ACE_Node3
Implementation element in a queue, set, and stack.
Usage
#include <ace/Containers.h>
template<class T>
class ACE_Node
{
public:
friend class ACE_Unbounded_Queue<T>;
friend class ACE_Unbounded_Queue_Iterator<T>;
friend class ACE_Unbounded_Set<T>;
friend class ACE_Unbounded_Set_Iterator<T>;
friend class ACE_Unbounded_Stack<T>;
friend class ACE_Unbounded_Stack_Iterator<T>;
~ACE_Node (void);
private:
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);
ACE_Node<T> *next_;
T item_;
};
Overview
This implementation of an unordered set uses a fixed array. This implementation does not allow duplicates...
Initialization 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);
ACE_Node<T> *next_;
Pointer to next element in the list of ACE_Nodes.
T item_;
Current value of the item in this node.
Initialization and termination methods.
Check boundary conditions.
Classic unordered set operations.
Library
ace