#include <Node.h>
Collaboration diagram for ACE_Node< T >:

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 <ACE_Node>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 > |
This isn't necessary, but it keeps some compilers happy.
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< T > [friend] |
friend class ACE_Unbounded_Set_Const_Iterator< T > [friend] |
friend class ACE_Unbounded_Set_Iterator< T > [friend] |
friend class ACE_Unbounded_Stack< T > [friend] |
friend class ACE_Unbounded_Stack_Iterator< T > [friend] |
Pointer to next element in the list of <ACE_Node>s.
1.4.7-1