1 files changed, 30 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/toSorted/comparefn-not-a-function.js b/js/src/tests/test262/built-ins/TypedArray/prototype/toSorted/comparefn-not-a-function.js
new file mode 100644
index 0000000000..9435129797
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/toSorted/comparefn-not-a-function.js
@@ -0,0 +1,30 @@
+// |reftest| shell-option(--enable-change-array-by-copy) skip-if(!Array.prototype.with||!xulRuntime.shell) -- change-array-by-copy is not enabled unconditionally, requires shell-options
+// Copyright (C) 2021 Igalia, S.L. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+esid: sec-%typedarray%.prototype.toSorted
+description: >
+  %TypedArray%.prototype.toSorted verifies that the comparator is callable before reading the length.
+info: |
+  %TypedArray%.prototype.toSorted ( comparefn )
+
+  1. If comparefn is not undefined and IsCallable(comparefn) is false, throw a TypeError exception.
+  2. ...
+  3. Let len be ? LengthOfArrayLike(O).
+includes: [testTypedArray.js]
+features: [TypedArray, change-array-by-copy]
+---*/
+
+var invalidComparators = [null, true, false, "", /a/g, 42, 42n, [], {}, Symbol()];
+
+testWithTypedArrayConstructors(TA => {
+  const ta = new TA([1]);
+  for (var i = 0; i < invalidComparators.length; i++) {
+    assert.throws(TypeError, function() {
+      ta.toSorted(invalidComparators[i]);
+    }, String(invalidComparators[i]));
+  }
+});
+
+reportCompare(0, 0);