Lines Matching refs:index
538 // that take an entry (instead of an index) as an argument.
543 size_t index) override = 0;
603 bool HasElement(JSObject holder, uint32_t index, FixedArrayBase backing_store,
605 return Subclass::HasElementImpl(holder.GetIsolate(), holder, index,
609 static bool HasElementImpl(Isolate* isolate, JSObject holder, size_t index,
612 return Subclass::GetEntryForIndexImpl(isolate, holder, backing_store, index,
667 Maybe<bool> Add(Handle<JSObject> object, uint32_t index, Handle<Object> value,
669 return Subclass::AddImpl(object, index, value, attributes, new_capacity);
672 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
943 Maybe<bool> GrowCapacity(Handle<JSObject> object, uint32_t index) final {
947 object->WouldConvertToSlowElements(index)) {
952 uint32_t new_capacity = JSObject::NewElementsCapacity(index + 1);
1074 uint32_t index;
1075 if (!key->ToUint32(&index)) continue;
1079 isolate, *object, object->elements(), index, filter);
1088 LookupIterator it(isolate, object, index, LookupIterator::OWN);
1092 if (get_entries) value = MakeEntryPair(isolate, index, value);
1100 uint32_t index;
1101 if (!key->ToUint32(&index)) continue;
1108 isolate, *object, object->elements(), index);
1115 LookupIterator it(isolate, object, index, LookupIterator::OWN);
1119 if (get_entries) value = MakeEntryPair(isolate, index, value);
1339 size_t index,
1346 index < length,
1347 index <= static_cast<size_t>(std::numeric_limits<int>::max()));
1348 return index < length &&
1350 .is_the_hole(isolate, static_cast<int>(index))
1351 ? InternalIndex(index)
1354 return index < length ? InternalIndex(index) : InternalIndex::NotFound();
1360 size_t index) final {
1361 return Subclass::GetEntryForIndexImpl(isolate, holder, backing_store, index,
1428 Object index = dict->KeyAt(isolate, entry);
1429 if (dict->IsKey(roots, index)) {
1430 uint32_t number = static_cast<uint32_t>(index.Number());
1446 Object index = dict->KeyAt(isolate, entry);
1447 if (dict->IsKey(roots, index)) {
1448 uint32_t number = static_cast<uint32_t>(index.Number());
1533 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
1545 object->GetIsolate(), dictionary, index, value, details);
1546 new_dictionary->UpdateMaxNumberKey(index, object);
1557 Object index = dict.KeyAt(isolate, entry);
1558 return !index.IsTheHole(isolate);
1562 FixedArrayBase store, size_t index,
1566 DCHECK_LE(index, std::numeric_limits<uint32_t>::max());
1568 dictionary.FindEntry(isolate, static_cast<uint32_t>(index));
1654 Handle<Object> index = isolate->factory()->NewNumberFromUint(key);
1655 list->set(insertion_index, *index);
1697 uint32_t index;
1698 if (!k.ToArrayIndex(&index) || index < start_from || index >= length) {
2039 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
2061 Subclass::SetImpl(object, InternalIndex(index), *value);
2230 for (size_t index = start; index < end; ++index) {
2231 Subclass::SetImpl(receiver, InternalIndex(index), *obj_value);
2567 for (uint32_t index = 0; index < length; ++index) {
2568 InternalIndex entry(index);
2571 value = MakeEntryPair(isolate, index, value);
2579 for (uint32_t index = 0; index < length; ++index) {
2580 InternalIndex entry(index);
2653 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
2751 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
2864 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
2980 for (uint32_t index = 0; index < length; ++index) {
2981 InternalIndex entry(index);
2985 value = MakeEntryPair(isolate, index, value);
3221 static bool HasElementImpl(Isolate* isolate, JSObject holder, size_t index,
3224 return index < AccessorClass::GetCapacityImpl(holder, backing_store);
3247 size_t index,
3249 return index < AccessorClass::GetCapacityImpl(holder, backing_store)
3250 ? InternalIndex(index)
3286 for (size_t index = 0; index < length; ++index) {
3288 AccessorClass::GetInternalImpl(object, InternalIndex(index));
3290 value = MakeEntryPair(isolate, index, value);
3851 // 3. If IsValidIntegerIndex(O, index) is true, then
3854 // c. Let indexedPosition be (ℝ(index) × elementSize) + offset.
4464 for (uint32_t index = 0; index < length; index++) {
4465 if (HasParameterMapArg(isolate, elements, index)) nof_elements++;
4477 for (uint32_t index = 0; index < length; index++) {
4478 InternalIndex entry(index);
4508 size_t index,
4512 if (HasParameterMapArg(isolate, elements, index)) {
4513 return InternalIndex(index);
4517 isolate, holder, arguments, index, filter);
4539 size_t index) {
4541 if (index >= length) return false;
4542 return !elements.mapped_entries(static_cast<uint32_t>(index), kRelaxedLoad)
4731 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
4747 NumberDictionary::Add(isolate, dictionary, index, value, details);
4849 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
4864 // For fast holey objects, the entry equals the index. The code above made
4866 // index to entry explicitly since the slot still contains the hole, so the
4869 FastHoleyObjectElementsAccessor::SetImpl(arguments, InternalIndex(index),
4967 size_t index,
4970 if (index < length) return InternalIndex(index);
4973 isolate, holder, backing_store, index, filter);
4996 static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
5000 DCHECK(index >= static_cast<uint32_t>(GetString(*object).length()));
5010 BackingStoreAccessor::AddImpl(object, index, value, attributes,