1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// Copyright (C) 2016 the V8 project authors. All rights reserved.
// This code is governed by the BSD license found in the LICENSE file.
/*---
esid: sec-%typedarray%.prototype.findindex
description: >
Change values during predicate call
info: |
22.2.3.11 %TypedArray%.prototype.findIndex ( predicate [ , thisArg ] )
%TypedArray%.prototype.findIndex is a distinct function that implements the
same algorithm as Array.prototype.findIndex as defined in 22.1.3.9 except that
the this object's [[ArrayLength]] internal slot is accessed in place of
performing a [[Get]] of "length".
...
22.1.3.9 Array.prototype.findIndex ( predicate[ , thisArg ] )
...
6. Repeat, while k < len
...
c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
...
includes: [compareArray.js, testBigIntTypedArray.js]
---*/
testWithBigIntTypedArrayConstructors(function(TA) {
var arr = convertToBigInt([10, 20, 30]);
var sample;
var result;
sample = new TA(3);
sample.findIndex(function(val, i) {
sample[i] = arr[i];
assert.sameValue(val, convertToBigInt(0), "value is not mapped to instance");
});
assert(compareArray(sample, arr), "values set during each predicate call");
sample = new TA(arr);
result = sample.findIndex(function(val, i) {
if ( i === 0 ) {
sample[2] = convertToBigInt(7);
}
return val === convertToBigInt(7);
});
assert.sameValue(result, 2, "value found");
sample = new TA(arr);
result = sample.findIndex(function(val, i) {
if ( i === 0 ) {
sample[2] = convertToBigInt(7);
}
return val === convertToBigInt(30);
});
assert.sameValue(result, -1, "value not found");
sample = new TA(arr);
result = sample.findIndex(function(val, i) {
if ( i > 0 ) {
sample[0] = convertToBigInt(7);
}
return val === convertToBigInt(7);
});
assert.sameValue(result, -1, "value not found - changed after call");
});
|
