| comparefn-call-throws.js |
|
332 |
| comparefn-calls.js |
|
493 |
| comparefn-nonfunction-call-throws.js |
1. If _comparefn_ is not *undefined* and IsCallable(_comparefn_) is *false*, throw a *TypeError* exception.
...
|
716 |
| invoked-as-func.js |
|
253 |
| invoked-as-method.js |
|
280 |
| length.js |
|
856 |
| sorted-values.js |
|
757 |
| stability.js |
|
1235 |
| this-is-not-tuple.js |
|
618 |
| toSorted.js |
8.2.3.29 Tuple.prototype.toSorted ( compareFn )
Except as described below, implements the same requirements as those of Array.prototype.sort as defined in 22.1.3.27. The implementation 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.
Upon entry, the following steps are performed to initialize evaluation of the sorted function. These steps are used instead of the entry steps in 22.1.3.27:
1. If comparefn is not undefined and IsCallable(comparefn) is false, throw a TypeError exception.
2. Let T be ? thisTupleValue(this value).
3. Let list be a new List containing the elements of T.[[Sequence]].
4. Let len be the length of list.
A new Tuple containing the elements from the original Tuple is returned, where the elements are sorted. The sort order is the ordering, after completion of this function, of the elements of list. The sort order of the result of sorted is the same order as if the elements of list were sorted in an Array via %Array.prototype.sort% with comparefn as the first argument.
|
2091 |
| toSortedcompare-with-no-tostring.js |
description: Tuple toSorted does cast values to String |
359 |
| tuplelength-internal.js |
Use internal length rather than getting a length property |
665 |