TAO_CosNaming  2.0.6
Public Member Functions | Public Attributes | Private Attributes
ACE_Unbounded_List_Iterator Class Reference

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

#include <Naming_Service_Container.h>

Collaboration diagram for ACE_Unbounded_List_Iterator:
Collaboration graph
[legend]

List of all members.

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.
void dump (void) const
 Dump the state of an object.
ACE_Unbounded_List_Iterator< T > operator++ (int)
 Postfix advance.
ACE_Unbounded_List_Iterator< T > & operator++ (void)
 Prefix advance.
T & operator* (void)
 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

Implement an iterator over an unbounded List.


Constructor & Destructor Documentation

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

Member Function Documentation

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.

int ACE_Unbounded_List_Iterator::done ( void  ) const

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

void ACE_Unbounded_List_Iterator::dump ( void  ) const

Dump the state of an object.

int ACE_Unbounded_List_Iterator::first ( void  )

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

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.

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

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

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

Postfix advance.

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

Prefix advance.

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

Declare the dynamic allocation hooks.

Pointer to the current node in the iteration.

Pointer to the set we're iterating over.


The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines