Lines Matching defs:array
13 #include "src/objects/fixed-array.h"
27 #include "torque-generated/src/objects/fixed-array-tq-inl.inc"
78 Handle<Object> FixedArray::get(FixedArray array, int index, Isolate* isolate) {
79 return handle(array.get(isolate, index), isolate);
114 void FixedArray::NoWriteBarrierSet(FixedArray array, int index, Object value) {
115 DCHECK_NE(array.map(), array.GetReadOnlyRoots().fixed_cow_array_map());
117 static_cast<unsigned>(array.length()));
120 RELAXED_WRITE_FIELD(array, offset, value);
249 // Perform a binary search in a fixed array.
251 int BinarySearch(T* array, Name name, int valid_entries,
257 // (i.e the first added item in {array} could be the last in the sorted
260 int high = array->number_of_entries() - 1;
268 Name mid_name = array->GetSortedKey(mid);
279 int sort_index = array->GetSortedKeyIndex(low);
280 Name entry = array->GetKey(InternalIndex(sort_index));
307 // Perform a linear search in this fixed array. len is the number of entry
310 int LinearSearch(T* array, Name name, int valid_entries,
314 int len = array->number_of_entries();
316 int sorted_index = array->GetSortedKeyIndex(number);
317 Name entry = array->GetKey(InternalIndex(sorted_index));
328 DCHECK_LE(valid_entries, array->number_of_entries());
331 if (array->GetKey(InternalIndex(number)) == name) return number;
338 int Search(T* array, Name name, int valid_entries, int* out_insertion_index,
340 SLOW_DCHECK_IMPLIES(!concurrent_search, array->IsSortedNoDuplicates());
353 return LinearSearch<search_mode>(array, name, valid_entries,
357 return BinarySearch<search_mode>(array, name, valid_entries,
378 Handle<Object> FixedDoubleArray::get(FixedDoubleArray array, int index,
380 if (array.is_the_hole(index)) {
383 return isolate->factory()->NewNumber(array.get_scalar(index));
449 Handle<WeakFixedArray> array,
451 if (array->length() < length) {
452 int grow_by = length - array->length();
453 array = isolate->factory()->CopyWeakFixedArrayAndGrow(array, grow_by);
455 return array;