summaryrefslogtreecommitdiffstats
path: root/js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js
diff options
context:
space:
mode:
Diffstat (limited to 'js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js')
-rw-r--r--js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js76
1 files changed, 76 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js b/js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js
new file mode 100644
index 0000000000..d2b7e87fbc
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/copyWithin/non-negative-out-of-bounds-target-and-start.js
@@ -0,0 +1,76 @@
+// 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.copywithin
+description: >
+ Max values of target and start positions are this.length.
+info: |
+ 22.2.3.5 %TypedArray%.prototype.copyWithin (target, start [ , end ] )
+
+ %TypedArray%.prototype.copyWithin is a distinct function that implements the
+ same algorithm as Array.prototype.copyWithin as defined in 22.1.3.3 except
+ that the this object's [[ArrayLength]] internal slot is accessed in place of
+ performing a [[Get]] of "length" and the actual copying of values in step 12
+ must be performed in a manner that preserves the bit-level encoding of the
+ source data.
+
+ ...
+includes: [compareArray.js, testTypedArray.js]
+features: [TypedArray]
+---*/
+
+testWithTypedArrayConstructors(function(TA) {
+ assert(
+ compareArray(
+ new TA([0, 1, 2, 3, 4, 5]).copyWithin(6, 0),
+ [0, 1, 2, 3, 4, 5]
+ )
+ );
+
+ assert(
+ compareArray(
+ new TA([1, 2, 3, 4, 5]).copyWithin(Infinity, 0),
+ [1, 2, 3, 4, 5]
+ ),
+ '[1, 2, 3, 4, 5].copyWithin(Infinity, 0) -> [1, 2, 3, 4, 5]'
+ );
+
+ assert(
+ compareArray(
+ new TA([0, 1, 2, 3, 4, 5]).copyWithin(0, 6),
+ [0, 1, 2, 3, 4, 5]
+ )
+ );
+
+ assert(
+ compareArray(
+ new TA([1, 2, 3, 4, 5]).copyWithin(0, Infinity),
+ [1, 2, 3, 4, 5]
+ ),
+ '[1, 2, 3, 4, 5].copyWithin(0, Infinity) -> [1, 2, 3, 4, 5]'
+ );
+
+ assert(
+ compareArray(
+ new TA([0, 1, 2, 3, 4, 5]).copyWithin(6, 6),
+ [0, 1, 2, 3, 4, 5]
+ )
+ );
+
+ assert(
+ compareArray(
+ new TA([0, 1, 2, 3, 4, 5]).copyWithin(10, 10),
+ [0, 1, 2, 3, 4, 5]
+ )
+ );
+
+ assert(
+ compareArray(
+ new TA([1, 2, 3, 4, 5]).copyWithin(Infinity, Infinity),
+ [1, 2, 3, 4, 5]
+ ),
+ '[1, 2, 3, 4, 5].copyWithin(Infinity, Infinity) -> [1, 2, 3, 4, 5]'
+ );
+});
+
+reportCompare(0, 0);