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"

Include dependency graph for Containers_T.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	ACE_Bounded_Stack
	Implement a generic LIFO abstract data type. More...
class	ACE_Fixed_Stack
	Implement a generic LIFO abstract data type. More...
class	ACE_DNode
	Implementation element in a bilinked list. More...
class	ACE_Unbounded_Stack
	Implement a generic LIFO abstract data type. More...
class	ACE_Unbounded_Stack_Iterator
	Implement an iterator over an unbounded Stack. More...
class	ACE_Double_Linked_List_Iterator_Base
	Implements a common base class for iterators for a double linked list ADT. More...
class	ACE_Double_Linked_List_Iterator
	Implements an iterator for a double linked list ADT. More...
class	ACE_Double_Linked_List_Reverse_Iterator
	Implements a reverse iterator for a double linked list ADT. More...
class	ACE_Double_Linked_List
	A double-linked list implementation. More...
class	ACE_DLList
	A double-linked list container class. More...
class	ACE_DLList_Iterator
	A double-linked list container class iterator. More...
class	ACE_DLList_Reverse_Iterator
	A double-linked list container class iterator. More...
class	ACE_Fixed_Set_Iterator_Base
	Implements a common base class for iterators for a unordered set. More...
class	ACE_Fixed_Set_Iterator
	Iterates through an unordered set. More...
class	ACE_Fixed_Set_Const_Iterator
	Iterates through a const unordered set. More...
class	ACE_Fixed_Set
	Implement a simple unordered set of {T} with maximum {ACE_SIZE}. More...
class	ACE_Bounded_Set_Iterator
	Iterates through an unordered set. More...
class	ACE_Bounded_Set
	Implement a simple unordered set of {T} with maximum set at creation time. More...
struct	ACE_Bounded_Set::Search_Structure
class	ACE_Ordered_MultiSet_Iterator
	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
	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
	A dynamic array class. More...
Typedefs
typedef ACE_Double_Linked_List< ACE_DLList_Node >	ACE_DLList_Base
Variables
ACE_BEGIN_VERSIONED_NAMESPACE_DECL class	ACE_Allocator

---

Detailed Description

Id

Containers_T.h 77853 2007-03-30 12:11:47Z johnnyw

Author:

Douglas C. Schmidt <schmidt@cs.wustl.edu>

Definition in file Containers_T.h.

---

Typedef Documentation

typedef ACE_Double_Linked_List<ACE_DLList_Node> ACE_DLList_Base

Definition at line 1000 of file Containers_T.h. Referenced by ACE_DLList< T >::ACE_DLList(), ACE_DLList_Iterator< T >::ACE_DLList_Iterator(), ACE_DLList_Reverse_Iterator< T >::ACE_DLList_Reverse_Iterator(), ACE_DLList< T >::operator=(), ACE_DLList_Reverse_Iterator< T >::reset(), and ACE_DLList_Iterator< T >::reset().

---

Variable Documentation

ACE_BEGIN_VERSIONED_NAMESPACE_DECL class ACE_Allocator

Definition at line 41 of file Containers_T.h.

---