#include <Containers_T.h>
Inheritance diagram for ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >:
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. |
This implementation of an unordered set uses a fixed array.
Definition at line 1296 of file Containers_T.h.
|
Definition at line 1189 of file Containers_T.cpp. References ACE_TRACE.
01190 : ACE_Fixed_Set_Iterator_Base<T, ACE_SIZE> (s) 01191 { 01192 ACE_TRACE ("ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>::ACE_Fixed_Set_Const_Iterator"); 01193 } |
|
Dump the state of an object.
Definition at line 1181 of file Containers_T.cpp. References ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::dump_i().
01182 { 01183 #if defined (ACE_HAS_DUMP) 01184 this->dump_i (); 01185 #endif /* ACE_HAS_DUMP */ 01186 } |
|
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 1196 of file Containers_T.cpp. References ACE_TRACE, and ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::next_i().
|
|
STL-like iterator dereference operator: returns a reference to the node underneath the iterator. Definition at line 1204 of file Containers_T.cpp. References ACE_ASSERT.
01205 { 01206 const T *retv = 0; 01207 01208 if (this->s_.search_structure_[this->next_].is_free_ == 0) 01209 retv = &this->s_.search_structure_[this->next_].item_; 01210 01211 ACE_ASSERT (retv != 0); 01212 01213 return *retv; 01214 } |
|
Declare the dynamic allocation hooks.
Reimplemented from ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >. Definition at line 1316 of file Containers_T.h. |