Adding upstream version 115.7.0esr.upstream/115.7.0esrupstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 59 insertions, 0 deletions

diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/lastIndexOf/BigInt/search-found-returns-index.js b/js/src/tests/test262/built-ins/TypedArray/prototype/lastIndexOf/BigInt/search-found-returns-index.js
new file mode 100644
index 0000000000..c0160be2d0
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/lastIndexOf/BigInt/search-found-returns-index.js
@@ -0,0 +1,59 @@
+// 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 index for the first found element
+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
+    a. Let kPresent be ? HasProperty(O, ! ToString(k)).
+    b. If kPresent is true, then
+      i. Let elementK be ? Get(O, ! ToString(k)).
+      ii. Let same be the result of performing Strict Equality Comparison
+      searchElement === elementK.
+      iii. If same is true, return k.
+  ...
+includes: [testBigIntTypedArray.js]
+features: [BigInt, TypedArray]
+---*/
+
+testWithBigIntTypedArrayConstructors(function(TA) {
+  var sample = new TA([42n, 43n, 42n, 41n]);
+  assert.sameValue(sample.lastIndexOf(42n), 2, "lastIndexOf(42)");
+  assert.sameValue(sample.lastIndexOf(43n), 1, "lastIndexOf(43)");
+  assert.sameValue(sample.lastIndexOf(41n), 3, "lastIndexOf(41)");
+  assert.sameValue(sample.lastIndexOf(41n, 3), 3, "lastIndexOf(41, 3)");
+  assert.sameValue(sample.lastIndexOf(41n, 4), 3, "lastIndexOf(41, 4)");
+  assert.sameValue(sample.lastIndexOf(43n, 1), 1, "lastIndexOf(43, 1)");
+  assert.sameValue(sample.lastIndexOf(43n, 2), 1, "lastIndexOf(43, 2)");
+  assert.sameValue(sample.lastIndexOf(43n, 3), 1, "lastIndexOf(43, 3)");
+  assert.sameValue(sample.lastIndexOf(43n, 4), 1, "lastIndexOf(43, 4)");
+  assert.sameValue(sample.lastIndexOf(42n, 0), 0, "lastIndexOf(42, 0)");
+  assert.sameValue(sample.lastIndexOf(42n, 1), 0, "lastIndexOf(42, 1)");
+  assert.sameValue(sample.lastIndexOf(42n, 2), 2, "lastIndexOf(42, 2)");
+  assert.sameValue(sample.lastIndexOf(42n, 3), 2, "lastIndexOf(42, 3)");
+  assert.sameValue(sample.lastIndexOf(42n, 4), 2, "lastIndexOf(42, 4)");
+  assert.sameValue(sample.lastIndexOf(42n, -4), 0, "lastIndexOf(42, -4)");
+  assert.sameValue(sample.lastIndexOf(42n, -3), 0, "lastIndexOf(42, -3)");
+  assert.sameValue(sample.lastIndexOf(42n, -2), 2, "lastIndexOf(42, -2)");
+  assert.sameValue(sample.lastIndexOf(42n, -1), 2, "lastIndexOf(42, -1)");
+  assert.sameValue(sample.lastIndexOf(43n, -3), 1, "lastIndexOf(43, -3)");
+  assert.sameValue(sample.lastIndexOf(43n, -2), 1, "lastIndexOf(43, -2)");
+  assert.sameValue(sample.lastIndexOf(43n, -1), 1, "lastIndexOf(43, -1)");
+  assert.sameValue(sample.lastIndexOf(41n, -1), 3, "lastIndexOf(41, -1)");
+});
+
+reportCompare(0, 0);