1 files changed, 106 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/fill/BigInt/coerced-indexes.js b/js/src/tests/test262/built-ins/TypedArray/prototype/fill/BigInt/coerced-indexes.js
new file mode 100644
index 0000000000..f7ba55c725
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/fill/BigInt/coerced-indexes.js
@@ -0,0 +1,106 @@
+// 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.fill
+description: >
+  Fills elements from coerced to Integer `start` and `end` values
+info: |
+  22.2.3.8 %TypedArray%.prototype.fill (value [ , start [ , end ] ] )
+
+  %TypedArray%.prototype.fill is a distinct function that implements the same
+  algorithm as Array.prototype.fill as defined in 22.1.3.6 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. However, such optimization
+  must not introduce any observable changes in the specified behaviour of the
+  algorithm.
+
+  ...
+
+  22.1.3.6 Array.prototype.fill (value [ , start [ , end ] ] )
+
+  ...
+  3. Let relativeStart be ? ToInteger(start).
+  4. If relativeStart < 0, let k be max((len + relativeStart), 0); else let k be
+  min(relativeStart, len).
+  5. If end is undefined, let relativeEnd be len; else let relativeEnd be ?
+  ToInteger(end).
+  ...
+includes: [compareArray.js, testBigIntTypedArray.js]
+features: [BigInt, TypedArray]
+---*/
+
+testWithBigIntTypedArrayConstructors(function(TA) {
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, undefined), [1n, 1n]),
+    '`undefined` start coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, undefined), [1n, 1n]),
+    'If end is undefined, let relativeEnd be len'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, null), [1n, 1n]),
+    '`null` start coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, null), [0n, 0n]),
+    '`null` end coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, true), [0n, 1n]),
+    '`true` start coerced to 1'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, true), [1n, 0n]),
+    '`true` end coerced to 1'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, false), [1n, 1n]),
+    '`false` start coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, false), [0n, 0n]),
+    '`false` end coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, NaN), [1n, 1n]),
+    '`NaN` start coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, NaN), [0n, 0n]),
+    '`NaN` end coerced to 0'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, '1'), [0n, 1n]),
+    'string start coerced'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, '1'), [1n, 0n]),
+    'string end coerced'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 1.5), [0n, 1n]),
+    'start as a float number coerced'
+  );
+
+  assert(
+    compareArray(new TA([0n, 0n]).fill(1n, 0, 1.5), [1n, 0n]),
+    'end as a float number coerced'
+  );
+});
+
+reportCompare(0, 0);