ACE_Unbounded_Set_Ex_Const_Iterator< T, C > Class Template Reference

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

#include <Unbounded_Set_Ex.h>

List of all members.

Public Member Functions
	ACE_Unbounded_Set_Ex_Const_Iterator (const ACE_Unbounded_Set_Ex< T, C > &s, bool end=false)
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_Ex_Const_Iterator < T, C >	operator++ (int)
	Postfix advance.
ACE_Unbounded_Set_Ex_Const_Iterator < T, C > &	operator++ (void)
	Prefix advance.
T &	operator* (void)
	Returns a reference to the internal element this is pointing to.
bool	operator== (const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &) const
	Check if two iterators point to the same position.
bool	operator!= (const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &) const
Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.
Private Attributes
ACE_Node< T, C > *	current_
	Pointer to the current node in the iteration.
const ACE_Unbounded_Set_Ex< T, C > *	set_
	Pointer to the set we're iterating over.

---

Detailed Description

template<class T, class C>
class ACE_Unbounded_Set_Ex_Const_Iterator< T, C >

Implement an const iterator over an unbounded set.

---

Constructor & Destructor Documentation

template<class T, class C>

ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::ACE_Unbounded_Set_Ex_Const_Iterator	(	const ACE_Unbounded_Set_Ex< T, C > &	s,
		bool	end = false
	)			[inline]

---

Member Function Documentation

template<class T, class C>

int ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::next

(

T *&

next_item

)

[inline]

Pass back the next_item that hasn't been seen in the Set.

Returns:

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

template<class T, class C>

int ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::advance

(

void

)

[inline]

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, class C>

int ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::first

(

void

)

[inline]

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

template<class T, class C>

int ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::done

(

void

)

const [inline]

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

template<class T, class C>

void ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::dump

(

void

)

const [inline]

Dump the state of an object.

template<class T, class C>

ACE_Unbounded_Set_Ex_Const_Iterator< T, C > ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::operator++

(

int

)

[inline]

Postfix advance.

template<class T, class C>

ACE_Unbounded_Set_Ex_Const_Iterator< T, C > & ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::operator++

(

void

)

[inline]

Prefix advance.

template<class T, class C>

T & ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::operator*

(

void

)

[inline]

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

template<class T, class C>

bool ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::operator==

(

const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &

rhs

)

const [inline]

Check if two iterators point to the same position.

template<class T, class C>

bool ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::operator!=

(

const ACE_Unbounded_Set_Ex_Const_Iterator< T, C > &

rhs

)

const [inline]

---

Member Data Documentation

template<class T, class C>

ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

template<class T, class C>

ACE_Node<T, C>* ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::current_ [private]

Pointer to the current node in the iteration.

template<class T, class C>

const ACE_Unbounded_Set_Ex<T, C>* ACE_Unbounded_Set_Ex_Const_Iterator< T, C >::set_ [private]

Pointer to the set we're iterating over.

---

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

• Unbounded_Set_Ex.h
• Unbounded_Set_Ex.cpp