Lines Matching full:be
52 // 1. Let numberOfArgs be the number of arguments passed to this function call. in ArrayConstructor()
55 …// 3. If NewTarget is undefined, let newTarget be the active function object, else let newTarget b… in ArrayConstructor()
62 // 4. Let proto be GetPrototypeFromConstructor(newTarget, "%ArrayPrototype%"). in ArrayConstructor()
74 // 6. Let array be ArrayCreate(0, proto). in ArrayConstructor()
80 // a. Let defineStatus be CreateDataProperty(array, "0", len). in ArrayConstructor()
82 // c. Let intLen be 1. in ArrayConstructor()
84 // a. Let intLen be ToUint32(len). in ArrayConstructor()
86 // 9. Let setStatus be Set(array, "length", intLen, true). in ArrayConstructor()
112 // 8. Let k be 0. in ArrayConstructor()
113 // 9. Let items be a zero-origined List containing the argument items in order. in ArrayConstructor()
115 // a. Let Pk be ToString(k). in ArrayConstructor()
116 // b. Let itemK be items[k]. in ArrayConstructor()
117 // c. Let defineStatus be CreateDataProperty(array, Pk, itemK). in ArrayConstructor()
142 // 1. Let C be the this value. in From()
144 // 2. If mapfn is undefined, let mapping be false. in From()
148 // b. If thisArg was supplied, let T be thisArg; else let T be undefined. in From()
149 // c. Let mapping be true in From()
158 // 4. Let usingIterator be GetMethod(items, @@iterator). in From()
177 // i. Let A be Construct(C). in From()
179 // i. Let A be ArrayCreate(0). in From()
195 // d. Let iterator be GetIterator(items, usingIterator). in From()
199 // f. Let k be 0. in From()
206 // i. Let Pk be ToString(k). in From()
207 // ii. Let next be IteratorStep(iterator). in From()
212 // 1. Let setStatus be Set(A, "length", k, true). in From()
220 // v. Let nextValue be IteratorValue(next). in From()
225 // 1. Let mappedValue be Call(mapfn, T, «nextValue, k»). in From()
227 // 3. Let mappedValue be mappedValue.[[value]]. in From()
228 // viii. Else, let mappedValue be nextValue. in From()
242 // ix. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
253 // 8. Let arrayLike be ToObject(items). in From()
258 // 10. Let len be ToLength(Get(arrayLike, "length")). in From()
263 // a. Let A be Construct(C, «len»). in From()
265 // a. Let A be ArrayCreate(len). in From()
283 // 15. Let k be 0. in From()
285 // a. Let Pk be ToString(k). in From()
286 // b. Let kValue be Get(arrayLike, Pk). in From()
288 // i. Let mappedValue be Call(mapfn, T, «kValue, k»). in From()
289 // e. Else, let mappedValue be kValue. in From()
290 // f. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
314 // 17. Let setStatus be Set(A, "length", len, true). in From()
345 // 1. Let len be the actual number of arguments passed to this function. in Of()
348 // 3. Let C be the this value. in Of()
351 // a. Let A be Construct(C, «len»). in Of()
353 // a. Let A be ArrayCreate(len). in Of()
374 // 7. Let k be 0. in Of()
376 // a. Let kValue be items[k]. in Of()
377 // b. Let Pk be ToString(k). in Of()
378 // c. Let defineStatus be CreateDataPropertyOrThrow(A,Pk, kValue). in Of()
388 // 9. Let setStatus be Set(A, "length", len, true). in Of()
414 // 1. Let O be ToObject(this value). in Concat()
420 // 2. Let A be ArraySpeciesCreate(O, 0). in Concat()
440 // 3. Let n be 0. in Concat()
453 // a. Let spreadable be ? IsConcatSpreadable(E). in Concat()
458 // i. Let k be 0. in Concat()
459 // ii. Let len be ? LengthOfArrayLike(E). in Concat()
473 // 1. Let P be ToString(k). in Concat()
474 // 2. Let exists be HasProperty(E, P). in Concat()
481 // a. Let subElement be Get(E, P). in Concat()
524 // 1. Let O be ToObject(this value). in CopyWithin()
530 // 3. Let len be ToLength(Get(O, "length")). in CopyWithin()
539 // 5. Let relativeTarget be ToInteger(target). in CopyWithin()
544 …// 7. If relativeTarget < 0, let to be max((len + relativeTarget),0); else let to be min(relativeT… in CopyWithin()
551 // 8. Let relativeStart be ToInteger(start). in CopyWithin()
556 …// 10. If relativeStart < 0, let from be max((len + relativeStart),0); else let from be min(relati… in CopyWithin()
563 // 11. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in CopyWithin()
573 …// 13. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in CopyWithin()
580 // 14. Let count be min(final-from, len-to). in CopyWithin()
584 // a. Let direction be -1. in CopyWithin()
585 // b. Let from be from + count -1. in CopyWithin()
586 // c. Let to be to + count -1. in CopyWithin()
597 // a. Let fromKey be ToString(from). in CopyWithin()
598 // b. Let toKey be ToString(to). in CopyWithin()
599 // c. Let fromPresent be HasProperty(O, fromKey). in CopyWithin()
602 // i. Let fromVal be Get(O, fromKey). in CopyWithin()
604 // iii. Let setStatus be Set(O, toKey, fromVal, true). in CopyWithin()
607 // i. Let deleteStatus be DeletePropertyOrThrow(O, toKey). in CopyWithin()
609 // g. Let from be from + direction. in CopyWithin()
610 // h. Let to be to + direction. in CopyWithin()
611 // i. Let count be count − 1. in CopyWithin()
649 // 1. Let O be ToObject(this value). in Entries()
666 // 1. Let O be ToObject(this value). in Every()
673 // 3. Let len be ToLength(Get(O, "length")). in Every()
684 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Every()
687 // 7. Let k be 0. in Every()
689 // a. Let Pk be ToString(k). in Every()
690 // b. Let kPresent be HasProperty(O, Pk). in Every()
693 // i. Let kValue be Get(O, Pk). in Every()
695 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Every()
743 // 1. Let O be ToObject(this value). in Fill()
761 // 3. Let len be ToLength(Get(O, "length")). in Fill()
766 // 5. Let relativeStart be ToInteger(start). in Fill()
772 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Fill()
781 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Fill()
791 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Fill()
800 // a. Let Pk be ToString(k). in Fill()
801 // b. Let setStatus be Set(O, Pk, value, true). in Fill()
843 // 1. Let O be ToObject(this value). in Filter()
850 // 3. Let len be ToLength(Get(O, "length")). in Filter()
861 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Filter()
864 // 7. Let A be ArraySpeciesCreate(O, 0). in Filter()
871 // 9. Let k be 0. in Filter()
872 // 10. Let to be 0. in Filter()
874 // a. Let Pk be ToString(k). in Filter()
875 // b. Let kPresent be HasProperty(O, Pk). in Filter()
878 // i. Let kValue be Get(O, Pk). in Filter()
880 // iii. Let selected be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Filter()
883 // 1. Let status be CreateDataPropertyOrThrow (A, ToString(to), kValue). in Filter()
932 // 1. Let O be ToObject(this value). in Find()
939 // 3. Let len be ToLength(Get(O, "length")). in Find()
950 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Find()
953 // 7. Let k be 0. in Find()
955 // a. Let Pk be ToString(k). in Find()
956 // b. Let kValue be Get(O, Pk). in Find()
958 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in Find()
994 // 1. Let O be ToObject(this value). in FindIndex()
1001 // 3. Let len be ToLength(Get(O, "length")). in FindIndex()
1012 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindIndex()
1015 // 7. Let k be 0. in FindIndex()
1017 // a. Let Pk be ToString(k). in FindIndex()
1018 // b. Let kValue be Get(O, Pk). in FindIndex()
1020 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindIndex()
1063 // 1. Let O be ToObject(this value). in ForEach()
1070 // 3. Let len be ToLength(Get(O, "length")). in ForEach()
1081 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in ForEach()
1084 // 7. Let k be 0. in ForEach()
1086 // a. Let Pk be ToString(k). in ForEach()
1087 // b. Let kPresent be HasProperty(O, Pk). in ForEach()
1090 // i. Let kValue be Get(O, Pk). in ForEach()
1092 // iii. Let funcResult be Call(callbackfn, T, «kValue, k, O»). in ForEach()
1134 // 1. Let O be ToObject(this value). in IndexOf()
1143 // 3. Let len be ToLength(Get(O, "length")). in IndexOf()
1153 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in IndexOf()
1169 // a. Let k be n. in IndexOf()
1171 // a. Let k be len - abs(n). in IndexOf()
1172 // b. If k < 0, let k be 0. in IndexOf()
1182 // a. Let kPresent be HasProperty(O, ToString(k)). in IndexOf()
1185 // i. Let elementK be Get(O, ToString(k)). in IndexOf()
1187 …// iii. Let same be the result of performing Strict Equality Comparison searchElement === elem… in IndexOf()
1227 // 1. Let O be ToObject(this value). in Join()
1233 // 3. Let len be ToLength(Get(O, "length")). in Join()
1238 // 5. If separator is undefined, let separator be the single-element String ",". in Join()
1239 // 6. Let sep be ToString(separator). in Join()
1257 // 9. Let element0 be Get(O, "0"). in Join()
1258 …// 10. If element0 is undefined or null, let R be the empty String; otherwise, let R be ToString(e… in Join()
1260 // 12. Let k be 1. in Join()
1262 // a. Let S be the String value produced by concatenating R and sep. in Join()
1263 // b. Let element be Get(O, ToString(k)). in Join()
1264 …// c. If element is undefined or null, let next be the empty String; otherwise, let next be ToSt… in Join()
1266 // e. Let R be a String value produced by concatenating S and next. in Join()
1301 // 1. Let O be ToObject(this value). in Keys()
1320 // 1. Let O be ToObject(this value). in LastIndexOf()
1329 // 3. Let len be ToLength(Get(O, "length")). in LastIndexOf()
1339 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be len-1. in LastIndexOf()
1349 // 8. If n ≥ 0, let k be min(n, len – 1). in LastIndexOf()
1351 // a. Let k be len - abs(n). in LastIndexOf()
1361 // a. Let kPresent be HasProperty(O, ToString(k)). in LastIndexOf()
1364 // i. Let elementK be Get(O, ToString(k)). in LastIndexOf()
1366 …// iii. Let same be the result of performing Strict Equality Comparison searchElement === elem… in LastIndexOf()
1396 // 1. Let O be ToObject(this value). in Map()
1403 // 3. Let len be ToLength(Get(O, "length")). in Map()
1414 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Map()
1417 // 7. Let A be ArraySpeciesCreate(O, len). in Map()
1427 // 9. Let k be 0. in Map()
1429 // a. Let Pk be ToString(k). in Map()
1430 // b. Let kPresent be HasProperty(O, Pk). in Map()
1433 // i. Let kValue be Get(O, Pk). in Map()
1435 // iii. Let mappedValue be Call(callbackfn, T, «kValue, k, O»). in Map()
1437 // v. Let status be CreateDataPropertyOrThrow (A, Pk, mappedValue). in Map()
1481 // 1. Let O be ToObject(this value). in Pop()
1491 // 3. Let len be ToLength(Get(O, "length")). in Pop()
1496 // a. Let setStatus be Set(O, "length", 0, true). in Pop()
1508 // a. Let newLen be len–1. in Pop()
1509 // b. Let indx be ToString(newLen). in Pop()
1510 // c. Let element be Get(O, indx). in Pop()
1512 // e. Let deleteStatus be DeletePropertyOrThrow(O, indx). in Pop()
1514 // g. Let setStatus be Set(O, "length", newLen, true). in Pop()
1540 // 6. Let argCount be the number of elements in items. in Push()
1543 // 1. Let O be ToObject(this value). in Push()
1549 // 3. Let len be ToLength(Get(O, "length")). in Push()
1559 // a. Remove the first element from items and let E be the value of the element. in Push()
1560 // b. Let setStatus be Set(O, ToString(len), E, true). in Push()
1562 // d. Let len be len+1. in Push()
1574 // 9. Let setStatus be Set(O, "length", len, true). in Push()
1595 // 1. Let O be ToObject(this value). in Reduce()
1602 // 3. Let len be ToLength(Get(O, "length")). in Reduce()
1618 // 7. Let k be 0. in Reduce()
1622 // a. Let kPresent be false. in Reduce()
1624 // i. Let Pk be ToString(k). in Reduce()
1625 // ii. Let kPresent be HasProperty(O, Pk). in Reduce()
1628 // 1. Let accumulator be Get(O, Pk). in Reduce()
1648 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in Reduce()
1657 // a. Let Pk be ToString(k). in Reduce()
1658 // b. Let kPresent be HasProperty(O, Pk). in Reduce()
1661 // i. Let kValue be Get(O, Pk). in Reduce()
1663 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in Reduce()
1705 // 1. Let O be ToObject(this value). in ReduceRight()
1712 // 3. Let len be ToLength(Get(O, "length")). in ReduceRight()
1728 // 7. Let k be len-1. in ReduceRight()
1733 // a. Let kPresent be false. in ReduceRight()
1735 // i. Let Pk be ToString(k). in ReduceRight()
1736 // ii. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1739 // 1. Let accumulator be Get(O, Pk). in ReduceRight()
1758 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in ReduceRight()
1763 // a. Let Pk be ToString(k). in ReduceRight()
1764 // b. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1767 // i. Let kValue be Get(O, Pk). in ReduceRight()
1769 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in ReduceRight()
1808 // 1. Let O be ToObject(this value). in Reverse()
1815 // 3. Let len be ToLength(Get(O, "length")). in Reverse()
1820 // 5. Let middle be floor(len/2). in Reverse()
1823 // 6. Let lower be 0. in Reverse()
1827 // a. Let upper be len-lower-1. in Reverse()
1828 // b. Let upperP be ToString(upper). in Reverse()
1829 // c. Let lowerP be ToString(lower). in Reverse()
1830 // d. Let lowerExists be HasProperty(O, lowerP). in Reverse()
1833 // i. Let lowerValue be Get(O, lowerP). in Reverse()
1835 // g. Let upperExists be HasProperty(O, upperP). in Reverse()
1838 // i. Let upperValue be Get(O, upperP). in Reverse()
1841 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1843 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1846 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1848 // iii. Let deleteStatus be DeletePropertyOrThrow (O, upperP). in Reverse()
1851 // i. Let deleteStatus be DeletePropertyOrThrow (O, lowerP). in Reverse()
1853 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1913 // 1. Let O be ToObject(this value). in Shift()
1923 // 3. Let len be ToLength(Get(O, "length")). in Shift()
1928 // a. Let setStatus be Set(O, "length", 0, true). in Shift()
1939 // 6. Let first be Get(O, "0"). in Shift()
1945 // 8. Let k be 1. in Shift()
1947 // a. Let from be ToString(k). in Shift()
1948 // b. Let to be ToString(k–1). in Shift()
1949 // c. Let fromPresent be HasProperty(O, from). in Shift()
1952 // i. Let fromVal be Get(O, from). in Shift()
1954 // iii. Let setStatus be Set(O, to, fromVal, true). in Shift()
1957 // i. Let deleteStatus be DeletePropertyOrThrow(O, to). in Shift()
1977 // 10. Let deleteStatus be DeletePropertyOrThrow(O, ToString(len–1)). in Shift()
1983 // 12. Let setStatus be Set(O, "length", len–1, true). in Shift()
2001 // 1. Let O be ToObject(this value). in Slice()
2008 // 3. Let len be ToLength(Get(O, "length")). in Slice()
2018 // 5. Let relativeStart be ToInteger(start). in Slice()
2025 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Slice()
2034 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Slice()
2036 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Slice()
2057 // 11. Let count be max(final – k, 0). in Slice()
2082 // 12. Let A be ArraySpeciesCreate(O, count). in Slice()
2092 // 14. Let n be 0. in Slice()
2094 // a. Let Pk be ToString(k). in Slice()
2095 // b. Let kPresent be HasProperty(O, Pk). in Slice()
2098 // i. Let kValue be Get(O, Pk). in Slice()
2100 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(n), kValue ). in Slice()
2122 // 16. Let setStatus be Set(A, "length", n, true). in Slice()
2141 // 1. Let O be ToObject(this value). in Some()
2148 // 3. Let len be ToLength(Get(O, "length")). in Some()
2159 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Some()
2162 // 7. Let k be 0. in Some()
2164 // a. Let Pk be ToString(k). in Some()
2165 // b. Let kPresent be HasProperty(O, Pk). in Some()
2168 // i. Let kValue be Get(O, Pk). in Some()
2170 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, and O»)). in Some()
2210 // 1. Let obj be ToObject(this value). in Sort()
2220 // 2. Let len be ToLength(Get(obj, "length")). in Sort()
2274 // 1. Let O be ToObject(this value). in Splice()
2280 // 3. Let len be ToLength(Get(O, "length")). in Splice()
2284 // 5. Let relativeStart be ToInteger(start). in Splice()
2296 …// 7. If relativeStart < 0, let actualStart be max((len + relativeStart),0); else let actualStart … in Splice()
2307 // a. Let insertCount be 0. in Splice()
2308 // b. Let actualDeleteCount be 0. in Splice()
2310 // a. Let insertCount be 0. in Splice()
2311 // b. Let actualDeleteCount be len – actualStart. in Splice()
2313 // a. Let insertCount be the number of actual arguments minus 2. in Splice()
2314 // b. Let dc be ToInteger(deleteCount). in Splice()
2316 // d. Let actualDeleteCount be min(max(dc,0), len – actualStart). in Splice()
2334 // 12. Let A be ArraySpeciesCreate(O, actualDeleteCount). in Splice()
2339 // 14. Let k be 0. in Splice()
2341 // a. Let from be ToString(actualStart+k). in Splice()
2342 // b. Let fromPresent be HasProperty(O, from). in Splice()
2344 // i. Let fromValue be Get(O, from). in Splice()
2345 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(k), fromValue). in Splice()
2368 // 16. Let setStatus be Set(A, "length", actualDeleteCount, true). in Splice()
2374 // 19. Let itemCount be the number of elements in items. in Splice()
2376 // a. Let k be actualStart. in Splice()
2378 // i. Let from be ToString(k+actualDeleteCount). in Splice()
2379 // ii. Let to be ToString(k+itemCount). in Splice()
2380 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2382 // 1. Let fromValue be Get(O, from). in Splice()
2383 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2385 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2387 // c. Let k be len. in Splice()
2389 // i. Let deleteStatus be DeletePropertyOrThrow(O, ToString(k–1)). in Splice()
2419 // a. Let k be (len – actualDeleteCount). in Splice()
2421 // i. Let from be ToString(k + actualDeleteCount – 1). in Splice()
2422 // ii. Let to be ToString(k + itemCount – 1) in Splice()
2423 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2426 // 1. Let fromValue be Get(O, from). in Splice()
2428 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2431 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2452 // 22. Let k be actualStart. in Splice()
2463 // 24. Let setStatus be Set(O, "length", len – actualDeleteCount + itemCount, true). in Splice()
2483 // 1. Let O be ToObject(this value). in ToLocaleString()
2490 // 3. Let len be ToLength(Get(O, "length")). in ToLocaleString()
2505 // 7. Let firstElement be Get(array, "0"). in ToLocaleString()
2508 // a. Let R be the empty String. in ToLocaleString()
2510 // a. Let R be ToString(Invoke(firstElement, "toLocaleString")). in ToLocaleString()
2512 // 11. Let k be 1. in ToLocaleString()
2514 // a. Let S be a String value produced by concatenating R and separator. in ToLocaleString()
2515 // b. Let nextElement be Get(array, ToString(k)). in ToLocaleString()
2518 // i. Let R be the empty String. in ToLocaleString()
2520 // i. Let R be ToString(Invoke(nextElement, "toLocaleString")). in ToLocaleString()
2522 // f. Let R be a String value produced by concatenating S and R. in ToLocaleString()
2566 // 1. Let array be ToObject(this value). in ToString()
2573 // 3. Let func be Get(array, "join"). in ToString()
2580 …// 5. If IsCallable(func) is false, let func be the intrinsic function %ObjProto_toString% (19.1.3… in ToString()
2605 // 5. Let argCount be the number of actual arguments. in Unshift()
2608 // 1. Let O be ToObject(this value). in Unshift()
2615 // 3. Let len be ToLength(Get(O, "length")). in Unshift()
2622 // b. Let k be len. in Unshift()
2624 // i. Let from be ToString(k–1). in Unshift()
2625 // ii. Let to be ToString(k+argCount –1). in Unshift()
2626 // iii. Let fromPresent be HasProperty(O, from). in Unshift()
2629 // 1. Let fromValue be Get(O, from). in Unshift()
2631 // 3. Let setStatus be Set(O, to, fromValue, true). in Unshift()
2634 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Unshift()
2660 // d. Let j be 0. in Unshift()
2661 …// e. Let items be a List whose elements are, in left to right order, the arguments that were pa… in Unshift()
2664 // i. Remove the first element from items and let E be the value of that element. in Unshift()
2665 // ii. Let setStatus be Set(O, ToString(j), E, true). in Unshift()
2678 // 7. Let setStatus be Set(O, "length", len+argCount, true). in Unshift()
2698 // 1. Let O be ToObject(this value). in Values()
2759 // 1. Let O be ? ToObject(this value). in Flat()
2767 // 2. Let sourceLen be ? LengthOfArrayLike(O). in Flat()
2771 // 3. Let depthNum be 1. in Flat()
2785 // 5. Let A be ? ArraySpeciesCreate(O, 0). in Flat()
2809 // 1. Let O be ? ToObject(this value). in FlatMap()
2815 // 2. Let sourceLen be ? LengthOfArrayLike(O). in FlatMap()
2824 // 4. Let A be ? ArraySpeciesCreate(O, 0). in FlatMap()
2846 // 1. Let O be ? ToObject(this value). in Includes()
2855 // 2. Let len be ? LengthOfArrayLike(O). in Includes()
2862 // 4. Let n be ? ToIntegerOrInfinity(fromIndex). in Includes()
2880 // a. Let k be n. in Includes()
2882 // a. Let k be len + n. in Includes()
2883 // b. If k < 0, let k be 0. in Includes()
2887 // a. Let elementK be ? Get(O, ! ToString(!(k))). in Includes()
2917 // 1. Let O be ToObject(this value). in At()
2927 // 2. Let len be ? LengthOfArrayLike(O). in At()
2932 // 3. Let index be ? ToIntegerOrInfinity(index). in At()
2938 // a. Let k be relativeIndex. in At()
2940 // a. Let k be len + relativeIndex. in At()
2969 // 1. Let O be ToObject(this value). in With()
2974 // 2. Let len be ? LengthOfArrayLike(O). in With()
2978 // 3. Let relativeIndex be ? ToIntegerOrInfinity(relativeIndex). in With()
2985 // 4. If relativeIndex ≥ 0, let actualIndex be relativeIndex. in With()
2986 // 5. Else, let actualIndex be len + relativeIndex. in With()
2996 // 7. Let A be ? ArrayCreate(len). in With()
3005 // 8. Let k be 0. in With()
3008 // a. Let Pk be ! ToString(��(k)). in With()
3009 // b. If k is actualIndex, let fromValue be value. in With()
3010 // c. Else, let fromValue be ? Get(O, Pk). in With()
3045 // 2. Let obj be ToObject(this value). in ToSorted()
3050 // 3. Let len be ToLength(Get(obj, "length")). in ToSorted()
3055 // 4. Let A be ? ArrayCreate(len). in ToSorted()
3060 …// 5. Let SortCompare be a new Abstract Closure with parameters (x, y) that captures comparefn and… in ToSorted()
3063 // 6. Let sortedList be ? SortIndexedProperties(O, len, SortCompare, read-through-holes). in ToSorted()
3069 //7. Let j be 0. in ToSorted()
3093 // 1. Let O be ? ToObject(this value). in ToSpliced()
3099 // 2. Let len be ? LengthOfArrayLike(O). in ToSpliced()
3107 // 3. Let relativeStart be ? ToIntegerOrInfinity(start). in ToSpliced()
3113 // 4. If relativeStart = -∞, let k be 0. in ToSpliced()
3114 // 5. Else if relativeStart < 0, let k be max(len + relativeStart, 0). in ToSpliced()
3115 // 6. Else, let k be min(relativeStart, len). in ToSpliced()
3124 // 7. Let insertCount be the number of elements in items. in ToSpliced()
3126 // a. Let actualSkipCount be 0. in ToSpliced()
3128 // a. Let actualSkipCount be len - actualStart. in ToSpliced()
3130 // a. Let sc be ? ToIntegerOrInfinity(skipCount). in ToSpliced()
3131 // b. Let actualSkipCount be the result of clamping sc between 0 and len - actualStart. in ToSpliced()
3141 // 11. Let newLen be len + insertCount - actualSkipCount. in ToSpliced()
3151 // 13. Let A be ? ArrayCreate(newLen). in ToSpliced()
3157 // 14. Let i be 0. in ToSpliced()
3159 // 15. Let r be actualStart + actualSkipCount. in ToSpliced()
3162 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3163 // b. Let iValue be ? Get(O, Pi). in ToSpliced()
3175 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3187 // a. Let Pi be ! ToString(��(i)). in ToSpliced()
3188 // b. Let from be ! ToString(��(r)). in ToSpliced()
3189 // c. Let fromValue be ? Get(O, from). in ToSpliced()
3221 // 1. Let O be ToObject(this value). in FindLast()
3228 // 3. Let len be ToLength(Get(O, "length")). in FindLast()
3239 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLast()
3242 // 7. Let k be (len - 1). in FindLast()
3244 // a. Let Pk be ToString(k). in FindLast()
3245 // b. Let kValue be Get(O, Pk). in FindLast()
3247 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLast()
3283 // 1. Let O be ToObject(this value). in FindLastIndex()
3290 // 3. Let len be ToLength(Get(O, "length")). in FindLastIndex()
3301 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindLastIndex()
3304 // 7. Let k be (len - 1). in FindLastIndex()
3306 // a. Let Pk be ToString(k). in FindLastIndex()
3307 // b. Let kValue be Get(O, Pk). in FindLastIndex()
3309 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindLastIndex()
3353 // 1. Let O be ToObject(this value). in ToReversed()
3360 // 2. Let len be ? LengthOfArrayLike(O). in ToReversed()
3367 // 3. Let A be ? ArrayCreate(len). in ToReversed()
3373 // 4. Let k be 0. in ToReversed()
3375 // a. Let from be ! ToString(��(len - k - 1)). in ToReversed()
3376 // b. Let Pk be ! ToString(��(k)). in ToReversed()
3377 // c. Let fromValue be ? Get(O, from). in ToReversed()