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
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
|
<!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/list.tcc</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> - list.tcc</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%">11</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%">11</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> : // List implementation (out of line) -*- 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 list.tcc
<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 _LIST_TCC
<span class="lineNum"> 63 </span> : #define _LIST_TCC 1
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
<span class="lineNum"> 66 </span> :
<span class="lineNum"> 67 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 68 </span> : void
<span class="lineNum"> 69 </span> : _List_base<_Tp, _Alloc>::
<span class="lineNum"> 70 </span><span class="lineCov"> 19 : _M_clear()</span>
<span class="lineNum"> 71 </span> : {
<span class="lineNum"> 72 </span> : typedef _List_node<_Tp> _Node;
<span class="lineNum"> 73 </span><span class="lineCov"> 19 : _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next);</span>
<span class="lineNum"> 74 </span><span class="lineCov"> 60 : while (__cur != &this->_M_impl._M_node)</span>
<span class="lineNum"> 75 </span> : {
<span class="lineNum"> 76 </span><span class="lineCov"> 22 : _Node* __tmp = __cur;</span>
<span class="lineNum"> 77 </span><span class="lineCov"> 22 : __cur = static_cast<_Node*>(__cur->_M_next);</span>
<span class="lineNum"> 78 </span><span class="lineCov"> 22 : _M_get_Tp_allocator().destroy(&__tmp->_M_data);</span>
<span class="lineNum"> 79 </span><span class="lineCov"> 22 : _M_put_node(__tmp);</span>
<span class="lineNum"> 80 </span> : }
<span class="lineNum"> 81 </span><span class="lineCov"> 19 : }</span>
<span class="lineNum"> 82 </span> :
<span class="lineNum"> 83 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 84 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 85 </span> : template<typename... _Args>
<span class="lineNum"> 86 </span> : typename list<_Tp, _Alloc>::iterator
<span class="lineNum"> 87 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 88 </span> : emplace(iterator __position, _Args&&... __args)
<span class="lineNum"> 89 </span> : {
<span class="lineNum"> 90 </span> : _Node* __tmp = _M_create_node(std::forward<_Args>(__args)...);
<span class="lineNum"> 91 </span> : __tmp->hook(__position._M_node);
<span class="lineNum"> 92 </span> : return iterator(__tmp);
<span class="lineNum"> 93 </span> : }
<span class="lineNum"> 94 </span> : #endif
<span class="lineNum"> 95 </span> :
<span class="lineNum"> 96 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 97 </span> : typename list<_Tp, _Alloc>::iterator
<span class="lineNum"> 98 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 99 </span> : insert(iterator __position, const value_type& __x)
<span class="lineNum"> 100 </span> : {
<span class="lineNum"> 101 </span> : _Node* __tmp = _M_create_node(__x);
<span class="lineNum"> 102 </span> : __tmp->hook(__position._M_node);
<span class="lineNum"> 103 </span> : return iterator(__tmp);
<span class="lineNum"> 104 </span> : }
<span class="lineNum"> 105 </span> :
<span class="lineNum"> 106 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 107 </span> : typename list<_Tp, _Alloc>::iterator
<span class="lineNum"> 108 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 109 </span><span class="lineCov"> 25 : erase(iterator __position)</span>
<span class="lineNum"> 110 </span> : {
<span class="lineNum"> 111 </span><span class="lineCov"> 25 : iterator __ret = iterator(__position._M_node->_M_next);</span>
<span class="lineNum"> 112 </span><span class="lineCov"> 25 : _M_erase(__position);</span>
<span class="lineNum"> 113 </span> : return __ret;
<span class="lineNum"> 114 </span> : }
<span class="lineNum"> 115 </span> :
<span class="lineNum"> 116 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 117 </span> : void
<span class="lineNum"> 118 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 119 </span> : resize(size_type __new_size, value_type __x)
<span class="lineNum"> 120 </span> : {
<span class="lineNum"> 121 </span> : iterator __i = begin();
<span class="lineNum"> 122 </span> : size_type __len = 0;
<span class="lineNum"> 123 </span> : for (; __i != end() && __len < __new_size; ++__i, ++__len)
<span class="lineNum"> 124 </span> : ;
<span class="lineNum"> 125 </span> : if (__len == __new_size)
<span class="lineNum"> 126 </span> : erase(__i, end());
<span class="lineNum"> 127 </span> : else // __i == end()
<span class="lineNum"> 128 </span> : insert(end(), __new_size - __len, __x);
<span class="lineNum"> 129 </span> : }
<span class="lineNum"> 130 </span> :
<span class="lineNum"> 131 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 132 </span> : list<_Tp, _Alloc>&
<span class="lineNum"> 133 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 134 </span> : operator=(const list& __x)
<span class="lineNum"> 135 </span> : {
<span class="lineNum"> 136 </span> : if (this != &__x)
<span class="lineNum"> 137 </span> : {
<span class="lineNum"> 138 </span> : iterator __first1 = begin();
<span class="lineNum"> 139 </span> : iterator __last1 = end();
<span class="lineNum"> 140 </span> : const_iterator __first2 = __x.begin();
<span class="lineNum"> 141 </span> : const_iterator __last2 = __x.end();
<span class="lineNum"> 142 </span> : for (; __first1 != __last1 && __first2 != __last2;
<span class="lineNum"> 143 </span> : ++__first1, ++__first2)
<span class="lineNum"> 144 </span> : *__first1 = *__first2;
<span class="lineNum"> 145 </span> : if (__first2 == __last2)
<span class="lineNum"> 146 </span> : erase(__first1, __last1);
<span class="lineNum"> 147 </span> : else
<span class="lineNum"> 148 </span> : insert(__last1, __first2, __last2);
<span class="lineNum"> 149 </span> : }
<span class="lineNum"> 150 </span> : return *this;
<span class="lineNum"> 151 </span> : }
<span class="lineNum"> 152 </span> :
<span class="lineNum"> 153 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 154 </span> : void
<span class="lineNum"> 155 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 156 </span> : _M_fill_assign(size_type __n, const value_type& __val)
<span class="lineNum"> 157 </span> : {
<span class="lineNum"> 158 </span> : iterator __i = begin();
<span class="lineNum"> 159 </span> : for (; __i != end() && __n > 0; ++__i, --__n)
<span class="lineNum"> 160 </span> : *__i = __val;
<span class="lineNum"> 161 </span> : if (__n > 0)
<span class="lineNum"> 162 </span> : insert(end(), __n, __val);
<span class="lineNum"> 163 </span> : else
<span class="lineNum"> 164 </span> : erase(__i, end());
<span class="lineNum"> 165 </span> : }
<span class="lineNum"> 166 </span> :
<span class="lineNum"> 167 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 168 </span> : template <typename _InputIterator>
<span class="lineNum"> 169 </span> : void
<span class="lineNum"> 170 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 171 </span> : _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,
<span class="lineNum"> 172 </span> : __false_type)
<span class="lineNum"> 173 </span> : {
<span class="lineNum"> 174 </span> : iterator __first1 = begin();
<span class="lineNum"> 175 </span> : iterator __last1 = end();
<span class="lineNum"> 176 </span> : for (; __first1 != __last1 && __first2 != __last2;
<span class="lineNum"> 177 </span> : ++__first1, ++__first2)
<span class="lineNum"> 178 </span> : *__first1 = *__first2;
<span class="lineNum"> 179 </span> : if (__first2 == __last2)
<span class="lineNum"> 180 </span> : erase(__first1, __last1);
<span class="lineNum"> 181 </span> : else
<span class="lineNum"> 182 </span> : insert(__last1, __first2, __last2);
<span class="lineNum"> 183 </span> : }
<span class="lineNum"> 184 </span> :
<span class="lineNum"> 185 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 186 </span> : void
<span class="lineNum"> 187 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 188 </span> : remove(const value_type& __value)
<span class="lineNum"> 189 </span> : {
<span class="lineNum"> 190 </span> : iterator __first = begin();
<span class="lineNum"> 191 </span> : iterator __last = end();
<span class="lineNum"> 192 </span> : iterator __extra = __last;
<span class="lineNum"> 193 </span> : while (__first != __last)
<span class="lineNum"> 194 </span> : {
<span class="lineNum"> 195 </span> : iterator __next = __first;
<span class="lineNum"> 196 </span> : ++__next;
<span class="lineNum"> 197 </span> : if (*__first == __value)
<span class="lineNum"> 198 </span> : {
<span class="lineNum"> 199 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS
<span class="lineNum"> 200 </span> : // 526. Is it undefined if a function in the standard changes
<span class="lineNum"> 201 </span> : // in parameters?
<span class="lineNum"> 202 </span> : if (&*__first != &__value)
<span class="lineNum"> 203 </span> : _M_erase(__first);
<span class="lineNum"> 204 </span> : else
<span class="lineNum"> 205 </span> : __extra = __first;
<span class="lineNum"> 206 </span> : }
<span class="lineNum"> 207 </span> : __first = __next;
<span class="lineNum"> 208 </span> : }
<span class="lineNum"> 209 </span> : if (__extra != __last)
<span class="lineNum"> 210 </span> : _M_erase(__extra);
<span class="lineNum"> 211 </span> : }
<span class="lineNum"> 212 </span> :
<span class="lineNum"> 213 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 214 </span> : void
<span class="lineNum"> 215 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 216 </span> : unique()
<span class="lineNum"> 217 </span> : {
<span class="lineNum"> 218 </span> : iterator __first = begin();
<span class="lineNum"> 219 </span> : iterator __last = end();
<span class="lineNum"> 220 </span> : if (__first == __last)
<span class="lineNum"> 221 </span> : return;
<span class="lineNum"> 222 </span> : iterator __next = __first;
<span class="lineNum"> 223 </span> : while (++__next != __last)
<span class="lineNum"> 224 </span> : {
<span class="lineNum"> 225 </span> : if (*__first == *__next)
<span class="lineNum"> 226 </span> : _M_erase(__next);
<span class="lineNum"> 227 </span> : else
<span class="lineNum"> 228 </span> : __first = __next;
<span class="lineNum"> 229 </span> : __next = __first;
<span class="lineNum"> 230 </span> : }
<span class="lineNum"> 231 </span> : }
<span class="lineNum"> 232 </span> :
<span class="lineNum"> 233 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 234 </span> : void
<span class="lineNum"> 235 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 236 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 237 </span> : merge(list&& __x)
<span class="lineNum"> 238 </span> : #else
<span class="lineNum"> 239 </span> : merge(list& __x)
<span class="lineNum"> 240 </span> : #endif
<span class="lineNum"> 241 </span> : {
<span class="lineNum"> 242 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS
<span class="lineNum"> 243 </span> : // 300. list::merge() specification incomplete
<span class="lineNum"> 244 </span> : if (this != &__x)
<span class="lineNum"> 245 </span> : {
<span class="lineNum"> 246 </span> : _M_check_equal_allocators(__x);
<span class="lineNum"> 247 </span> :
<span class="lineNum"> 248 </span> : iterator __first1 = begin();
<span class="lineNum"> 249 </span> : iterator __last1 = end();
<span class="lineNum"> 250 </span> : iterator __first2 = __x.begin();
<span class="lineNum"> 251 </span> : iterator __last2 = __x.end();
<span class="lineNum"> 252 </span> : while (__first1 != __last1 && __first2 != __last2)
<span class="lineNum"> 253 </span> : if (*__first2 < *__first1)
<span class="lineNum"> 254 </span> : {
<span class="lineNum"> 255 </span> : iterator __next = __first2;
<span class="lineNum"> 256 </span> : _M_transfer(__first1, __first2, ++__next);
<span class="lineNum"> 257 </span> : __first2 = __next;
<span class="lineNum"> 258 </span> : }
<span class="lineNum"> 259 </span> : else
<span class="lineNum"> 260 </span> : ++__first1;
<span class="lineNum"> 261 </span> : if (__first2 != __last2)
<span class="lineNum"> 262 </span> : _M_transfer(__last1, __first2, __last2);
<span class="lineNum"> 263 </span> : }
<span class="lineNum"> 264 </span> : }
<span class="lineNum"> 265 </span> :
<span class="lineNum"> 266 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 267 </span> : template <typename _StrictWeakOrdering>
<span class="lineNum"> 268 </span> : void
<span class="lineNum"> 269 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 270 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 271 </span> : merge(list&& __x, _StrictWeakOrdering __comp)
<span class="lineNum"> 272 </span> : #else
<span class="lineNum"> 273 </span> : merge(list& __x, _StrictWeakOrdering __comp)
<span class="lineNum"> 274 </span> : #endif
<span class="lineNum"> 275 </span> : {
<span class="lineNum"> 276 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS
<span class="lineNum"> 277 </span> : // 300. list::merge() specification incomplete
<span class="lineNum"> 278 </span> : if (this != &__x)
<span class="lineNum"> 279 </span> : {
<span class="lineNum"> 280 </span> : _M_check_equal_allocators(__x);
<span class="lineNum"> 281 </span> :
<span class="lineNum"> 282 </span> : iterator __first1 = begin();
<span class="lineNum"> 283 </span> : iterator __last1 = end();
<span class="lineNum"> 284 </span> : iterator __first2 = __x.begin();
<span class="lineNum"> 285 </span> : iterator __last2 = __x.end();
<span class="lineNum"> 286 </span> : while (__first1 != __last1 && __first2 != __last2)
<span class="lineNum"> 287 </span> : if (__comp(*__first2, *__first1))
<span class="lineNum"> 288 </span> : {
<span class="lineNum"> 289 </span> : iterator __next = __first2;
<span class="lineNum"> 290 </span> : _M_transfer(__first1, __first2, ++__next);
<span class="lineNum"> 291 </span> : __first2 = __next;
<span class="lineNum"> 292 </span> : }
<span class="lineNum"> 293 </span> : else
<span class="lineNum"> 294 </span> : ++__first1;
<span class="lineNum"> 295 </span> : if (__first2 != __last2)
<span class="lineNum"> 296 </span> : _M_transfer(__last1, __first2, __last2);
<span class="lineNum"> 297 </span> : }
<span class="lineNum"> 298 </span> : }
<span class="lineNum"> 299 </span> :
<span class="lineNum"> 300 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 301 </span> : void
<span class="lineNum"> 302 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 303 </span> : sort()
<span class="lineNum"> 304 </span> : {
<span class="lineNum"> 305 </span> : // Do nothing if the list has length 0 or 1.
<span class="lineNum"> 306 </span> : if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node
<span class="lineNum"> 307 </span> : && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node)
<span class="lineNum"> 308 </span> : {
<span class="lineNum"> 309 </span> : list __carry;
<span class="lineNum"> 310 </span> : list __tmp[64];
<span class="lineNum"> 311 </span> : list * __fill = &__tmp[0];
<span class="lineNum"> 312 </span> : list * __counter;
<span class="lineNum"> 313 </span> :
<span class="lineNum"> 314 </span> : do
<span class="lineNum"> 315 </span> : {
<span class="lineNum"> 316 </span> : __carry.splice(__carry.begin(), *this, begin());
<span class="lineNum"> 317 </span> :
<span class="lineNum"> 318 </span> : for(__counter = &__tmp[0];
<span class="lineNum"> 319 </span> : __counter != __fill && !__counter->empty();
<span class="lineNum"> 320 </span> : ++__counter)
<span class="lineNum"> 321 </span> : {
<span class="lineNum"> 322 </span> : __counter->merge(__carry);
<span class="lineNum"> 323 </span> : __carry.swap(*__counter);
<span class="lineNum"> 324 </span> : }
<span class="lineNum"> 325 </span> : __carry.swap(*__counter);
<span class="lineNum"> 326 </span> : if (__counter == __fill)
<span class="lineNum"> 327 </span> : ++__fill;
<span class="lineNum"> 328 </span> : }
<span class="lineNum"> 329 </span> : while ( !empty() );
<span class="lineNum"> 330 </span> :
<span class="lineNum"> 331 </span> : for (__counter = &__tmp[1]; __counter != __fill; ++__counter)
<span class="lineNum"> 332 </span> : __counter->merge(*(__counter - 1));
<span class="lineNum"> 333 </span> : swap( *(__fill - 1) );
<span class="lineNum"> 334 </span> : }
<span class="lineNum"> 335 </span> : }
<span class="lineNum"> 336 </span> :
<span class="lineNum"> 337 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 338 </span> : template <typename _Predicate>
<span class="lineNum"> 339 </span> : void
<span class="lineNum"> 340 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 341 </span> : remove_if(_Predicate __pred)
<span class="lineNum"> 342 </span> : {
<span class="lineNum"> 343 </span> : iterator __first = begin();
<span class="lineNum"> 344 </span> : iterator __last = end();
<span class="lineNum"> 345 </span> : while (__first != __last)
<span class="lineNum"> 346 </span> : {
<span class="lineNum"> 347 </span> : iterator __next = __first;
<span class="lineNum"> 348 </span> : ++__next;
<span class="lineNum"> 349 </span> : if (__pred(*__first))
<span class="lineNum"> 350 </span> : _M_erase(__first);
<span class="lineNum"> 351 </span> : __first = __next;
<span class="lineNum"> 352 </span> : }
<span class="lineNum"> 353 </span> : }
<span class="lineNum"> 354 </span> :
<span class="lineNum"> 355 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 356 </span> : template <typename _BinaryPredicate>
<span class="lineNum"> 357 </span> : void
<span class="lineNum"> 358 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 359 </span> : unique(_BinaryPredicate __binary_pred)
<span class="lineNum"> 360 </span> : {
<span class="lineNum"> 361 </span> : iterator __first = begin();
<span class="lineNum"> 362 </span> : iterator __last = end();
<span class="lineNum"> 363 </span> : if (__first == __last)
<span class="lineNum"> 364 </span> : return;
<span class="lineNum"> 365 </span> : iterator __next = __first;
<span class="lineNum"> 366 </span> : while (++__next != __last)
<span class="lineNum"> 367 </span> : {
<span class="lineNum"> 368 </span> : if (__binary_pred(*__first, *__next))
<span class="lineNum"> 369 </span> : _M_erase(__next);
<span class="lineNum"> 370 </span> : else
<span class="lineNum"> 371 </span> : __first = __next;
<span class="lineNum"> 372 </span> : __next = __first;
<span class="lineNum"> 373 </span> : }
<span class="lineNum"> 374 </span> : }
<span class="lineNum"> 375 </span> :
<span class="lineNum"> 376 </span> : template<typename _Tp, typename _Alloc>
<span class="lineNum"> 377 </span> : template <typename _StrictWeakOrdering>
<span class="lineNum"> 378 </span> : void
<span class="lineNum"> 379 </span> : list<_Tp, _Alloc>::
<span class="lineNum"> 380 </span> : sort(_StrictWeakOrdering __comp)
<span class="lineNum"> 381 </span> : {
<span class="lineNum"> 382 </span> : // Do nothing if the list has length 0 or 1.
<span class="lineNum"> 383 </span> : if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node
<span class="lineNum"> 384 </span> : && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node)
<span class="lineNum"> 385 </span> : {
<span class="lineNum"> 386 </span> : list __carry;
<span class="lineNum"> 387 </span> : list __tmp[64];
<span class="lineNum"> 388 </span> : list * __fill = &__tmp[0];
<span class="lineNum"> 389 </span> : list * __counter;
<span class="lineNum"> 390 </span> :
<span class="lineNum"> 391 </span> : do
<span class="lineNum"> 392 </span> : {
<span class="lineNum"> 393 </span> : __carry.splice(__carry.begin(), *this, begin());
<span class="lineNum"> 394 </span> :
<span class="lineNum"> 395 </span> : for(__counter = &__tmp[0];
<span class="lineNum"> 396 </span> : __counter != __fill && !__counter->empty();
<span class="lineNum"> 397 </span> : ++__counter)
<span class="lineNum"> 398 </span> : {
<span class="lineNum"> 399 </span> : __counter->merge(__carry, __comp);
<span class="lineNum"> 400 </span> : __carry.swap(*__counter);
<span class="lineNum"> 401 </span> : }
<span class="lineNum"> 402 </span> : __carry.swap(*__counter);
<span class="lineNum"> 403 </span> : if (__counter == __fill)
<span class="lineNum"> 404 </span> : ++__fill;
<span class="lineNum"> 405 </span> : }
<span class="lineNum"> 406 </span> : while ( !empty() );
<span class="lineNum"> 407 </span> :
<span class="lineNum"> 408 </span> : for (__counter = &__tmp[1]; __counter != __fill; ++__counter)
<span class="lineNum"> 409 </span> : __counter->merge(*(__counter - 1), __comp);
<span class="lineNum"> 410 </span> : swap(*(__fill - 1));
<span class="lineNum"> 411 </span> : }
<span class="lineNum"> 412 </span> : }
<span class="lineNum"> 413 </span> :
<span class="lineNum"> 414 </span> : _GLIBCXX_END_NESTED_NAMESPACE
<span class="lineNum"> 415 </span> :
<span class="lineNum"> 416 </span> : #endif /* _LIST_TCC */
<span class="lineNum"> 417 </span> :
</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>
|
