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
|
// 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.lastindexof
description: returns -1 if the element if not found
info: |
22.2.3.17 %TypedArray%.prototype.lastIndexOf ( searchElement [ , fromIndex ] )
%TypedArray%.prototype.lastIndexOf is a distinct function that implements the
same algorithm as Array.prototype.lastIndexOf as defined in 22.1.3.15 except
that the this object's [[ArrayLength]] internal slot is accessed in place of
performing a [[Get]] of "length".
22.1.3.15 Array.prototype.lastIndexOf ( searchElement [ , fromIndex ] )
...
5. If n ≥ 0, then
a. If n is -0, let k be +0; else let k be min(n, len - 1).
6. Else n < 0,
a. Let k be len + n.
7. Repeat, while k ≥ 0
...
8. Return -1.
includes: [testBigIntTypedArray.js]
features: [BigInt, TypedArray]
---*/
testWithBigIntTypedArrayConstructors(function(TA) {
var sample;
sample = new TA([42n, 43n, 42n, 41n]);
assert.sameValue(sample.lastIndexOf(44n), -1, "lastIndexOf(44)");
assert.sameValue(sample.lastIndexOf(44n, -4), -1, "lastIndexOf(44, -4)");
assert.sameValue(sample.lastIndexOf(44n, -5), -1, "lastIndexOf(44, -5)");
assert.sameValue(sample.lastIndexOf(42n, -5), -1, "lastIndexOf(42, -5)");
assert.sameValue(sample.lastIndexOf(43n, -4), -1, "lastIndexOf(43, -4)");
assert.sameValue(sample.lastIndexOf(43n, -5), -1, "lastIndexOf(43, -5)");
assert.sameValue(sample.lastIndexOf(41n, 0), -1, "lastIndexOf(41, 0)");
assert.sameValue(sample.lastIndexOf(41n, 1), -1, "lastIndexOf(41, 1)");
assert.sameValue(sample.lastIndexOf(41n, 2), -1, "lastIndexOf(41, 2)");
assert.sameValue(sample.lastIndexOf(43n, 0), -1, "lastIndexOf(43, 0)");
});
reportCompare(0, 0);
|