Lines Matching full:hashing
1 /* hash - hashing table processing.
89 entry contents may be hashed by a randomization function (the hashing
93 slot. A bucket is the collection of all entries hashing to the same slot.
394 This is a convenience routine for constructing other hashing functions. */
399 B. J. McKenzie, R. Harries & T. Bell, Selecting a hashing algorithm,
423 per a few experiments. It is inspired from a hashing routine found in the
488 /* When hashing unique pointers, it is often the case that they were
575 arguments ENTRY and TABLE_SIZE. It computes, by hashing ENTRY contents, a
1060 entries: if the hashing function is ill-conditioned, rehashing is not
