Lines Matching defs:element
384 // Extending spec'ed behavior, we'd be happy to return an element index.
1099 // 7c. If Type(next) is not an element of elementTypes, throw a
1106 // 7d. Append next as the last element of list.
1791 // For FastHoley kinds, an element access on a hole would cause a lookup on
4270 // Optimize for the most recently added element to be removed again.
4276 // Move the last element into the this slot (or no-op, if this is the
4370 MaybeObject element = array->Get(i);
4372 if (element->GetHeapObjectIfWeak(&value)) {
4374 new_array->Set(copy_to++, element);
4376 DCHECK(element->IsCleared() || element->IsSmi());
4486 // Now element at child_index could be < its children.
4493 // Put max element at the back of the array.
4495 // Shift down the new top element.
4676 Object element = fixed_array.get(i);
4677 const bool element_is_separator_sequence = element.IsSmi();
4679 // If element is a Smi, it represents the number of separators to write.
4681 CHECK(element.ToUint32(&num_separators));
4713 DCHECK(element.IsString());
4714 String string = String::cast(element);
4721 // Next string element, needs at least one separator preceding it.
5824 // Put the current element into the correct position.
5826 // The other element will be processed on the next iteration,
5829 // The place for the current element is occupied. Leave the element
5963 Object element = KeyAt(cage_base, entry, kRelaxedLoad);
5964 if (isolate->heap()->IsPendingAllocation(element)) return {};
5965 if (element == undefined) return {};
5966 if (ShapeT::kMatchNeedsHoleCheck && element == the_hole) continue;
5967 if (!ShapeT::IsMatch(name, element)) continue;
5968 CHECK(element.IsPropertyCell(cage_base));
5969 return PropertyCell::cast(element);
6101 // Insert element at empty or deleted entry.
6110 // Insert element at empty or deleted entry
6167 // If the dictionary requires slow elements an element has already