Lines Matching full:be
51 // 1. Let numberOfArgs be the number of arguments passed to this function call. in ArrayConstructor()
54 …// 3. If NewTarget is undefined, let newTarget be the active function object, else let newTarget b… in ArrayConstructor()
61 // 4. Let proto be GetPrototypeFromConstructor(newTarget, "%ArrayPrototype%"). in ArrayConstructor()
73 // 6. Let array be ArrayCreate(0, proto). in ArrayConstructor()
78 // a. Let defineStatus be CreateDataProperty(array, "0", len). in ArrayConstructor()
80 // c. Let intLen be 1. in ArrayConstructor()
82 // a. Let intLen be ToUint32(len). in ArrayConstructor()
84 // 9. Let setStatus be Set(array, "length", intLen, true). in ArrayConstructor()
110 // 8. Let k be 0. in ArrayConstructor()
111 // 9. Let items be a zero-origined List containing the argument items in order. in ArrayConstructor()
113 // a. Let Pk be ToString(k). in ArrayConstructor()
114 // b. Let itemK be items[k]. in ArrayConstructor()
115 // c. Let defineStatus be CreateDataProperty(array, Pk, itemK). in ArrayConstructor()
140 // 1. Let C be the this value. in From()
142 // 2. If mapfn is undefined, let mapping be false. in From()
146 // b. If thisArg was supplied, let T be thisArg; else let T be undefined. in From()
147 // c. Let mapping be true in From()
156 // 4. Let usingIterator be GetMethod(items, @@iterator). in From()
170 // i. Let A be Construct(C). in From()
172 // i. Let A be ArrayCreate(0). in From()
188 // d. Let iterator be GetIterator(items, usingIterator). in From()
192 // f. Let k be 0. in From()
199 // i. Let Pk be ToString(k). in From()
200 // ii. Let next be IteratorStep(iterator). in From()
205 // 1. Let setStatus be Set(A, "length", k, true). in From()
213 // v. Let nextValue be IteratorValue(next). in From()
218 // 1. Let mappedValue be Call(mapfn, T, «nextValue, k»). in From()
220 // 3. Let mappedValue be mappedValue.[[value]]. in From()
221 // viii. Else, let mappedValue be nextValue. in From()
235 // ix. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
246 // 8. Let arrayLike be ToObject(items). in From()
251 // 10. Let len be ToLength(Get(arrayLike, "length")). in From()
256 // a. Let A be Construct(C, «len»). in From()
258 // a. Let A be ArrayCreate(len). in From()
276 // 15. Let k be 0. in From()
278 // a. Let Pk be ToString(k). in From()
279 // b. Let kValue be Get(arrayLike, Pk). in From()
281 // i. Let mappedValue be Call(mapfn, T, «kValue, k»). in From()
282 // e. Else, let mappedValue be kValue. in From()
283 // f. Let defineStatus be CreateDataPropertyOrThrow(A, Pk, mappedValue). in From()
308 // 17. Let setStatus be Set(A, "length", len, true). in From()
339 // 1. Let len be the actual number of arguments passed to this function. in Of()
342 // 3. Let C be the this value. in Of()
345 // a. Let A be Construct(C, «len»). in Of()
347 // a. Let A be ArrayCreate(len). in Of()
368 // 7. Let k be 0. in Of()
370 // a. Let kValue be items[k]. in Of()
371 // b. Let Pk be ToString(k). in Of()
372 // c. Let defineStatus be CreateDataPropertyOrThrow(A,Pk, kValue). in Of()
382 // 9. Let setStatus be Set(A, "length", len, true). in Of()
407 // 1. Let O be ToObject(this value). in Concat()
414 // 3. Let A be ArraySpeciesCreate(O, 0). in Concat()
421 // 5. Let n be 0. in Concat()
461 // a. Remove the first element from items and let E be the value of the element in Concat()
466 // b. Let spreadable be IsConcatSpreadable(E). in Concat()
472 // ii. Let len be ToLength(Get(E, "length")). in Concat()
489 // 1. Let P be ToString(k). in Concat()
490 // 2. Let exists be HasProperty(E, P). in Concat()
495 // a. Let subElement be Get(E, P). in Concat()
514 // ii. Let status be CreateDataPropertyOrThrow (A, ToString(n), E). in Concat()
523 // 8. Let setStatus be Set(A, "length", n, true). in Concat()
542 // 1. Let O be ToObject(this value). in CopyWithin()
548 // 3. Let len be ToLength(Get(O, "length")). in CopyWithin()
557 // 5. Let relativeTarget be ToInteger(target). in CopyWithin()
562 …// 7. If relativeTarget < 0, let to be max((len + relativeTarget),0); else let to be min(relativeT… in CopyWithin()
569 // 8. Let relativeStart be ToInteger(start). in CopyWithin()
574 …// 10. If relativeStart < 0, let from be max((len + relativeStart),0); else let from be min(relati… in CopyWithin()
581 // 11. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in CopyWithin()
591 …// 13. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in CopyWithin()
598 // 14. Let count be min(final-from, len-to). in CopyWithin()
602 // a. Let direction be -1. in CopyWithin()
603 // b. Let from be from + count -1. in CopyWithin()
604 // c. Let to be to + count -1. in CopyWithin()
615 // a. Let fromKey be ToString(from). in CopyWithin()
616 // b. Let toKey be ToString(to). in CopyWithin()
617 // c. Let fromPresent be HasProperty(O, fromKey). in CopyWithin()
620 // i. Let fromVal be Get(O, fromKey). in CopyWithin()
622 // iii. Let setStatus be Set(O, toKey, fromVal, true). in CopyWithin()
625 // i. Let deleteStatus be DeletePropertyOrThrow(O, toKey). in CopyWithin()
627 // g. Let from be from + direction. in CopyWithin()
628 // h. Let to be to + direction. in CopyWithin()
629 // i. Let count be count − 1. in CopyWithin()
666 // 1. Let O be ToObject(this value). in Entries()
683 // 1. Let O be ToObject(this value). in Every()
690 // 3. Let len be ToLength(Get(O, "length")). in Every()
701 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Every()
704 // 7. Let k be 0. in Every()
706 // a. Let Pk be ToString(k). in Every()
707 // b. Let kPresent be HasProperty(O, Pk). in Every()
710 // i. Let kValue be Get(O, Pk). in Every()
712 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Every()
760 // 1. Let O be ToObject(this value). in Fill()
778 // 3. Let len be ToLength(Get(O, "length")). in Fill()
783 // 5. Let relativeStart be ToInteger(start). in Fill()
789 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Fill()
798 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Fill()
808 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Fill()
817 // a. Let Pk be ToString(k). in Fill()
818 // b. Let setStatus be Set(O, Pk, value, true). in Fill()
860 // 1. Let O be ToObject(this value). in Filter()
867 // 3. Let len be ToLength(Get(O, "length")). in Filter()
878 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Filter()
881 // 7. Let A be ArraySpeciesCreate(O, 0). in Filter()
888 // 9. Let k be 0. in Filter()
889 // 10. Let to be 0. in Filter()
891 // a. Let Pk be ToString(k). in Filter()
892 // b. Let kPresent be HasProperty(O, Pk). in Filter()
895 // i. Let kValue be Get(O, Pk). in Filter()
897 // iii. Let selected be ToBoolean(Call(callbackfn, T, «kValue, k, O»)). in Filter()
900 // 1. Let status be CreateDataPropertyOrThrow (A, ToString(to), kValue). in Filter()
948 // 1. Let O be ToObject(this value). in Find()
955 // 3. Let len be ToLength(Get(O, "length")). in Find()
966 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Find()
969 // 7. Let k be 0. in Find()
971 // a. Let Pk be ToString(k). in Find()
972 // b. Let kValue be Get(O, Pk). in Find()
974 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in Find()
1011 // 1. Let O be ToObject(this value). in FindIndex()
1018 // 3. Let len be ToLength(Get(O, "length")). in FindIndex()
1029 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in FindIndex()
1032 // 7. Let k be 0. in FindIndex()
1034 // a. Let Pk be ToString(k). in FindIndex()
1035 // b. Let kValue be Get(O, Pk). in FindIndex()
1037 // d. Let testResult be ToBoolean(Call(predicate, T, «kValue, k, O»)). in FindIndex()
1079 // 1. Let O be ToObject(this value). in ForEach()
1086 // 3. Let len be ToLength(Get(O, "length")). in ForEach()
1097 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in ForEach()
1100 // 7. Let k be 0. in ForEach()
1102 // a. Let Pk be ToString(k). in ForEach()
1103 // b. Let kPresent be HasProperty(O, Pk). in ForEach()
1106 // i. Let kValue be Get(O, Pk). in ForEach()
1108 // iii. Let funcResult be Call(callbackfn, T, «kValue, k, O»). in ForEach()
1149 // 1. Let O be ToObject(this value). in IndexOf()
1158 // 3. Let len be ToLength(Get(O, "length")). in IndexOf()
1168 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be 0. in IndexOf()
1184 // a. Let k be n. in IndexOf()
1186 // a. Let k be len - abs(n). in IndexOf()
1187 // b. If k < 0, let k be 0. in IndexOf()
1197 // a. Let kPresent be HasProperty(O, ToString(k)). in IndexOf()
1200 // i. Let elementK be Get(O, ToString(k)). in IndexOf()
1202 …// iii. Let same be the result of performing Strict Equality Comparison searchElement === elem… in IndexOf()
1237 // 1. Let O be ToObject(this value). in Join()
1243 // 3. Let len be ToLength(Get(O, "length")). in Join()
1248 // 5. If separator is undefined, let separator be the single-element String ",". in Join()
1249 // 6. Let sep be ToString(separator). in Join()
1267 // 9. Let element0 be Get(O, "0"). in Join()
1268 …// 10. If element0 is undefined or null, let R be the empty String; otherwise, let R be ToString(e… in Join()
1270 // 12. Let k be 1. in Join()
1272 // a. Let S be the String value produced by concatenating R and sep. in Join()
1273 // b. Let element be Get(O, ToString(k)). in Join()
1274 …// c. If element is undefined or null, let next be the empty String; otherwise, let next be ToSt… in Join()
1276 // e. Let R be a String value produced by concatenating S and next. in Join()
1313 // 1. Let O be ToObject(this value). in Keys()
1332 // 1. Let O be ToObject(this value). in LastIndexOf()
1341 // 3. Let len be ToLength(Get(O, "length")). in LastIndexOf()
1351 // 6. If argument fromIndex was passed let n be ToInteger(fromIndex); else let n be len-1. in LastIndexOf()
1361 // 8. If n ≥ 0, let k be min(n, len – 1). in LastIndexOf()
1363 // a. Let k be len - abs(n). in LastIndexOf()
1373 // a. Let kPresent be HasProperty(O, ToString(k)). in LastIndexOf()
1376 // i. Let elementK be Get(O, ToString(k)). in LastIndexOf()
1378 …// iii. Let same be the result of performing Strict Equality Comparison searchElement === elem… in LastIndexOf()
1408 // 1. Let O be ToObject(this value). in Map()
1415 // 3. Let len be ToLength(Get(O, "length")). in Map()
1426 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Map()
1429 // 7. Let A be ArraySpeciesCreate(O, len). in Map()
1439 // 9. Let k be 0. in Map()
1441 // a. Let Pk be ToString(k). in Map()
1442 // b. Let kPresent be HasProperty(O, Pk). in Map()
1445 // i. Let kValue be Get(O, Pk). in Map()
1447 // iii. Let mappedValue be Call(callbackfn, T, «kValue, k, O»). in Map()
1449 // v. Let status be CreateDataPropertyOrThrow (A, Pk, mappedValue). in Map()
1493 // 1. Let O be ToObject(this value). in Pop()
1503 // 3. Let len be ToLength(Get(O, "length")). in Pop()
1508 // a. Let setStatus be Set(O, "length", 0, true). in Pop()
1520 // a. Let newLen be len–1. in Pop()
1521 // b. Let indx be ToString(newLen). in Pop()
1522 // c. Let element be Get(O, indx). in Pop()
1524 // e. Let deleteStatus be DeletePropertyOrThrow(O, indx). in Pop()
1526 // g. Let setStatus be Set(O, "length", newLen, true). in Pop()
1552 // 6. Let argCount be the number of elements in items. in Push()
1555 // 1. Let O be ToObject(this value). in Push()
1561 // 3. Let len be ToLength(Get(O, "length")). in Push()
1571 // a. Remove the first element from items and let E be the value of the element. in Push()
1572 // b. Let setStatus be Set(O, ToString(len), E, true). in Push()
1574 // d. Let len be len+1. in Push()
1586 // 9. Let setStatus be Set(O, "length", len, true). in Push()
1607 // 1. Let O be ToObject(this value). in Reduce()
1614 // 3. Let len be ToLength(Get(O, "length")). in Reduce()
1630 // 7. Let k be 0. in Reduce()
1634 // a. Let kPresent be false. in Reduce()
1636 // i. Let Pk be ToString(k). in Reduce()
1637 // ii. Let kPresent be HasProperty(O, Pk). in Reduce()
1640 // 1. Let accumulator be Get(O, Pk). in Reduce()
1660 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in Reduce()
1665 // a. Let Pk be ToString(k). in Reduce()
1666 // b. Let kPresent be HasProperty(O, Pk). in Reduce()
1669 // i. Let kValue be Get(O, Pk). in Reduce()
1671 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in Reduce()
1713 // 1. Let O be ToObject(this value). in ReduceRight()
1720 // 3. Let len be ToLength(Get(O, "length")). in ReduceRight()
1736 // 7. Let k be len-1. in ReduceRight()
1741 // a. Let kPresent be false. in ReduceRight()
1743 // i. Let Pk be ToString(k). in ReduceRight()
1744 // ii. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1747 // 1. Let accumulator be Get(O, Pk). in ReduceRight()
1766 …THROW_TYPE_ERROR_AND_RETURN(thread, "accumulator can't be initialized.", JSTaggedValue::Exception(… in ReduceRight()
1771 // a. Let Pk be ToString(k). in ReduceRight()
1772 // b. Let kPresent be HasProperty(O, Pk). in ReduceRight()
1775 // i. Let kValue be Get(O, Pk). in ReduceRight()
1777 // iii. Let accumulator be Call(callbackfn, undefined, «accumulator, kValue, k, O»). in ReduceRight()
1816 // 1. Let O be ToObject(this value). in Reverse()
1823 // 3. Let len be ToLength(Get(O, "length")). in Reverse()
1828 // 5. Let middle be floor(len/2). in Reverse()
1831 // 6. Let lower be 0. in Reverse()
1835 // a. Let upper be len-lower-1. in Reverse()
1836 // b. Let upperP be ToString(upper). in Reverse()
1837 // c. Let lowerP be ToString(lower). in Reverse()
1838 // d. Let lowerExists be HasProperty(O, lowerP). in Reverse()
1841 // i. Let lowerValue be Get(O, lowerP). in Reverse()
1843 // g. Let upperExists be HasProperty(O, upperP). in Reverse()
1846 // i. Let upperValue be Get(O, upperP). in Reverse()
1849 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1851 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1854 // i. Let setStatus be Set(O, lowerP, upperValue, true). in Reverse()
1856 // iii. Let deleteStatus be DeletePropertyOrThrow (O, upperP). in Reverse()
1859 // i. Let deleteStatus be DeletePropertyOrThrow (O, lowerP). in Reverse()
1861 // iii. Let setStatus be Set(O, upperP, lowerValue, true). in Reverse()
1921 // 1. Let O be ToObject(this value). in Shift()
1931 // 3. Let len be ToLength(Get(O, "length")). in Shift()
1936 // a. Let setStatus be Set(O, "length", 0, true). in Shift()
1947 // 6. Let first be Get(O, "0"). in Shift()
1953 // 8. Let k be 1. in Shift()
1955 // a. Let from be ToString(k). in Shift()
1956 // b. Let to be ToString(k–1). in Shift()
1957 // c. Let fromPresent be HasProperty(O, from). in Shift()
1960 // i. Let fromVal be Get(O, from). in Shift()
1962 // iii. Let setStatus be Set(O, to, fromVal, true). in Shift()
1965 // i. Let deleteStatus be DeletePropertyOrThrow(O, to). in Shift()
1985 // 10. Let deleteStatus be DeletePropertyOrThrow(O, ToString(len–1)). in Shift()
1991 // 12. Let setStatus be Set(O, "length", len–1, true). in Shift()
2009 // 1. Let O be ToObject(this value). in Slice()
2016 // 3. Let len be ToLength(Get(O, "length")). in Slice()
2026 // 5. Let relativeStart be ToInteger(start). in Slice()
2033 …// 7. If relativeStart < 0, let k be max((len + relativeStart),0); else let k be min(relativeStart… in Slice()
2042 // 8. If end is undefined, let relativeEnd be len; else let relativeEnd be ToInteger(end). in Slice()
2044 …// 10. If relativeEnd < 0, let final be max((len + relativeEnd),0); else let final be min(relative… in Slice()
2065 // 11. Let count be max(final – k, 0). in Slice()
2090 // 12. Let A be ArraySpeciesCreate(O, count). in Slice()
2100 // 14. Let n be 0. in Slice()
2102 // a. Let Pk be ToString(k). in Slice()
2103 // b. Let kPresent be HasProperty(O, Pk). in Slice()
2106 // i. Let kValue be Get(O, Pk). in Slice()
2108 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(n), kValue ). in Slice()
2130 // 16. Let setStatus be Set(A, "length", n, true). in Slice()
2149 // 1. Let O be ToObject(this value). in Some()
2156 // 3. Let len be ToLength(Get(O, "length")). in Some()
2167 // 6. If thisArg was supplied, let T be thisArg; else let T be undefined. in Some()
2170 // 7. Let k be 0. in Some()
2172 // a. Let Pk be ToString(k). in Some()
2173 // b. Let kPresent be HasProperty(O, Pk). in Some()
2176 // i. Let kValue be Get(O, Pk). in Some()
2178 // iii. Let testResult be ToBoolean(Call(callbackfn, T, «kValue, k, and O»)). in Some()
2219 // 1. Let obj be ToObject(this value). in Sort()
2229 // 2. Let len be ToLength(Get(obj, "length")). in Sort()
2284 // 1. Let O be ToObject(this value). in Splice()
2290 // 3. Let len be ToLength(Get(O, "length")). in Splice()
2294 // 5. Let relativeStart be ToInteger(start). in Splice()
2306 …// 7. If relativeStart < 0, let actualStart be max((len + relativeStart),0); else let actualStart … in Splice()
2317 // a. Let insertCount be 0. in Splice()
2318 // b. Let actualDeleteCount be 0. in Splice()
2320 // a. Let insertCount be 0. in Splice()
2321 // b. Let actualDeleteCount be len – actualStart. in Splice()
2323 // a. Let insertCount be the number of actual arguments minus 2. in Splice()
2324 // b. Let dc be ToInteger(deleteCount). in Splice()
2326 // d. Let actualDeleteCount be min(max(dc,0), len – actualStart). in Splice()
2344 // 12. Let A be ArraySpeciesCreate(O, actualDeleteCount). in Splice()
2349 // 14. Let k be 0. in Splice()
2351 // a. Let from be ToString(actualStart+k). in Splice()
2352 // b. Let fromPresent be HasProperty(O, from). in Splice()
2354 // i. Let fromValue be Get(O, from). in Splice()
2355 // iii. Let status be CreateDataPropertyOrThrow(A, ToString(k), fromValue). in Splice()
2377 // 16. Let setStatus be Set(A, "length", actualDeleteCount, true). in Splice()
2383 // 19. Let itemCount be the number of elements in items. in Splice()
2385 // a. Let k be actualStart. in Splice()
2387 // i. Let from be ToString(k+actualDeleteCount). in Splice()
2388 // ii. Let to be ToString(k+itemCount). in Splice()
2389 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2391 // 1. Let fromValue be Get(O, from). in Splice()
2392 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2394 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2396 // c. Let k be len. in Splice()
2398 // i. Let deleteStatus be DeletePropertyOrThrow(O, ToString(k–1)). in Splice()
2428 // a. Let k be (len – actualDeleteCount). in Splice()
2430 // i. Let from be ToString(k + actualDeleteCount – 1). in Splice()
2431 // ii. Let to be ToString(k + itemCount – 1) in Splice()
2432 // iii. Let fromPresent be HasProperty(O, from). in Splice()
2435 // 1. Let fromValue be Get(O, from). in Splice()
2437 // 3. Let setStatus be Set(O, to, fromValue, true). in Splice()
2440 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Splice()
2461 // 22. Let k be actualStart. in Splice()
2472 // 24. Let setStatus be Set(O, "length", len – actualDeleteCount + itemCount, true). in Splice()
2492 // 1. Let O be ToObject(this value). in ToLocaleString()
2499 // 3. Let len be ToLength(Get(O, "length")). in ToLocaleString()
2504 …// 5. Let separator be the String value for the list-separator String appropriate for the host env… in ToLocaleString()
2525 // 7. Let firstElement be Get(array, "0"). in ToLocaleString()
2528 // a. Let R be the empty String. in ToLocaleString()
2530 // a. Let R be ToString(Invoke(firstElement, "toLocaleString")). in ToLocaleString()
2532 // 11. Let k be 1. in ToLocaleString()
2534 // a. Let S be a String value produced by concatenating R and separator. in ToLocaleString()
2535 // b. Let nextElement be Get(array, ToString(k)). in ToLocaleString()
2538 // i. Let R be the empty String. in ToLocaleString()
2540 // i. Let R be ToString(Invoke(nextElement, "toLocaleString")). in ToLocaleString()
2542 // f. Let R be a String value produced by concatenating S and R. in ToLocaleString()
2586 // 1. Let array be ToObject(this value). in ToString()
2593 // 3. Let func be Get(array, "join"). in ToString()
2600 …// 5. If IsCallable(func) is false, let func be the intrinsic function %ObjProto_toString% (19.1.3… in ToString()
2625 // 5. Let argCount be the number of actual arguments. in Unshift()
2628 // 1. Let O be ToObject(this value). in Unshift()
2635 // 3. Let len be ToLength(Get(O, "length")). in Unshift()
2642 // b. Let k be len. in Unshift()
2644 // i. Let from be ToString(k–1). in Unshift()
2645 // ii. Let to be ToString(k+argCount –1). in Unshift()
2646 // iii. Let fromPresent be HasProperty(O, from). in Unshift()
2649 // 1. Let fromValue be Get(O, from). in Unshift()
2651 // 3. Let setStatus be Set(O, to, fromValue, true). in Unshift()
2654 // 1. Let deleteStatus be DeletePropertyOrThrow(O, to). in Unshift()
2680 // d. Let j be 0. in Unshift()
2681 …// e. Let items be a List whose elements are, in left to right order, the arguments that were pa… in Unshift()
2684 // i. Remove the first element from items and let E be the value of that element. in Unshift()
2685 // ii. Let setStatus be Set(O, ToString(j), E, true). in Unshift()
2698 // 7. Let setStatus be Set(O, "length", len+argCount, true). in Unshift()
2718 // 1. Let O be ToObject(this value). in Values()
2778 // 1. Let O be ? ToObject(this value). in Flat()
2786 // 2. Let sourceLen be ? LengthOfArrayLike(O). in Flat()
2790 // 3. Let depthNum be 1. in Flat()
2804 // 5. Let A be ? ArraySpeciesCreate(O, 0). in Flat()
2828 // 1. Let O be ? ToObject(this value). in FlatMap()
2834 // 2. Let sourceLen be ? LengthOfArrayLike(O). in FlatMap()
2843 // 4. Let A be ? ArraySpeciesCreate(O, 0). in FlatMap()
2865 // 1. Let O be ? ToObject(this value). in Includes()
2874 // 2. Let len be ? LengthOfArrayLike(O). in Includes()
2881 // 4. Let n be ? ToIntegerOrInfinity(fromIndex). in Includes()
2899 // a. Let k be n. in Includes()
2901 // a. Let k be len + n. in Includes()
2902 // b. If k < 0, let k be 0. in Includes()
2906 // a. Let elementK be ? Get(O, ! ToString(!(k))). in Includes()