53             THROW_TYPE_ERROR_AND_RETURN(thread, "Not all array elements is configurable", false);  in LengthSetter()
257         if (Elements::IsGeneric(oldKind)) {  in SetCapacity()
267             newKind = Elements::ToElementsKind(val, newKind);  in SetCapacity()
269         // elements length might not be zero when newLen is zero  in SetCapacity()
279                 Elements::MigrateArrayWithKind(thread, array, oldKind, newKind);  in SetCapacity()
341     //      any elements cannot be deleted.  in ArraySetLength()
357     // Steps 19d-v, 21. Return false if there were non-deletable elements.  in ArraySetLength()
404 …ndle<JSArray> JSArray::CreateArrayFromList(JSThread *thread, const JSHandle<TaggedArray> &elements)  in CreateArrayFromList()  argument
406     // Assert: elements is a List whose elements are all ECMAScript language values.  in CreateArrayFromList()
408     uint32_t length = elements->GetLength();  in CreateArrayFromList()
410     // 4. For each element e of elements  in CreateArrayFromList()
418     obj->SetElements(thread, elements);  in CreateArrayFromList()
427                                                const JSHandle<TaggedArray> &elements)  in CreateArrayFromList()  argument
429     // Assert: elements is a List whose elements are all ECMAScript language values.  in CreateArrayFromList()
430     uint32_t length = elements->GetLength();  in CreateArrayFromList()
440     // set elements with initItems  in CreateArrayFromList()
443     obj->SetElements(thread, elements);  in CreateArrayFromList()
497     // 6. Let itemCount be the number of elements in sortedList.  in Sort()
527 void JSArray::SortElements(JSThread *thread, const JSHandle<TaggedArray> &elements, const JSHandle<…  in SortElements()  argument
531     uint32_t len = elements->GetLength();  in SortElements()
532     // 64: if the elements is more than 64, use merge-sort algorithm.  in SortElements()
534         SortElementsByInsertionSort(thread, elements, len, fn);  in SortElements()
536         SortElementsByMergeSort(thread, elements, fn, 0, len - 1);  in SortElements()
540 void JSArray::SortElementsByMergeSort(JSThread *thread, const JSHandle<TaggedArray> &elements,  in SortElementsByMergeSort()  argument
547     SortElementsByMergeSort(thread, elements, fn, startIdx, middleIdx);  in SortElementsByMergeSort()
548     SortElementsByMergeSort(thread, elements, fn, middleIdx + 1, endIdx);  in SortElementsByMergeSort()
549     MergeSortedElements(thread, elements, fn, startIdx, middleIdx, endIdx);  in SortElementsByMergeSort()
552 void JSArray::MergeSortedElements(JSThread *thread, const JSHandle<TaggedArray> &elements,  in MergeSortedElements()  argument
564         leftArray->Set(thread, i, elements->Get(startIdx + i));  in MergeSortedElements()
567         rightArray->Set(thread, j, elements->Get(static_cast<int32_t>(middleIdx + 1 + j)));  in MergeSortedElements()
581             elements->Set(thread, k, leftArray->Get(i));  in MergeSortedElements()
584             elements->Set(thread, k, rightArray->Get(j));  in MergeSortedElements()
591         elements->Set(thread, k, leftArray->Get(i));  in MergeSortedElements()
597         elements->Set(thread, k, rightArray->Get(j));  in MergeSortedElements()
603 void JSArray::SortElementsByInsertionSort(JSThread *thread, const JSHandle<TaggedArray> &elements, …  in SortElementsByInsertionSort()  argument
615         presentValue.Update(elements->Get(i));  in SortElementsByInsertionSort()
618             middleValue.Update(elements->Get(middleIndex));  in SortElementsByInsertionSort()
630                 previousValue.Update(elements->Get(j - 1));  in SortElementsByInsertionSort()
631                 elements->Set(thread, j, previousValue);  in SortElementsByInsertionSort()
633             elements->Set(thread, endIndex, presentValue);  in SortElementsByInsertionSort()
716     // Check whether array is shared in the nonmovable space before set properties and elements.  in CheckAndCopyArray()