summaryrefslogtreecommitdiffstats
path: root/js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js
diff options
context:
space:
mode:
Diffstat (limited to 'js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js')
-rw-r--r--js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js44
1 files changed, 44 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js b/js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js
new file mode 100644
index 0000000000..d9219834fe
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/findLastIndex/BigInt/predicate-call-this-strict-strict.js
@@ -0,0 +1,44 @@
+'use strict';
+// Copyright (C) 2021 Microsoft. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+esid: sec-%typedarray%.prototype.findlastindex
+description: >
+ Predicate thisArg as F.call( thisArg, kValue, k, O ) for each array entry.
+info: |
+ %TypedArray%.prototype.findLastIndex ( predicate [ , thisArg ] )
+
+ ...
+ 5. Let k be len - 1.
+ 6. Repeat, while k ≥ 0
+ ...
+ c. Let testResult be ! ToBoolean(? Call(predicate, thisArg, « kValue, 𝔽(k), O »)).
+ ...
+flags: [onlyStrict]
+includes: [testBigIntTypedArray.js]
+features: [BigInt, TypedArray, array-find-from-last]
+---*/
+
+testWithBigIntTypedArrayConstructors(function(TA) {
+ var sample = new TA(1);
+ var result;
+
+ sample.findLastIndex(function() {
+ result = this;
+ });
+
+ assert.sameValue(
+ result,
+ undefined,
+ "without thisArg, predicate this is undefined"
+ );
+
+ var o = {};
+ sample.findLastIndex(function() {
+ result = this;
+ }, o);
+
+ assert.sameValue(result, o, "thisArg becomes the predicate this");
+});
+
+reportCompare(0, 0);