|
ACE
6.0.7
|
Implement an const iterator over an unbounded set. More...
#include <Unbounded_Set_Ex.h>

Public Types | |
| typedef ACE_Unbounded_Set_Ex < T, C > | container_type |
| typedef std::forward_iterator_tag | iterator_category |
| typedef container_type::const_value_type | value_type |
| typedef container_type::const_reference | reference |
| typedef container_type::const_pointer | pointer |
| typedef container_type::difference_type | difference_type |
Public Member Functions | |
| ACE_Unbounded_Set_Ex_Const_Iterator (const ACE_Unbounded_Set_Ex< T, C > &s, bool end=false) | |
| int | next (T *&next_item) |
| int | advance (void) |
| int | first (void) |
| int | done (void) const |
| Returns 1 when all items have been seen, else 0. | |
| void | dump (void) const |
| Dump the state of an object. | |
| ACE_Unbounded_Set_Ex_Const_Iterator < T, C > | operator++ (int) |
| Postfix advance. | |
| ACE_Unbounded_Set_Ex_Const_Iterator < T, C > & | operator++ (void) |
| Prefix advance. | |
| T & | operator* (void) |
Returns a reference to the internal element this is pointing to. | |
| bool | operator== (const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &) const |
| Check if two iterators point to the same position. | |
| bool | operator!= (const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &) const |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Private Attributes | |
| ACE_Node< T, C > * | current_ |
| Pointer to the current node in the iteration. | |
| const ACE_Unbounded_Set_Ex< T, C > * | set_ |
| Pointer to the set we're iterating over. | |
Implement an const iterator over an unbounded set.
| typedef std::forward_iterator_tag ACE_Unbounded_Set_Ex_Const_Iterator::iterator_category |
| ACE_Unbounded_Set_Ex_Const_Iterator::ACE_Unbounded_Set_Ex_Const_Iterator | ( | const ACE_Unbounded_Set_Ex< T, C > & | s, |
| bool | end = false |
||
| ) |
| int ACE_Unbounded_Set_Ex_Const_Iterator::advance | ( | void | ) |
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
| int ACE_Unbounded_Set_Ex_Const_Iterator::done | ( | void | ) | const |
Returns 1 when all items have been seen, else 0.
| void ACE_Unbounded_Set_Ex_Const_Iterator::dump | ( | void | ) | const |
Dump the state of an object.
| int ACE_Unbounded_Set_Ex_Const_Iterator::first | ( | void | ) |
Move to the first element in the set. Returns 0 if the set is empty, else 1.
| int ACE_Unbounded_Set_Ex_Const_Iterator::next | ( | T *& | next_item | ) |
Pass back the next_item that hasn't been seen in the Set.
| bool ACE_Unbounded_Set_Ex_Const_Iterator::operator!= | ( | const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > & | rhs | ) | const |
| T & ACE_Unbounded_Set_Ex_Const_Iterator::operator* | ( | void | ) |
Returns a reference to the internal element this is pointing to.
| ACE_Unbounded_Set_Ex_Const_Iterator< T, C > ACE_Unbounded_Set_Ex_Const_Iterator::operator++ | ( | int | ) |
Postfix advance.
| ACE_Unbounded_Set_Ex_Const_Iterator< T, C > & ACE_Unbounded_Set_Ex_Const_Iterator::operator++ | ( | void | ) |
Prefix advance.
| bool ACE_Unbounded_Set_Ex_Const_Iterator::operator== | ( | const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > & | rhs | ) | const |
Check if two iterators point to the same position.
Declare the dynamic allocation hooks.
ACE_Node<T, C>* ACE_Unbounded_Set_Ex_Const_Iterator::current_ [private] |
Pointer to the current node in the iteration.
const ACE_Unbounded_Set_Ex<T, C>* ACE_Unbounded_Set_Ex_Const_Iterator::set_ [private] |
Pointer to the set we're iterating over.
1.7.5