Lines Matching defs:hash
154 uint32_t hash = name.hash();
156 // We probe the hash table in groups of |kGroupWidth| buckets. One bucket
174 auto seq = probe(hash, Capacity());
181 for (int i : g.Match(swiss_table::H2(hash))) {
387 inline int SwissNameDictionary::FindFirstEmpty(uint32_t hash) {
390 auto seq = probe(hash, Capacity());
483 // present + deleted entries in the hash table (= maximum load factor *
539 uint32_t hash = key.hash();
544 int target = FindFirstEmpty(hash);
546 SetCtrl(target, swiss_table::H2(hash));
657 void SwissNameDictionary::SetHash(int32_t hash) {
658 WriteField(PrefixOffset(), hash);
745 SwissNameDictionary::probe(uint32_t hash, int capacity) {
750 swiss_table::H1(hash), static_cast<uint32_t>(non_zero_capacity - 1));