ACE_Node< T, C > Class Template Reference

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

#include <Node.h>

Public Member Functions
	~ACE_Node ()=default

Public Attributes
	ACE_ALLOC_HOOK_DECLARE

Private Member Functions
	ACE_Node (const T &i, ACE_Node< T, C > *n)
	ACE_Node (ACE_Node< T, C > *n=nullptr, int=0)
	ACE_Node (const ACE_Node< T, C > &n)
void	operator= (const ACE_Node< T, C > &)=delete

Private Attributes
ACE_Node< T, C > *	next_
	Pointer to next element in the list of ACE_Nodes. More...
T	item_
	Current value of the item in this node. More...

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.

Constructor & Destructor Documentation

~ACE_Node()

template<class T , class C = void>

ACE_Node< T, C >::~ACE_Node ( )

default

ACE_Node() [1/3]

template<class T , class C = void>

class C ACE_Node< T, C >::ACE_Node ( const T &  i, ACE_Node< T, C > *  n  )

private

ACE_Node() [2/3]

template<class T , class C >

ACE_Node< T, C >::ACE_Node ( ACE_Node< T, C > *  n = nullptr, int  = 0  )

private

ACE_Node() [3/3]

template<class T , class C >

ACE_Node< T, C >::ACE_Node ( const ACE_Node< T, C > &  n )

private

Member Function Documentation

operator=()

template<class T , class C = void>

void ACE_Node< T, C >::operator= ( const ACE_Node< T, C > &  )

privatedelete

Friends And Related Function Documentation

ACE_Unbounded_Queue< T >

template<class T , class C = void>

friend class ACE_Unbounded_Queue< T >

friend

ACE_Unbounded_Queue_Const_Iterator< T >

template<class T , class C = void>

friend class ACE_Unbounded_Queue_Const_Iterator< T >

friend

ACE_Unbounded_Queue_Iterator< T >

template<class T , class C = void>

friend class ACE_Unbounded_Queue_Iterator< T >

friend

ACE_Unbounded_Set_Ex< T, C >

template<class T , class C = void>

friend class ACE_Unbounded_Set_Ex< T, C >

friend

ACE_Unbounded_Set_Ex_Const_Iterator< T, C >

template<class T , class C = void>

friend class ACE_Unbounded_Set_Ex_Const_Iterator< T, C >

friend

ACE_Unbounded_Set_Ex_Iterator< T, C >

template<class T , class C = void>

friend class ACE_Unbounded_Set_Ex_Iterator< T, C >

friend

ACE_Unbounded_Stack< T >

template<class T , class C = void>

friend class ACE_Unbounded_Stack< T >

friend

ACE_Unbounded_Stack_Iterator< T >

template<class T , class C = void>

friend class ACE_Unbounded_Stack_Iterator< T >

friend

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class T , class C = void>

ACE_Node< T, C >::ACE_ALLOC_HOOK_DECLARE

item_

template<class T , class C = void>

T ACE_Node< T, C >::item_

private

Current value of the item in this node.

next_

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.

---

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

• Node.h
• Node.cpp