Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members   Related Pages  

ACE_Unbounded_Set_Const_Iterator Class Template Reference

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

#include <Unbounded_Set.h>

Collaboration diagram for ACE_Unbounded_Set_Const_Iterator:

Collaboration graph
[legend]
List of all members.

Public Methods

 ACE_Unbounded_Set_Const_Iterator (const ACE_Unbounded_Set<T> &s, int end = 0)
int 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.

int 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 first (void)
 Move to the first element in the set. Returns 0 if the set is empty, else 1.

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_Const_Iterator<
T> 
operator++ (int)
 Postfix advance.

ACE_Unbounded_Set_Const_Iterator<
T>& 
operator++ (void)
 Prefix advance.

T& operator * (void)
 Returns a reference to the internal element <this> is pointing to.

int operator== (const ACE_Unbounded_Set_Const_Iterator<T> &) const
 Check if two iterators point to the same position.

int operator!= (const ACE_Unbounded_Set_Const_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.

const ACE_Unbounded_Set<T>* set_
 Pointer to the set we're iterating over.


Detailed Description

template<class T> template class ACE_Unbounded_Set_Const_Iterator

Implement an const iterator over an unbounded set.


Constructor & Destructor Documentation

template<classT>
ACE_Unbounded_Set_Const_Iterator< T >::ACE_Unbounded_Set_Const_Iterator<T> ( const ACE_Unbounded_Set< T >& s,
int end = 0 )
 


Member Function Documentation

template<classT>
int ACE_Unbounded_Set_Const_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<classT>
int ACE_Unbounded_Set_Const_Iterator<T>::done ( void ) const
 

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

template<classT>
void ACE_Unbounded_Set_Const_Iterator<T>::dump ( void ) const
 

Dump the state of an object.

template<classT>
int ACE_Unbounded_Set_Const_Iterator<T>::first ( void )
 

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

template<classT>
int ACE_Unbounded_Set_Const_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<classT>
T & ACE_Unbounded_Set_Const_Iterator<T>::operator * ( void )
 

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

template<classT>
int ACE_Unbounded_Set_Const_Iterator<T>::operator!= ( const ACE_Unbounded_Set_Const_Iterator< T >& ) const
 

template<classT>
ACE_Unbounded_Set_Const_Iterator< T >& ACE_Unbounded_Set_Const_Iterator<T>::operator++ ( void )
 

Prefix advance.

template<classT>
ACE_Unbounded_Set_Const_Iterator< T > ACE_Unbounded_Set_Const_Iterator<T>::operator++ ( int )
 

Postfix advance.

template<classT>
int ACE_Unbounded_Set_Const_Iterator<T>::operator== ( const ACE_Unbounded_Set_Const_Iterator< T >& ) const
 

Check if two iterators point to the same position.


Member Data Documentation

template<classT>
ACE_Unbounded_Set_Const_Iterator<T>::ACE_ALLOC_HOOK_DECLARE
 

Declare the dynamic allocation hooks.

template<classT>
ACE_Node< T >* ACE_Unbounded_Set_Const_Iterator<T>::current_ [private]
 

Pointer to the current node in the iteration.

template<classT>
const ACE_Unbounded_Set< T >* ACE_Unbounded_Set_Const_Iterator<T>::set_ [private]
 

Pointer to the set we're iterating over.


The documentation for this class was generated from the following files:
Generated at Wed Nov 21 10:34:37 2001 for ACE by doxygen1.2.3 written by Dimitri van Heesch, © 1997-2000