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

Public Methods | |
| ~ACE_Node (void) | |
| This isn't necessary, but it keeps some compilers happy. | |
Private Methods | |
| 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) | |
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_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.
|
|
||||||
|
|
|
||||||
|
|
|
||||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
Current value of the item in this node.
|
|
|||
|
Pointer to next element in the list of s.
|
1.2.3 written by Dimitri van Heesch,
© 1997-2000