Lines Matching defs:key
73 bool KeyIsMatch(IsolateT* isolate, StringTableKey* key, String string) {
74 if (string.hash() != key->hash()) return false;
75 if (string.length() != key->length()) return false;
76 return key->IsMatch(isolate, string);
139 InternalIndex FindEntry(IsolateT* isolate, StringTableKey* key,
147 StringTableKey* key,
254 StringTableKey* key,
266 if (KeyIsMatch(isolate, key, string)) return entry;
286 IsolateT* isolate, StringTableKey* key, uint32_t hash) const {
309 if (KeyIsMatch(isolate, key, string)) return entry;
344 // InternalizedStringKey carries a string/internalized-string object as key.
350 // internalized the key, in which case StringTable::LookupKey will perform a
467 InternalizedStringKey key(string);
468 Handle<String> result = LookupKey(isolate, &key);
478 Handle<String> StringTable::LookupKey(IsolateT* isolate, StringTableKey* key) {
522 InternalIndex entry = current_data->FindEntry(isolate, key, key->hash());
531 key->PrepareForInsertion(isolate);
537 // Check one last time if the key is present in the table, in case it was
539 entry = data->FindEntryOrInsertionEntry(isolate, key, key->hash());
545 Handle<String> new_string = key->GetHandleForInsertion();
553 Handle<String> new_string = key->GetHandleForInsertion();
566 OneByteStringKey* key);
568 TwoByteStringKey* key);
570 SeqOneByteSubStringKey* key);
572 SeqTwoByteSubStringKey* key);
575 OneByteStringKey* key);
577 TwoByteStringKey* key);
580 StringTableInsertionKey* key);
582 StringTableInsertionKey* key);
655 SequentialStringKey<Char> key(base::Vector<const Char>(chars, length), seed);
658 uint32_t raw_hash_field = key.raw_hash_field();
673 InternalIndex entry = string_table_data->FindEntry(isolate, &key, key.hash());