Lines Matching full:hash
0 /* hash - hashing table processing.
22 /* A generic hash table package. */
31 #include "hash.h"
86 /* A hash table contains many internal entries, each holding a pointer to
91 and the current table size. At each slot position in the hash table,
92 starts a linked chain of entries for which the user data all hash to this
100 larger hash table size (that is, a larger number of buckets) is prone to
103 Long buckets slow down the lookup algorithm. One might use big hash table
105 become inordinate, as unused slots in the hash table take some space. The
141 /* The following few functions provide information about the overall hash
145 /* Return the number of buckets in the hash table. The table size, the total
197 /* Do a mild validation of a hash table, by traversing it and checking two
246 /* If ENTRY matches an entry already in the hash table, return the
271 /* The functions in this page traverse the hash table and process the
272 contained entries. For the traversal to work properly, the hash table
321 /* Fill BUFFER with pointers to active user entries in the hash table, then
349 /* Call a PROCESSOR function for each entry of a hash table, and return the
383 /* Return a hash index for a NUL-terminated STRING between 0 and N_BUCKETS-1.
390 Software--practice & experience 20, 2 (Feb 1990), 209-224. Good hash
477 /* For the given hash TABLE, check the user supplied tuning structure for
480 in the hash table (that is, the user loses the right of further modifying
508 /* Allocate and return a new hash table, or NULL upon failure. The initial
511 the hash table size occurs. So, if have a reasonably tight a-priori upper
512 bound on the number of entries you intend to insert in the hash table, you
529 on entries which are already known to hash to the same bucket index.
642 /* Reclaim all storage associated with a hash table. If a data_freer
643 function has been supplied by the user when the hash table was created,
694 /* Free the remainder of the hash table structure. */
701 /* Get a new hash entry for a bucket overflow, possibly by reclying a
726 /* Free a hash entry which was part of some bucket overflow,
810 /* For an already existing hash table, change the number of buckets through
811 specifying CANDIDATE. The contents of the hash table are preserved. The
814 those already in the table, before any other growth of the hash table size
903 /* If ENTRY matches an entry already in the hash table, return the pointer
