TUint32Array.uts 8.3 KB
Newer Older
M
mahaifeng 已提交
1 2 3 4 5 6 7 8 9
import {
  describe,
  test,
  expect,
  Result
} from './tests.uts'

export class TUint32Array {
  test() {
10
    // #ifdef APP-ANDROID
M
mahaifeng 已提交
11
    this.testuint32();
M
mahaifeng 已提交
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
    this.testConstructor();
    this.testSet();
    this.testCopyWith();
    this.testEvery();
    this.testFill();
    this.testFilter();
    this.find();
    this.findIndex();
    this.foreach();
    this.iterator();
    this.includes();
    this.indexOf();
    this.join();
    this.keys();
    this.map();
    this.reduce();
    this.reduceRight();
    this.reverse();
    this.slice();
    this.sort();
    this.subarray();
    this.values();
    this.arrayBufferSlice();
35
    // #endif
M
mahaifeng 已提交
36 37
  }

M
mahaifeng 已提交
38
  // #ifdef APP-ANDROID
M
mahaifeng 已提交
39 40 41 42 43
  testuint32() {
    let uint32 = new Uint32Array(2);
    uint32[0] = 42;
    expect(uint32[0]).toEqual(42);
    expect(uint32.length).toEqual(2);
M
mahaifeng 已提交
44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
    expect(Uint32Array.BYTES_PER_ELEMENT).toEqual(4);

    let x = new Uint32Array([21, 31, 3]);
    expect(x[1]).toEqual(31);

    let y = new Uint32Array(x);
    expect(y[0]).toEqual(21);

    let buffer = new ArrayBuffer(16);
    let z = new Uint32Array(buffer, 2, 4);
    expect(z.byteOffset).toEqual(2);
    expect(z.length).toEqual(4);
  }

  testConstructor() {
    let buffer = new ArrayBuffer(16);
M
mahaifeng 已提交
60 61 62
    let uint32 = new Uint32Array(buffer);
    uint32[1] = 42;
    expect(uint32.toString()).toEqual("0,42,0,0");
M
mahaifeng 已提交
63 64 65
  }

  testSet() {
M
mahaifeng 已提交
66
    // #TEST Uint32Array.set
M
mahaifeng 已提交
67
    let uint32 = new Uint32Array(8);
M
mahaifeng 已提交
68
    var array = [1, 2, 3];
M
mahaifeng 已提交
69 70
    uint32.set(array, 1);
    expect(uint32.toString()).toEqual("0,1,2,3,0,0,0,0");
M
mahaifeng 已提交
71
    // #END
M
mahaifeng 已提交
72 73 74
  }

  testCopyWith() {
M
mahaifeng 已提交
75 76
    // #TEST Uint32Array.copyWithin
    console.log("testCopyWith 1");
M
mahaifeng 已提交
77 78
    let uint32 = new Uint32Array(8);
    uint32.set([1, 2, 3], 1);
M
mahaifeng 已提交
79
    console.log("testCopyWith 1");
M
mahaifeng 已提交
80
    uint32.copyWithin(3, 0, 3);
M
mahaifeng 已提交
81
    console.log("testCopyWith 1");
M
mahaifeng 已提交
82
    expect(uint32.toString()).toEqual("0,1,2,0,1,2,0,0");
M
mahaifeng 已提交
83
    // #END
M
mahaifeng 已提交
84 85 86
  }

  testEvery() {
M
mahaifeng 已提交
87 88 89
    // #TEST Uint32Array.every
    // const isBelowThreshold = (currentValue: number, index: number, array: Uint32Array): boolean => currentValue < 40;
    let result = new Uint32Array([12, 5, 8, 130, 44]).every((value : number, _ : number, _a : Uint32Array) : boolean => value < 40);
M
mahaifeng 已提交
90
    expect(result).toEqual(false);
M
mahaifeng 已提交
91
    // #END
M
mahaifeng 已提交
92 93 94
  }

