Lines Matching defs:entry
130 InternalIndex entry = table.FindEntry(isolate, key);
131 return entry.is_found();
191 // Insert a new entry at the end,
196 // and point the bucket to the new entry.
339 InternalIndex entry = table.FindEntry(isolate, key);
340 if (entry.is_not_found()) return false;
344 int index = table.EntryToIndex(entry);
397 // Insert a new entry at the end,
403 // and point the bucket to the new entry.
409 void OrderedHashMap::SetEntry(InternalIndex entry, Object key, Object value) {
411 int index = EntryToIndex(entry);
431 InternalIndex entry(raw_entry);
432 Object candidate_key = KeyAt(entry);
435 if (candidate_key == raw_key) return entry;
463 // Insert a new entry at the end,
475 // and point the bucket to the new entry.
481 void OrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
486 int index = EntryToIndex(entry);
498 InternalIndex entry) {
499 DCHECK(entry.is_found());
503 table->SetEntry(entry, hole, hole, details);
728 // Insert a new entry at the end,
771 // Insert a new entry at the end,
807 InternalIndex entry(raw_entry);
808 Object candidate_key = KeyAt(entry);
809 if (candidate_key == key) return entry;
837 // Insert a new entry at the end,
858 void SmallOrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
861 int raw_entry = entry.as_int();
883 InternalIndex entry = table.FindEntry(isolate, key);
884 if (entry.is_not_found()) return false;
891 table.SetDataEntry(entry.as_int(), j, hole);
902 InternalIndex entry) {
903 DCHECK(entry.is_found());
908 table->SetEntry(entry, hole, hole, details);
1025 InternalIndex entry(raw_entry);
1026 Object candidate_key = KeyAt(entry);
1027 if (candidate_key.SameValueZero(key)) return entry;
1157 for (InternalIndex entry : table->IterateEntries()) {
1158 Handle<Object> key = handle(table->KeyAt(entry), isolate);
1161 table->GetDataEntry(entry.as_int(), SmallOrderedHashMap::kValueIndex),
1184 for (InternalIndex entry : table->IterateEntries()) {
1185 Handle<Object> key = handle(table->KeyAt(entry), isolate);
1209 for (InternalIndex entry : table->IterateEntries()) {
1210 Handle<Name> key(Name::cast(table->KeyAt(entry)), isolate);
1212 Handle<Object> value(table->ValueAt(entry), isolate);
1213 PropertyDetails details = table->DetailsAt(entry);
1298 InternalIndex entry, Object key,
1303 return SmallOrderedNameDictionary::cast(table).SetEntry(entry, key, value,
1308 return OrderedNameDictionary::cast(table).SetEntry(InternalIndex(entry), key,
1325 InternalIndex entry) {
1327 return SmallOrderedNameDictionary::cast(table).ValueAt(entry);
1331 return OrderedNameDictionary::cast(table).ValueAt(entry);
1335 InternalIndex entry,
1338 return SmallOrderedNameDictionary::cast(table).ValueAtPut(entry, value);
1342 OrderedNameDictionary::cast(table).ValueAtPut(entry, value);
1346 InternalIndex entry) {
1348 return SmallOrderedNameDictionary::cast(table).DetailsAt(entry);
1352 return OrderedNameDictionary::cast(table).DetailsAt(entry);
1356 InternalIndex entry,
1359 return SmallOrderedNameDictionary::cast(table).DetailsAtPut(entry, details);
1363 OrderedNameDictionary::cast(table).DetailsAtPut(entry, details);
1385 InternalIndex entry) {
1387 return Name::cast(SmallOrderedNameDictionary::cast(table).KeyAt(entry));
1391 OrderedNameDictionary::cast(table).KeyAt(InternalIndex(entry)));
1424 Isolate* isolate, Handle<HeapObject> table, InternalIndex entry) {
1429 return SmallOrderedNameDictionary::DeleteEntry(isolate, small_dict, entry);
1435 InternalIndex(entry));