#include <ace/Hash_Map_Manager.h>
template<class EXT_ID, class INT_ID, class ACE_LOCK> class ACE_Hash_Map_Iterator_Base {
public:ACE_Hash_Map_Iterator_Base ( ACE_Hash_Map_Manager <EXT_ID, INT_ID, ACE_LOCK> &mm, int head );int next (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&next_entry);int done (void) const;ACE_Hash_Map_Entry<EXT_ID, INT_ID>& operator* (void);ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_LOCK>& map (void);int operator== ( const ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> & ) const;int operator!= ( const ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> & ) const;ACE_ALLOC_HOOK_DECLARE;protected:int forward_i (void);int reverse_i (void);void dump_i (void) const;ACE_Hash_Map_Manager <EXT_ID, INT_ID, ACE_LOCK> *map_man_;ssize_t index_;ACE_Hash_Map_Entry<EXT_ID, INT_ID> *next_;};
ACE_Hash_Map_Iterator_Base (
ACE_Hash_Map_Manager <EXT_ID, INT_ID, ACE_LOCK> &mm,
int head
);
int next (ACE_Hash_Map_Entry<EXT_ID, INT_ID> *&next_entry);
entry that hasn't been seen in the Set.
Returns 0 when all items have been seen, else 1.
int done (void) const;
ACE_Hash_Map_Entry<EXT_ID, INT_ID>& operator* (void);
this is pointing
to.
ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_LOCK>& map (void);
int operator== (
const ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> &
) const;
int operator!= (
const ACE_Hash_Map_Iterator_Base<EXT_ID, INT_ID, ACE_LOCK> &
) const;
ACE_ALLOC_HOOK_DECLARE;