  testFill() {
M
mahaifeng 已提交
95
    // #TEST Uint32Array.fill
M
mahaifeng 已提交
96 97
    let uint32 = new Uint32Array([1, 2, 3]).fill(4);
    expect(uint32.toString()).toEqual("4,4,4");
M
mahaifeng 已提交
98

M
mahaifeng 已提交
99 100
    uint32 = new Uint32Array([1, 2, 3]).fill(4, 1);
    expect(uint32.toString()).toEqual("1,4,4");
M
mahaifeng 已提交
101

M
mahaifeng 已提交
102 103
    uint32 = new Uint32Array([1, 2, 3]).fill(4, 1, 2);
    expect(uint32.toString()).toEqual("1,4,3");
M
mahaifeng 已提交
104

M
mahaifeng 已提交
105 106
    uint32 = new Uint32Array([1, 2, 3]).fill(4, 1, 1);
    expect(uint32.toString()).toEqual("1,2,3");
M
mahaifeng 已提交
107

M
mahaifeng 已提交
108 109
    uint32 = new Uint32Array([1, 2, 3]).fill(4, -3, -2);
    expect(uint32.toString()).toEqual("4,2,3");
M
mahaifeng 已提交
110
    // #END
M
mahaifeng 已提交
111 112
  }
  testFilter() {
M
mahaifeng 已提交
113
    // #TEST Uint32Array.filter
M
mahaifeng 已提交
114
    // const isBelowThreshold = (currentValue: number, index: number, _): boolean => currentValue >= 10;
M
mahaifeng 已提交
115
    let uint32 = new Uint32Array([12, 5, 8, 44]).filter((value : number, _ : number, _a : Uint32Array) : boolean => value >= 10);
M
mahaifeng 已提交
116
    expect(uint32.toString()).toEqual("12,44");
M
mahaifeng 已提交
117
    // #END
M
mahaifeng 已提交
118 119 120
  }

  find() {
M
mahaifeng 已提交
121
    // #TEST Uint32Array.find
M
mahaifeng 已提交
122
    let uint32 = new Uint32Array([4, 5, 8, 12]);
M
mahaifeng 已提交
123
    let res = uint32.find((value : number, _ : number, _a : Uint32Array) : boolean => value > 5);
M
mahaifeng 已提交
124
    expect(res).toEqual(8);
M
mahaifeng 已提交
125
    // #END
M
mahaifeng 已提交
126 127 128
  }

  findIndex() {
M
mahaifeng 已提交
129
    // #TEST Uint32Array.findIndex
M
mahaifeng 已提交
130
    let uint32 = new Uint32Array([4, 6, 8, 12]);
M
mahaifeng 已提交
131
    let res = uint32.findIndex((value : number, _ : number, _a : Uint32Array) : boolean => value > 100);
M
mahaifeng 已提交
132 133
    expect(res).toEqual(-1);

M
mahaifeng 已提交
134
    let uuint32 = new Uint32Array([4, 6, 7, 120]);
M
mahaifeng 已提交
135
    res = uuint32.findIndex((value : number, _ : number, _a : Uint32Array) : boolean => value > 100);
M
mahaifeng 已提交
136
    expect(res).toEqual(3);
M
mahaifeng 已提交
137
    // #END
M
mahaifeng 已提交
138 139 140
  }

  foreach() {
M
mahaifeng 已提交
141 142
    // #TEST Uint32Array.forEach
    new Uint32Array([0, 1, 2, 3]).forEach((value : number, index : number, _a : Uint32Array) => {
M
mahaifeng 已提交
143 144
      console.log(`a[${index}] = ${value}`);
    });
M
mahaifeng 已提交
145
    // #END
M
mahaifeng 已提交
146 147
  }
  iterator() {
M
mahaifeng 已提交
148
    // #TEST Uint32Array.entries
M
mahaifeng 已提交
149 150 151
    let arr = new Uint32Array([10, 20, 30, 40, 50]);
    let entries = arr.entries();
    expect(entries.next().value[1]).toEqual(10);
M
mahaifeng 已提交
152
    // #END
M
mahaifeng 已提交
153 154 155
  }

  includes() {
M
mahaifeng 已提交
156
    // #TEST Uint32Array.includes
M
mahaifeng 已提交
157 158
    let uint32 = new Uint32Array([1, 2, 3]);
    let res = uint32.includes(2);
M
mahaifeng 已提交
159 160
    expect(res).toEqual(true);

M
mahaifeng 已提交
161
    res = uint32.includes(4);
M
mahaifeng 已提交
162 163
    expect(res).toEqual(false);

M
mahaifeng 已提交
164
    res = uint32.includes(3, 3);
M
mahaifeng 已提交
165
    expect(res).toEqual(false);
M
mahaifeng 已提交
166
    // #END
M
mahaifeng 已提交
167 168 169
  }

