Lines Matching full:hash
81 // Professor Daniel J. Bernstein's hash function. See
86 uint32_t hash = 5381;
90 hash = ((hash << 5) + hash) + *key;
92 return hash;
98 // Hash the key to get the table position
110 // Create a new hash entry and fill in the values
127 // Hash the key to get the table position
152 // Hash the key to get the table position
186 // If we already iterated part way through the hash table, then continue
