ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE > Class Template Reference

Implements a common base class for iterators for a unordered set. More...

#include <Containers_T.h>

Inheritance diagram for ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >:

Public Member Functions
int	next (T *&next_item)
int	advance ()
int	first ()
int	done () const
	Returns 1 when all items have been seen, else 0.

Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.

Protected Member Functions
	ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set< T, ACE_SIZE > &s)
void	dump_i () const
	Dump the state of an object.
int	next_i (T *&next_item)

Protected Attributes
ACE_Fixed_Set< T, ACE_SIZE > &	s_
	Set we are iterating over.
ssize_t	next_
	How far we've advanced over the set.
size_t	iterated_items_
	The number of non free items that the iterator had pointed at.

Detailed Description

template<class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >

Implements a common base class for iterators for a unordered set.

Constructor & Destructor Documentation

ACE_Fixed_Set_Iterator_Base()

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::ACE_Fixed_Set_Iterator_Base ( ACE_Fixed_Set< T, ACE_SIZE > & s )

protected

Member Function Documentation

advance()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::advance

(

)

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

done()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::done

(

)

const

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

dump_i()

template<class T , size_t ACE_SIZE>

size_t ACE_SIZE void ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::dump_i ( ) const

protected

Dump the state of an object.

first()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::first

(

)

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

next()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::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.

next_i()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::next_i ( T *& next_item )

protected

Pass back the {next_item} that hasn't been seen in the Set. Returns 0 when all items have been seen, else 1.

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

iterated_items_

template<class T , size_t ACE_SIZE>

size_t ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::iterated_items_

protected

The number of non free items that the iterator had pointed at.

next_

template<class T , size_t ACE_SIZE>

ssize_t ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::next_

protected

How far we've advanced over the set.

s_

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set<T, ACE_SIZE>& ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >::s_

protected

Set we are iterating over.

---

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

• Containers_T.h
• Containers_T.cpp