Containers_T.h File Reference

#include "ace/Containers.h"
#include "ace/Node.h"
#include "ace/Array_Base.h"
#include "ace/Unbounded_Set.h"
#include "ace/Unbounded_Queue.h"
#include "ace/Containers_T.inl"
#include "ace/Containers_T.cpp"

Classes
class	ACE_Bounded_Stack< T >
	Implement a generic LIFO abstract data type. More...
class	ACE_Fixed_Stack< T, ACE_SIZE >
	Implement a generic LIFO abstract data type. More...
class	ACE_DNode< T >
	Implementation element in a bilinked list. More...
class	ACE_Unbounded_Stack< T >
	Implement a generic LIFO abstract data type. More...
class	ACE_Unbounded_Stack_Iterator< T >
	Implement an iterator over an unbounded Stack. More...
class	ACE_Double_Linked_List_Iterator_Base< T >
	Implements a common base class for iterators for a double linked list ADT. More...
class	ACE_Double_Linked_List_Iterator< T >
	Implements an iterator for a double linked list ADT. More...
class	ACE_Double_Linked_List_Reverse_Iterator< T >
	Implements a reverse iterator for a double linked list ADT. More...
class	ACE_Double_Linked_List< T >
	A double-linked list implementation. More...
class	ACE_DLList< T >
	A double-linked list container class. More...
class	ACE_DLList_Iterator< T >
	A double-linked list container class iterator. More...
class	ACE_DLList_Reverse_Iterator< T >
	A double-linked list container class iterator. More...
class	ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
	Implements a common base class for iterators for a unordered set. More...
class	ACE_Fixed_Set_Iterator< T, ACE_SIZE >
	Iterates through an unordered set. More...
class	ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >
	Iterates through a const unordered set. More...
class	ACE_Fixed_Set< T, ACE_SIZE >
	Implement a simple unordered set of {T} with maximum {ACE_SIZE}. More...
class	ACE_Bounded_Set_Iterator< T >
	Iterates through an unordered set. More...
class	ACE_Bounded_Set< T >
	Implement a simple unordered set of {T} with maximum set at creation time. More...
struct	ACE_Bounded_Set< T >::Search_Structure
class	ACE_Ordered_MultiSet_Iterator< T >
	Implement a bidirectional iterator over an ordered multiset. This class template requires that < operator semantics be defined for the parameterized type {T}, but does not impose any restriction on how that ordering operator is implemented. More...
class	ACE_Ordered_MultiSet< T >
	Implement a simple ordered multiset of {T} of unbounded size that allows duplicates. This class template requires that < operator semantics be defined for the parameterized type {T}, but does not impose any restriction on how that ordering operator is implemented. The set is implemented as a linked list. More...
class	ACE_Array< T >
	A dynamic array class. More...
Typedefs
typedef ACE_Double_Linked_List < ACE_DLList_Node >	ACE_DLList_Base

---

Detailed Description

Id:

Containers_T.h 91995 2010-09-24 12:45:24Z johnnyw

Author:

Douglas C. Schmidt schmi.nosp@m.dt@c.nosp@m.s.wus.nosp@m.tl.e.nosp@m.du

---

Typedef Documentation

typedef ACE_Double_Linked_List<ACE_DLList_Node> ACE_DLList_Base