Implementation element in a Queue, Set, and Stack. More...

#include <Node.h>

Collaboration diagram for ACE_Node< T, C >:

Public Member Functions
	~ACE_Node (void)
	This isn't necessary, but it keeps some compilers happy.
Private Member Functions
	ACE_Node (const T &i, ACE_Node< T, C > *n)
	ACE_Node (ACE_Node< T, C > *n=0, int=0)
	ACE_Node (const ACE_Node< T, C > &n)
void	operator= (const ACE_Node< T, C > &)
	Not possible.
Private Attributes
ACE_Node< T, C > *	next_
	Pointer to next element in the list of ACE_Nodes.
T	item_
	Current value of the item in this node.
Friends
class	ACE_Unbounded_Queue< T >
class	ACE_Unbounded_Queue_Iterator< T >
class	ACE_Unbounded_Queue_Const_Iterator< T >
class	ACE_Unbounded_Set_Ex< T, C >
class	ACE_Unbounded_Set_Ex_Iterator< T, C >
class	ACE_Unbounded_Set_Ex_Const_Iterator< T, C >
class	ACE_Unbounded_Stack< T >
class	ACE_Unbounded_Stack_Iterator< T >

Detailed Description

Implementation element in a Queue, Set, and Stack.

Definition at line 42 of file Node.h.

Constructor & Destructor Documentation

template<class T , class C >

ACE_Node< T, C >::~ACE_Node ( void )

This isn't necessary, but it keeps some compilers happy.

Definition at line 17 of file Node.cpp.

{
}

template<class T, class C>

Definition at line 22 of file Node.cpp.

  : next_ (n),
    item_ (i)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}

template<class T, class C>

Definition at line 30 of file Node.cpp.

  : next_ (n)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}

template<class T, class C>

ACE_Node< T, C >::ACE_Node ( const ACE_Node< T, C > & n ) [private]

Definition at line 37 of file Node.cpp.

  : next_ (s.next_),
    item_ (s.item_)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}