1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
.TH ACE_DLList 3 "1 Dec 2001" "ACE" \" -*- nroff -*-
.ad l
.nh
.SH NAME
ACE_DLList \- A double-linked list container class.
.SH SYNOPSIS
.br
.PP
\fC#include <Containers_T.h>\fR
.PP
Inherits \fBACE_Double_Linked_List\fR.
.PP
.SS Public Methods
.in +1c
.ti -1c
.RI "void \fBoperator=\fR (const ACE_DLList<T> &l)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "T* \fBinsert_tail\fR (T *new_item)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "T* \fBinsert_head\fR (T *new_item)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "T* \fBdelete_head\fR (void)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "T* \fBdelete_tail\fR (void)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "int \fBget\fR (T *&item, size_t slot = 0)"
.br
.ti -1c
.RI "void \fBdump\fR (void) const"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "int \fBremove\fR (\fBACE_DLList_Node\fR *n)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "\fBACE_DLList\fR (\fBACE_Allocator\fR *alloc = 0)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "\fBACE_DLList\fR (const ACE_DLList<T> &l)"
.br
.RI "\fIDelegates to \fBACE_Double_Linked_List\fR.\fR"
.ti -1c
.RI "\fB~ACE_DLList\fR (void)"
.br
.RI "\fIDeletes the list starting from the head.\fR"
.in -1c
.SS Friends
.in +1c
.ti -1c
.RI "class \fBACE_DLList_Node\fR"
.br
.ti -1c
.RI "class \fBACE_Double_Linked_List_Iterator< T >\fR"
.br
.ti -1c
.RI "class \fBACE_DLList_Iterator< T >\fR"
.br
.ti -1c
.RI "class \fBACE_DLList_Reverse_Iterator< T >\fR"
.br
.in -1c
.SH DETAILED DESCRIPTION
.PP
.SS template<class T> template class ACE_DLList
A double-linked list container class.
.PP
.PP
This implementation uses \fBACE_Double_Linked_List\fR to perform the logic behind this container class. It delegates all of its calls to \fBACE_Double_Linked_List\fR.
.PP
.SH CONSTRUCTOR & DESTRUCTOR DOCUMENTATION
.PP
.SS template<classT> ACE_DLList<T>::ACE_DLList<T> (\fBACE_Allocator\fR * alloc = 0)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
.SS template<classT> ACE_DLList<T>::ACE_DLList<T> (const ACE_DLList< T >& l)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
.SS template<classT> ACE_DLList<T>::~ACE_DLList<T> (void)
.PP
Deletes the list starting from the head.
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP
.SS template<classT> T * ACE_DLList<T>::delete_head (void)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> T * ACE_DLList<T>::delete_tail (void)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> void ACE_DLList<T>::dump (void) const
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> int ACE_DLList<T>::get (T *& item, size_t slot = 0)
.PP
Delegates to , but where returns the node as the item, this get returns the contents of the node in item.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> T * ACE_DLList<T>::insert_head (T * new_item)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> T * ACE_DLList<T>::insert_tail (T * new_item)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SS template<classT> void ACE_DLList<T>::operator= (const ACE_DLList< T >& l)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
.SS template<classT> int ACE_DLList<T>::remove (\fBACE_DLList_Node\fR * n)
.PP
Delegates to \fBACE_Double_Linked_List\fR.
.PP
.SH FRIENDS AND RELATED FUNCTION DOCUMENTATION
.PP
.SS template<classT> class \fBACE_DLList_Iterator\fR\fC [friend]\fR
.PP
.SS template<classT> class ACE_DLList_Node\fC [friend]\fR
.PP
.SS template<classT> class \fBACE_DLList_Reverse_Iterator\fR\fC [friend]\fR
.PP
.SS template<classT> class \fBACE_Double_Linked_List_Iterator\fR\fC [friend]\fR
.PP
Reimplemented from \fBACE_Double_Linked_List\fR.
.SH AUTHOR
.PP
Generated automatically by Doxygen for ACE from the source code.
|
