Lines Matching full:hash
26 * \brief Implementation of a generic, opaque hash table data type.
53 * Hash table constructor
55 * Creates a hash table with the specified number of buckets. The supplied
56 * \c hash and \c compare routines are used when adding elements to the table
59 * \param num_buckets Number of buckets (bins) in the hash table.
60 * \param hash Function used to compute hash value of input keys.
64 hash_func_t hash, hash_compare_func_t compare);
68 * Release all memory associated with a hash table
77 * Flush all entries from a hash table
85 * Search a hash table for a specific element
99 * Add an element to a hash table
102 * If \c key is already in the hash table, it will be added again. Future
107 * The value passed by \c key is kept in the hash table and is used by later
116 * Add an element to a hash table with replacement
123 * If \c key is already in the hash table, \c data will \b replace the most
133 * Remove a specific element from a hash table.
138 * Compute hash value of a string
140 * Computes the hash value of a string using the DJB2 algorithm developed by
162 * Compute hash value of a pointer
164 * \param key Pointer to be used as a hash key
168 * itself is used as the hash key
255 /* The low-level hash table structure returns NULL if key is not in the
256 * hash table. However, users of this map might want to store zero as a
