Lines Matching defs:hash
35 * HASHSET is hash table managing pointers to a set of keys
38 * Unlike the libc `hsearch' based hash table, this implementation
45 * the actual key data only through the hash and equal functions given
81 * - HASHSET is a hash table of pointers to keys
86 * - the function hash(key) is used to compute hash values for keys; if
87 * keys are "equal" the values returned by the hash function must be
92 h_create(uint_t (*hash) (const void *),
119 h->h_hash = hash;
135 uint_t hash = h->h_hash(key);
136 uint_t i = hash % h->h_tableSize;
140 if (e->e_hash == hash && h->h_equal(e->e_key, key))
189 uint_t hash = h->h_hash(key);
190 uint_t indx = hash % h->h_tableSize;
194 if (e->e_hash == hash && h->h_equal(e->e_key, key))
200 indx = hash % h->h_tableSize;
204 e->e_hash = hash;
225 uint_t hash = h->h_hash(key);
226 uint_t indx = hash % h->h_tableSize;
230 if (e->e_hash == hash && h->h_equal(e->e_key, key)) {