Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages | Search for 

ACE_Node< T > Class Template Reference

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

#include <Node.h>

Collaboration diagram for ACE_Node< T >:

Collaboration graph
[legend]
List of all members.

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 > *n)
 ACE_Node (ACE_Node< T > *n=0, int=0)
 ACE_Node (const ACE_Node< T > &n)
void operator= (const ACE_Node< T > &)
 Not possible.


Private Attributes

ACE_Node< T > * next_
 Pointer to next element in the list of s.

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< T >
class ACE_Unbounded_Set_Iterator< T >
class ACE_Unbounded_Set_Const_Iterator< T >
class ACE_Unbounded_Stack< T >
class ACE_Unbounded_Stack_Iterator< T >

Detailed Description

template<class T>
class ACE_Node< T >

Implementation element in a Queue, Set, and Stack.

Definition at line 42 of file Node.h.

Constructor & Destructor Documentation

template<class T>
ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_Node< T >::~ACE_Node (  void   ) 
 

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

Definition at line 18 of file Node.cpp. 

00019 {
00020 }

template<class T>
ACE_Node< T >::ACE_Node (  const T &  i,
ACE_Node< T > *  n
)  [private]
 

Definition at line 24 of file Node.cpp. 

00025   : next_ (n),
00026     item_ (i)
00027 {
00028   // ACE_TRACE ("ACE_Node<T>::ACE_Node");
00029 }

template<class T>
ACE_Node< T >::ACE_Node (  ACE_Node< T > *  n = 0,
int  = 0
)  [private]
 

Definition at line 32 of file Node.cpp. 

00033   : next_ (n)
00034 {
00035   // ACE_TRACE ("ACE_Node<T>::ACE_Node");
00036 }

template<class T>
ACE_Node< T >::ACE_Node (  const ACE_Node< T > &  n  )  [private]
 

Definition at line 39 of file Node.cpp. 

00040   : next_ (s.next_),
00041     item_ (s.item_)
00042 {
00043   // ACE_TRACE ("ACE_Node<T>::ACE_Node");
00044 }

Member Function Documentation

template<class T>
void ACE_Node< T >::operator= (  const ACE_Node< T > &   )  [private]
 

Not possible.

Friends And Related Function Documentation

template<class T>
friend class ACE_Unbounded_Queue< T > [friend]
 

Definition at line 45 of file Node.h.

template<class T>
friend class ACE_Unbounded_Queue_Const_Iterator< T > [friend]
 

Definition at line 47 of file Node.h.

template<class T>
friend class ACE_Unbounded_Queue_Iterator< T > [friend]
 

Definition at line 46 of file Node.h.

template<class T>
friend class ACE_Unbounded_Set< T > [friend]
 

Definition at line 48 of file Node.h.

template<class T>
friend class ACE_Unbounded_Set_Const_Iterator< T > [friend]
 

Definition at line 50 of file Node.h.

template<class T>
friend class ACE_Unbounded_Set_Iterator< T > [friend]
 

Definition at line 49 of file Node.h.

template<class T>
friend class ACE_Unbounded_Stack< T > [friend]
 

Definition at line 51 of file Node.h.

template<class T>
friend class ACE_Unbounded_Stack_Iterator< T > [friend]
 

Definition at line 52 of file Node.h.

Member Data Documentation

template<class T>
T ACE_Node< T >::item_ [private]
 

Current value of the item in this node.

Definition at line 73 of file Node.h.

Referenced by ACE_Unbounded_Stack< T >::copy_all_nodes(), ACE_Unbounded_Set< T >::copy_nodes(), ACE_Unbounded_Queue< T >::copy_nodes(), ACE_Unbounded_Queue< T >::dequeue_head(), ACE_Unbounded_Set< T >::find(), ACE_Unbounded_Stack< T >::find(), ACE_Unbounded_Queue< T >::get(), ACE_Unbounded_Stack< T >::pop(), and ACE_Unbounded_Queue< T >::set().

template<class T>
ACE_Node<T>* ACE_Node< T >::next_ [private]
 

Pointer to next element in the list of s.

Definition at line 70 of file Node.h.

Referenced by ACE_Unbounded_Stack< T >::copy_all_nodes(), ACE_Unbounded_Set< T >::copy_nodes(), ACE_Unbounded_Queue< T >::copy_nodes(), ACE_Unbounded_Stack< T >::delete_all_nodes(), ACE_Unbounded_Set< T >::delete_nodes(), ACE_Unbounded_Queue< T >::delete_nodes(), ACE_Unbounded_Queue< T >::dequeue_head(), ACE_Unbounded_Set< T >::find(), ACE_Unbounded_Stack< T >::find(), ACE_Unbounded_Queue< T >::get(), ACE_Unbounded_Stack< T >::pop(), ACE_Unbounded_Set< T >::remove(), ACE_Unbounded_Stack< T >::remove(), and ACE_Unbounded_Queue< T >::set().

The documentation for this class was generated from the following files:
Generated on Thu Nov 9 11:25:41 2006 for ACE by doxygen 1.3.6