summaryrefslogtreecommitdiffstats
path: root/js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-19 00:47:55 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-19 00:47:55 +0000
commit26a029d407be480d791972afb5975cf62c9360a6 (patch)
treef435a8308119effd964b339f76abb83a57c29483 /js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js
parentInitial commit. (diff)
downloadfirefox-26a029d407be480d791972afb5975cf62c9360a6.tar.xz
firefox-26a029d407be480d791972afb5975cf62c9360a6.zip
Adding upstream version 124.0.1.upstream/124.0.1
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js')
-rw-r--r--js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js62
1 files changed, 62 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js b/js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js
new file mode 100644
index 0000000000..bbfa0928e9
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/find/return-undefined-if-predicate-returns-false-value.js
@@ -0,0 +1,62 @@
+// 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
+description: >
+ Return undefined if predicate always returns a boolean false value.
+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 ] )
+
+ ...
+ 6. Repeat, while k < len
+ ...
+ c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
+ ...
+ 7. Return undefined.
+includes: [testTypedArray.js]
+features: [Symbol, TypedArray]
+---*/
+
+testWithTypedArrayConstructors(function(TA) {
+ var sample = new TA(3);
+ var called = 0;
+
+ var result = sample.find(function() {
+ called++;
+ return false;
+ });
+
+ assert.sameValue(called, 3, "predicate was called three times");
+ assert.sameValue(result, undefined);
+
+ result = sample.find(function() { return ""; });
+ assert.sameValue(result, undefined, "ToBoolean(empty string)");
+
+ result = sample.find(function() { return undefined; });
+ assert.sameValue(result, undefined, "ToBoolean(undefined)");
+
+ result = sample.find(function() { return null; });
+ assert.sameValue(result, undefined, "ToBoolean(null)");
+
+ result = sample.find(function() { return 0; });
+ assert.sameValue(result, undefined, "ToBoolean(0)");
+
+ result = sample.find(function() { return -0; });
+ assert.sameValue(result, undefined, "ToBoolean(-0)");
+
+ result = sample.find(function() { return NaN; });
+ assert.sameValue(result, undefined, "ToBoolean(NaN)");
+});
+
+reportCompare(0, 0);