apr/include/apr_hash.h

43  *         is not included in the hash value (why throw a constant in?).
44  *         Since the hash table merely references the provided key (rather
50  * Abstract type for hash tables.
55  * Abstract type for scanning hash tables.
60  * Callback functions for calculating hash values.
68  * The default hash function.
74  * Create a hash table.
75  * @param pool The pool to allocate the hash table out of
76  * @return The hash table just created
81  * Create a hash table with a custom hash function
82  * @param pool The pool to allocate the hash table out of
83  * @param hash_func A custom hash function.
84  * @return The hash table just created
90  * Make a copy of a hash table
91  * @param pool The pool from which to allocate the new hash table
92  * @param h The hash table to clone
93  * @return The hash table just created
100  * Associate a value with a key in a hash table.
101  * @param ht The hash table
105  * @remark If the value is NULL the hash entry is deleted. The key is stored as is,
106  *         and so must have a lifetime at least as long as the hash table's pool.
112  * Look up the value associated with a key in a hash table.
113  * @param ht The hash table
122  * Start iterating over the entries in a hash table.
125  * @param ht The hash table
127  * @remark  There is no restriction on adding or deleting hash entries during
151  * Continue iterating over the entries in a hash table.
192  * Get the number of key/value pairs in the hash table.
193  * @param ht The hash table
194  * @return The number of key/value pairs in the hash table.
199  * Clear any key/value pairs in the hash table.
200  * @param ht The hash table
205  * Merge two hash tables into one new hash table. The values of the overlay
206  * hash override the values of the base if both have the same key.  Both
207  * hash tables must use the same hash function.
208  * @param p The pool to use for the new hash table
211  * @return A new hash table containing all of the data from the two passed in
218  * Merge two hash tables into one new hash table. If the same key
221  * hash tables must use the same hash function.
222  * @param p The pool to use for the new hash table
229  * @return A new hash table containing all of the data from the two passed in
246  * @param key The key from this iteration of the hash table
247  * @param klen The key length from this iteration of the hash table
248  * @param value The value from this iteration of the hash table
258  * Iterate over a hash table running the provided function once for every
259  * element in the hash table. The @param comp function will be invoked for
260  * every element in the hash table.
264  * @param ht The hash table to iterate over
273  * Get a pointer to the pool which the hash table was created in
275 APR_POOL_DECLARE_ACCESSOR(hash);