Lines Matching defs:key

126                                                   Derived table, Object key) {
130 InternalIndex entry = table.FindEntry(isolate, key);
136 Object key) {
146 if (key.IsSmi()) {
147 uint32_t hash = ComputeUnseededHash(Smi::ToInt(key));
151 Object hash = key.GetHash();
152 // If the object does not have an identity hash, it was never used as a key
157 // Walk the chain in the bucket to find the key.
160 if (candidate_key.SameValueZero(key)) return InternalIndex(raw_entry);
169 Handle<Object> key) {
170 int hash = key->GetOrCreateHash(isolate).value();
173 // Walk the chain of the bucket and try finding the key.
176 // Do not add if we have the key already
177 if (candidate_key.SameValueZero(*key)) return table;
194 table->set(new_index, *key);
214 Object key = table->get(index);
217 if (key.ToArrayIndex(&index_value)) {
220 key = *isolate->factory()->Uint32ToString(index_value, use_cache);
222 CHECK(key.IsName());
225 DCHECK(!key.ToArrayIndex(&index_value));
227 result->set(i, key);
270 Object key = table->KeyAt(old_entry);
271 if (key.IsTheHole(isolate)) {
276 Object hash = key.GetHash();
337 Derived table, Object key) {
339 InternalIndex entry = table.FindEntry(isolate, key);
359 Object key(raw_key);
360 Object hash = key.GetHash();
361 // If the object does not have an identity hash, it was never used as a key
370 Handle<Object> key,
372 int hash = key->GetOrCreateHash(isolate).value();
375 // Walk the chain of the bucket and try finding the key.
378 Object raw_key = *key;
381 // Do not add if we have the key already
400 table->set(new_index, *key);
409 void OrderedHashMap::SetEntry(InternalIndex entry, Object key, Object value) {
412 this->set(index, key);
417 InternalIndex OrderedNameDictionary::FindEntry(IsolateT* isolate, Object key) {
420 DCHECK(key.IsUniqueName());
421 Name raw_key = Name::cast(key);
448 IsolateT* isolate, Handle<OrderedNameDictionary> table, Handle<Name> key,
450 DCHECK(key->IsUniqueName());
451 DCHECK(table->FindEntry(isolate, *key).is_not_found());
459 int hash = key->hash();
466 table->set(new_index, *key);
481 void OrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
484 DCHECK_IMPLIES(!key.IsName(), key.IsTheHole());
487 this->set(index, key);
578 Isolate* isolate, OrderedHashSet table, Object key);
581 Isolate* isolate, OrderedHashSet table, Object key);
584 OrderedHashTable<OrderedHashSet, 1>::FindEntry(Isolate* isolate, Object key);
602 Isolate* isolate, OrderedHashMap table, Object key);
605 Isolate* isolate, OrderedHashMap table, Object key);
608 OrderedHashTable<OrderedHashMap, 2>::FindEntry(Isolate* isolate, Object key);
632 OrderedNameDictionary::FindEntry(Isolate* isolate, Object key);
635 OrderedNameDictionary::FindEntry(LocalIsolate* isolate, Object key);
640 Handle<Name> key, Handle<Object> value,
646 Handle<Name> key, Handle<Object> value,
710 Isolate* isolate, Handle<SmallOrderedHashSet> table, Handle<Object> key) {
711 if (table->HasKey(isolate, key)) return table;
721 int hash = key->GetOrCreateHash(isolate).value();
731 table->SetDataEntry(new_entry, SmallOrderedHashSet::kKeyIndex, *key);
742 Object key) {
744 key);
747 bool SmallOrderedHashSet::HasKey(Isolate* isolate, Handle<Object> key) {
748 return SmallOrderedHashTable<SmallOrderedHashSet>::HasKey(isolate, key);
752 Isolate* isolate, Handle<SmallOrderedHashMap> table, Handle<Object> key,
754 if (table->HasKey(isolate, key)) return table;
764 int hash = key->GetOrCreateHash(isolate).value();
775 table->SetDataEntry(new_entry, SmallOrderedHashMap::kKeyIndex, *key);
786 Object key) {
788 key);
791 bool SmallOrderedHashMap::HasKey(Isolate* isolate, Handle<Object> key) {
792 return SmallOrderedHashTable<SmallOrderedHashMap>::HasKey(isolate, key);
798 Object key) {
800 DCHECK(key.IsUniqueName());
801 Name raw_key = Name::cast(key);
805 // Walk the chain in the bucket to find the key.
809 if (candidate_key == key) return entry;
818 Handle<Name> key, Handle<Object> value, PropertyDetails details) {
819 DCHECK(key->IsUniqueName());
820 DCHECK(table->FindEntry(isolate, *key).is_not_found());
833 int hash = key->hash();
842 table->SetDataEntry(new_entry, SmallOrderedNameDictionary::kKeyIndex, *key);
858 void SmallOrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
862 DCHECK_IMPLIES(!key.IsName(), key.IsTheHole());
864 SetDataEntry(raw_entry, SmallOrderedNameDictionary::kKeyIndex, key);
874 Handle<Object> key) {
876 return FindEntry(isolate, *key).is_found();
881 Object key) {
883 InternalIndex entry = table.FindEntry(isolate, key);
933 Object key = table->KeyAt(old_entry);
934 if (key.IsTheHole(isolate)) continue;
936 int hash = Smi::ToInt(key.GetHash());
1016 Object key) {
1018 Object hash = key.GetHash();
1023 // Walk the chain in the bucket to find the key.
1027 if (candidate_key.SameValueZero(key)) return entry;
1035 Handle<Object> key);
1051 Object key);
1054 SmallOrderedHashMap>::HasKey(Isolate* isolate, Handle<Object> key);
1071 Object key);
1104 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key) {
1106 return SmallTable::Delete(isolate, *Handle<SmallTable>::cast(table), *key);
1112 return LargeTable::Delete(isolate, *Handle<LargeTable>::cast(table), *key);
1117 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key) {
1119 return Handle<SmallTable>::cast(table)->HasKey(isolate, key);
1123 return LargeTable::HasKey(isolate, LargeTable::cast(*table), *key);
1128 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key);
1131 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key);
1135 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key);
1138 Isolate* isolate, Handle<HeapObject> table, Handle<Object> key);
1143 Handle<Object> key);
1158 Handle<Object> key = handle(table->KeyAt(entry), isolate);
1159 if (key->IsTheHole(isolate)) continue;
1163 new_table_candidate = OrderedHashMap::Add(isolate, new_table, key, value);
1185 Handle<Object> key = handle(table->KeyAt(entry), isolate);
1186 if (key->IsTheHole(isolate)) continue;
1187 new_table_candidate = OrderedHashSet::Add(isolate, new_table, key);
1210 Handle<Name> key(Name::cast(table->KeyAt(entry)), isolate);
1211 if (key->IsTheHole(isolate)) continue;
1215 OrderedNameDictionary::Add(isolate, new_table, key, value, details);
1226 Handle<Object> key,
1232 SmallOrderedHashMap::Add(isolate, small_map, key, value);
1245 return OrderedHashMap::Add(isolate, Handle<OrderedHashMap>::cast(table), key,
1251 Handle<Object> key) {
1256 SmallOrderedHashSet::Add(isolate, small_set, key);
1269 return OrderedHashSet::Add(isolate, Handle<OrderedHashSet>::cast(table), key);
1273 Isolate* isolate, Handle<HeapObject> table, Handle<Name> key,
1279 SmallOrderedNameDictionary::Add(isolate, small_dict, key, value,
1294 isolate, Handle<OrderedNameDictionary>::cast(table), key, value, details);
1298 InternalIndex entry, Object key,
1303 return SmallOrderedNameDictionary::cast(table).SetEntry(entry, key, value,
1308 return OrderedNameDictionary::cast(table).SetEntry(InternalIndex(entry), key,
1314 Name key) {
1317 return SmallOrderedNameDictionary::cast(table).FindEntry(isolate, key);
1321 return OrderedNameDictionary::cast(table).FindEntry(isolate, key);