Lines Matching refs:item
5 * Implementation of hash tables. Each item inserted must include
68 * item -- the item we're inserting
72 * Inserts an item into the hash table. It must not currently be in any
77 void *item)
79 hash_bucket *b = GET_BUCKET(tab, item);
80 unsigned int val = tab->compute_hash(item);
96 * item -- item in hash table
100 * Removes item from hash table
104 void *item)
106 hash_bucket *b = GET_BUCKET(tab, item);
124 * item -- item equal to one we're seeking (in the compare-function sense)
126 * A pointer to the item in the hash table, or NULL if no such item
128 * Searches hash table for item.
132 void *item)
134 unsigned int val = tab->compute_hash(item) % HASHTAB_SIZE;
138 if (!tab->compare(item, item2)) return item2;
147 * item -- an item returned by hash_find or hash_find_next
149 * A pointer to the next equal item in the hash table, or NULL if no such item
151 * Searches hash table for anoter item equivalent to this one. Search
152 * starts from item.
156 void *item)
158 hash_bucket *b = GET_BUCKET(tab, item);
161 if (!tab->compare(item, item2)) return item2;
181 /* Point cursor to NEXT item so it is valid
182 even if current item is free'd */
197 * Next item in table, or NULL.
199 * Steps cursor to next item in table.