Inheritance diagram for w_hash_i< T, LOCK, K >:
w_hash_t<entry_t,key_t>(16, W_HASH_ARG(entry_t,hashkey,hashlink)) hashtable; w_hash_i<entry_t,key_t> iter(hashtable); entry_t *entry = NULL; while( ( entry = iter.next()) != NULL) { ... }
Since the w_hash_t is built of w_list_t, the same comments go for next() and curr() here. You can remove items from the table in an iteration but you cannot insert.
Definition at line 213 of file w_hash.h.
Public Member Functions | |
NORET | w_hash_i (const w_hash_t< T, LOCK, K > &t) |
NORET | ~w_hash_i () |
T * | next () |
T * | curr () |