summaryrefslogtreecommitdiff
path: root/test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js
diff options
context:
space:
mode:
authorLeo Balter <leonardo.balter@gmail.com>2018-02-09 13:39:06 -0500
committerLeo Balter <leonardo.balter@gmail.com>2018-02-15 16:45:06 -0500
commitc1bc43b1b10ec9d7c83ebee2af1837b78b784e52 (patch)
tree88aa3d799434cef567d2b1a8682b4fd6990c23d3 /test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js
parent5722ac494b89135cdcc406ec9ca3362920129346 (diff)
downloadqtdeclarative-testsuites-c1bc43b1b10ec9d7c83ebee2af1837b78b784e52.tar.gz
Restore original tests for TypedArrays and optimize files
- optimize file names - BigInt folder for TAs.from and of - copy tests preparing for bigint - copy ta prototype methods for bigint - Use an exclusive harness for bigint typedarrays - add features - use proper harness - use preper harness - Restore original tests for TypedArrays - final fixes - fix includes
Diffstat (limited to 'test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js')
-rw-r--r--test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js63
1 files changed, 63 insertions, 0 deletions
diff --git a/test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js b/test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js
new file mode 100644
index 000000000..fd69894e6
--- /dev/null
+++ b/test/built-ins/TypedArray/prototype/find/BigInt/predicate-call-parameters.js
@@ -0,0 +1,63 @@
+// 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.find
+es6id: 22.2.3.10
+description: >
+ Predicate called as F.call( thisArg, kValue, k, O ) for each array entry.
+info: |
+ 22.2.3.10 %TypedArray%.prototype.find (predicate [ , thisArg ] )
+
+ %TypedArray%.prototype.find is a distinct function that implements the same
+ algorithm as Array.prototype.find as defined in 22.1.3.8 except that the this
+ object's [[ArrayLength]] internal slot is accessed in place of performing a
+ [[Get]] of "length". The implementation of the algorithm may be optimized with
+ the knowledge that the this value is an object that has a fixed length and
+ whose integer indexed properties are not sparse.
+
+ ...
+
+ 22.1.3.8 Array.prototype.find ( predicate[ , thisArg ] )
+
+ ...
+ 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
+ 5. Let k be 0.
+ 6. Repeat, while k < len
+ ...
+ c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
+ ...
+includes: [testBigIntTypedArray.js]
+features: [BigInt, TypedArray]
+---*/
+
+testWithBigIntTypedArrayConstructors(function(TA) {
+ var sample = new TA(convertToBigInt([39, 2, 62]));
+ var results = [];
+ var result;
+
+ sample.foo = "bar"; // Ignores non integer index properties
+
+ sample.find(function() {
+ results.push(arguments);
+ });
+
+ assert.sameValue(results.length, 3, "predicate is called for each index");
+
+ result = results[0];
+ assert.sameValue(result[0], convertToBigInt(39), "results[0][0] === 39, value");
+ assert.sameValue(result[1], 0, "results[0][1] === 0, index");
+ assert.sameValue(result[2], sample, "results[0][2] === sample, instance");
+ assert.sameValue(result.length, 3, "results[0].length === 3 arguments");
+
+ result = results[1];
+ assert.sameValue(result[0], convertToBigInt(2), "results[1][0] === 2, value");
+ assert.sameValue(result[1], 1, "results[1][1] === 1, index");
+ assert.sameValue(result[2], sample, "results[1][2] === sample, instance");
+ assert.sameValue(result.length, 3, "results[1].length === 3 arguments");
+
+ result = results[2];
+ assert.sameValue(result[0], convertToBigInt(62), "results[2][0] === 62, value");
+ assert.sameValue(result[1], 2, "results[2][1] === 2, index");
+ assert.sameValue(result[2], sample, "results[2][2] === sample, instance");
+ assert.sameValue(result.length, 3, "results[2].length === 3 arguments");
+});