  indexOf() {
M
mahaifeng 已提交
170
    // #TEST Uint32Array.indexOf
M
mahaifeng 已提交
171 172
    let uint32 = new Uint32Array([2, 5, 9]);
    let res = uint32.indexOf(2);
M
mahaifeng 已提交
173 174
    expect(res).toEqual(0);

M
mahaifeng 已提交
175
    res = uint32.indexOf(7);
M
mahaifeng 已提交
176 177
    expect(res).toEqual(-1);

M
mahaifeng 已提交
178
    res = uint32.indexOf(9, 2);
M
mahaifeng 已提交
179 180
    expect(res).toEqual(2);

M
mahaifeng 已提交
181
    res = uint32.indexOf(2, -1);
M
mahaifeng 已提交
182 183
    expect(res).toEqual(-1);

M
mahaifeng 已提交
184
    res = uint32.indexOf(2, -3);
M
mahaifeng 已提交
185
    expect(res).toEqual(0);
M
mahaifeng 已提交
186
    // #END
M
mahaifeng 已提交
187 188
  }
  join() {
M
mahaifeng 已提交
189
    // #TEST Uint32Array.join
M
mahaifeng 已提交
190 191
    let uint32 = new Uint32Array([1, 2, 3]);
    let res = uint32.join();
M
mahaifeng 已提交
192 193
    expect(res).toEqual("1,2,3");

M
mahaifeng 已提交
194
    res = uint32.join(" / ");
M
mahaifeng 已提交
195 196
    expect(res).toEqual("1 / 2 / 3");

M
mahaifeng 已提交
197
    res = uint32.join("");
M
mahaifeng 已提交
198
    expect(res).toEqual("123");
M
mahaifeng 已提交
199
    // #END
M
mahaifeng 已提交
200 201 202
  }

  keys() {
M
mahaifeng 已提交
203
    // #TEST Uint32Array.keys
M
mahaifeng 已提交
204 205 206
    let arr = new Uint32Array([10, 20, 30, 40, 50]);
    let keys = arr.keys();
    expect(keys.next().value).toEqual(0);
M
mahaifeng 已提交
207
    // #END
M
mahaifeng 已提交
208 209 210
  }

  map() {
M
mahaifeng 已提交
211
    // #TEST Uint32Array.map
M
mahaifeng 已提交
212
    let numbers = new Uint32Array([1, 4, 9]);
M
mahaifeng 已提交
213
    let doubles = numbers.map((value : number, _ : number, _a : Uint32Array) : number => value * 2);
M
mahaifeng 已提交
214 215
    expect(numbers.toString()).toEqual("1,4,9");
    expect(doubles.toString()).toEqual("2,8,18");
M
mahaifeng 已提交
216
    // #END
M
mahaifeng 已提交
217 218 219
  }

  reduce() {
M
mahaifeng 已提交
220
    // #TEST Uint32Array.reduce
M
mahaifeng 已提交
221
    let total = new Uint32Array([0, 1, 2, 3]);
M
mahaifeng 已提交
222
    let res = total.reduce((accumulator : number, currentValue : number, _ : number, _a : Uint32Array) :
M
mahaifeng 已提交
223 224 225 226
      number => accumulator + currentValue);
    expect(res).toEqual(6);

    total = new Uint32Array([0, 1, 2, 3]);
M
mahaifeng 已提交
227
    res = total.reduce((accumulator : number, currentValue : number, _ : number, _a : Uint32Array) :
M
mahaifeng 已提交
228 229
      number => accumulator + currentValue, 8);
    expect(res).toEqual(14);
M
mahaifeng 已提交
230
    // #END
M
mahaifeng 已提交
231 232
  }
  reduceRight() {
M
mahaifeng 已提交
233
    // #TEST Uint32Array.reduceRight
M
mahaifeng 已提交
234
    let total = new Uint32Array([0, 1, 2, 3]);
M
mahaifeng 已提交
235
    let res = total.reduceRight((accumulator : number, currentValue : number, _ : number, _a : Uint32Array) :
M
mahaifeng 已提交
236 237 238 239
      number => accumulator + currentValue);
    expect(res).toEqual(6);

    total = new Uint32Array([0, 1, 2, 3]);
M
mahaifeng 已提交
240
    res = total.reduceRight((accumulator : number, currentValue : number, _ : number, _a : Uint32Array) :
M
mahaifeng 已提交
241 242
      number => accumulator + currentValue, 8);
    expect(res).toEqual(14);
M
mahaifeng 已提交
243
    // #END
M
mahaifeng 已提交
244 245 246
  }

