Lines Matching full:be
40 // 1. Let numberOfArgs be the number of arguments passed to this function call. in ArrayConstructor()
43 …// 3. If NewTarget is undefined, let newTarget be the active function object, else let newTarget b… in ArrayConstructor()
50 // 4. Let proto be GetPrototypeFromConstructor(newTarget, "%ArrayPrototype%"). in ArrayConstructor()
62 // 6. Let array be ArrayCreate(0, proto). in ArrayConstructor()
67 // a. Let defineStatus be CreateDataProperty(array, "0", len). in ArrayConstructor()
69 // c. Let intLen be 1. in ArrayConstructor()
71 // a. Let intLen be ToUint32(len). in ArrayConstructor()
73 // 9. Let setStatus be Set(array, "length", intLen, true). in ArrayConstructor()
130 // 8. Let k be 0. in ArrayConstructor()
131 // 9. Let items be a zero-origined List containing the argument items in order. in ArrayConstructor()
133 // a. Let Pk be ToString(k). in ArrayConstructor()
134 // b. Let itemK be items[k]. in ArrayConstructor()
135 // c. Let defineStatus be CreateDataProperty(array, Pk, itemK). in ArrayConstructor()
163 // 1. Let C be the this value. in From()
165 // 2. If mapfn is undefined, let mapping be false. in From()
169 // b. If thisArg was supplied, let T be thisArg; else let T be undefined. in From()
170 // c. Let mapping be true in From()
179 // 4. Let usingIterator be GetMethod(items, @@iterator). in From()
212 // i. Let A be Construct(C). in From()
214 // i. Let A be ArrayCreate(0). in From()
230 // d. Let iterator be GetIterator(items, usingIterator). in From()
236 // f. Let k be 0. in From()
272 // i. Let Pk be ToString(k). in From()
273 // ii. Let next be IteratorStep(iterator). in From()
278 // 1. Let setStatus be Set(A, "length", k, true). in From()
286 // v. Let nextValue be IteratorValue(next). in From()
291 // 1. Let mappedValue be Call(mapfn, T, «nextValue, k»). in From()
293 // 3. Let mappedValue be mappedValue.[[value]]. in From()
294 // viii. Else, let mappedValue be nextValue. in From()
308 // ix. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
319 // 8. Let arrayLike be ToObject(items). in From()
324 // 10. Let len be ToLength(Get(arrayLike, "length")). in From()
329 // a. Let A be Construct(C, «len»). in From()
331 // a. Let A be ArrayCreate(len). in From()
349 // 15. Let k be 0. in From()
351 // a. Let Pk be ToString(k). in From()
352 // b. Let kValue be Get(arrayLike, Pk). in From()
354 // i. Let mappedValue be Call(mapfn, T, «kValue, k»). in From()
355 // e. Else, let mappedValue be kValue. in From()
356 // f. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
381 // 17. Let setStatus be Set(A, "length", len, true). in From()
412 // 1. Let len be the actual number of arguments passed to this function. in Of()
415 // 3. Let C be the this value. in Of()
418 // a. Let A be Construct(C, «len»). in Of()
420 // a. Let A be ArrayCreate(len). in Of()
441 // 7. Let k be 0. in Of()
443 // a. Let kValue be items[k]. in Of()
444 // b. Let Pk be ToString(k). in Of()
445 // c. Let defineStatus be CreateDataPropertyOrThrow(A,Pk, kValue). in Of()
455 // 9. Let setStatus be Set(A, "length", len, true). in Of()
481 // 1. Let O be ToObject(this value). in Concat()
487 // 2. Let A be ArraySpeciesCreate(O, 0). in Concat()
499 // 3. Let n be 0. in Concat()
512 // a. Let spreadable be ? IsConcatSpreadable(E). in Concat()
517 // i. Let k be 0. in Concat()
518 // ii. Let len be ? LengthOfArrayLike(E). in Concat()
533 // 1. Let P be ToString(k). in Concat()
534 // 2. Let exists be HasProperty(E, P). in Concat()
541 // a. Let subElement be Get(E, P). in Concat()
586 // 1. Let O be ToObject(this value). in CopyWithin()
592 // 3. Let len be ToLength(Get(O, "length")). in CopyWithin()
601 // 5. Let relativeTarget be ToInteger(target). in CopyWithin()
606 …// 7. If relativeTarget < 0, let to be max((len + relativeTarget),0); else let to be min(relativeT… in CopyWithin()
613 // 8. Let relativeStart be ToInteger(start). in CopyWithin()
618 …// 10. If relativeStart < 0, let from be max((len + relativeStart),0); else let from be min(relati… in CopyWithin()
625 // 11. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in CopyWithin()
635 …// 13. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in CopyWithin()
642 // 14. Let count be min(final-from, len-to). in CopyWithin()
646 // a. Let direction be -1. in CopyWithin()
647 // b. Let from be from + count -1. in CopyWithin()
648 // c. Let to be to + count -1. in CopyWithin()
659 // a. Let fromKey be ToString(from). in CopyWithin()
660 // b. Let toKey be ToString(to). in CopyWithin()
661 // c. Let fromPresent be HasProperty(O, fromKey). in CopyWithin()
664 // i. Let fromVal be Get(O, fromKey). in CopyWithin()
666 // iii. Let setStatus be Set(O, toKey, fromVal, true). in CopyWithin()
669 // i. Let deleteStatus be DeletePropertyOrThrow(O, toKey). in CopyWithin()
671 // g. Let from be from + direction. in CopyWithin()
672 // h. Let to be to + direction. in CopyWithin()
673 // i. Let count be count − 1. in CopyWithin()
712 // 1. Let O be ToObject(this value). in Entries()
729 // 1. Let O be ToObject(this value). in Every()
736 // 3. Let len be ToLength(Get(O, "length")). in Every()
747 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Every()
750 // 7. Let k be 0. in Every()
752 // a. Let Pk be ToString(k). in Every()
753 // b. Let kPresent be HasProperty(O, Pk). in Every()
756 // i. Let kValue be Get(O, Pk). in Every()
758 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Every()
807 // 1. Let O be ToObject(this value). in Fill()
830 // 3. Let len be ToLength(Get(O, "length")). in Fill()
835 // 5. Let relativeStart be ToInteger(start). in Fill()
841 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Fill()
850 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Fill()
860 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Fill()
869 // a. Let Pk be ToString(k). in Fill()
870 // b. Let setStatus be Set(O, Pk, value, true). in Fill()
934 // 1. Let O be ToObject(this value). in Filter()
941 // 3. Let len be ToLength(Get(O, "length")). in Filter()
952 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Filter()
955 // 7. Let A be ArraySpeciesCreate(O, 0). in Filter()
962 // 9. Let k be 0. in Filter()
963 // 10. Let to be 0. in Filter()
965 // a. Let Pk be ToString(k). in Filter()
966 // b. Let kPresent be HasProperty(O, Pk). in Filter()
969 // i. Let kValue be Get(O, Pk). in Filter()
971 // iii. Let selected be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Filter()
974 // 1. Let status be CreateDataPropertyOrThrow (A, ToString(to), kValue). in Filter()
997 // 1. Let O be ToObject(this value). in Find()
1004 // 3. Let len be ToLength(Get(O, "length")). in Find()
1015 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Find()
1018 // 7. Let k be 0. in Find()
1020 // a. Let Pk be ToString(k). in Find()
1021 // b. Let kValue be Get(O, Pk). in Find()
1023 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in Find()
1059 // 1. Let O be ToObject(this value). in FindIndex()
1066 // 3. Let len be ToLength(Get(O, "length")). in FindIndex()
1077 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindIndex()
1080 // 7. Let k be 0. in FindIndex()
1082 // a. Let Pk be ToString(k). in FindIndex()
1083 // b. Let kValue be Get(O, Pk). in FindIndex()
1085 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindIndex()
1130 // 1. Let O be ToObject(this value). in ForEach()
1137 // 3. Let len be ToLength(Get(O, "length")). in ForEach()
1148 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in ForEach()
1151 // 7. Let k be 0. in ForEach()
1153 // a. Let Pk be ToString(k). in ForEach()
1154 // b. Let kPresent be HasProperty(O, Pk). in ForEach()
1157 // i. Let kValue be Get(O, Pk). in ForEach()
1159 // iii. Let funcResult be Call(callbackfn, T, «kValue, k, O»). in ForEach()
1226 // 1. Let O be ToObject(this value). in IndexOfSlowPath()
1231 // 3. Let len be ToLength(Get(O, "length")). in IndexOfSlowPath()
1239 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in IndexOfSlowPath()
1293 // 1. Let O be ToObject(this value). in Join()
1298 // 2. Let len be ? LengthOfArrayLike(O). in Join()
1305 // 3. If separator is undefined, let sep be ",". in Join()
1306 // 4. Else, let sep be ? ToString(separator). in Join()
1343 // 9. Let element0 be Get(O, "0"). in Join()
1344 …// 10. If element0 is undefined or null, let R be the empty String; otherwise, let R be ToString(e… in Join()
1346 // 12. Let k be 1. in Join()
1348 // a. Let S be the String value produced by concatenating R and sep. in Join()
1349 // b. Let element be Get(O, ToString(k)). in Join()
1350 …// c. If element is undefined or null, let next be the empty String; otherwise, let next be ToSt… in Join()
1352 // e. Let R be a String value produced by concatenating S and next. in Join()
1392 // 1. Let O be ToObject(this value). in Keys()
1432 // 1. Let O be ToObject(this value). in LastIndexOfSlowPath()
1437 // 3. Let len be ToLength(Get(O, "length")). in LastIndexOfSlowPath()
1445 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in LastIndexOfSlowPath()
1495 // 1. Let O be ToObject(this value). in Map()
1502 // 3. Let len be ToLength(Get(O, "length")). in Map()
1513 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Map()
1516 // 7. Let A be ArraySpeciesCreate(O, len). in Map()
1526 // 9. Let k be 0. in Map()
1528 // a. Let Pk be ToString(k). in Map()
1529 // b. Let kPresent be HasProperty(O, Pk). in Map()
1532 // i. Let kValue be Get(O, Pk). in Map()
1534 // iii. Let mappedValue be Call(callbackfn, T, «kValue, k, O»). in Map()
1536 // v. Let status be CreateDataPropertyOrThrow (A, Pk, mappedValue). in Map()
1589 // 1. Let O be ToObject(this value). in Pop()
1600 // 3. Let len be ToLength(Get(O, "length")). in Pop()
1605 // a. Let setStatus be Set(O, "length", 0, true). in Pop()
1617 // a. Let newLen be len–1. in Pop()
1618 // b. Let indx be ToString(newLen). in Pop()
1619 // c. Let element be Get(O, indx). in Pop()
1621 // e. Let deleteStatus be DeletePropertyOrThrow(O, indx). in Pop()
1623 // g. Let setStatus be Set(O, "length", newLen, true). in Pop()
1646 // 1. Let O be ToObject(this value). in Push()
1651 // 6. Let argCount be the number of elements in items. in Push()
1658 // 3. Let len be ToLength(Get(O, "length")). in Push()
1668 // a. Remove the first element from items and let E be the value of the element. in Push()
1669 // b. Let setStatus be Set(O, ToString(len), E, true). in Push()
1671 // d. Let len be len+1. in Push()
1683 // 9. Let setStatus be Set(O, "length", len, true). in Push()
1734 // 1. Let O be ToObject(this value). in Reduce()
1741 // 3. Let len be ToLength(Get(O, "length")). in Reduce()
1753 // 1. Let O be ToObject(this value). in ReduceInner()
1771 // 7. Let k be 0. in ReduceInner()
1775 // a. Let kPresent be false. in ReduceInner()
1777 // i. Let Pk be ToString(k). in ReduceInner()
1778 // ii. Let kPresent be HasProperty(O, Pk). in ReduceInner()
1781 // 1. Let accumulator be Get(O, Pk). in ReduceInner()
1802 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in ReduceInner()
1821 // 1. Let O be ToObject(this value). in ReduceRight()
1828 // 3. Let len be ToLength(Get(O, "length")). in ReduceRight()
1843 // 1. Let O be ToObject(this value). in ReduceRightInner()
1861 // 7. Let k be len-1. in ReduceRightInner()
1866 // a. Let kPresent be false. in ReduceRightInner()
1868 // i. Let Pk be ToString(k). in ReduceRightInner()
1869 // ii. Let kPresent be HasProperty(O, Pk). in ReduceRightInner()
1872 // 1. Let accumulator be Get(O, Pk). in ReduceRightInner()
1891 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in ReduceRightInner()
1896 // a. Let Pk be ToString(k). in ReduceRightInner()
1897 // b. Let kPresent be HasProperty(O, Pk). in ReduceRightInner()
1900 // i. Let kValue be Get(O, Pk). in ReduceRightInner()
1902 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in ReduceRightInner()
1951 // 1. Let O be ToObject(this value). in Reverse()
1958 // 3. Let len be ToLength(Get(O, "length")). in Reverse()
1973 // 5. Let middle be floor(len/2). in Reverse()
1976 // 6. Let lower be 0. in Reverse()
1980 // a. Let upper be len-lower-1. in Reverse()
1981 // b. Let upperP be ToString(upper). in Reverse()
1982 // c. Let lowerP be ToString(lower). in Reverse()
1983 // d. Let lowerExists be HasProperty(O, lowerP). in Reverse()
1986 // i. Let lowerValue be Get(O, lowerP). in Reverse()
1988 // g. Let upperExists be HasProperty(O, upperP). in Reverse()
1991 // i. Let upperValue be Get(O, upperP). in Reverse()
1994 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1996 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1999 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
2001 // iii. Let deleteStatus be DeletePropertyOrThrow (O, upperP). in Reverse()
2004 // i. Let deleteStatus be DeletePropertyOrThrow (O, lowerP). in Reverse()
2006 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
2067 // 1. Let O be ToObject(this value). in Shift()
2077 // 3. Let len be ToLength(Get(O, "length")). in Shift()
2082 // a. Let setStatus be Set(O, "length", 0, true). in Shift()
2093 // 6. Let first be Get(O, "0"). in Shift()
2099 // 8. Let k be 1. in Shift()
2101 // a. Let from be ToString(k). in Shift()
2102 // b. Let to be ToString(k–1). in Shift()
2103 // c. Let fromPresent be HasProperty(O, from). in Shift()
2106 // i. Let fromVal be Get(O, from). in Shift()
2108 // iii. Let setStatus be Set(O, to, fromVal, true). in Shift()
2111 // i. Let deleteStatus be DeletePropertyOrThrow(O, to). in Shift()
2132 // 10. Let deleteStatus be DeletePropertyOrThrow(O, ToString(len–1)). in Shift()
2138 // 12. Let setStatus be Set(O, "length", len–1, true). in Shift()
2156 // 1. Let O be ToObject(this value). in Slice()
2163 // 3. Let len be ToLength(Get(O, "length")). in Slice()
2173 // 5. Let relativeStart be ToInteger(start). in Slice()
2180 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Slice()
2189 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Slice()
2191 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Slice()
2212 // 11. Let count be max(final – k, 0). in Slice()
2220 // 12. Let A be ArraySpeciesCreate(O, count). in Slice()
2230 // 14. Let n be 0. in Slice()
2232 // a. Let Pk be ToString(k). in Slice()
2233 // b. Let kPresent be HasProperty(O, Pk). in Slice()
2236 // i. Let kValue be Get(O, Pk). in Slice()
2238 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(n), kValue ). in Slice()
2260 // 16. Let setStatus be Set(A, "length", n, true). in Slice()
2279 // 1. Let O be ToObject(this value). in Some()
2286 // 3. Let len be ToLength(Get(O, "length")). in Some()
2307 // 2. Let obj be ToObject(this value). in Sort()
2331 // 1. Let O be ToObject(this value). in Splice()
2337 // 3. Let len be ToLength(Get(O, "length")). in Splice()
2341 // 5. Let relativeStart be ToInteger(start). in Splice()
2353 …// 7. If relativeStart < 0, let actualStart be max((len + relativeStart),0); else let actualStart … in Splice()
2364 // a. Let insertCount be 0. in Splice()
2365 // b. Let actualDeleteCount be 0. in Splice()
2367 // a. Let insertCount be 0. in Splice()
2368 // b. Let actualDeleteCount be len – actualStart. in Splice()
2370 // a. Let insertCount be the number of actual arguments minus 2. in Splice()
2371 // b. Let dc be ToInteger(deleteCount). in Splice()
2373 // d. Let actualDeleteCount be min(max(dc,0), len – actualStart). in Splice()
2387 // 12. Let A be ArraySpeciesCreate(O, actualDeleteCount). in Splice()
2396 // 14. Let k be 0. in Splice()
2398 // a. Let from be ToString(actualStart+k). in Splice()
2399 // b. Let fromPresent be HasProperty(O, from). in Splice()
2401 // i. Let fromValue be Get(O, from). in Splice()
2402 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(k), fromValue). in Splice()
2425 // 16. Let setStatus be Set(A, "length", actualDeleteCount, true). in Splice()
2431 // 19. Let itemCount be the number of elements in items. in Splice()
2433 // a. Let k be actualStart. in Splice()
2435 // i. Let from be ToString(k+actualDeleteCount). in Splice()
2436 // ii. Let to be ToString(k+itemCount). in Splice()
2437 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2439 // 1. Let fromValue be Get(O, from). in Splice()
2440 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2442 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2444 // c. Let k be len. in Splice()
2446 // i. Let deleteStatus be DeletePropertyOrThrow(O, ToString(k–1)). in Splice()
2476 // a. Let k be (len – actualDeleteCount). in Splice()
2478 // i. Let from be ToString(k + actualDeleteCount – 1). in Splice()
2479 // ii. Let to be ToString(k + itemCount – 1) in Splice()
2480 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2483 // 1. Let fromValue be Get(O, from). in Splice()
2485 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2488 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2509 // 22. Let k be actualStart. in Splice()
2520 // 24. Let setStatus be Set(O, "length", len – actualDeleteCount + itemCount, true). in Splice()
2540 // 1. Let O be ToObject(this value). in ToLocaleString()
2553 // 3. Let len be ToLength(Get(O, "length")). in ToLocaleString()
2570 // 7. Let firstElement be Get(array, "0"). in ToLocaleString()
2573 // a. Let R be the empty String. in ToLocaleString()
2575 // a. Let R be ToString(Invoke(firstElement, "toLocaleString")). in ToLocaleString()
2577 // 11. Let k be 1. in ToLocaleString()
2579 // a. Let S be a String value produced by concatenating R and separator. in ToLocaleString()
2580 // b. Let nextElement be Get(array, ToString(k)). in ToLocaleString()
2583 // i. Let R be the empty String. in ToLocaleString()
2585 // i. Let R be ToString(Invoke(nextElement, "toLocaleString")). in ToLocaleString()
2587 // f. Let R be a String value produced by concatenating S and R. in ToLocaleString()
2634 // 1. Let array be ToObject(this value). in ToString()
2641 // 3. Let func be Get(array, "join"). in ToString()
2648 …// 5. If IsCallable(func) is false, let func be the intrinsic function %ObjProto_toString% (19.1.3… in ToString()
2671 // 5. Let argCount be the number of actual arguments. in Unshift()
2674 // 1. Let O be ToObject(this value). in Unshift()
2681 // 3. Let len be ToLength(Get(O, "length")). in Unshift()
2688 // b. Let k be len. in Unshift()
2690 // i. Let from be ToString(k–1). in Unshift()
2691 // ii. Let to be ToString(k+argCount –1). in Unshift()
2692 // iii. Let fromPresent be HasProperty(O, from). in Unshift()
2695 // 1. Let fromValue be Get(O, from). in Unshift()
2697 // 3. Let setStatus be Set(O, to, fromValue, true). in Unshift()
2700 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Unshift()
2726 // d. Let j be 0. in Unshift()
2727 …// e. Let items be a List whose elements are, in left to right order, the arguments that were pa… in Unshift()
2730 // i. Remove the first element from items and let E be the value of that element. in Unshift()
2731 // ii. Let setStatus be Set(O, ToString(j), E, true). in Unshift()
2744 // 7. Let setStatus be Set(O, "length", len+argCount, true). in Unshift()
2764 // 1. Let O be ToObject(this value). in Values()
2781 // 1. Let O be ? ToObject(this value). in Flat()
2789 // 2. Let sourceLen be ? LengthOfArrayLike(O). in Flat()
2793 // 3. Let depthNum be 1. in Flat()
2808 // 5. Let A be ? ArraySpeciesCreate(O, 0). in Flat()
2833 // 1. Let O be ? ToObject(this value). in FlatMap()
2839 // 2. Let sourceLen be ? LengthOfArrayLike(O). in FlatMap()
2848 // 4. Let A be ? ArraySpeciesCreate(O, 0). in FlatMap()
2870 // 1. Let O be ? ToObject(this value). in Includes()
2879 // 2. Let len be ? LengthOfArrayLike(O). in Includes()
2886 // 4. Let n be ? ToIntegerOrInfinity(fromIndex). in Includes()
2904 // a. Let k be n. in Includes()
2906 // a. Let k be len + n. in Includes()
2907 // b. If k < 0, let k be 0. in Includes()
2911 // a. Let elementK be ? Get(O, ! ToString(!(k))). in Includes()
2941 // 1. Let O be ToObject(this value). in At()
2951 // 2. Let len be ? LengthOfArrayLike(O). in At()
2956 // 3. Let index be ? ToIntegerOrInfinity(index). in At()
2962 // a. Let k be relativeIndex. in At()
2964 // a. Let k be len + relativeIndex. in At()
2993 // 1. Let O be ToObject(this value). in With()
2998 // 2. Let len be ? LengthOfArrayLike(O). in With()
3002 // 3. Let relativeIndex be ? ToIntegerOrInfinity(relativeIndex). in With()
3009 // 4. If relativeIndex ≥ 0, let actualIndex be relativeIndex. in With()
3010 // 5. Else, let actualIndex be len + relativeIndex. in With()
3020 // 7. Let A be ? ArrayCreate(len). in With()
3029 // 8. Let k be 0. in With()
3032 // a. Let Pk be ! ToString(��(k)). in With()
3033 // b. If k is actualIndex, let fromValue be value. in With()
3034 // c. Else, let fromValue be ? Get(O, Pk). in With()
3070 // 2. Let obj be ToObject(this value). in ToSorted()
3075 // 3. Let len be ToLength(Get(obj, "length")). in ToSorted()
3080 // 4. Let A be ? ArrayCreate(len). in ToSorted()
3085 …// 5. Let SortCompare be a new Abstract Closure with parameters (x, y) that captures comparefn and… in ToSorted()
3088 // 6. Let sortedList be ? SortIndexedProperties(O, len, SortCompare, read-through-holes). in ToSorted()
3094 //7. Let j be 0. in ToSorted()
3118 // 1. Let O be ? ToObject(this value). in ToSpliced()
3124 // 2. Let len be ? LengthOfArrayLike(O). in ToSpliced()
3132 // 3. Let relativeStart be ? ToIntegerOrInfinity(start). in ToSpliced()
3138 // 4. If relativeStart = -∞, let k be 0. in ToSpliced()
3139 // 5. Else if relativeStart < 0, let k be max(len + relativeStart, 0). in ToSpliced()
3140 // 6. Else, let k be min(relativeStart, len). in ToSpliced()
3149 // 7. Let insertCount be the number of elements in items. in ToSpliced()
3151 // a. Let actualSkipCount be 0. in ToSpliced()
3153 // a. Let actualSkipCount be len - actualStart. in ToSpliced()
3155 // a. Let sc be ? ToIntegerOrInfinity(skipCount). in ToSpliced()
3156 // b. Let actualSkipCount be the result of clamping sc between 0 and len - actualStart. in ToSpliced()
3166 // 11. Let newLen be len + insertCount - actualSkipCount. in ToSpliced()
3176 // 13. Let A be ? ArrayCreate(newLen). in ToSpliced()
3182 // 14. Let i be 0. in ToSpliced()
3184 // 15. Let r be actualStart + actualSkipCount. in ToSpliced()
3187 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3188 // b. Let iValue be ? Get(O, Pi). in ToSpliced()
3200 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3212 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3213 // b. Let from be ! ToString(��(r)). in ToSpliced()
3214 // c. Let fromValue be ? Get(O, from). in ToSpliced()
3246 // 1. Let O be ToObject(this value). in FindLast()
3253 // 3. Let len be ToLength(Get(O, "length")). in FindLast()
3264 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLast()
3267 // 7. Let k be (len - 1). in FindLast()
3269 // a. Let Pk be ToString(k). in FindLast()
3270 // b. Let kValue be Get(O, Pk). in FindLast()
3272 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLast()
3319 // 1. Let O be ToObject(this value). in FindLastIndex()
3326 // 3. Let len be ToLength(Get(O, "length")). in FindLastIndex()
3337 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLastIndex()
3340 // 7. Let k be (len - 1). in FindLastIndex()
3342 // a. Let Pk be ToString(k). in FindLastIndex()
3343 // b. Let kValue be Get(O, Pk). in FindLastIndex()
3345 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLastIndex()
3390 // 1. Let O be ToObject(this value). in ToReversed()
3397 // 2. Let len be ? LengthOfArrayLike(O). in ToReversed()
3404 // 3. Let A be ? ArrayCreate(len). in ToReversed()
3410 // 4. Let k be 0. in ToReversed()
3412 // a. Let from be ! ToString(��(len - k - 1)). in ToReversed()
3413 // b. Let Pk be ! ToString(��(k)). in ToReversed()
3414 // c. Let fromValue be ? Get(O, from). in ToReversed()