Lines Matching defs:hash
4 * Implementation of in-memory hash tables for Tcl and Tcl-based
29 * the hash table to make it larger.
35 * The following macro takes a preliminary integer hash value and
36 * produces an index into a hash tables bucket list. The idea is
38 * will end up in different buckets. The hash function was taken
46 * Prototypes for the array hash key methods.
59 * Prototypes for the one word hash key methods.
74 * Prototypes for the string hash key methods.
133 * Given storage for a hash table, set up the fields to prepare
134 * the hash table for use.
170 * Given storage for a hash table, set up the fields to prepare
171 * the hash table for use. This is an extended version of
216 * The caller has been rebuilt so the hash table is an extended
221 * The caller is requesting a customized hash table so it must be
227 * The caller has not been rebuilt so the hash table is not
250 * the hash table is not an extended version.
264 * Given a hash table find the entry with a matching key.
268 * hash table, or NULL if there was no matching entry.
283 unsigned int hash;
306 hash = typePtr->hashKeyProc (tablePtr, (VOID *) key);
308 index = RANDOM_INDEX (tablePtr, hash);
310 index = hash & tablePtr->mask;
313 hash = (unsigned int) key;
314 index = RANDOM_INDEX (tablePtr, hash);
326 if (hash != (unsigned int) hPtr->hash) {
338 if (hash != (unsigned int) hPtr->hash) {
357 * Given a hash table with string keys, and a string key, find
368 * A new entry may be added to the hash table.
383 unsigned int hash;
406 hash = typePtr->hashKeyProc (tablePtr, (VOID *) key);
408 index = RANDOM_INDEX (tablePtr, hash);
410 index = hash & tablePtr->mask;
413 hash = (unsigned int) key;
414 index = RANDOM_INDEX (tablePtr, hash);
426 if (hash != (unsigned int) hPtr->hash) {
439 if (hash != (unsigned int) hPtr->hash) {
465 hPtr->hash = (VOID *) hash;
467 hPtr->hash = hash;
496 * Remove a single entry from a hash table.
542 index = RANDOM_INDEX (tablePtr, entryPtr->hash);
544 index = ((unsigned int) entryPtr->hash) & tablePtr->mask;
580 * Free up everything associated with a hash table except for
587 * The hash table is no longer useable.
659 * Locate the first entry in a hash table and set up a record
694 * Once a hash table enumeration has been initiated by calling
699 * The return value is the next entry in the hash table being
737 * Return statistics describing the layout of the hash table
738 * in its hash buckets.
824 VOID *keyPtr; /* Key to store in the hash table entry. */
893 * used to generate a hash index.
908 VOID *keyPtr; /* Key from which to compute hash value. */
941 VOID *keyPtr; /* Key to store in the hash table entry. */
1000 * used to generate a hash index.
1015 VOID *keyPtr; /* Key from which to compute hash value. */
1022 * I tried a zillion different hash functions and asked many other
1032 * hash value for ever, plus they spread fairly rapidly up to
1033 * the high-order bits to fill out the hash value. This seems
1118 * This procedure is invoked when the ratio of entries to hash
1191 index = RANDOM_INDEX (tablePtr, hPtr->hash);
1193 index = ((unsigned int) hPtr->hash) & tablePtr->mask;
1199 unsigned int hash;
1200 hash = typePtr->hashKeyProc (tablePtr, (VOID *) key);
1202 index = RANDOM_INDEX (tablePtr, hash);
1204 index = hash & tablePtr->mask;