  reverse() {
M
mahaifeng 已提交
247
    // #TEST Uint32Array.reverse
M
mahaifeng 已提交
248 249 250
    let uint32 = new Uint32Array([1, 2, 3]);
    uint32.reverse();
    expect(uint32.toString()).toEqual("3,2,1");
M
mahaifeng 已提交
251
    // #END
M
mahaifeng 已提交
252 253 254
  }

  slice() {
M
mahaifeng 已提交
255
    // #TEST Uint32Array.slice
M
mahaifeng 已提交
256 257
    let uint32 = new Uint32Array([1, 2, 3]);
    let res = uint32.slice(1);
M
mahaifeng 已提交
258 259
    expect(res.toString()).toEqual("2,3");

M
mahaifeng 已提交
260
    res = uint32.slice(2);
M
mahaifeng 已提交
261 262
    expect(res.toString()).toEqual("3");

M
mahaifeng 已提交
263
    res = uint32.slice(-2);
M
mahaifeng 已提交
264 265
    expect(res.toString()).toEqual("2,3");

M
mahaifeng 已提交
266
    res = uint32.slice(0, 1);
M
mahaifeng 已提交
267
    expect(res.toString()).toEqual("1");
M
mahaifeng 已提交
268
    // #END
M
mahaifeng 已提交
269 270 271
  }

  sort() {
M
mahaifeng 已提交
272
    // #TEST Uint32Array.sort
M
mahaifeng 已提交
273 274 275 276
    let numbers = new Uint32Array([40, 1, 5]);
    numbers.sort();
    expect(numbers.toString()).toEqual("1,5,40");

M
mahaifeng 已提交
277
    numbers.sort((a, b) : number => a - b);
M
mahaifeng 已提交
278
    expect(numbers.toString()).toEqual("1,5,40");
M
mahaifeng 已提交
279
    // #END
M
mahaifeng 已提交
280 281
  }
  subarray() {
M
mahaifeng 已提交
282
    // #TEST Uint32Array.subarray
M
mahaifeng 已提交
283
    let buffer = new ArrayBuffer(16);
M
mahaifeng 已提交
284 285 286
    let uint32 = new Uint32Array(buffer);
    uint32.set([1, 2, 3]);
    expect(uint32.toString()).toEqual("1,2,3,0");
M
mahaifeng 已提交
287

M
mahaifeng 已提交
288
    let sub = uint32.subarray(0, 4);
M
mahaifeng 已提交
289
    expect(sub.toString()).toEqual("1,2,3,0");
M
mahaifeng 已提交
290
    // #END
M
mahaifeng 已提交
291 292 293
  }

  values() {
M
mahaifeng 已提交
294
    // #TEST Uint32Array.values
M
mahaifeng 已提交
295 296 297
    let arr = new Uint32Array([1, 2, 3]);
    let values = arr.values();
    expect(values.next().value).toEqual(1);
M
mahaifeng 已提交
298
    // #END
M
mahaifeng 已提交
299 300 301
  }

  arrayBufferSlice() {
M
mahaifeng 已提交
302
    // #TEST ArrayBuffer.slice
M
mahaifeng 已提交
303
    let buffer = new ArrayBuffer(16);
M
mahaifeng 已提交
304 305 306
    let uint32 = new Uint32Array(buffer);
    uint32[3] = 42;
    expect(uint32.toString()).toEqual("0,0,0,42");
M
mahaifeng 已提交
307 308 309 310

    let res = buffer.slice(8);
    let sliced = new Uint32Array(res);
    expect(sliced[1]).toEqual(42);
M
mahaifeng 已提交
311
    // #END
M
mahaifeng 已提交
312
  }
M
mahaifeng 已提交
313

314
  // #endif
M
mahaifeng 已提交
315
}