Iterates through a const unordered set. More...
#include <Containers_T.h>
Public Member Functions | |
ACE_Fixed_Set_Const_Iterator (const ACE_Fixed_Set< T, ACE_SIZE > &s) | |
int | next (const T *&next_item) |
void | dump (void) const |
Dump the state of an object. | |
const T & | operator* (void) const |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. |
Iterates through a const unordered set.
This implementation of an unordered set uses a fixed array.
Definition at line 1345 of file Containers_T.h.
ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::ACE_Fixed_Set_Const_Iterator | ( | const ACE_Fixed_Set< T, ACE_SIZE > & | s | ) |
Definition at line 1191 of file Containers_T.cpp.
: ACE_Fixed_Set_Iterator_Base<T, ACE_SIZE> (s) { ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::ACE_Fixed_Set_Const_Iterator"); }
void ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::dump | ( | void | ) | const |
Dump the state of an object.
Definition at line 1183 of file Containers_T.cpp.
{ #if defined (ACE_HAS_DUMP) this->dump_i (); #endif /* ACE_HAS_DUMP */ }
int ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::next | ( | const T *& | next_item | ) |
Pass back the {next_item} that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.
Definition at line 1198 of file Containers_T.cpp.
const T & ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::operator* | ( | void | ) | const |
STL-like iterator dereference operator: returns a reference to the node underneath the iterator.
Definition at line 1206 of file Containers_T.cpp.
{ const T *retv = 0; if (this->s_.search_structure_[this->next_].is_free_ == 0) retv = &this->s_.search_structure_[this->next_].item_; ACE_ASSERT (retv != 0); return *retv; }
ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >.
Definition at line 1365 of file Containers_T.h.