ACE
6.1.6
|
Implement a bidirectional iterator over an ordered multiset. This class template requires that < operator semantics be defined for the parameterized type {T}, but does not impose any restriction on how that ordering operator is implemented. More...
#include <Containers_T.h>
Public Member Functions | |
ACE_Ordered_MultiSet_Iterator (ACE_Ordered_MultiSet< T > &s) | |
int | next (T *&next_item) const |
int | first (void) |
int | last (void) |
int | advance (void) |
int | retreat (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. | |
T & | operator* (void) |
Returns a reference to the internal element {this} is pointing to. |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. |
Private Attributes | |
ACE_DNode< T > * | current_ |
Pointer to the current node in the iteration. | |
ACE_Ordered_MultiSet< T > & | set_ |
Pointer to the set we're iterating over. |
Friends | |
class | ACE_Ordered_MultiSet< T > |
Implement a bidirectional iterator over an ordered multiset. This class template requires that < operator semantics be defined for the parameterized type {T}, but does not impose any restriction on how that ordering operator is implemented.
ACE_Ordered_MultiSet_Iterator< T >::ACE_Ordered_MultiSet_Iterator | ( | ACE_Ordered_MultiSet< T > & | s | ) |
|
inline |
Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
|
inline |
Returns 1 when all items have been seen, else 0.
|
inline |
Dump the state of an object.
|
inline |
Repositions the iterator at the first item in the ordered multiset Returns 0 if the list is empty else 1.
|
inline |
Repositions the iterator at the last item in the ordered multiset Returns 0 if the list is empty else 1.
int ACE_Ordered_MultiSet_Iterator< T >::next | ( | T *& | next_item | ) | const |
Pass back the {next_item} that hasn't been seen in the ordered multiset. Returns 0 when all items have been seen, else 1.
T & ACE_Ordered_MultiSet_Iterator< T >::operator* | ( | void | ) |
Returns a reference to the internal element {this} is pointing to.
|
inline |
Move backward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.
|
friend |
ACE_Ordered_MultiSet_Iterator< T >::ACE_ALLOC_HOOK_DECLARE |
Declare the dynamic allocation hooks.
|
private |
Pointer to the current node in the iteration.
|
private |
Pointer to the set we're iterating over.