|
TAO_CosNaming 2.0.3
|
Implement an iterator over an unbounded List. More...
#include <Naming_Service_Container.h>
Public Member Functions | |
| ACE_Unbounded_List_Iterator (ACE_Unbounded_List< T > &s, int end=0) | |
| 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_List_Iterator< T > | operator++ (int) |
| Postfix advance. | |
| ACE_Unbounded_List_Iterator< T > & | operator++ (void) |
| Prefix advance. | |
| T & | operator* (void) |
| Returns a reference to the interal element <this> is pointing to. | |
| bool | operator== (const ACE_Unbounded_List_Iterator< T > &) const |
| Check if two iterators point to the same position. | |
| bool | operator!= (const ACE_Unbounded_List_Iterator< T > &) const |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Private Attributes | |
| ACE_NS_Node< T > * | current_ |
| Pointer to the current node in the iteration. | |
| ACE_Unbounded_List< T > * | set_ |
| Pointer to the set we're iterating over. | |
Implement an iterator over an unbounded List.
| ACE_Unbounded_List_Iterator< T >::ACE_Unbounded_List_Iterator | ( | ACE_Unbounded_List< T > & | s, |
| int | end = 0 |
||
| ) |
| int ACE_Unbounded_List_Iterator< T >::advance | ( | void | ) |
Move forward by one element in the List. Returns 0 when all the items in the List have been seen, else 1.
| int ACE_Unbounded_List_Iterator< T >::done | ( | void | ) | const |
Returns 1 when all items have been seen, else 0.
| void ACE_Unbounded_List_Iterator< T >::dump | ( | void | ) | const |
Dump the state of an object.
| int ACE_Unbounded_List_Iterator< T >::first | ( | void | ) |
Move to the first element in the List. Returns 0 if the List is empty, else 1.
| int ACE_Unbounded_List_Iterator< T >::next | ( | T *& | next_item | ) |
Pass back the <next_item> that hasn't been seen in the List. Returns 0 when all items have been seen, else 1.
| bool ACE_Unbounded_List_Iterator< T >::operator!= | ( | const ACE_Unbounded_List_Iterator< T > & | rhs | ) | const |
| T & ACE_Unbounded_List_Iterator< T >::operator* | ( | void | ) |
Returns a reference to the interal element <this> is pointing to.
| ACE_Unbounded_List_Iterator< T > & ACE_Unbounded_List_Iterator< T >::operator++ | ( | void | ) |
Prefix advance.
| ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List_Iterator< T >::operator++ | ( | int | ) |
Postfix advance.
| bool ACE_Unbounded_List_Iterator< T >::operator== | ( | const ACE_Unbounded_List_Iterator< T > & | rhs | ) | const |
Check if two iterators point to the same position.
| ACE_Unbounded_List_Iterator< T >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
ACE_NS_Node<T>* ACE_Unbounded_List_Iterator< T >::current_ [private] |
Pointer to the current node in the iteration.
ACE_Unbounded_List<T>* ACE_Unbounded_List_Iterator< T >::set_ [private] |
Pointer to the set we're iterating over.
1.7.4