NAME

ACE_DNode - Implementation element in a bilinked list.

SYNOPSIS

#include <ace/Containers.h>

template<class T> class ACE_DNode { public: friend class ACE_Ordered_MultiSet<T>; friend class ACE_Ordered_MultiSet_Iterator<T>; ~ACE_DNode (void); private: ACE_DNode (const T &i, ACE_DNode<T> *n = 0, ACE_DNode<T> *p = 0); ACE_DNode<T> *next_; ACE_DNode<T> *prev_; T item_; };

DESCRIPTION

This implementation of an unordered set uses a fixed array. This implementation does not allow duplicates...

Initialization methods

ACE_DNode (const T &i, ACE_DNode<T> *n = 0, ACE_DNode<T> *p = 0);

ACE_DNode<T> *next_;

ACE_DNode<T> *prev_;

T item_;

AUTHOR

Doug Schmidt

Initialization and termination methods.

Check boundary conditions.

Classic unordered set operations.

LIBRARY

ace