ACE_Unbounded_List_Iterator< T > Class Template Reference

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 ()
int	first ()
int	done () const
	Returns 1 when all items have been seen, else 0.
void	dump () const
	Dump the state of an object.
ACE_Unbounded_List_Iterator< T >	operator++ (int)
	Postfix advance.
ACE_Unbounded_List_Iterator< T > &	operator++ ()
	Prefix advance.
T &	operator* ()
	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.

Detailed Description

template<class T>
class ACE_Unbounded_List_Iterator< T >

Implement an iterator over an unbounded List.

Constructor & Destructor Documentation

ACE_Unbounded_List_Iterator()

template<class T >

ACE_Unbounded_List_Iterator< T >::ACE_Unbounded_List_Iterator	(	ACE_Unbounded_List< T > &	s,
		int	end = 0 )

Member Function Documentation

advance()

template<class T >

int ACE_Unbounded_List_Iterator< T >::advance

(

)

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

done()

template<class T >

int ACE_Unbounded_List_Iterator< T >::done

(

)

const

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

dump()

template<class T >

void ACE_Unbounded_List_Iterator< T >::dump

(

)

const

Dump the state of an object.

first()

template<class T >

int ACE_Unbounded_List_Iterator< T >::first

(

)

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

next()

template<class T >

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.

operator!=()

template<class T >

bool ACE_Unbounded_List_Iterator< T >::operator!=

(

const ACE_Unbounded_List_Iterator< T > &

rhs

)

const

operator*()

template<class T >

T & ACE_Unbounded_List_Iterator< T >::operator*

(

)

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

operator++() [1/2]

template<class T >

ACE_Unbounded_List_Iterator< T > & ACE_Unbounded_List_Iterator< T >::operator++

(

)

Prefix advance.

operator++() [2/2]

template<class T >

ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List_Iterator< T >::operator++

(

int

)

Postfix advance.

operator==()

template<class T >

bool ACE_Unbounded_List_Iterator< T >::operator==

(

const ACE_Unbounded_List_Iterator< T > &

rhs

)

const

Check if two iterators point to the same position.

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class T >

ACE_Unbounded_List_Iterator< T >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

current_

template<class T >

ACE_NS_Node<T>* ACE_Unbounded_List_Iterator< T >::current_

private

Pointer to the current node in the iteration.

set_

template<class T >

ACE_Unbounded_List<T>* ACE_Unbounded_List_Iterator< T >::set_

private

Pointer to the set we're iterating over.

---

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

• Naming_Service_Container.h
• Naming_Service_Container.cpp