#include <Containers_T.h>
Inheritance diagram for ACE_DLList< T >:
Public Member Functions | |
| void | operator= (const ACE_DLList< T > &l) |
| Delegates to ACE_Double_Linked_List. | |
| T * | insert_tail (T *new_item) |
| Delegates to ACE_Double_Linked_List. | |
| T * | insert_head (T *new_item) |
| Delegates to ACE_Double_Linked_List. | |
| T * | delete_head (void) |
| Delegates to ACE_Double_Linked_List. | |
| T * | delete_tail (void) |
| Delegates to ACE_Double_Linked_List. | |
| int | get (T *&item, size_t slot=0) |
| void | dump (void) const |
| Delegates to ACE_Double_Linked_List. | |
| int | remove (ACE_DLList_Node *n) |
| Delegates to ACE_Double_Linked_List. | |
| ACE_DLList (ACE_Allocator *the_allocator=0) | |
| Delegates to ACE_Double_Linked_List. | |
| ACE_DLList (const ACE_DLList< T > &l) | |
| Delegates to ACE_Double_Linked_List. | |
| ~ACE_DLList (void) | |
| Deletes the list starting from the head. | |
Friends | |
| class | ACE_DLList_Node |
| class | ACE_Double_Linked_List_Iterator< T > |
| class | ACE_DLList_Iterator< T > |
| class | ACE_DLList_Reverse_Iterator< T > |
This implementation uses ACE_Double_Linked_List to perform the logic behind this container class. It delegates all of its calls to ACE_Double_Linked_List.
Definition at line 1026 of file Containers_T.h.
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Definition at line 353 of file Containers_T.inl. References ACE_DLList_Base.
00354 : ACE_DLList_Base (alloc) 00355 { 00356 } |
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Definition at line 359 of file Containers_T.inl. References ACE_DLList_Base.
00360 : ACE_DLList_Base ((ACE_DLList<T> &) l) 00361 { 00362 } |
|
||||||||||
|
Deletes the list starting from the head.
Definition at line 365 of file Containers_T.inl. References ACE_DLList< T >::delete_head().
00366 {
00367 while (this->delete_head ()) ;
00368 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 1891 of file Containers_T.cpp. References ACE_DES_FREE, ACE_Double_Linked_List< T >::delete_head(), and ACE_DLList_Node::item_. Referenced by ACE_DLList< T >::~ACE_DLList().
01892 {
01893 ACE_DLList_Node *temp1 = ACE_DLList_Base::delete_head ();
01894 T *temp2 = (T *) (temp1 ? temp1->item_ : 0);
01895 ACE_DES_FREE (temp1,
01896 this->allocator_->free,
01897 ACE_DLList_Node);
01898
01899 return temp2;
01900 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 1903 of file Containers_T.cpp. References ACE_DES_FREE, ACE_Double_Linked_List< T >::delete_tail(), and ACE_DLList_Node::item_.
01904 {
01905 ACE_DLList_Node *temp1 = ACE_DLList_Base::delete_tail ();
01906 T *temp2 = (T *) (temp1 ? temp1->item_ : 0);
01907 ACE_DES_FREE (temp1,
01908 this->allocator_->free,
01909 ACE_DLList_Node);
01910 return temp2;
01911 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 335 of file Containers_T.inl. References ACE_Double_Linked_List< T >::dump().
00336 {
00337 #if defined (ACE_HAS_DUMP)
00338 ACE_DLList_Base::dump ();
00339 #endif /* ACE_HAS_DUMP */
00340 }
|
|
||||||||||||||||
|
Delegates to {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. Reimplemented from ACE_Double_Linked_List< T >. Definition at line 325 of file Containers_T.inl. References ACE_Double_Linked_List< T >::get(), and ACE_DLList_Node::item_.
00326 {
00327 ACE_DLList_Node *node;
00328 int result = ACE_DLList_Base::get (node, index);
00329 if (result != -1)
00330 item = (T *) node->item_;
00331 return result;
00332 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 1879 of file Containers_T.cpp. References ACE_DLList< T >::ACE_DLList_Node, ACE_NEW_MALLOC_RETURN, ACE_Double_Linked_List< T >::insert_head(), and ACE_DLList_Node::item_.
01880 {
01881 ACE_DLList_Node *temp1;
01882 ACE_NEW_MALLOC_RETURN (temp1,
01883 (ACE_DLList_Node *) this->allocator_->malloc (sizeof (ACE_DLList_Node)),
01884 ACE_DLList_Node ((void *&)new_item), 0);
01885 ACE_DLList_Node *temp2 =
01886 ACE_DLList_Base::insert_head (temp1);
01887 return (T *) (temp2 ? temp2->item_ : 0);
01888 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 1867 of file Containers_T.cpp. References ACE_DLList< T >::ACE_DLList_Node, ACE_NEW_MALLOC_RETURN, ACE_Double_Linked_List< T >::insert_tail(), and ACE_DLList_Node::item_.
01868 {
01869 ACE_DLList_Node *temp1, *temp2;
01870 ACE_NEW_MALLOC_RETURN (temp1,
01871 static_cast<ACE_DLList_Node *> (this->allocator_->malloc (sizeof (ACE_DLList_Node))),
01872 ACE_DLList_Node ((void *&)new_item),
01873 0);
01874 temp2 = ACE_DLList_Base::insert_tail (temp1);
01875 return (T *) (temp2 ? temp2->item_ : 0);
01876 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Definition at line 319 of file Containers_T.inl. References ACE_DLList_Base.
00320 {
00321 *(ACE_DLList_Base *) this = l;
00322 }
|
|
||||||||||
|
Delegates to ACE_Double_Linked_List.
Definition at line 343 of file Containers_T.inl. References ACE_DES_FREE, and ACE_Double_Linked_List< T >::remove().
00344 {
00345 int result = ACE_DLList_Base::remove (n);
00346 ACE_DES_FREE (n,
00347 this->allocator_->free,
00348 ACE_DLList_Node);
00349 return result;
00350 }
|
|
|||||
|
Definition at line 1030 of file Containers_T.h. |
|
|||||
|
Definition at line 1028 of file Containers_T.h. Referenced by ACE_DLList< T >::insert_head(), and ACE_DLList< T >::insert_tail(). |
|
|||||
|
Definition at line 1031 of file Containers_T.h. |
|
|||||
|
Reimplemented from ACE_Double_Linked_List< T >. Definition at line 1029 of file Containers_T.h. |
1.3.6