Lines Matching defs:hash
119 * Graph structure. Vertices are maintained in a hash indexed by dataset name.
252 * parameter so in the future we can size the hash according to the number of
277 * Destroy a graph object. We have to iterate over all the hash chains,
300 * Graph hash function. Classic bernstein k=33 hash function, taken from
306 size_t hash = 5381;
310 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
312 return (hash % zgp->zg_size);