Lines Matching full:hashes

19  * fewest that can work, and supporting multiple hashes is an implementation
25  *   #hashes |   1   |   2   |   4   |   8   |
81 	size_t hashes[2], bucket, cell;
85 	ckh->hash(key, hashes);
88 	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
95 	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
137 	size_t hashes[2], bucket, tbucket;
149 		 * were an item for which both hashes indicated the same
167 		ckh->hash(key, hashes);
168 		tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
170 			tbucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets)
174 			 * item's hashes both indicate this bucket.  However,
186 			 *    has hashes that indicate distinct buckets.
205 	size_t hashes[2], bucket;
209 	ckh->hash(key, hashes);
212 	bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1);
218 	bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1);
266 	 * It is possible (though unlikely, given well behaved hashes) that the
317 	 * It is possible (though unlikely, given well behaved hashes) that the