#include <Node.h>
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 > |
This isn't necessary, but it keeps some compilers happy.
ACE_Node< T, C >::ACE_Node | ( | const T & | i, | |
ACE_Node< T, C > * | n | |||
) | [inline, private] |
ACE_Node< T, C >::ACE_Node | ( | ACE_Node< T, C > * | n = 0 , |
|
int | = 0 | |||
) | [inline, private] |
ACE_Node< T, C >::ACE_Node | ( | const ACE_Node< T, C > & | n | ) | [inline, private] |
void ACE_Node< T, C >::operator= | ( | const ACE_Node< T, C > & | ) | [private] |
Not possible.
friend class ACE_Unbounded_Queue< T > [friend] |
friend class ACE_Unbounded_Queue_Const_Iterator< T > [friend] |
friend class ACE_Unbounded_Queue_Iterator< T > [friend] |
friend class ACE_Unbounded_Set_Ex< T, C > [friend] |
friend class ACE_Unbounded_Set_Ex_Const_Iterator< T, C > [friend] |
friend class ACE_Unbounded_Set_Ex_Iterator< T, C > [friend] |
friend class ACE_Unbounded_Stack< T > [friend] |
friend class ACE_Unbounded_Stack_Iterator< T > [friend] |
Current value of the item in this node.
Pointer to next element in the list of ACE_Nodes.