Lines Matching defs:hash
74 if (string.hash() != key->hash()) return false;
88 // The elements themselves are stored as an open-addressed hash table, with
140 uint32_t hash) const;
143 uint32_t hash) const;
148 uint32_t hash) const;
168 inline static InternalIndex FirstProbe(uint32_t hash, uint32_t size) {
169 return InternalIndex(hash & (size - 1));
241 uint32_t hash = string.hash();
243 new_data->FindInsertionEntry(cage_base, hash);
255 uint32_t hash) const {
257 // EnsureCapacity will guarantee the hash table is never full.
258 for (InternalIndex entry = FirstProbe(hash, capacity_);;
271 uint32_t hash) const {
273 // EnsureCapacity will guarantee the hash table is never full.
274 for (InternalIndex entry = FirstProbe(hash, capacity_);;
286 IsolateT* isolate, StringTableKey* key, uint32_t hash) const {
289 // EnsureCapacity will guarantee the hash table is never full.
290 for (InternalIndex entry = FirstProbe(hash, capacity_);;
448 // because the characters are immutable and the same hash will be
449 // computed. The hash field is set with relaxed memory order. A thread that
450 // doesn't see the hash may do redundant work but will not be incorrect.
522 InternalIndex entry = current_data->FindEntry(isolate, key, key->hash());
539 entry = data->FindEntryOrInsertionEntry(isolate, key, key->hash());
673 InternalIndex entry = string_table_data->FindEntry(isolate, &key, key.hash());