Lines Matching full:be
55 // 1. Let numberOfArgs be the number of arguments passed to this function call. in ArrayConstructor()
58 …// 3. If NewTarget is undefined, let newTarget be the active function object, else let newTarget b… in ArrayConstructor()
65 // 4. Let proto be GetPrototypeFromConstructor(newTarget, "%ArrayPrototype%"). in ArrayConstructor()
77 // 6. Let array be ArrayCreate(0, proto). in ArrayConstructor()
82 // a. Let defineStatus be CreateDataProperty(array, "0", len). in ArrayConstructor()
84 // c. Let intLen be 1. in ArrayConstructor()
86 // a. Let intLen be ToUint32(len). in ArrayConstructor()
88 // 9. Let setStatus be Set(array, "length", intLen, true). in ArrayConstructor()
115 // 8. Let k be 0. in ArrayConstructor()
116 // 9. Let items be a zero-origined List containing the argument items in order. in ArrayConstructor()
118 // a. Let Pk be ToString(k). in ArrayConstructor()
119 // b. Let itemK be items[k]. in ArrayConstructor()
120 // c. Let defineStatus be CreateDataProperty(array, Pk, itemK). in ArrayConstructor()
148 // 1. Let C be the this value. in From()
150 // 2. If mapfn is undefined, let mapping be false. in From()
154 // b. If thisArg was supplied, let T be thisArg; else let T be undefined. in From()
155 // c. Let mapping be true in From()
164 // 4. Let usingIterator be GetMethod(items, @@iterator). in From()
193 // i. Let A be Construct(C). in From()
195 // i. Let A be ArrayCreate(0). in From()
211 // d. Let iterator be GetIterator(items, usingIterator). in From()
215 // f. Let k be 0. in From()
222 // i. Let Pk be ToString(k). in From()
223 // ii. Let next be IteratorStep(iterator). in From()
228 // 1. Let setStatus be Set(A, "length", k, true). in From()
236 // v. Let nextValue be IteratorValue(next). in From()
241 // 1. Let mappedValue be Call(mapfn, T, «nextValue, k»). in From()
243 // 3. Let mappedValue be mappedValue.[[value]]. in From()
244 // viii. Else, let mappedValue be nextValue. in From()
258 // ix. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
269 // 8. Let arrayLike be ToObject(items). in From()
274 // 10. Let len be ToLength(Get(arrayLike, "length")). in From()
279 // a. Let A be Construct(C, «len»). in From()
281 // a. Let A be ArrayCreate(len). in From()
299 // 15. Let k be 0. in From()
301 // a. Let Pk be ToString(k). in From()
302 // b. Let kValue be Get(arrayLike, Pk). in From()
304 // i. Let mappedValue be Call(mapfn, T, «kValue, k»). in From()
305 // e. Else, let mappedValue be kValue. in From()
306 // f. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
330 // 17. Let setStatus be Set(A, "length", len, true). in From()
361 // 1. Let len be the actual number of arguments passed to this function. in Of()
364 // 3. Let C be the this value. in Of()
367 // a. Let A be Construct(C, «len»). in Of()
369 // a. Let A be ArrayCreate(len). in Of()
390 // 7. Let k be 0. in Of()
392 // a. Let kValue be items[k]. in Of()
393 // b. Let Pk be ToString(k). in Of()
394 // c. Let defineStatus be CreateDataPropertyOrThrow(A,Pk, kValue). in Of()
404 // 9. Let setStatus be Set(A, "length", len, true). in Of()
430 // 1. Let O be ToObject(this value). in Concat()
436 // 2. Let A be ArraySpeciesCreate(O, 0). in Concat()
440 …THROW_TYPE_ERROR_AND_RETURN(thread, "array must be object or undefined.", JSTaggedValue::Exception… in Concat()
447 // 3. Let n be 0. in Concat()
460 // a. Let spreadable be ? IsConcatSpreadable(E). in Concat()
465 // i. Let k be 0. in Concat()
466 // ii. Let len be ? LengthOfArrayLike(E). in Concat()
480 // 1. Let P be ToString(k). in Concat()
481 // 2. Let exists be HasProperty(E, P). in Concat()
488 // a. Let subElement be Get(E, P). in Concat()
531 // 1. Let O be ToObject(this value). in CopyWithin()
537 // 3. Let len be ToLength(Get(O, "length")). in CopyWithin()
546 // 5. Let relativeTarget be ToInteger(target). in CopyWithin()
551 …// 7. If relativeTarget < 0, let to be max((len + relativeTarget),0); else let to be min(relativeT… in CopyWithin()
558 // 8. Let relativeStart be ToInteger(start). in CopyWithin()
563 …// 10. If relativeStart < 0, let from be max((len + relativeStart),0); else let from be min(relati… in CopyWithin()
570 // 11. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in CopyWithin()
580 …// 13. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in CopyWithin()
587 // 14. Let count be min(final-from, len-to). in CopyWithin()
591 // a. Let direction be -1. in CopyWithin()
592 // b. Let from be from + count -1. in CopyWithin()
593 // c. Let to be to + count -1. in CopyWithin()
604 // a. Let fromKey be ToString(from). in CopyWithin()
605 // b. Let toKey be ToString(to). in CopyWithin()
606 // c. Let fromPresent be HasProperty(O, fromKey). in CopyWithin()
609 // i. Let fromVal be Get(O, fromKey). in CopyWithin()
611 // iii. Let setStatus be Set(O, toKey, fromVal, true). in CopyWithin()
614 // i. Let deleteStatus be DeletePropertyOrThrow(O, toKey). in CopyWithin()
616 // g. Let from be from + direction. in CopyWithin()
617 // h. Let to be to + direction. in CopyWithin()
618 // i. Let count be count − 1. in CopyWithin()
656 // 1. Let O be ToObject(this value). in Entries()
673 // 1. Let O be ToObject(this value). in Every()
680 // 3. Let len be ToLength(Get(O, "length")). in Every()
691 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Every()
694 // 7. Let k be 0. in Every()
696 // a. Let Pk be ToString(k). in Every()
697 // b. Let kPresent be HasProperty(O, Pk). in Every()
700 // i. Let kValue be Get(O, Pk). in Every()
702 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Every()
750 // 1. Let O be ToObject(this value). in Fill()
779 // 3. Let len be ToLength(Get(O, "length")). in Fill()
784 // 5. Let relativeStart be ToInteger(start). in Fill()
790 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Fill()
799 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Fill()
809 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Fill()
818 // a. Let Pk be ToString(k). in Fill()
819 // b. Let setStatus be Set(O, Pk, value, true). in Fill()
890 // 1. Let O be ToObject(this value). in Filter()
897 // 3. Let len be ToLength(Get(O, "length")). in Filter()
908 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Filter()
911 // 7. Let A be ArraySpeciesCreate(O, 0). in Filter()
918 // 9. Let k be 0. in Filter()
919 // 10. Let to be 0. in Filter()
921 // a. Let Pk be ToString(k). in Filter()
922 // b. Let kPresent be HasProperty(O, Pk). in Filter()
925 // i. Let kValue be Get(O, Pk). in Filter()
927 // iii. Let selected be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Filter()
930 // 1. Let status be CreateDataPropertyOrThrow (A, ToString(to), kValue). in Filter()
952 // 1. Let O be ToObject(this value). in Find()
959 // 3. Let len be ToLength(Get(O, "length")). in Find()
970 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Find()
973 // 7. Let k be 0. in Find()
975 // a. Let Pk be ToString(k). in Find()
976 // b. Let kValue be Get(O, Pk). in Find()
978 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in Find()
1014 // 1. Let O be ToObject(this value). in FindIndex()
1021 // 3. Let len be ToLength(Get(O, "length")). in FindIndex()
1032 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindIndex()
1035 // 7. Let k be 0. in FindIndex()
1037 // a. Let Pk be ToString(k). in FindIndex()
1038 // b. Let kValue be Get(O, Pk). in FindIndex()
1040 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindIndex()
1084 // 1. Let O be ToObject(this value). in ForEach()
1091 // 3. Let len be ToLength(Get(O, "length")). in ForEach()
1102 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in ForEach()
1105 // 7. Let k be 0. in ForEach()
1107 // a. Let Pk be ToString(k). in ForEach()
1108 // b. Let kPresent be HasProperty(O, Pk). in ForEach()
1111 // i. Let kValue be Get(O, Pk). in ForEach()
1113 // iii. Let funcResult be Call(callbackfn, T, «kValue, k, O»). in ForEach()
1176 // 1. Let O be ToObject(this value). in IndexOfSlowPath()
1181 // 3. Let len be ToLength(Get(O, "length")). in IndexOfSlowPath()
1189 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in IndexOfSlowPath()
1250 // 1. Let O be ToObject(this value). in Join()
1256 // 3. Let len be ToLength(Get(O, "length")). in Join()
1264 // 5. If separator is undefined, let separator be the single-element String ",". in Join()
1265 // 6. Let sep be ToString(separator). in Join()
1294 // 9. Let element0 be Get(O, "0"). in Join()
1295 …// 10. If element0 is undefined or null, let R be the empty String; otherwise, let R be ToString(e… in Join()
1297 // 12. Let k be 1. in Join()
1299 // a. Let S be the String value produced by concatenating R and sep. in Join()
1300 // b. Let element be Get(O, ToString(k)). in Join()
1301 …// c. If element is undefined or null, let next be the empty String; otherwise, let next be ToSt… in Join()
1303 // e. Let R be a String value produced by concatenating S and next. in Join()
1338 // 1. Let O be ToObject(this value). in Keys()
1378 // 1. Let O be ToObject(this value). in LastIndexOfSlowPath()
1383 // 3. Let len be ToLength(Get(O, "length")). in LastIndexOfSlowPath()
1391 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in LastIndexOfSlowPath()
1441 // 1. Let O be ToObject(this value). in Map()
1448 // 3. Let len be ToLength(Get(O, "length")). in Map()
1459 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Map()
1462 // 7. Let A be ArraySpeciesCreate(O, len). in Map()
1472 // 9. Let k be 0. in Map()
1474 // a. Let Pk be ToString(k). in Map()
1475 // b. Let kPresent be HasProperty(O, Pk). in Map()
1478 // i. Let kValue be Get(O, Pk). in Map()
1480 // iii. Let mappedValue be Call(callbackfn, T, «kValue, k, O»). in Map()
1482 // v. Let status be CreateDataPropertyOrThrow (A, Pk, mappedValue). in Map()
1526 // 1. Let O be ToObject(this value). in Pop()
1537 // 3. Let len be ToLength(Get(O, "length")). in Pop()
1542 // a. Let setStatus be Set(O, "length", 0, true). in Pop()
1554 // a. Let newLen be len–1. in Pop()
1555 // b. Let indx be ToString(newLen). in Pop()
1556 // c. Let element be Get(O, indx). in Pop()
1558 // e. Let deleteStatus be DeletePropertyOrThrow(O, indx). in Pop()
1560 // g. Let setStatus be Set(O, "length", newLen, true). in Pop()
1586 // 6. Let argCount be the number of elements in items. in Push()
1589 // 1. Let O be ToObject(this value). in Push()
1595 // 3. Let len be ToLength(Get(O, "length")). in Push()
1605 // a. Remove the first element from items and let E be the value of the element. in Push()
1606 // b. Let setStatus be Set(O, ToString(len), E, true). in Push()
1608 // d. Let len be len+1. in Push()
1620 // 9. Let setStatus be Set(O, "length", len, true). in Push()
1671 // 1. Let O be ToObject(this value). in Reduce()
1678 // 3. Let len be ToLength(Get(O, "length")). in Reduce()
1694 // 7. Let k be 0. in Reduce()
1698 // a. Let kPresent be false. in Reduce()
1700 // i. Let Pk be ToString(k). in Reduce()
1701 // ii. Let kPresent be HasProperty(O, Pk). in Reduce()
1704 // 1. Let accumulator be Get(O, Pk). in Reduce()
1724 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in Reduce()
1746 // 1. Let O be ToObject(this value). in ReduceRight()
1753 // 3. Let len be ToLength(Get(O, "length")). in ReduceRight()
1769 // 7. Let k be len-1. in ReduceRight()
1774 // a. Let kPresent be false. in ReduceRight()
1776 // i. Let Pk be ToString(k). in ReduceRight()
1777 // ii. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1780 // 1. Let accumulator be Get(O, Pk). in ReduceRight()
1799 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in ReduceRight()
1804 // a. Let Pk be ToString(k). in ReduceRight()
1805 // b. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1808 // i. Let kValue be Get(O, Pk). in ReduceRight()
1810 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in ReduceRight()
1849 // 1. Let O be ToObject(this value). in Reverse()
1856 // 3. Let len be ToLength(Get(O, "length")). in Reverse()
1871 // 5. Let middle be floor(len/2). in Reverse()
1874 // 6. Let lower be 0. in Reverse()
1878 // a. Let upper be len-lower-1. in Reverse()
1879 // b. Let upperP be ToString(upper). in Reverse()
1880 // c. Let lowerP be ToString(lower). in Reverse()
1881 // d. Let lowerExists be HasProperty(O, lowerP). in Reverse()
1884 // i. Let lowerValue be Get(O, lowerP). in Reverse()
1886 // g. Let upperExists be HasProperty(O, upperP). in Reverse()
1889 // i. Let upperValue be Get(O, upperP). in Reverse()
1892 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1894 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1897 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1899 // iii. Let deleteStatus be DeletePropertyOrThrow (O, upperP). in Reverse()
1902 // i. Let deleteStatus be DeletePropertyOrThrow (O, lowerP). in Reverse()
1904 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1965 // 1. Let O be ToObject(this value). in Shift()
1975 // 3. Let len be ToLength(Get(O, "length")). in Shift()
1980 // a. Let setStatus be Set(O, "length", 0, true). in Shift()
1991 // 6. Let first be Get(O, "0"). in Shift()
1997 // 8. Let k be 1. in Shift()
1999 // a. Let from be ToString(k). in Shift()
2000 // b. Let to be ToString(k–1). in Shift()
2001 // c. Let fromPresent be HasProperty(O, from). in Shift()
2004 // i. Let fromVal be Get(O, from). in Shift()
2006 // iii. Let setStatus be Set(O, to, fromVal, true). in Shift()
2009 // i. Let deleteStatus be DeletePropertyOrThrow(O, to). in Shift()
2029 // 10. Let deleteStatus be DeletePropertyOrThrow(O, ToString(len–1)). in Shift()
2035 // 12. Let setStatus be Set(O, "length", len–1, true). in Shift()
2053 // 1. Let O be ToObject(this value). in Slice()
2060 // 3. Let len be ToLength(Get(O, "length")). in Slice()
2070 // 5. Let relativeStart be ToInteger(start). in Slice()
2077 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Slice()
2086 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Slice()
2088 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Slice()
2109 // 11. Let count be max(final – k, 0). in Slice()
2117 // 12. Let A be ArraySpeciesCreate(O, count). in Slice()
2127 // 14. Let n be 0. in Slice()
2129 // a. Let Pk be ToString(k). in Slice()
2130 // b. Let kPresent be HasProperty(O, Pk). in Slice()
2133 // i. Let kValue be Get(O, Pk). in Slice()
2135 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(n), kValue ). in Slice()
2157 // 16. Let setStatus be Set(A, "length", n, true). in Slice()
2176 // 1. Let O be ToObject(this value). in Some()
2183 // 3. Let len be ToLength(Get(O, "length")). in Some()
2194 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Some()
2197 // 7. Let k be 0. in Some()
2199 // a. Let Pk be ToString(k). in Some()
2200 // b. Let kPresent be HasProperty(O, Pk). in Some()
2203 // i. Let kValue be Get(O, Pk). in Some()
2205 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, and O»)). in Some()
2251 // 2. Let obj be ToObject(this value). in Sort()
2275 // 1. Let O be ToObject(this value). in Splice()
2281 // 3. Let len be ToLength(Get(O, "length")). in Splice()
2285 // 5. Let relativeStart be ToInteger(start). in Splice()
2297 …// 7. If relativeStart < 0, let actualStart be max((len + relativeStart),0); else let actualStart … in Splice()
2308 // a. Let insertCount be 0. in Splice()
2309 // b. Let actualDeleteCount be 0. in Splice()
2311 // a. Let insertCount be 0. in Splice()
2312 // b. Let actualDeleteCount be len – actualStart. in Splice()
2314 // a. Let insertCount be the number of actual arguments minus 2. in Splice()
2315 // b. Let dc be ToInteger(deleteCount). in Splice()
2317 // d. Let actualDeleteCount be min(max(dc,0), len – actualStart). in Splice()
2331 // 12. Let A be ArraySpeciesCreate(O, actualDeleteCount). in Splice()
2340 // 14. Let k be 0. in Splice()
2342 // a. Let from be ToString(actualStart+k). in Splice()
2343 // b. Let fromPresent be HasProperty(O, from). in Splice()
2345 // i. Let fromValue be Get(O, from). in Splice()
2346 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(k), fromValue). in Splice()
2369 // 16. Let setStatus be Set(A, "length", actualDeleteCount, true). in Splice()
2375 // 19. Let itemCount be the number of elements in items. in Splice()
2377 // a. Let k be actualStart. in Splice()
2379 // i. Let from be ToString(k+actualDeleteCount). in Splice()
2380 // ii. Let to be ToString(k+itemCount). in Splice()
2381 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2383 // 1. Let fromValue be Get(O, from). in Splice()
2384 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2386 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2388 // c. Let k be len. in Splice()
2390 // i. Let deleteStatus be DeletePropertyOrThrow(O, ToString(k–1)). in Splice()
2420 // a. Let k be (len – actualDeleteCount). in Splice()
2422 // i. Let from be ToString(k + actualDeleteCount – 1). in Splice()
2423 // ii. Let to be ToString(k + itemCount – 1) in Splice()
2424 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2427 // 1. Let fromValue be Get(O, from). in Splice()
2429 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2432 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2453 // 22. Let k be actualStart. in Splice()
2464 // 24. Let setStatus be Set(O, "length", len – actualDeleteCount + itemCount, true). in Splice()
2484 // 1. Let O be ToObject(this value). in ToLocaleString()
2497 // 3. Let len be ToLength(Get(O, "length")). in ToLocaleString()
2514 // 7. Let firstElement be Get(array, "0"). in ToLocaleString()
2517 // a. Let R be the empty String. in ToLocaleString()
2519 // a. Let R be ToString(Invoke(firstElement, "toLocaleString")). in ToLocaleString()
2521 // 11. Let k be 1. in ToLocaleString()
2523 // a. Let S be a String value produced by concatenating R and separator. in ToLocaleString()
2524 // b. Let nextElement be Get(array, ToString(k)). in ToLocaleString()
2527 // i. Let R be the empty String. in ToLocaleString()
2529 // i. Let R be ToString(Invoke(nextElement, "toLocaleString")). in ToLocaleString()
2531 // f. Let R be a String value produced by concatenating S and R. in ToLocaleString()
2577 // 1. Let array be ToObject(this value). in ToString()
2584 // 3. Let func be Get(array, "join"). in ToString()
2591 …// 5. If IsCallable(func) is false, let func be the intrinsic function %ObjProto_toString% (19.1.3… in ToString()
2616 // 5. Let argCount be the number of actual arguments. in Unshift()
2619 // 1. Let O be ToObject(this value). in Unshift()
2626 // 3. Let len be ToLength(Get(O, "length")). in Unshift()
2633 // b. Let k be len. in Unshift()
2635 // i. Let from be ToString(k–1). in Unshift()
2636 // ii. Let to be ToString(k+argCount –1). in Unshift()
2637 // iii. Let fromPresent be HasProperty(O, from). in Unshift()
2640 // 1. Let fromValue be Get(O, from). in Unshift()
2642 // 3. Let setStatus be Set(O, to, fromValue, true). in Unshift()
2645 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Unshift()
2671 // d. Let j be 0. in Unshift()
2672 …// e. Let items be a List whose elements are, in left to right order, the arguments that were pa… in Unshift()
2675 // i. Remove the first element from items and let E be the value of that element. in Unshift()
2676 // ii. Let setStatus be Set(O, ToString(j), E, true). in Unshift()
2689 // 7. Let setStatus be Set(O, "length", len+argCount, true). in Unshift()
2709 // 1. Let O be ToObject(this value). in Values()
2788 // 1. Let O be ? ToObject(this value). in Flat()
2796 // 2. Let sourceLen be ? LengthOfArrayLike(O). in Flat()
2800 // 3. Let depthNum be 1. in Flat()
2815 // 5. Let A be ? ArraySpeciesCreate(O, 0). in Flat()
2840 // 1. Let O be ? ToObject(this value). in FlatMap()
2846 // 2. Let sourceLen be ? LengthOfArrayLike(O). in FlatMap()
2855 // 4. Let A be ? ArraySpeciesCreate(O, 0). in FlatMap()
2877 // 1. Let O be ? ToObject(this value). in Includes()
2886 // 2. Let len be ? LengthOfArrayLike(O). in Includes()
2893 // 4. Let n be ? ToIntegerOrInfinity(fromIndex). in Includes()
2911 // a. Let k be n. in Includes()
2913 // a. Let k be len + n. in Includes()
2914 // b. If k < 0, let k be 0. in Includes()
2918 // a. Let elementK be ? Get(O, ! ToString(!(k))). in Includes()
2948 // 1. Let O be ToObject(this value). in At()
2958 // 2. Let len be ? LengthOfArrayLike(O). in At()
2963 // 3. Let index be ? ToIntegerOrInfinity(index). in At()
2969 // a. Let k be relativeIndex. in At()
2971 // a. Let k be len + relativeIndex. in At()
3000 // 1. Let O be ToObject(this value). in With()
3005 // 2. Let len be ? LengthOfArrayLike(O). in With()
3009 // 3. Let relativeIndex be ? ToIntegerOrInfinity(relativeIndex). in With()
3016 // 4. If relativeIndex ≥ 0, let actualIndex be relativeIndex. in With()
3017 // 5. Else, let actualIndex be len + relativeIndex. in With()
3027 // 7. Let A be ? ArrayCreate(len). in With()
3036 // 8. Let k be 0. in With()
3039 // a. Let Pk be ! ToString(��(k)). in With()
3040 // b. If k is actualIndex, let fromValue be value. in With()
3041 // c. Else, let fromValue be ? Get(O, Pk). in With()
3076 // 2. Let obj be ToObject(this value). in ToSorted()
3081 // 3. Let len be ToLength(Get(obj, "length")). in ToSorted()
3086 // 4. Let A be ? ArrayCreate(len). in ToSorted()
3091 …// 5. Let SortCompare be a new Abstract Closure with parameters (x, y) that captures comparefn and… in ToSorted()
3094 // 6. Let sortedList be ? SortIndexedProperties(O, len, SortCompare, read-through-holes). in ToSorted()
3100 //7. Let j be 0. in ToSorted()
3124 // 1. Let O be ? ToObject(this value). in ToSpliced()
3130 // 2. Let len be ? LengthOfArrayLike(O). in ToSpliced()
3138 // 3. Let relativeStart be ? ToIntegerOrInfinity(start). in ToSpliced()
3144 // 4. If relativeStart = -∞, let k be 0. in ToSpliced()
3145 // 5. Else if relativeStart < 0, let k be max(len + relativeStart, 0). in ToSpliced()
3146 // 6. Else, let k be min(relativeStart, len). in ToSpliced()
3155 // 7. Let insertCount be the number of elements in items. in ToSpliced()
3157 // a. Let actualSkipCount be 0. in ToSpliced()
3159 // a. Let actualSkipCount be len - actualStart. in ToSpliced()
3161 // a. Let sc be ? ToIntegerOrInfinity(skipCount). in ToSpliced()
3162 // b. Let actualSkipCount be the result of clamping sc between 0 and len - actualStart. in ToSpliced()
3172 // 11. Let newLen be len + insertCount - actualSkipCount. in ToSpliced()
3182 // 13. Let A be ? ArrayCreate(newLen). in ToSpliced()
3188 // 14. Let i be 0. in ToSpliced()
3190 // 15. Let r be actualStart + actualSkipCount. in ToSpliced()
3193 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3194 // b. Let iValue be ? Get(O, Pi). in ToSpliced()
3206 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3218 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3219 // b. Let from be ! ToString(��(r)). in ToSpliced()
3220 // c. Let fromValue be ? Get(O, from). in ToSpliced()
3252 // 1. Let O be ToObject(this value). in FindLast()
3259 // 3. Let len be ToLength(Get(O, "length")). in FindLast()
3270 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLast()
3273 // 7. Let k be (len - 1). in FindLast()
3275 // a. Let Pk be ToString(k). in FindLast()
3276 // b. Let kValue be Get(O, Pk). in FindLast()
3278 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLast()
3314 // 1. Let O be ToObject(this value). in FindLastIndex()
3321 // 3. Let len be ToLength(Get(O, "length")). in FindLastIndex()
3332 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLastIndex()
3335 // 7. Let k be (len - 1). in FindLastIndex()
3337 // a. Let Pk be ToString(k). in FindLastIndex()
3338 // b. Let kValue be Get(O, Pk). in FindLastIndex()
3340 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLastIndex()
3385 // 1. Let O be ToObject(this value). in ToReversed()
3392 // 2. Let len be ? LengthOfArrayLike(O). in ToReversed()
3399 // 3. Let A be ? ArrayCreate(len). in ToReversed()
3405 // 4. Let k be 0. in ToReversed()
3407 // a. Let from be ! ToString(��(len - k - 1)). in ToReversed()
3408 // b. Let Pk be ! ToString(��(k)). in ToReversed()
3409 // c. Let fromValue be ? Get(O, from). in ToReversed()