Lines Matching refs:hash
37 ares__htable_hashfunc_t hash;
46 * hash collisions we would have O(log n) worst case insert and search
48 * support sort). That said, risk with a random hash seed is near zero,
60 * doesn't have to be super secure, just quick. Likelihood of a hash
119 htable->hash = hash_func;
168 * the hash of the function reduced to the size of the bucket list.
169 * We are doing "hash & (size - 1)" since we are guaranteeing a power of
170 * 2 for size. This is equivalent to "hash % size", but should be more
172 #define HASH_IDX(h, key) h->hash(key, h->seed) & (h->size - 1)
206 * new hash array. Otherwise if there's a memory allocation failure in the