#include <ace/Containers.h>
template<class T> class ACE_DLList : public ACE_DLList_Base {
public:
friend class ACE_DLList_Node;
friend class ACE_Double_Linked_List_Iterator<T>;
friend class ACE_DLList_Iterator<T>;
friend class ACE_DLList_Reverse_Iterator<T>;
void operator= (ACE_DLList<T> &l);
T *insert_tail (T *new_item);
T *insert_head (T *new_item);
T *delete_head (void);
T *delete_tail (void);
int get (T *&item, size_t slot = 0);
void dump (void) const;
int remove (ACE_DLList_Node *n);
ACE_DLList (ACE_Allocator *alloc = 0);
ACE_DLList (ACE_DLList<T> &l);
~ACE_DLList (void);
};
T *insert_tail (T *new_item);
T *insert_head (T *new_item);
T *delete_head (void);
T *delete_tail (void);
int get (T *&item, size_t slot = 0);
ACE_Double_Linked_List
, but where
ACE_Double_Linked_List
returns the node as the item, this get
returns the contents of the node in item.
void dump (void) const;
int remove (ACE_DLList_Node *n);
ACE_DLList (ACE_Allocator *alloc = 0);
ACE_DLList (ACE_DLList<T> &l);
~ACE_DLList (void);