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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_stack.h</title>
<link rel="stylesheet" type="text/css" href="../../../../../gcov.css">
</head>
<body>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="title">LTP GCOV extension - code coverage report</td></tr>
<tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
<tr>
<td width="100%">
<table cellpadding=1 border=0 width="100%">
<tr>
<td class="headerItem" width="20%">Current view:</td>
<td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_stack.h</td>
</tr>
<tr>
<td class="headerItem" width="20%">Test:</td>
<td class="headerValue" width="80%" colspan=4>lcov.info</td>
</tr>
<tr>
<td class="headerItem" width="20%">Date:</td>
<td class="headerValue" width="20%">2008-08-14</td>
<td width="20%"></td>
<td class="headerItem" width="20%">Instrumented lines:</td>
<td class="headerValue" width="20%">12</td>
</tr>
<tr>
<td class="headerItem" width="20%">Code covered:</td>
<td class="headerValue" width="20%">100.0 %</td>
<td width="20%"></td>
<td class="headerItem" width="20%">Executed lines:</td>
<td class="headerValue" width="20%">12</td>
</tr>
</table>
</td>
</tr>
<tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
</table>
<table cellpadding=0 cellspacing=0 border=0>
<tr>
<td><br></td>
</tr>
<tr>
<td><pre class="source">
<span class="lineNum"> 1 </span> : // Stack implementation -*- C++ -*-
<span class="lineNum"> 2 </span> :
<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc.
<span class="lineNum"> 5 </span> : //
<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free
<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the
<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the
<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option)
<span class="lineNum"> 10 </span> : // any later version.
<span class="lineNum"> 11 </span> :
<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful,
<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of
<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
<span class="lineNum"> 15 </span> : // GNU General Public License for more details.
<span class="lineNum"> 16 </span> :
<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along
<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free
<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
<span class="lineNum"> 20 </span> : // USA.
<span class="lineNum"> 21 </span> :
<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software
<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate
<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile
<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this
<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by
<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however
<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by
<span class="lineNum"> 29 </span> : // the GNU General Public License.
<span class="lineNum"> 30 </span> :
<span class="lineNum"> 31 </span> : /*
<span class="lineNum"> 32 </span> : *
<span class="lineNum"> 33 </span> : * Copyright (c) 1994
<span class="lineNum"> 34 </span> : * Hewlett-Packard Company
<span class="lineNum"> 35 </span> : *
<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software
<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee,
<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and
<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear
<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no
<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any
<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty.
<span class="lineNum"> 43 </span> : *
<span class="lineNum"> 44 </span> : *
<span class="lineNum"> 45 </span> : * Copyright (c) 1996,1997
<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc.
<span class="lineNum"> 47 </span> : *
<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software
<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee,
<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and
<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear
<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no
<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any
<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty.
<span class="lineNum"> 55 </span> : */
<span class="lineNum"> 56 </span> :
<span class="lineNum"> 57 </span> : /** @file stl_stack.h
<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers.
<span class="lineNum"> 59 </span> : * You should not attempt to use it directly.
<span class="lineNum"> 60 </span> : */
<span class="lineNum"> 61 </span> :
<span class="lineNum"> 62 </span> : #ifndef _STL_STACK_H
<span class="lineNum"> 63 </span> : #define _STL_STACK_H 1
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span> : #include <bits/concept_check.h>
<span class="lineNum"> 66 </span> : #include <debug/debug.h>
<span class="lineNum"> 67 </span> :
<span class="lineNum"> 68 </span> : _GLIBCXX_BEGIN_NAMESPACE(std)
<span class="lineNum"> 69 </span> :
<span class="lineNum"> 70 </span> : /**
<span class="lineNum"> 71 </span> : * @brief A standard container giving FILO behavior.
<span class="lineNum"> 72 </span> : *
<span class="lineNum"> 73 </span> : * @ingroup Containers
<span class="lineNum"> 74 </span> : * @ingroup Sequences
<span class="lineNum"> 75 </span> : *
<span class="lineNum"> 76 </span> : * Meets many of the requirements of a
<span class="lineNum"> 77 </span> : * <a href="tables.html#65">container</a>,
<span class="lineNum"> 78 </span> : * but does not define anything to do with iterators. Very few of the
<span class="lineNum"> 79 </span> : * other standard container interfaces are defined.
<span class="lineNum"> 80 </span> : *
<span class="lineNum"> 81 </span> : * This is not a true container, but an @e adaptor. It holds
<span class="lineNum"> 82 </span> : * another container, and provides a wrapper interface to that
<span class="lineNum"> 83 </span> : * container. The wrapper is what enforces strict
<span class="lineNum"> 84 </span> : * first-in-last-out %stack behavior.
<span class="lineNum"> 85 </span> : *
<span class="lineNum"> 86 </span> : * The second template parameter defines the type of the underlying
<span class="lineNum"> 87 </span> : * sequence/container. It defaults to std::deque, but it can be
<span class="lineNum"> 88 </span> : * any type that supports @c back, @c push_back, and @c pop_front,
<span class="lineNum"> 89 </span> : * such as std::list, std::vector, or an appropriate user-defined
<span class="lineNum"> 90 </span> : * type.
<span class="lineNum"> 91 </span> : *
<span class="lineNum"> 92 </span> : * Members not found in "normal" containers are @c container_type,
<span class="lineNum"> 93 </span> : * which is a typedef for the second Sequence parameter, and @c
<span class="lineNum"> 94 </span> : * push, @c pop, and @c top, which are standard %stack/FILO
<span class="lineNum"> 95 </span> : * operations.
<span class="lineNum"> 96 </span> : */
<span class="lineNum"> 97 </span> : template<typename _Tp, typename _Sequence = deque<_Tp> >
<span class="lineNum"> 98 </span> : class stack
<span class="lineNum"> 99 </span><span class="lineCov"> 13 : {</span>
<span class="lineNum"> 100 </span> : // concept requirements
<span class="lineNum"> 101 </span> : typedef typename _Sequence::value_type _Sequence_value_type;
<span class="lineNum"> 102 </span> : __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
<span class="lineNum"> 103 </span> : __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
<span class="lineNum"> 104 </span> : __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
<span class="lineNum"> 105 </span> :
<span class="lineNum"> 106 </span> : template<typename _Tp1, typename _Seq1>
<span class="lineNum"> 107 </span> : friend bool
<span class="lineNum"> 108 </span> : operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
<span class="lineNum"> 109 </span> :
<span class="lineNum"> 110 </span> : template<typename _Tp1, typename _Seq1>
<span class="lineNum"> 111 </span> : friend bool
<span class="lineNum"> 112 </span> : operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
<span class="lineNum"> 113 </span> :
<span class="lineNum"> 114 </span> : public:
<span class="lineNum"> 115 </span> : typedef typename _Sequence::value_type value_type;
<span class="lineNum"> 116 </span> : typedef typename _Sequence::reference reference;
<span class="lineNum"> 117 </span> : typedef typename _Sequence::const_reference const_reference;
<span class="lineNum"> 118 </span> : typedef typename _Sequence::size_type size_type;
<span class="lineNum"> 119 </span> : typedef _Sequence container_type;
<span class="lineNum"> 120 </span> :
<span class="lineNum"> 121 </span> : protected:
<span class="lineNum"> 122 </span> : // See queue::c for notes on this name.
<span class="lineNum"> 123 </span> : _Sequence c;
<span class="lineNum"> 124 </span> :
<span class="lineNum"> 125 </span> : public:
<span class="lineNum"> 126 </span> : // XXX removed old def ctor, added def arg to this one to match 14882
<span class="lineNum"> 127 </span> : /**
<span class="lineNum"> 128 </span> : * @brief Default constructor creates no elements.
<span class="lineNum"> 129 </span> : */
<span class="lineNum"> 130 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 131 </span> : explicit
<span class="lineNum"> 132 </span><span class="lineCov"> 13 : stack(const _Sequence& __c = _Sequence())</span>
<span class="lineNum"> 133 </span><span class="lineCov"> 13 : : c(__c) { }</span>
<span class="lineNum"> 134 </span> : #else
<span class="lineNum"> 135 </span> : explicit
<span class="lineNum"> 136 </span> : stack(const _Sequence& __c)
<span class="lineNum"> 137 </span> : : c(__c) { }
<span class="lineNum"> 138 </span> :
<span class="lineNum"> 139 </span> : explicit
<span class="lineNum"> 140 </span> : stack(_Sequence&& __c = _Sequence())
<span class="lineNum"> 141 </span> : : c(std::move(__c)) { }
<span class="lineNum"> 142 </span> : #endif
<span class="lineNum"> 143 </span> :
<span class="lineNum"> 144 </span> : /**
<span class="lineNum"> 145 </span> : * Returns true if the %stack is empty.
<span class="lineNum"> 146 </span> : */
<span class="lineNum"> 147 </span> : bool
<span class="lineNum"> 148 </span><span class="lineCov"> 32 : empty() const</span>
<span class="lineNum"> 149 </span><span class="lineCov"> 32 : { return c.empty(); }</span>
<span class="lineNum"> 150 </span> :
<span class="lineNum"> 151 </span> : /** Returns the number of elements in the %stack. */
<span class="lineNum"> 152 </span> : size_type
<span class="lineNum"> 153 </span> : size() const
<span class="lineNum"> 154 </span> : { return c.size(); }
<span class="lineNum"> 155 </span> :
<span class="lineNum"> 156 </span> : /**
<span class="lineNum"> 157 </span> : * Returns a read/write reference to the data at the first
<span class="lineNum"> 158 </span> : * element of the %stack.
<span class="lineNum"> 159 </span> : */
<span class="lineNum"> 160 </span> : reference
<span class="lineNum"> 161 </span><span class="lineCov"> 39 : top()</span>
<span class="lineNum"> 162 </span> : {
<span class="lineNum"> 163 </span> : __glibcxx_requires_nonempty();
<span class="lineNum"> 164 </span><span class="lineCov"> 39 : return c.back();</span>
<span class="lineNum"> 165 </span> : }
<span class="lineNum"> 166 </span> :
<span class="lineNum"> 167 </span> : /**
<span class="lineNum"> 168 </span> : * Returns a read-only (constant) reference to the data at the first
<span class="lineNum"> 169 </span> : * element of the %stack.
<span class="lineNum"> 170 </span> : */
<span class="lineNum"> 171 </span> : const_reference
<span class="lineNum"> 172 </span> : top() const
<span class="lineNum"> 173 </span> : {
<span class="lineNum"> 174 </span> : __glibcxx_requires_nonempty();
<span class="lineNum"> 175 </span> : return c.back();
<span class="lineNum"> 176 </span> : }
<span class="lineNum"> 177 </span> :
<span class="lineNum"> 178 </span> : /**
<span class="lineNum"> 179 </span> : * @brief Add data to the top of the %stack.
<span class="lineNum"> 180 </span> : * @param x Data to be added.
<span class="lineNum"> 181 </span> : *
<span class="lineNum"> 182 </span> : * This is a typical %stack operation. The function creates an
<span class="lineNum"> 183 </span> : * element at the top of the %stack and assigns the given data
<span class="lineNum"> 184 </span> : * to it. The time complexity of the operation depends on the
<span class="lineNum"> 185 </span> : * underlying sequence.
<span class="lineNum"> 186 </span> : */
<span class="lineNum"> 187 </span> : #ifndef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 188 </span> : void
<span class="lineNum"> 189 </span><span class="lineCov"> 24 : push(const value_type& __x)</span>
<span class="lineNum"> 190 </span><span class="lineCov"> 24 : { c.push_back(__x); }</span>
<span class="lineNum"> 191 </span> : #else
<span class="lineNum"> 192 </span> : // NB: DR 756.
<span class="lineNum"> 193 </span> : template<typename... _Args>
<span class="lineNum"> 194 </span> : void
<span class="lineNum"> 195 </span> : push(_Args&&... __args)
<span class="lineNum"> 196 </span> : { c.push_back(std::forward<_Args>(__args)...); }
<span class="lineNum"> 197 </span> : #endif
<span class="lineNum"> 198 </span> :
<span class="lineNum"> 199 </span> : /**
<span class="lineNum"> 200 </span> : * @brief Removes first element.
<span class="lineNum"> 201 </span> : *
<span class="lineNum"> 202 </span> : * This is a typical %stack operation. It shrinks the %stack
<span class="lineNum"> 203 </span> : * by one. The time complexity of the operation depends on the
<span class="lineNum"> 204 </span> : * underlying sequence.
<span class="lineNum"> 205 </span> : *
<span class="lineNum"> 206 </span> : * Note that no data is returned, and if the first element's
<span class="lineNum"> 207 </span> : * data is needed, it should be retrieved before pop() is
<span class="lineNum"> 208 </span> : * called.
<span class="lineNum"> 209 </span> : */
<span class="lineNum"> 210 </span> : void
<span class="lineNum"> 211 </span><span class="lineCov"> 24 : pop()</span>
<span class="lineNum"> 212 </span> : {
<span class="lineNum"> 213 </span> : __glibcxx_requires_nonempty();
<span class="lineNum"> 214 </span><span class="lineCov"> 24 : c.pop_back();</span>
<span class="lineNum"> 215 </span><span class="lineCov"> 24 : }</span>
<span class="lineNum"> 216 </span> :
<span class="lineNum"> 217 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 218 </span> : void
<span class="lineNum"> 219 </span> : swap(stack&& __s)
<span class="lineNum"> 220 </span> : { c.swap(__s.c); }
<span class="lineNum"> 221 </span> : #endif
<span class="lineNum"> 222 </span> : };
<span class="lineNum"> 223 </span> :
<span class="lineNum"> 224 </span> : /**
<span class="lineNum"> 225 </span> : * @brief Stack equality comparison.
<span class="lineNum"> 226 </span> : * @param x A %stack.
<span class="lineNum"> 227 </span> : * @param y A %stack of the same type as @a x.
<span class="lineNum"> 228 </span> : * @return True iff the size and elements of the stacks are equal.
<span class="lineNum"> 229 </span> : *
<span class="lineNum"> 230 </span> : * This is an equivalence relation. Complexity and semantics
<span class="lineNum"> 231 </span> : * depend on the underlying sequence type, but the expected rules
<span class="lineNum"> 232 </span> : * are: this relation is linear in the size of the sequences, and
<span class="lineNum"> 233 </span> : * stacks are considered equivalent if their sequences compare
<span class="lineNum"> 234 </span> : * equal.
<span class="lineNum"> 235 </span> : */
<span class="lineNum"> 236 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 237 </span> : inline bool
<span class="lineNum"> 238 </span> : operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 239 </span> : { return __x.c == __y.c; }
<span class="lineNum"> 240 </span> :
<span class="lineNum"> 241 </span> : /**
<span class="lineNum"> 242 </span> : * @brief Stack ordering relation.
<span class="lineNum"> 243 </span> : * @param x A %stack.
<span class="lineNum"> 244 </span> : * @param y A %stack of the same type as @a x.
<span class="lineNum"> 245 </span> : * @return True iff @a x is lexicographically less than @a y.
<span class="lineNum"> 246 </span> : *
<span class="lineNum"> 247 </span> : * This is an total ordering relation. Complexity and semantics
<span class="lineNum"> 248 </span> : * depend on the underlying sequence type, but the expected rules
<span class="lineNum"> 249 </span> : * are: this relation is linear in the size of the sequences, the
<span class="lineNum"> 250 </span> : * elements must be comparable with @c <, and
<span class="lineNum"> 251 </span> : * std::lexicographical_compare() is usually used to make the
<span class="lineNum"> 252 </span> : * determination.
<span class="lineNum"> 253 </span> : */
<span class="lineNum"> 254 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 255 </span> : inline bool
<span class="lineNum"> 256 </span> : operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 257 </span> : { return __x.c < __y.c; }
<span class="lineNum"> 258 </span> :
<span class="lineNum"> 259 </span> : /// Based on operator==
<span class="lineNum"> 260 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 261 </span> : inline bool
<span class="lineNum"> 262 </span> : operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 263 </span> : { return !(__x == __y); }
<span class="lineNum"> 264 </span> :
<span class="lineNum"> 265 </span> : /// Based on operator<
<span class="lineNum"> 266 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 267 </span> : inline bool
<span class="lineNum"> 268 </span> : operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 269 </span> : { return __y < __x; }
<span class="lineNum"> 270 </span> :
<span class="lineNum"> 271 </span> : /// Based on operator<
<span class="lineNum"> 272 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 273 </span> : inline bool
<span class="lineNum"> 274 </span> : operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 275 </span> : { return !(__y < __x); }
<span class="lineNum"> 276 </span> :
<span class="lineNum"> 277 </span> : /// Based on operator<
<span class="lineNum"> 278 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 279 </span> : inline bool
<span class="lineNum"> 280 </span> : operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
<span class="lineNum"> 281 </span> : { return !(__x < __y); }
<span class="lineNum"> 282 </span> :
<span class="lineNum"> 283 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 284 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 285 </span> : inline void
<span class="lineNum"> 286 </span> : swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)
<span class="lineNum"> 287 </span> : { __x.swap(__y); }
<span class="lineNum"> 288 </span> :
<span class="lineNum"> 289 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 290 </span> : inline void
<span class="lineNum"> 291 </span> : swap(stack<_Tp, _Seq>&& __x, stack<_Tp, _Seq>& __y)
<span class="lineNum"> 292 </span> : { __x.swap(__y); }
<span class="lineNum"> 293 </span> :
<span class="lineNum"> 294 </span> : template<typename _Tp, typename _Seq>
<span class="lineNum"> 295 </span> : inline void
<span class="lineNum"> 296 </span> : swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>&& __y)
<span class="lineNum"> 297 </span> : { __x.swap(__y); }
<span class="lineNum"> 298 </span> : #endif
<span class="lineNum"> 299 </span> :
<span class="lineNum"> 300 </span> : _GLIBCXX_END_NAMESPACE
<span class="lineNum"> 301 </span> :
<span class="lineNum"> 302 </span> : #endif /* _STL_STACK_H */
</pre>
</td>
</tr>
</table>
<br>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr>
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr>
</table>
<br>
</body>
</html>
|
