Lines Matching refs:hash
4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
14 * alternative to traditional hash tables. In Proceedings of the 7th
18 * This implementation uses precisely two hash functions because that is the
77 ckh->hash(key, hashes);
160 ckh->hash(key, hashes);
202 ckh->hash(key, hashes);
221 * Try to rebuild the hash table from scratch by inserting all items from the
355 ckh_new(tsd_t *tsd, ckh_t *ckh, size_t minitems, ckh_hash_t *hash,
363 assert(hash != NULL);
391 ckh->hash = hash;
540 hash(key, strlen((const char *)key), 0x94122f33U, r_hash);
562 hash(&u.i, sizeof(u.i), 0xd983396eU, r_hash);