summaryrefslogtreecommitdiffstats
path: root/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js
diff options
context:
space:
mode:
Diffstat (limited to 'js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js')
-rw-r--r--js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js60
1 files changed, 60 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js b/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js
new file mode 100644
index 0000000000..3bea4299b5
--- /dev/null
+++ b/js/src/tests/test262/built-ins/Array/prototype/copyWithin/negative-end.js
@@ -0,0 +1,60 @@
+// 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 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, -1), [1, 2, 2, 3],
+ '[0, 1, 2, 3].copyWithin(0, 1, -1) must return [1, 2, 2, 3]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3, 4].copyWithin(2, 0, -1), [0, 1, 0, 1, 2],
+ '[0, 1, 2, 3, 4].copyWithin(2, 0, -1) must return [0, 1, 0, 1, 2]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3, 4].copyWithin(1, 2, -2), [0, 2, 2, 3, 4],
+ '[0, 1, 2, 3, 4].copyWithin(1, 2, -2) must return [0, 2, 2, 3, 4]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(0, -2, -1), [2, 1, 2, 3],
+ '[0, 1, 2, 3].copyWithin(0, -2, -1) must return [2, 1, 2, 3]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3, 4].copyWithin(2, -2, -1), [0, 1, 3, 3, 4],
+ '[0, 1, 2, 3, 4].copyWithin(2, -2, -1) must return [0, 1, 3, 3, 4]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3].copyWithin(-3, -2, -1), [0, 2, 2, 3],
+ '[0, 1, 2, 3].copyWithin(-3, -2, -1) must return [0, 2, 2, 3]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3, 4].copyWithin(-2, -3, -1), [0, 1, 2, 2, 3],
+ '[0, 1, 2, 3, 4].copyWithin(-2, -3, -1) must return [0, 1, 2, 2, 3]'
+);
+
+assert.compareArray(
+ [0, 1, 2, 3, 4].copyWithin(-5, -2, -1), [3, 1, 2, 3, 4],
+ '[0, 1, 2, 3, 4].copyWithin(-5, -2, -1) must return [3, 1, 2, 3, 4]'
+);
+
+reportCompare(0, 0);