1 files changed, 32 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/indexOf/BigInt/fromIndex-minus-zero.js b/js/src/tests/test262/built-ins/TypedArray/prototype/indexOf/BigInt/fromIndex-minus-zero.js
new file mode 100644
index 0000000000..523e0a6dfb
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/indexOf/BigInt/fromIndex-minus-zero.js
@@ -0,0 +1,32 @@
+// 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.indexof
+description: -0 fromIndex becomes 0
+info: |
+  22.2.3.13 %TypedArray%.prototype.indexOf (searchElement [ , fromIndex ] )
+
+  %TypedArray%.prototype.indexOf is a distinct function that implements the same
+  algorithm as Array.prototype.indexOf as defined in 22.1.3.12 except that the
+  this object's [[ArrayLength]] internal slot is accessed in place of performing
+  a [[Get]] of "length".
+
+  22.1.3.12 Array.prototype.indexOf ( searchElement [ , fromIndex ] )
+
+  ...
+  6. If n ≥ 0, then
+    a. If n is -0, let k be +0; else let k be n.
+  ...
+includes: [testBigIntTypedArray.js]
+features: [BigInt, TypedArray]
+---*/
+
+testWithBigIntTypedArrayConstructors(function(TA) {
+  var sample;
+
+  sample = new TA([42n, 43n]);
+  assert.sameValue(sample.indexOf(42n, -0), 0, "-0 [0]");
+  assert.sameValue(sample.indexOf(43n, -0), 1, "-0 [1]");
+});
+
+reportCompare(0, 0);