Lines Matching defs:key
375 // 1. Let key be ToPrimitive(argument, hint String).
378 // 2. ReturnIfAbrupt(key).
379 Handle<Object> key;
380 if (!maybe_key.ToHandle(&key)) return key;
381 // 3. If Type(key) is Symbol, then return key.
382 if (key->IsSymbol()) return key;
383 // 4. Return ToString(key).
385 if (key->IsSmi()) return key;
386 if (key->IsHeapNumber()) {
393 return Object::ToString(isolate, key);
1123 Handle<Name> key = isolate->factory()->length_string();
1125 isolate, val, JSReceiver::GetProperty(isolate, object, key), Object);
1216 PropertyKey key(isolate, name);
1217 LookupIterator it(isolate, receiver, key, target);
2985 Handle<Name> key(Name::cast(entry->name()), isolate);
2986 DCHECK(key->IsUniqueName());
2988 if (!T::Contains(key, entry, valid_descriptors, array)) {
2989 T::Insert(key, entry, valid_descriptors, array);
2999 static bool Contains(Handle<Name> key, Handle<AccessorInfo> entry,
3002 if (*key == AccessorInfo::cast(array->get(i)).name()) return true;
3006 static void Insert(Handle<Name> key, Handle<AccessorInfo> entry,
3150 PropertyKey key(isolate, name);
3151 LookupIterator it(isolate, receiver, key, target);
3481 Handle<Object> key,
3485 if (key->IsSymbol() && Handle<Symbol>::cast(key)->IsPrivate()) {
3486 DCHECK(!Handle<Symbol>::cast(key)->IsPrivateName());
3487 return JSProxy::SetPrivateSymbol(isolate, proxy, Handle<Symbol>::cast(key),
3492 DCHECK(key->IsName() || key->IsNumber());
3513 return JSReceiver::DefineOwnProperty(isolate, target, key, desc,
3521 key->IsName()
3522 ? Handle<Name>::cast(key)
3523 : Handle<Name>::cast(isolate->factory()->NumberToString(key));
3541 JSReceiver::GetOwnPropertyDescriptor(isolate, target, key, &target_desc);
3890 Name key = source.GetKey(i);
3893 if (!key.IsPrivate()) {
3905 copy.Set(i, key, value_or_field_type, details);
3936 Name key = src.GetKey(i);
3940 DCHECK(!key.IsPrivateName());
3963 descriptors.Set(i, key, type, new_details);
5432 Handle<Symbol> key = isolate->factory()->promise_debug_message_symbol();
5433 Object::SetProperty(isolate, promise, key, message, StoreOrigin::kMaybeKeyed,
5994 Isolate* isolate, Handle<RegisteredSymbolTable> table, Handle<String> key,
5996 // Validate that the key is absent.
5997 SLOW_DCHECK(table->FindEntry(isolate, key).is_not_found());
6000 uint32_t hash = ShapeT::Hash(ReadOnlyRoots(isolate), key);
6002 table->set(EntryToIndex(entry), *key);
6010 Handle<Object> key) {
6011 int32_t hash = key->GetOrCreateHash(isolate).value();
6012 if (!set->Has(isolate, key, hash)) {
6015 set->set(EntryToIndex(entry), *key);
6080 Key key, Handle<Object> value,
6082 InternalIndex entry = dictionary->FindEntry(isolate, key);
6086 return Derived::Add(isolate, dictionary, key, value, details);
6099 IsolateT* isolate, Handle<Derived> dictionary, Key key,
6102 return Dictionary<Derived, Shape>::Add(isolate, dictionary, key, value,
6108 Isolate* isolate, Handle<Derived> dictionary, Key key, Handle<Object> value,
6116 dictionary = AddNoUpdateNextEnumerationIndex(isolate, dictionary, key, value,
6128 Key key, Handle<Object> value,
6132 uint32_t hash = Shape::Hash(roots, key);
6133 // Validate that the key is absent.
6134 SLOW_DCHECK(dictionary->FindEntry(isolate, key).is_not_found());
6138 // Compute the key object.
6139 Handle<Object> k = Shape::AsHandle(isolate, key);
6159 Isolate* isolate, Handle<SimpleNumberDictionary> dictionary, uint32_t key,
6161 return AtPut(isolate, dictionary, key, value, PropertyDetails::Empty());
6164 void NumberDictionary::UpdateMaxNumberKey(uint32_t key,
6172 if (key > kRequiresSlowElementsLimit) {
6179 // Update max key value.
6181 if (!max_index_object.IsSmi() || max_number_key() < key) {
6183 Smi::FromInt(key << kRequiresSlowElementsTagSize));
6188 Isolate* isolate, Handle<NumberDictionary> dictionary, uint32_t key,
6195 AtPut(isolate, dictionary, key, value, details);
6196 new_dictionary->UpdateMaxNumberKey(key, dictionary_holder);
6287 Handle<Object> key,
6291 DCHECK(this->IsKey(roots, *key));
6293 InternalIndex entry = this->FindEntry(cage_base, roots, key, hash);
6300 int NameToIndexHashTable::Lookup(Handle<Name> key) {
6305 InternalIndex entry = this->FindEntry(cage_base, roots, key, key->hash());
6311 Object ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key) {
6316 DCHECK(this->IsKey(roots, *key));
6318 // If the object does not have an identity hash, it was never used as a key.
6319 Object hash = key->GetHash();
6323 return Lookup(cage_base, key, Smi::ToInt(hash));
6327 Object ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key,
6329 return Lookup(GetPtrComprCageBase(*this), key, hash);
6357 Handle<Object> key,
6360 DCHECK(table->IsKey(ReadOnlyRoots(isolate), *key));
6363 // Make sure the key object has an identity hash code.
6364 int32_t hash = key->GetOrCreateHash(isolate).value();
6366 return ObjectHashTableBase<Derived, Shape>::Put(isolate, table, key, value,
6373 Handle<Object> key,
6377 DCHECK(table->IsKey(roots, *key));
6380 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6409 table->AddEntry(table->FindInsertionEntry(isolate, hash), *key, *value);
6415 Isolate* isolate, Handle<Derived> table, Handle<Object> key,
6417 DCHECK(table->IsKey(table->GetReadOnlyRoots(), *key));
6419 Object hash = key->GetHash();
6425 return Remove(isolate, table, key, was_present, Smi::ToInt(hash));
6430 Isolate* isolate, Handle<Derived> table, Handle<Object> key,
6433 DCHECK(table->IsKey(roots, *key));
6435 InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
6448 Object key, Object value) {
6450 self->set_key(Derived::EntryToIndex(entry), key);
6505 Handle<Object> key, Handle<Object> value,
6507 DCHECK(key->IsJSReceiver() || key->IsSymbol());
6511 DCHECK(table->IsKey(weak_collection->GetReadOnlyRoots(), *key));
6513 weak_collection->GetIsolate(), table, key, value, hash);
6522 Handle<Object> key, int32_t hash) {
6523 DCHECK(key->IsJSReceiver() || key->IsSymbol());
6527 DCHECK(table->IsKey(weak_collection->GetReadOnlyRoots(), *key));
6530 weak_collection->GetIsolate(), table, key, &was_present, hash);
6561 Object key;
6562 if (table->ToKey(roots, InternalIndex(i), &key)) {
6563 entries->set(count++, key);
6565 Object value = table->Lookup(handle(key, isolate));
6964 uint32_t key = Smi::ToInt(unregister_token.GetHash());
6965 InternalIndex entry = key_map.FindEntry(isolate, key);
6969 // weak_cell is the only one associated with its key; remove the key
6974 // weak_cell is the list head for its key; we need to change the value
6975 // of the key in the hash table.
6982 // weak_cell is somewhere in the middle of its key list.