ACE_Node< T, C > Class Template Reference

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

#include <Node.h>

Collaboration diagram for ACE_Node< T, C >:

[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, 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 >

---

Detailed Description

template<class T, class C = void>
class ACE_Node< T, C >

Implementation element in a Queue, Set, and Stack.

Definition at line 42 of file Node.h.

---

Constructor & Destructor Documentation

template<class T, class C>

ACE_BEGIN_VERSIONED_NAMESPACE_DECL ACE_Node< T, C >::~ACE_Node

(

void

)

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

Definition at line 17 of file Node.cpp.

{
}

template<class T, class C>

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

Definition at line 22 of file Node.cpp.

  : next_ (n),
    item_ (i)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}

template<class T, class C>

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

Definition at line 30 of file Node.cpp.

  : next_ (n)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}

template<class T, class C>

ACE_Node< T, C >::ACE_Node

(

const ACE_Node< T, C > &

n

)

[private]

Definition at line 37 of file Node.cpp.

  : next_ (s.next_),
    item_ (s.item_)
{
  // ACE_TRACE ("ACE_Node<T, C>::ACE_Node");
}

---

Member Function Documentation

template<class T, class C = void>

void ACE_Node< T, C >::operator=

(

const ACE_Node< T, C > &

)

[private]

Not possible.

---

Friends And Related Function Documentation

template<class T, class C = void>

friend class ACE_Unbounded_Queue< T > [friend]

Definition at line 45 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Queue_Const_Iterator< T > [friend]

Definition at line 47 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Queue_Iterator< T > [friend]

Definition at line 46 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Set_Ex< T, C > [friend]

Definition at line 48 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Set_Ex_Const_Iterator< T, C > [friend]

Definition at line 50 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Set_Ex_Iterator< T, C > [friend]

Definition at line 49 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Stack< T > [friend]

Definition at line 51 of file Node.h.

template<class T, class C = void>

friend class ACE_Unbounded_Stack_Iterator< T > [friend]

Definition at line 52 of file Node.h.

---

Member Data Documentation

template<class T, class C = void>

T ACE_Node< T, C >::item_ [private]

Current value of the item in this node.

Definition at line 71 of file Node.h.

Referenced by ACE_Unbounded_Queue< T >::dequeue_head(), ACE_Unbounded_Queue< T >::enqueue_tail(), ACE_Unbounded_Stack< T >::find(), ACE_Unbounded_Queue< T >::get(), ACE_Unbounded_Set_Ex< T, C >::insert_tail(), ACE_Unbounded_Queue_Iterator< T >::next(), ACE_Unbounded_Queue_Const_Iterator< T >::next(), ACE_Unbounded_Stack_Iterator< T >::next(), ACE_Unbounded_Stack< T >::pop(), ACE_Unbounded_Set_Ex< T, C >::remove(), ACE_Unbounded_Stack< T >::remove(), and ACE_Unbounded_Queue< T >::set().

template<class T, class C = void>

ACE_Node<T, C>* ACE_Node< T, C >::next_ [private]

Pointer to next element in the list of ACE_Nodes.

Definition at line 68 of file Node.h.

Referenced by ACE_Unbounded_Queue< T >::ACE_Unbounded_Queue(), ACE_Unbounded_Set_Ex< T, C >::ACE_Unbounded_Set_Ex(), ACE_Unbounded_Stack< T >::ACE_Unbounded_Stack(), ACE_Unbounded_Queue_Iterator< T >::advance(), ACE_Unbounded_Queue_Const_Iterator< T >::advance(), ACE_Unbounded_Stack_Iterator< T >::advance(), ACE_Unbounded_Stack< T >::copy_all_nodes(), ACE_Unbounded_Set_Ex< T, C >::copy_nodes(), ACE_Unbounded_Queue< T >::copy_nodes(), ACE_Unbounded_Set_Ex< T, C >::delete_nodes(), ACE_Unbounded_Queue< T >::delete_nodes(), ACE_Unbounded_Queue< T >::dequeue_head(), ACE_Unbounded_Queue< T >::enqueue_head(), ACE_Unbounded_Queue< T >::enqueue_tail(), ACE_Unbounded_Stack< T >::find(), ACE_Unbounded_Queue< T >::get(), ACE_Unbounded_Set_Ex< T, C >::insert_tail(), ACE_Unbounded_Set_Ex< T, C >::is_empty(), ACE_Unbounded_Queue< T >::is_empty(), ACE_Unbounded_Stack< T >::is_empty(), ACE_Unbounded_Stack< T >::pop(), ACE_Unbounded_Stack< T >::push(), ACE_Unbounded_Set_Ex< T, C >::remove(), ACE_Unbounded_Stack< T >::remove(), and ACE_Unbounded_Queue< T >::set().

---

The documentation for this class was generated from the following files:

• Node.h
• Node.cpp

---