summaryrefslogtreecommitdiffstats
path: root/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js
diff options
context:
space:
mode:
Diffstat (limited to 'js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js')
-rw-r--r--js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js70
1 files changed, 70 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js b/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js
new file mode 100644
index 0000000000..acd8f91c95
--- /dev/null
+++ b/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-out-of-bounds-end.js
@@ -0,0 +1,70 @@
+// Copyright (C) 2015 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+esid: sec-array.prototype.copywithin
+description: >
+ Set values with negative out of bounds end argument.
+info: |
+ 22.1.3.3 Array.prototype.copyWithin (target, start [ , end ] )
+
+ ...
+ 11. If end is undefined, let relativeEnd be len; else let relativeEnd be
+ ToInteger(end).
+ 12. ReturnIfAbrupt(relativeEnd).
+ 13. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let
+ final be min(relativeEnd, len).
+ ...
+includes: [compareArray.js]
+---*/
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(0, 1, -10), [0, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(0, 1, -10) must return [0, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [1, 2, 3, 4, 5].copyWithin(0, 1, -Infinity), [1, 2, 3, 4, 5],
+ '[1, 2, 3, 4, 5].copyWithin(0, 1, -Infinity) must return [1, 2, 3, 4, 5]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(0, -2, -10), [0, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(0, -2, -10) must return [0, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [1, 2, 3, 4, 5].copyWithin(0, -2, -Infinity), [1, 2, 3, 4, 5],
+ '[1, 2, 3, 4, 5].copyWithin(0, -2, -Infinity) must return [1, 2, 3, 4, 5]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(0, -9, -10), [0, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(0, -9, -10) must return [0, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [1, 2, 3, 4, 5].copyWithin(0, -9, -Infinity), [1, 2, 3, 4, 5],
+ '[1, 2, 3, 4, 5].copyWithin(0, -9, -Infinity) must return [1, 2, 3, 4, 5]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(-3, -2, -10), [0, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(-3, -2, -10) must return [0, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [1, 2, 3, 4, 5].copyWithin(-3, -2, -Infinity), [1, 2, 3, 4, 5],
+ '[1, 2, 3, 4, 5].copyWithin(-3, -2, -Infinity) must return [1, 2, 3, 4, 5]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(-7, -8, -9), [0, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(-7, -8, -9) must return [0, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [1, 2, 3, 4, 5].copyWithin(-7, -8, -Infinity), [1, 2, 3, 4, 5],
+ '[1, 2, 3, 4, 5].copyWithin(-7, -8, -Infinity) must return [1, 2, 3, 4, 5]'
+);
+
+reportCompare(0, 0);