Lines Matching refs:hash
30 * Hash table implementation.
32 * This file provides a hash implementation that is capable of dealing
34 * functions operating on the hash return an iterator. The iterator
59 struct cso_hash *hash;
65 void cso_hash_delete(struct cso_hash *hash);
68 int cso_hash_size(struct cso_hash *hash);
72 * Adds a data with the given key to the hash. If entry with the given
73 * key is already in the hash, this current entry is instered before it
75 * Function returns iterator pointing to the inserted item in the hash.
77 struct cso_hash_iter cso_hash_insert(struct cso_hash *hash, unsigned key,
80 * Removes the item pointed to by the current iterator from the hash.
84 * the hash.
86 struct cso_hash_iter cso_hash_erase(struct cso_hash *hash, struct cso_hash_iter iter);
88 void *cso_hash_take(struct cso_hash *hash, unsigned key);
92 struct cso_hash_iter cso_hash_first_node(struct cso_hash *hash);
97 struct cso_hash_iter cso_hash_find(struct cso_hash *hash, unsigned key);
100 * Returns true if a value with the given key exists in the hash
102 boolean cso_hash_contains(struct cso_hash *hash, unsigned key);
119 void *cso_hash_find_data_from_template( struct cso_hash *hash,
