## NAME

ACE_Node - Implementation element in a Queue, Set, and Stack.

## SYNOPSIS

    #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_;
    };

## 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_Node`s.

    T item_;

Current value of the item in this node.

## AUTHOR

Doug Schmidt

## LIBRARY

ace