#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_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< 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 > |
Definition at line 42 of file Node.h.
|
This isn't necessary, but it keeps some compilers happy.
Definition at line 17 of file Node.cpp.
00018 { 00019 } |
|
Definition at line 22 of file Node.cpp.
|
|
Definition at line 30 of file Node.cpp.
00031 : next_ (n) 00032 { 00033 // ACE_TRACE ("ACE_Node<T>::ACE_Node"); 00034 } |
|
Definition at line 37 of file Node.cpp.
|
|
Not possible.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Current value of the item in this node.
Definition at line 71 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_Stack< T >::find(), ACE_Unbounded_Queue< T >::get(), ACE_Unbounded_Stack< T >::pop(), and ACE_Unbounded_Queue< T >::set(). |
|
Pointer to next element in the list of ACE_Nodes.
Definition at line 68 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_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(). |