Lines Matching defs:hash
64 // How many slots does the table contain? (Note that unlike an array, hash tables can grow
81 // Copy val into the hash table, returning a pointer to the copy now in the table.
92 uint32_t hash = Hash(key);
93 int index = hash & (fCapacity-1);
99 if (hash == s.hash && key == Traits::GetKey(*s)) {
117 // Remove the value with this key from the hash table.
121 uint32_t hash = Hash(key);
122 int index = hash & (fCapacity-1);
126 if (hash == s.hash && key == Traits::GetKey(*s)) {
239 uint32_t hash = Hash(key);
240 int index = hash & (fCapacity-1);
245 s.emplace(std::move(val), hash);
249 if (hash == s.hash && key == Traits::GetKey(*s)) {
252 s.emplace(std::move(val), hash);
302 originalIndex = s.hash & (fCapacity - 1);
319 uint32_t hash = Traits::Hash(key) & 0xffffffff;
320 return hash ? hash : 1; // We reserve hash 0 to mark empty.
332 if (hash) {
333 if (that.hash) {
335 hash = that.hash;
340 if (that.hash) {
342 hash = that.hash;
355 if (hash) {
356 if (that.hash) {
358 hash = that.hash;
363 if (that.hash) {
365 hash = that.hash;
381 hash = h;
385 bool has_value() const { return hash != 0; }
390 if (hash) {
392 hash = 0;
396 uint32_t hash = 0;