w_hash_i< T, LOCK, K > Class Template Reference

Inherits w_base_t.

Inheritance diagram for w_hash_i< T, LOCK, K >:

Inheritance graph
[legend]
Collaboration diagram for w_hash_i< T, LOCK, K >:

Collaboration graph
[legend]
List of all members.

Detailed Description

template<class T, class LOCK, class K>
class w_hash_i< T, LOCK, K >

Iterate over hash table (for debugging).

Note:
Not for general use. Helper for w_hash_t, and useful for writing debugging / dump-table code.
Example:
 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 241 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 ()


The documentation for this class was generated from the following file:
Generated on Wed Jul 7 17:22:43 2010 for Shore Storage Manager by  doxygen 1.4.7