# ACE_Unbounded_Set_Iterator< T > Class Template Reference

Implement an iterator over an unbounded set. More...

`#include <Unbounded_Set.h>`

List of all members.

## Public Member Functions

| ACE_Unbounded_Set_Iterator (ACE_Unbounded_Set< 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_Set_Iterator< T > | operator++ (int)
| Postfix advance.
ACE_Unbounded_Set_Iterator< T > & | operator++ (void)
| Prefix advance.
T & | operator * (void)
| Returns a reference to the internal element <this> is pointing to.
bool | operator== (const ACE_Unbounded_Set_Iterator< T > &) const
| Check if two iterators point to the same position.
bool | operator!= (const ACE_Unbounded_Set_Iterator< T > &) const

## Public Attributes

| ACE_ALLOC_HOOK_DECLARE
| Declare the dynamic allocation hooks.

## Private Attributes

ACE_Node< T > * | current_
| Pointer to the current node in the iteration.
ACE_Unbounded_Set< T > * | set_
| Pointer to the set we're iterating over.

## Detailed Description

### template<class T>
class ACE_Unbounded_Set_Iterator< T >

Implement an iterator over an unbounded set.

## Constructor & Destructor Documentation

template<class T>
ACE_Unbounded_Set_Iterator< T >::ACE_Unbounded_Set_Iterator | ( | ACE_Unbounded_Set< T > & | s,
|  | int | end = `0`
| ) |

## Member Function Documentation

template<class T>
int ACE_Unbounded_Set_Iterator< T >::advance | ( | void |  | ) |

| Move forward by one element in the set. Returns 0 when all the items in the set have been seen, else 1.

template<class T>
int ACE_Unbounded_Set_Iterator< T >::done | ( | void |  | ) | const

| Returns 1 when all items have been seen, else 0.

template<class T>
void ACE_Unbounded_Set_Iterator< T >::dump | ( | void |  | ) | const

| Dump the state of an object.

template<class T>
int ACE_Unbounded_Set_Iterator< T >::first | ( | void |  | ) |

| Move to the first element in the set. Returns 0 if the set is empty, else 1.

template<class T>
int ACE_Unbounded_Set_Iterator< T >::next | ( | 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.

template<class T>
T & ACE_Unbounded_Set_Iterator< T >::operator * | ( | void |  | ) |

| Returns a reference to the internal element <this> is pointing to.

template<class T>
bool ACE_Unbounded_Set_Iterator< T >::operator!= | ( | const ACE_Unbounded_Set_Iterator< T > & |  | ) | const

template<class T>
ACE_Unbounded_Set_Iterator< T > & ACE_Unbounded_Set_Iterator< T >::operator++ | ( | void |  | ) |

| Prefix advance.

template<class T>
ACE_Unbounded_Set_Iterator< T > ACE_Unbounded_Set_Iterator< T >::operator++ | ( | int |  | ) |

| Postfix advance.

template<class T>
bool ACE_Unbounded_Set_Iterator< T >::operator== | ( | const ACE_Unbounded_Set_Iterator< T > & |  | ) | const

| Check if two iterators point to the same position.

## Member Data Documentation

template<class T>
ACE_Unbounded_Set_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

| Declare the dynamic allocation hooks.

template<class T>
ACE_Node<T>* ACE_Unbounded_Set_Iterator< T >::current_ `[private]`

| Pointer to the current node in the iteration.

template<class T>
ACE_Unbounded_Set<T>* ACE_Unbounded_Set_Iterator< T >::set_ `[private]`

| Pointer to the set we're iterating over.

The documentation for this class was generated from the following files:

- Unbounded_Set.h
- Unbounded_Set.cpp