Implement an iterator over an unbounded List. More...

#include <Naming_Service_Container.h>

Collaboration diagram for ACE_Unbounded_List_Iterator:

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. More...

void	dump (void) const
	Dump the state of an object. More...

ACE_Unbounded_List_Iterator< T >	operator++ (int)
	Postfix advance. More...

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

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

bool	operator== (const ACE_Unbounded_List_Iterator< T > &) const
	Check if two iterators point to the same position. More...

bool	operator!= (const ACE_Unbounded_List_Iterator< T > &) const

Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks. More...

Private Attributes
ACE_NS_Node< T > *	current_
	Pointer to the current node in the iteration. More...

ACE_Unbounded_List< T > *	set_
	Pointer to the set we're iterating over. More...

Detailed Description

Implement an iterator over an unbounded List.

Constructor & Destructor Documentation

◆ ACE_Unbounded_List_Iterator()

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

Member Function Documentation

◆ advance()

int ACE_Unbounded_List_Iterator::advance ( void )

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

◆ done()

int ACE_Unbounded_List_Iterator::done ( void ) const

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

◆ dump()

void ACE_Unbounded_List_Iterator::dump ( void ) const

Dump the state of an object.

◆ first()

int ACE_Unbounded_List_Iterator::first ( void )

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

◆ next()

int ACE_Unbounded_List_Iterator::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!=()

bool ACE_Unbounded_List_Iterator::operator!= ( const ACE_Unbounded_List_Iterator< T > & rhs ) const

◆ operator*()

T & ACE_Unbounded_List_Iterator::operator* ( void )

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

◆ operator++() [1/2]

ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List_Iterator::operator++ ( int )

Postfix advance.

◆ operator++() [2/2]

ACE_Unbounded_List_Iterator< T > & ACE_Unbounded_List_Iterator::operator++ ( void )

Prefix advance.

◆ operator==()

bool ACE_Unbounded_List_Iterator::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

ACE_Unbounded_List_Iterator::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

◆ current_

ACE_NS_Node<T>* ACE_Unbounded_List_Iterator::current_

private

Pointer to the current node in the iteration.

◆ set_

ACE_Unbounded_List<T>* ACE_Unbounded_List_Iterator::set_