-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
220 lines (166 loc) · 6.56 KB
/
index.html
File metadata and controls
220 lines (166 loc) · 6.56 KB
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<!-- Mirrored from cppreference.com/cppdeque/index.html by HTTrack Website Copier/3.x [XR&CO'2004], Tue, 22 Jan 2008 06:22:56 GMT -->
<!-- Added by HTTrack --><meta http-equiv="content-type" content="text/html;charset=iso-8859-1"><!-- /Added by HTTrack -->
<head>
<meta name="generator" content=
"HTML Tidy for Linux/x86 (vers 1 September 2005), see www.w3.org">
<title>C++ Double-ended Queues</title>
<link href="../cppreference.css" rel="stylesheet" type="text/css">
<link href="../prettify.css" type="text/css" rel="stylesheet" />
<script type="text/javascript" src="../prettify.js"></script>
</head>
<body onload="prettyPrint()">
<table>
<tr>
<td>
<div class="body-content">
<div class="header-box">
<a href="../index-2.html">cppreference.com</a> > <a href=
"index.html">C++ Double-ended Queues</a>
</div>
<div class="name-format">
C++ Double-ended Queues
</div>
<p>Double-ended queues are like vectors, except that they allow fast
insertions and deletions at the beginning (as well as the end) of the
container.</p>
<p><a href="all.html">Display all entries</a> for C++ Double-ended
Queues on one page, or view entries individually:</p>
<table class="category-table">
<tr class="category-table-tr-2">
<td class="category-table-td"><a href=
"container_constructors2.html">Container constructors</a></td>
<td class="category-table-td">create dequeues and initialize them
with some data</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"container_operators.html">Container operators</a></td>
<td class="category-table-td">compare, assign, and access
elements of a dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href=
"assign.html">assign</a></td>
<td class="category-table-td">assign elements to a dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href="at.html">at</a></td>
<td class="category-table-td">returns an element at a specific
location</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="back.html">back</a></td>
<td class="category-table-td">returns a reference to last element
of a dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href="begin.html">begin</a></td>
<td class="category-table-td">returns an iterator to the
beginning of the dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="clear.html">clear</a></td>
<td class="category-table-td">removes all elements from the
dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href="empty.html">empty</a></td>
<td class="category-table-td">true if the dequeue has no
elements</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="end.html">end</a></td>
<td class="category-table-td">returns an iterator just past the
last element of a dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href="erase.html">erase</a></td>
<td class="category-table-td">removes elements from a
dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="front.html">front</a></td>
<td class="category-table-td">returns a reference to the first
element of a dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"insert.html">insert</a></td>
<td class="category-table-td">inserts elements into the
dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href=
"max_size.html">max_size</a></td>
<td class="category-table-td">returns the maximum number of
elements that the dequeue can hold</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"pop_back.html">pop_back</a></td>
<td class="category-table-td">removes the last element of a
dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href=
"pop_front.html">pop_front</a></td>
<td class="category-table-td">removes the first element of the
dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"push_back.html">push_back</a></td>
<td class="category-table-td">add an element to the end of the
dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href=
"push_front.html">push_front</a></td>
<td class="category-table-td">add an element to the front of the
dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"rbegin.html">rbegin</a></td>
<td class="category-table-td">returns a <a href=
"../iterators.html">reverse_iterator</a> to the end of the
dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="rend.html">rend</a></td>
<td class="category-table-td">returns a <a href=
"../iterators.html">reverse_iterator</a> to the beginning of the
dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href=
"resize.html">resize</a></td>
<td class="category-table-td">change the size of the dequeue</td>
</tr>
<tr class="category-table-tr-2">
<td class="category-table-td"><a href="size.html">size</a></td>
<td class="category-table-td">returns the number of items in the
dequeue</td>
</tr>
<tr class="category-table-tr-1">
<td class="category-table-td"><a href="swap.html">swap</a></td>
<td class="category-table-td">swap the contents of this dequeue
with another</td>
</tr>
</table>
</div>
</td>
<script src="../../www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-2828341-1";
urchinTracker();
</script>
</tr>
</table>
</body>
<!-- Mirrored from cppreference.com/cppdeque/index.html by HTTrack Website Copier/3.x [XR&CO'2004], Tue, 22 Jan 2008 06:22:56 GMT -->
<!-- Added by HTTrack --><meta http-equiv="content-type" content="text/html;charset=iso-8859-1"><!-- /Added by HTTrack -->
</html>