Lines Matching defs:elements
57 #include "src/objects/elements.h"
3447 // any elements cannot be deleted.
3466 // Steps 19d-v, 21. Return false if there were non-deletable elements.
4039 // Check that GC didn't remove elements from the array.
4055 // Check that GC didn't remove elements from the array.
4072 // Check that GC didn't remove elements from the array.
4136 // Reload length; GC might have removed elements from the array.
4153 // Reload length; GC might have removed elements from the array.
4366 // Allocation might have caused GC and turned some of the elements into
4491 // Extract elements and create sorted array.
5243 uint32_t capacity = static_cast<uint32_t>(elements().length());
5746 // Rehash the elements.
5806 // All elements at entries given by one of the first _probe_ probes
5807 // are placed correctly. Other elements might need to be moved.
5885 // 50% is still free after adding number_of_additional_elements elements and
5886 // at most 50% of the free elements are deleted elements.
5899 // Shrink to fit the number of elements if only a quarter of the
5900 // capacity is filled with elements.
5905 // Don't go lower than room for {kMinShrinkCapacity} elements.
6167 // If the dictionary requires slow elements an element has already
6171 // elements.
6200 void NumberDictionary::CopyValuesTo(FixedArray elements) {
6204 WriteBarrierMode mode = elements.GetWriteBarrierMode(no_gc);
6208 elements.set(pos++, this->ValueAt(i), mode);
6211 DCHECK_EQ(pos, elements.length());
6246 // fewer entries than the count of elements claimed by the dictionary.
6516 // Zap the old table since we didn't record slots for its elements.
6533 // Zap the old table since we didn't record slots for its elements.
6550 // Recompute max_values because GC could have removed elements from the table.