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
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
|
<!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_set.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_set.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%">33</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%">33</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> : // Set implementation -*- C++ -*-
<span class="lineNum"> 2 </span> :
<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
<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_set.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_SET_H
<span class="lineNum"> 63 </span> : #define _STL_SET_H 1
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span> : #include <bits/concept_check.h>
<span class="lineNum"> 66 </span> :
<span class="lineNum"> 67 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
<span class="lineNum"> 68 </span> :
<span class="lineNum"> 69 </span> : /**
<span class="lineNum"> 70 </span> : * @brief A standard container made up of unique keys, which can be
<span class="lineNum"> 71 </span> : * retrieved in logarithmic time.
<span class="lineNum"> 72 </span> : *
<span class="lineNum"> 73 </span> : * @ingroup Containers
<span class="lineNum"> 74 </span> : * @ingroup Assoc_containers
<span class="lineNum"> 75 </span> : *
<span class="lineNum"> 76 </span> : * Meets the requirements of a <a href="tables.html#65">container</a>, a
<span class="lineNum"> 77 </span> : * <a href="tables.html#66">reversible container</a>, and an
<span class="lineNum"> 78 </span> : * <a href="tables.html#69">associative container</a> (using unique keys).
<span class="lineNum"> 79 </span> : *
<span class="lineNum"> 80 </span> : * Sets support bidirectional iterators.
<span class="lineNum"> 81 </span> : *
<span class="lineNum"> 82 </span> : * @param Key Type of key objects.
<span class="lineNum"> 83 </span> : * @param Compare Comparison function object type, defaults to less<Key>.
<span class="lineNum"> 84 </span> : * @param Alloc Allocator type, defaults to allocator<Key>.
<span class="lineNum"> 85 </span> : *
<span class="lineNum"> 86 </span> : * The private tree data is declared exactly the same way for set and
<span class="lineNum"> 87 </span> : * multiset; the distinction is made entirely in how the tree functions are
<span class="lineNum"> 88 </span> : * called (*_unique versus *_equal, same as the standard).
<span class="lineNum"> 89 </span> : */
<span class="lineNum"> 90 </span> : template<typename _Key, typename _Compare = std::less<_Key>,
<span class="lineNum"> 91 </span> : typename _Alloc = std::allocator<_Key> >
<span class="lineNum"> 92 </span> : class set
<span class="lineNum"> 93 </span><span class="lineCov"> 1308625 : {</span>
<span class="lineNum"> 94 </span> : // concept requirements
<span class="lineNum"> 95 </span> : typedef typename _Alloc::value_type _Alloc_value_type;
<span class="lineNum"> 96 </span> : __glibcxx_class_requires(_Key, _SGIAssignableConcept)
<span class="lineNum"> 97 </span> : __glibcxx_class_requires4(_Compare, bool, _Key, _Key,
<span class="lineNum"> 98 </span> : _BinaryFunctionConcept)
<span class="lineNum"> 99 </span> : __glibcxx_class_requires2(_Key, _Alloc_value_type, _SameTypeConcept)
<span class="lineNum"> 100 </span> :
<span class="lineNum"> 101 </span> : public:
<span class="lineNum"> 102 </span> : // typedefs:
<span class="lineNum"> 103 </span> : //@{
<span class="lineNum"> 104 </span> : /// Public typedefs.
<span class="lineNum"> 105 </span> : typedef _Key key_type;
<span class="lineNum"> 106 </span> : typedef _Key value_type;
<span class="lineNum"> 107 </span> : typedef _Compare key_compare;
<span class="lineNum"> 108 </span> : typedef _Compare value_compare;
<span class="lineNum"> 109 </span> : typedef _Alloc allocator_type;
<span class="lineNum"> 110 </span> : //@}
<span class="lineNum"> 111 </span> :
<span class="lineNum"> 112 </span> : private:
<span class="lineNum"> 113 </span> : typedef typename _Alloc::template rebind<_Key>::other _Key_alloc_type;
<span class="lineNum"> 114 </span> :
<span class="lineNum"> 115 </span> : typedef _Rb_tree<key_type, value_type, _Identity<value_type>,
<span class="lineNum"> 116 </span> : key_compare, _Key_alloc_type> _Rep_type;
<span class="lineNum"> 117 </span> : _Rep_type _M_t; // Red-black tree representing set.
<span class="lineNum"> 118 </span> :
<span class="lineNum"> 119 </span> : public:
<span class="lineNum"> 120 </span> : //@{
<span class="lineNum"> 121 </span> : /// Iterator-related typedefs.
<span class="lineNum"> 122 </span> : typedef typename _Key_alloc_type::pointer pointer;
<span class="lineNum"> 123 </span> : typedef typename _Key_alloc_type::const_pointer const_pointer;
<span class="lineNum"> 124 </span> : typedef typename _Key_alloc_type::reference reference;
<span class="lineNum"> 125 </span> : typedef typename _Key_alloc_type::const_reference const_reference;
<span class="lineNum"> 126 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS
<span class="lineNum"> 127 </span> : // DR 103. set::iterator is required to be modifiable,
<span class="lineNum"> 128 </span> : // but this allows modification of keys.
<span class="lineNum"> 129 </span> : typedef typename _Rep_type::const_iterator iterator;
<span class="lineNum"> 130 </span> : typedef typename _Rep_type::const_iterator const_iterator;
<span class="lineNum"> 131 </span> : typedef typename _Rep_type::const_reverse_iterator reverse_iterator;
<span class="lineNum"> 132 </span> : typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
<span class="lineNum"> 133 </span> : typedef typename _Rep_type::size_type size_type;
<span class="lineNum"> 134 </span> : typedef typename _Rep_type::difference_type difference_type;
<span class="lineNum"> 135 </span> : //@}
<span class="lineNum"> 136 </span> :
<span class="lineNum"> 137 </span> : // allocation/deallocation
<span class="lineNum"> 138 </span> : /**
<span class="lineNum"> 139 </span> : * @brief Default constructor creates no elements.
<span class="lineNum"> 140 </span> : */
<span class="lineNum"> 141 </span><span class="lineCov"> 277740 : set()</span>
<span class="lineNum"> 142 </span><span class="lineCov"> 277740 : : _M_t() { }</span>
<span class="lineNum"> 143 </span> :
<span class="lineNum"> 144 </span> : /**
<span class="lineNum"> 145 </span> : * @brief Creates a %set with no elements.
<span class="lineNum"> 146 </span> : * @param comp Comparator to use.
<span class="lineNum"> 147 </span> : * @param a An allocator object.
<span class="lineNum"> 148 </span> : */
<span class="lineNum"> 149 </span> : explicit
<span class="lineNum"> 150 </span> : set(const _Compare& __comp,
<span class="lineNum"> 151 </span> : const allocator_type& __a = allocator_type())
<span class="lineNum"> 152 </span> : : _M_t(__comp, __a) { }
<span class="lineNum"> 153 </span> :
<span class="lineNum"> 154 </span> : /**
<span class="lineNum"> 155 </span> : * @brief Builds a %set from a range.
<span class="lineNum"> 156 </span> : * @param first An input iterator.
<span class="lineNum"> 157 </span> : * @param last An input iterator.
<span class="lineNum"> 158 </span> : *
<span class="lineNum"> 159 </span> : * Create a %set consisting of copies of the elements from [first,last).
<span class="lineNum"> 160 </span> : * This is linear in N if the range is already sorted, and NlogN
<span class="lineNum"> 161 </span> : * otherwise (where N is distance(first,last)).
<span class="lineNum"> 162 </span> : */
<span class="lineNum"> 163 </span> : template<typename _InputIterator>
<span class="lineNum"> 164 </span> : set(_InputIterator __first, _InputIterator __last)
<span class="lineNum"> 165 </span> : : _M_t()
<span class="lineNum"> 166 </span> : { _M_t._M_insert_unique(__first, __last); }
<span class="lineNum"> 167 </span> :
<span class="lineNum"> 168 </span> : /**
<span class="lineNum"> 169 </span> : * @brief Builds a %set from a range.
<span class="lineNum"> 170 </span> : * @param first An input iterator.
<span class="lineNum"> 171 </span> : * @param last An input iterator.
<span class="lineNum"> 172 </span> : * @param comp A comparison functor.
<span class="lineNum"> 173 </span> : * @param a An allocator object.
<span class="lineNum"> 174 </span> : *
<span class="lineNum"> 175 </span> : * Create a %set consisting of copies of the elements from [first,last).
<span class="lineNum"> 176 </span> : * This is linear in N if the range is already sorted, and NlogN
<span class="lineNum"> 177 </span> : * otherwise (where N is distance(first,last)).
<span class="lineNum"> 178 </span> : */
<span class="lineNum"> 179 </span> : template<typename _InputIterator>
<span class="lineNum"> 180 </span> : set(_InputIterator __first, _InputIterator __last,
<span class="lineNum"> 181 </span> : const _Compare& __comp,
<span class="lineNum"> 182 </span> : const allocator_type& __a = allocator_type())
<span class="lineNum"> 183 </span> : : _M_t(__comp, __a)
<span class="lineNum"> 184 </span> : { _M_t._M_insert_unique(__first, __last); }
<span class="lineNum"> 185 </span> :
<span class="lineNum"> 186 </span> : /**
<span class="lineNum"> 187 </span> : * @brief %Set copy constructor.
<span class="lineNum"> 188 </span> : * @param x A %set of identical element and allocator types.
<span class="lineNum"> 189 </span> : *
<span class="lineNum"> 190 </span> : * The newly-created %set uses a copy of the allocation object used
<span class="lineNum"> 191 </span> : * by @a x.
<span class="lineNum"> 192 </span> : */
<span class="lineNum"> 193 </span><span class="lineCov"> 925151 : set(const set& __x)</span>
<span class="lineNum"> 194 </span><span class="lineCov"> 925151 : : _M_t(__x._M_t) { }</span>
<span class="lineNum"> 195 </span> :
<span class="lineNum"> 196 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 197 </span> : /**
<span class="lineNum"> 198 </span> : * @brief %Set move constructor
<span class="lineNum"> 199 </span> : * @param x A %set of identical element and allocator types.
<span class="lineNum"> 200 </span> : *
<span class="lineNum"> 201 </span> : * The newly-created %set contains the exact contents of @a x.
<span class="lineNum"> 202 </span> : * The contents of @a x are a valid, but unspecified %set.
<span class="lineNum"> 203 </span> : */
<span class="lineNum"> 204 </span> : set(set&& __x)
<span class="lineNum"> 205 </span> : : _M_t(std::forward<_Rep_type>(__x._M_t)) { }
<span class="lineNum"> 206 </span> : #endif
<span class="lineNum"> 207 </span> :
<span class="lineNum"> 208 </span> : /**
<span class="lineNum"> 209 </span> : * @brief %Set assignment operator.
<span class="lineNum"> 210 </span> : * @param x A %set of identical element and allocator types.
<span class="lineNum"> 211 </span> : *
<span class="lineNum"> 212 </span> : * All the elements of @a x are copied, but unlike the copy constructor,
<span class="lineNum"> 213 </span> : * the allocator object is not copied.
<span class="lineNum"> 214 </span> : */
<span class="lineNum"> 215 </span> : set&
<span class="lineNum"> 216 </span><span class="lineCov"> 80 : operator=(const set& __x)</span>
<span class="lineNum"> 217 </span> : {
<span class="lineNum"> 218 </span><span class="lineCov"> 80 : _M_t = __x._M_t;</span>
<span class="lineNum"> 219 </span><span class="lineCov"> 80 : return *this;</span>
<span class="lineNum"> 220 </span> : }
<span class="lineNum"> 221 </span> :
<span class="lineNum"> 222 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 223 </span> : /**
<span class="lineNum"> 224 </span> : * @brief %Set move assignment operator.
<span class="lineNum"> 225 </span> : * @param x A %set of identical element and allocator types.
<span class="lineNum"> 226 </span> : *
<span class="lineNum"> 227 </span> : * The contents of @a x are moved into this %set (without copying).
<span class="lineNum"> 228 </span> : * @a x is a valid, but unspecified %set.
<span class="lineNum"> 229 </span> : */
<span class="lineNum"> 230 </span> : set&
<span class="lineNum"> 231 </span> : operator=(set&& __x)
<span class="lineNum"> 232 </span> : {
<span class="lineNum"> 233 </span> : // NB: DR 675.
<span class="lineNum"> 234 </span> : this->clear();
<span class="lineNum"> 235 </span> : this->swap(__x);
<span class="lineNum"> 236 </span> : return *this;
<span class="lineNum"> 237 </span> : }
<span class="lineNum"> 238 </span> : #endif
<span class="lineNum"> 239 </span> :
<span class="lineNum"> 240 </span> : // accessors:
<span class="lineNum"> 241 </span> :
<span class="lineNum"> 242 </span> : /// Returns the comparison object with which the %set was constructed.
<span class="lineNum"> 243 </span> : key_compare
<span class="lineNum"> 244 </span> : key_comp() const
<span class="lineNum"> 245 </span> : { return _M_t.key_comp(); }
<span class="lineNum"> 246 </span> : /// Returns the comparison object with which the %set was constructed.
<span class="lineNum"> 247 </span> : value_compare
<span class="lineNum"> 248 </span> : value_comp() const
<span class="lineNum"> 249 </span> : { return _M_t.key_comp(); }
<span class="lineNum"> 250 </span> : /// Returns the allocator object with which the %set was constructed.
<span class="lineNum"> 251 </span> : allocator_type
<span class="lineNum"> 252 </span> : get_allocator() const
<span class="lineNum"> 253 </span> : { return _M_t.get_allocator(); }
<span class="lineNum"> 254 </span> :
<span class="lineNum"> 255 </span> : /**
<span class="lineNum"> 256 </span> : * Returns a read-only (constant) iterator that points to the first
<span class="lineNum"> 257 </span> : * element in the %set. Iteration is done in ascending order according
<span class="lineNum"> 258 </span> : * to the keys.
<span class="lineNum"> 259 </span> : */
<span class="lineNum"> 260 </span> : iterator
<span class="lineNum"> 261 </span><span class="lineCov"> 468023 : begin() const</span>
<span class="lineNum"> 262 </span><span class="lineCov"> 468023 : { return _M_t.begin(); }</span>
<span class="lineNum"> 263 </span> :
<span class="lineNum"> 264 </span> : /**
<span class="lineNum"> 265 </span> : * Returns a read-only (constant) iterator that points one past the last
<span class="lineNum"> 266 </span> : * element in the %set. Iteration is done in ascending order according
<span class="lineNum"> 267 </span> : * to the keys.
<span class="lineNum"> 268 </span> : */
<span class="lineNum"> 269 </span> : iterator
<span class="lineNum"> 270 </span><span class="lineCov"> 1576796 : end() const</span>
<span class="lineNum"> 271 </span><span class="lineCov"> 1576796 : { return _M_t.end(); }</span>
<span class="lineNum"> 272 </span> :
<span class="lineNum"> 273 </span> : /**
<span class="lineNum"> 274 </span> : * Returns a read-only (constant) iterator that points to the last
<span class="lineNum"> 275 </span> : * element in the %set. Iteration is done in descending order according
<span class="lineNum"> 276 </span> : * to the keys.
<span class="lineNum"> 277 </span> : */
<span class="lineNum"> 278 </span> : reverse_iterator
<span class="lineNum"> 279 </span> : rbegin() const
<span class="lineNum"> 280 </span> : { return _M_t.rbegin(); }
<span class="lineNum"> 281 </span> :
<span class="lineNum"> 282 </span> : /**
<span class="lineNum"> 283 </span> : * Returns a read-only (constant) reverse iterator that points to the
<span class="lineNum"> 284 </span> : * last pair in the %set. Iteration is done in descending order
<span class="lineNum"> 285 </span> : * according to the keys.
<span class="lineNum"> 286 </span> : */
<span class="lineNum"> 287 </span> : reverse_iterator
<span class="lineNum"> 288 </span> : rend() const
<span class="lineNum"> 289 </span> : { return _M_t.rend(); }
<span class="lineNum"> 290 </span> :
<span class="lineNum"> 291 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 292 </span> : /**
<span class="lineNum"> 293 </span> : * Returns a read-only (constant) iterator that points to the first
<span class="lineNum"> 294 </span> : * element in the %set. Iteration is done in ascending order according
<span class="lineNum"> 295 </span> : * to the keys.
<span class="lineNum"> 296 </span> : */
<span class="lineNum"> 297 </span> : iterator
<span class="lineNum"> 298 </span> : cbegin() const
<span class="lineNum"> 299 </span> : { return _M_t.begin(); }
<span class="lineNum"> 300 </span> :
<span class="lineNum"> 301 </span> : /**
<span class="lineNum"> 302 </span> : * Returns a read-only (constant) iterator that points one past the last
<span class="lineNum"> 303 </span> : * element in the %set. Iteration is done in ascending order according
<span class="lineNum"> 304 </span> : * to the keys.
<span class="lineNum"> 305 </span> : */
<span class="lineNum"> 306 </span> : iterator
<span class="lineNum"> 307 </span> : cend() const
<span class="lineNum"> 308 </span> : { return _M_t.end(); }
<span class="lineNum"> 309 </span> :
<span class="lineNum"> 310 </span> : /**
<span class="lineNum"> 311 </span> : * Returns a read-only (constant) iterator that points to the last
<span class="lineNum"> 312 </span> : * element in the %set. Iteration is done in descending order according
<span class="lineNum"> 313 </span> : * to the keys.
<span class="lineNum"> 314 </span> : */
<span class="lineNum"> 315 </span> : reverse_iterator
<span class="lineNum"> 316 </span> : crbegin() const
<span class="lineNum"> 317 </span> : { return _M_t.rbegin(); }
<span class="lineNum"> 318 </span> :
<span class="lineNum"> 319 </span> : /**
<span class="lineNum"> 320 </span> : * Returns a read-only (constant) reverse iterator that points to the
<span class="lineNum"> 321 </span> : * last pair in the %set. Iteration is done in descending order
<span class="lineNum"> 322 </span> : * according to the keys.
<span class="lineNum"> 323 </span> : */
<span class="lineNum"> 324 </span> : reverse_iterator
<span class="lineNum"> 325 </span> : crend() const
<span class="lineNum"> 326 </span> : { return _M_t.rend(); }
<span class="lineNum"> 327 </span> : #endif
<span class="lineNum"> 328 </span> :
<span class="lineNum"> 329 </span> : /// Returns true if the %set is empty.
<span class="lineNum"> 330 </span> : bool
<span class="lineNum"> 331 </span><span class="lineCov"> 338386 : empty() const</span>
<span class="lineNum"> 332 </span><span class="lineCov"> 338386 : { return _M_t.empty(); }</span>
<span class="lineNum"> 333 </span> :
<span class="lineNum"> 334 </span> : /// Returns the size of the %set.
<span class="lineNum"> 335 </span> : size_type
<span class="lineNum"> 336 </span><span class="lineCov"> 84631 : size() const</span>
<span class="lineNum"> 337 </span><span class="lineCov"> 84631 : { return _M_t.size(); }</span>
<span class="lineNum"> 338 </span> :
<span class="lineNum"> 339 </span> : /// Returns the maximum size of the %set.
<span class="lineNum"> 340 </span> : size_type
<span class="lineNum"> 341 </span> : max_size() const
<span class="lineNum"> 342 </span> : { return _M_t.max_size(); }
<span class="lineNum"> 343 </span> :
<span class="lineNum"> 344 </span> : /**
<span class="lineNum"> 345 </span> : * @brief Swaps data with another %set.
<span class="lineNum"> 346 </span> : * @param x A %set of the same element and allocator types.
<span class="lineNum"> 347 </span> : *
<span class="lineNum"> 348 </span> : * This exchanges the elements between two sets in constant time.
<span class="lineNum"> 349 </span> : * (It is only swapping a pointer, an integer, and an instance of
<span class="lineNum"> 350 </span> : * the @c Compare type (which itself is often stateless and empty), so it
<span class="lineNum"> 351 </span> : * should be quite fast.)
<span class="lineNum"> 352 </span> : * Note that the global std::swap() function is specialized such that
<span class="lineNum"> 353 </span> : * std::swap(s1,s2) will feed to this function.
<span class="lineNum"> 354 </span> : */
<span class="lineNum"> 355 </span> : void
<span class="lineNum"> 356 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 357 </span> : swap(set&& __x)
<span class="lineNum"> 358 </span> : #else
<span class="lineNum"> 359 </span> : swap(set& __x)
<span class="lineNum"> 360 </span> : #endif
<span class="lineNum"> 361 </span> : { _M_t.swap(__x._M_t); }
<span class="lineNum"> 362 </span> :
<span class="lineNum"> 363 </span> : // insert/erase
<span class="lineNum"> 364 </span> : /**
<span class="lineNum"> 365 </span> : * @brief Attempts to insert an element into the %set.
<span class="lineNum"> 366 </span> : * @param x Element to be inserted.
<span class="lineNum"> 367 </span> : * @return A pair, of which the first element is an iterator that points
<span class="lineNum"> 368 </span> : * to the possibly inserted element, and the second is a bool
<span class="lineNum"> 369 </span> : * that is true if the element was actually inserted.
<span class="lineNum"> 370 </span> : *
<span class="lineNum"> 371 </span> : * This function attempts to insert an element into the %set. A %set
<span class="lineNum"> 372 </span> : * relies on unique keys and thus an element is only inserted if it is
<span class="lineNum"> 373 </span> : * not already present in the %set.
<span class="lineNum"> 374 </span> : *
<span class="lineNum"> 375 </span> : * Insertion requires logarithmic time.
<span class="lineNum"> 376 </span> : */
<span class="lineNum"> 377 </span> : std::pair<iterator, bool>
<span class="lineNum"> 378 </span><span class="lineCov"> 1422360 : insert(const value_type& __x)</span>
<span class="lineNum"> 379 </span> : {
<span class="lineNum"> 380 </span> : std::pair<typename _Rep_type::iterator, bool> __p =
<span class="lineNum"> 381 </span><span class="lineCov"> 1422360 : _M_t._M_insert_unique(__x);</span>
<span class="lineNum"> 382 </span><span class="lineCov"> 1422360 : return std::pair<iterator, bool>(__p.first, __p.second);</span>
<span class="lineNum"> 383 </span> : }
<span class="lineNum"> 384 </span> :
<span class="lineNum"> 385 </span> : /**
<span class="lineNum"> 386 </span> : * @brief Attempts to insert an element into the %set.
<span class="lineNum"> 387 </span> : * @param position An iterator that serves as a hint as to where the
<span class="lineNum"> 388 </span> : * element should be inserted.
<span class="lineNum"> 389 </span> : * @param x Element to be inserted.
<span class="lineNum"> 390 </span> : * @return An iterator that points to the element with key of @a x (may
<span class="lineNum"> 391 </span> : * or may not be the element passed in).
<span class="lineNum"> 392 </span> : *
<span class="lineNum"> 393 </span> : * This function is not concerned about whether the insertion took place,
<span class="lineNum"> 394 </span> : * and thus does not return a boolean like the single-argument insert()
<span class="lineNum"> 395 </span> : * does. Note that the first parameter is only a hint and can
<span class="lineNum"> 396 </span> : * potentially improve the performance of the insertion process. A bad
<span class="lineNum"> 397 </span> : * hint would cause no gains in efficiency.
<span class="lineNum"> 398 </span> : *
<span class="lineNum"> 399 </span> : * See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4
<span class="lineNum"> 400 </span> : * for more on "hinting".
<span class="lineNum"> 401 </span> : *
<span class="lineNum"> 402 </span> : * Insertion requires logarithmic time (if the hint is not taken).
<span class="lineNum"> 403 </span> : */
<span class="lineNum"> 404 </span> : iterator
<span class="lineNum"> 405 </span><span class="lineCov"> 107613 : insert(iterator __position, const value_type& __x)</span>
<span class="lineNum"> 406 </span><span class="lineCov"> 107613 : { return _M_t._M_insert_unique_(__position, __x); }</span>
<span class="lineNum"> 407 </span> :
<span class="lineNum"> 408 </span> : /**
<span class="lineNum"> 409 </span> : * @brief A template function that attempts to insert a range of elements.
<span class="lineNum"> 410 </span> : * @param first Iterator pointing to the start of the range to be
<span class="lineNum"> 411 </span> : * inserted.
<span class="lineNum"> 412 </span> : * @param last Iterator pointing to the end of the range.
<span class="lineNum"> 413 </span> : *
<span class="lineNum"> 414 </span> : * Complexity similar to that of the range constructor.
<span class="lineNum"> 415 </span> : */
<span class="lineNum"> 416 </span> : template<typename _InputIterator>
<span class="lineNum"> 417 </span> : void
<span class="lineNum"> 418 </span> : insert(_InputIterator __first, _InputIterator __last)
<span class="lineNum"> 419 </span> : { _M_t._M_insert_unique(__first, __last); }
<span class="lineNum"> 420 </span> :
<span class="lineNum"> 421 </span> : /**
<span class="lineNum"> 422 </span> : * @brief Erases an element from a %set.
<span class="lineNum"> 423 </span> : * @param position An iterator pointing to the element to be erased.
<span class="lineNum"> 424 </span> : *
<span class="lineNum"> 425 </span> : * This function erases an element, pointed to by the given iterator,
<span class="lineNum"> 426 </span> : * from a %set. Note that this function only erases the element, and
<span class="lineNum"> 427 </span> : * that if the element is itself a pointer, the pointed-to memory is not
<span class="lineNum"> 428 </span> : * touched in any way. Managing the pointer is the user's responsibility.
<span class="lineNum"> 429 </span> : */
<span class="lineNum"> 430 </span> : void
<span class="lineNum"> 431 </span><span class="lineCov"> 129 : erase(iterator __position)</span>
<span class="lineNum"> 432 </span><span class="lineCov"> 129 : { _M_t.erase(__position); }</span>
<span class="lineNum"> 433 </span> :
<span class="lineNum"> 434 </span> : /**
<span class="lineNum"> 435 </span> : * @brief Erases elements according to the provided key.
<span class="lineNum"> 436 </span> : * @param x Key of element to be erased.
<span class="lineNum"> 437 </span> : * @return The number of elements erased.
<span class="lineNum"> 438 </span> : *
<span class="lineNum"> 439 </span> : * This function erases all the elements located by the given key from
<span class="lineNum"> 440 </span> : * a %set.
<span class="lineNum"> 441 </span> : * Note that this function only erases the element, and that if
<span class="lineNum"> 442 </span> : * the element is itself a pointer, the pointed-to memory is not touched
<span class="lineNum"> 443 </span> : * in any way. Managing the pointer is the user's responsibility.
<span class="lineNum"> 444 </span> : */
<span class="lineNum"> 445 </span> : size_type
<span class="lineNum"> 446 </span><span class="lineCov"> 9 : erase(const key_type& __x)</span>
<span class="lineNum"> 447 </span><span class="lineCov"> 9 : { return _M_t.erase(__x); }</span>
<span class="lineNum"> 448 </span> :
<span class="lineNum"> 449 </span> : /**
<span class="lineNum"> 450 </span> : * @brief Erases a [first,last) range of elements from a %set.
<span class="lineNum"> 451 </span> : * @param first Iterator pointing to the start of the range to be
<span class="lineNum"> 452 </span> : * erased.
<span class="lineNum"> 453 </span> : * @param last Iterator pointing to the end of the range to be erased.
<span class="lineNum"> 454 </span> : *
<span class="lineNum"> 455 </span> : * This function erases a sequence of elements from a %set.
<span class="lineNum"> 456 </span> : * Note that this function only erases the element, and that if
<span class="lineNum"> 457 </span> : * the element is itself a pointer, the pointed-to memory is not touched
<span class="lineNum"> 458 </span> : * in any way. Managing the pointer is the user's responsibility.
<span class="lineNum"> 459 </span> : */
<span class="lineNum"> 460 </span> : void
<span class="lineNum"> 461 </span> : erase(iterator __first, iterator __last)
<span class="lineNum"> 462 </span> : { _M_t.erase(__first, __last); }
<span class="lineNum"> 463 </span> :
<span class="lineNum"> 464 </span> : /**
<span class="lineNum"> 465 </span> : * Erases all elements in a %set. Note that this function only erases
<span class="lineNum"> 466 </span> : * the elements, and that if the elements themselves are pointers, the
<span class="lineNum"> 467 </span> : * pointed-to memory is not touched in any way. Managing the pointer is
<span class="lineNum"> 468 </span> : * the user's responsibility.
<span class="lineNum"> 469 </span> : */
<span class="lineNum"> 470 </span> : void
<span class="lineNum"> 471 </span><span class="lineCov"> 84600 : clear()</span>
<span class="lineNum"> 472 </span><span class="lineCov"> 84600 : { _M_t.clear(); }</span>
<span class="lineNum"> 473 </span> :
<span class="lineNum"> 474 </span> : // set operations:
<span class="lineNum"> 475 </span> :
<span class="lineNum"> 476 </span> : /**
<span class="lineNum"> 477 </span> : * @brief Finds the number of elements.
<span class="lineNum"> 478 </span> : * @param x Element to located.
<span class="lineNum"> 479 </span> : * @return Number of elements with specified key.
<span class="lineNum"> 480 </span> : *
<span class="lineNum"> 481 </span> : * This function only makes sense for multisets; for set the result will
<span class="lineNum"> 482 </span> : * either be 0 (not present) or 1 (present).
<span class="lineNum"> 483 </span> : */
<span class="lineNum"> 484 </span> : size_type
<span class="lineNum"> 485 </span> : count(const key_type& __x) const
<span class="lineNum"> 486 </span> : { return _M_t.find(__x) == _M_t.end() ? 0 : 1; }
<span class="lineNum"> 487 </span> :
<span class="lineNum"> 488 </span> : // _GLIBCXX_RESOLVE_LIB_DEFECTS
<span class="lineNum"> 489 </span> : // 214. set::find() missing const overload
<span class="lineNum"> 490 </span> : //@{
<span class="lineNum"> 491 </span> : /**
<span class="lineNum"> 492 </span> : * @brief Tries to locate an element in a %set.
<span class="lineNum"> 493 </span> : * @param x Element to be located.
<span class="lineNum"> 494 </span> : * @return Iterator pointing to sought-after element, or end() if not
<span class="lineNum"> 495 </span> : * found.
<span class="lineNum"> 496 </span> : *
<span class="lineNum"> 497 </span> : * This function takes a key and tries to locate the element with which
<span class="lineNum"> 498 </span> : * the key matches. If successful the function returns an iterator
<span class="lineNum"> 499 </span> : * pointing to the sought after element. If unsuccessful it returns the
<span class="lineNum"> 500 </span> : * past-the-end ( @c end() ) iterator.
<span class="lineNum"> 501 </span> : */
<span class="lineNum"> 502 </span> : iterator
<span class="lineNum"> 503 </span><span class="lineCov"> 39 : find(const key_type& __x)</span>
<span class="lineNum"> 504 </span><span class="lineCov"> 39 : { return _M_t.find(__x); }</span>
<span class="lineNum"> 505 </span> :
<span class="lineNum"> 506 </span> : const_iterator
<span class="lineNum"> 507 </span><span class="lineCov"> 16 : find(const key_type& __x) const</span>
<span class="lineNum"> 508 </span><span class="lineCov"> 16 : { return _M_t.find(__x); }</span>
<span class="lineNum"> 509 </span> : //@}
<span class="lineNum"> 510 </span> :
<span class="lineNum"> 511 </span> : //@{
<span class="lineNum"> 512 </span> : /**
<span class="lineNum"> 513 </span> : * @brief Finds the beginning of a subsequence matching given key.
<span class="lineNum"> 514 </span> : * @param x Key to be located.
<span class="lineNum"> 515 </span> : * @return Iterator pointing to first element equal to or greater
<span class="lineNum"> 516 </span> : * than key, or end().
<span class="lineNum"> 517 </span> : *
<span class="lineNum"> 518 </span> : * This function returns the first element of a subsequence of elements
<span class="lineNum"> 519 </span> : * that matches the given key. If unsuccessful it returns an iterator
<span class="lineNum"> 520 </span> : * pointing to the first element that has a greater value than given key
<span class="lineNum"> 521 </span> : * or end() if no such element exists.
<span class="lineNum"> 522 </span> : */
<span class="lineNum"> 523 </span> : iterator
<span class="lineNum"> 524 </span> : lower_bound(const key_type& __x)
<span class="lineNum"> 525 </span> : { return _M_t.lower_bound(__x); }
<span class="lineNum"> 526 </span> :
<span class="lineNum"> 527 </span> : const_iterator
<span class="lineNum"> 528 </span> : lower_bound(const key_type& __x) const
<span class="lineNum"> 529 </span> : { return _M_t.lower_bound(__x); }
<span class="lineNum"> 530 </span> : //@}
<span class="lineNum"> 531 </span> :
<span class="lineNum"> 532 </span> : //@{
<span class="lineNum"> 533 </span> : /**
<span class="lineNum"> 534 </span> : * @brief Finds the end of a subsequence matching given key.
<span class="lineNum"> 535 </span> : * @param x Key to be located.
<span class="lineNum"> 536 </span> : * @return Iterator pointing to the first element
<span class="lineNum"> 537 </span> : * greater than key, or end().
<span class="lineNum"> 538 </span> : */
<span class="lineNum"> 539 </span> : iterator
<span class="lineNum"> 540 </span> : upper_bound(const key_type& __x)
<span class="lineNum"> 541 </span> : { return _M_t.upper_bound(__x); }
<span class="lineNum"> 542 </span> :
<span class="lineNum"> 543 </span> : const_iterator
<span class="lineNum"> 544 </span> : upper_bound(const key_type& __x) const
<span class="lineNum"> 545 </span> : { return _M_t.upper_bound(__x); }
<span class="lineNum"> 546 </span> : //@}
<span class="lineNum"> 547 </span> :
<span class="lineNum"> 548 </span> : //@{
<span class="lineNum"> 549 </span> : /**
<span class="lineNum"> 550 </span> : * @brief Finds a subsequence matching given key.
<span class="lineNum"> 551 </span> : * @param x Key to be located.
<span class="lineNum"> 552 </span> : * @return Pair of iterators that possibly points to the subsequence
<span class="lineNum"> 553 </span> : * matching given key.
<span class="lineNum"> 554 </span> : *
<span class="lineNum"> 555 </span> : * This function is equivalent to
<span class="lineNum"> 556 </span> : * @code
<span class="lineNum"> 557 </span> : * std::make_pair(c.lower_bound(val),
<span class="lineNum"> 558 </span> : * c.upper_bound(val))
<span class="lineNum"> 559 </span> : * @endcode
<span class="lineNum"> 560 </span> : * (but is faster than making the calls separately).
<span class="lineNum"> 561 </span> : *
<span class="lineNum"> 562 </span> : * This function probably only makes sense for multisets.
<span class="lineNum"> 563 </span> : */
<span class="lineNum"> 564 </span> : std::pair<iterator, iterator>
<span class="lineNum"> 565 </span> : equal_range(const key_type& __x)
<span class="lineNum"> 566 </span> : { return _M_t.equal_range(__x); }
<span class="lineNum"> 567 </span> :
<span class="lineNum"> 568 </span> : std::pair<const_iterator, const_iterator>
<span class="lineNum"> 569 </span> : equal_range(const key_type& __x) const
<span class="lineNum"> 570 </span> : { return _M_t.equal_range(__x); }
<span class="lineNum"> 571 </span> : //@}
<span class="lineNum"> 572 </span> :
<span class="lineNum"> 573 </span> : template<typename _K1, typename _C1, typename _A1>
<span class="lineNum"> 574 </span> : friend bool
<span class="lineNum"> 575 </span> : operator==(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
<span class="lineNum"> 576 </span> :
<span class="lineNum"> 577 </span> : template<typename _K1, typename _C1, typename _A1>
<span class="lineNum"> 578 </span> : friend bool
<span class="lineNum"> 579 </span> : operator<(const set<_K1, _C1, _A1>&, const set<_K1, _C1, _A1>&);
<span class="lineNum"> 580 </span> : };
<span class="lineNum"> 581 </span> :
<span class="lineNum"> 582 </span> :
<span class="lineNum"> 583 </span> : /**
<span class="lineNum"> 584 </span> : * @brief Set equality comparison.
<span class="lineNum"> 585 </span> : * @param x A %set.
<span class="lineNum"> 586 </span> : * @param y A %set of the same type as @a x.
<span class="lineNum"> 587 </span> : * @return True iff the size and elements of the sets are equal.
<span class="lineNum"> 588 </span> : *
<span class="lineNum"> 589 </span> : * This is an equivalence relation. It is linear in the size of the sets.
<span class="lineNum"> 590 </span> : * Sets are considered equivalent if their sizes are equal, and if
<span class="lineNum"> 591 </span> : * corresponding elements compare equal.
<span class="lineNum"> 592 </span> : */
<span class="lineNum"> 593 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 594 </span> : inline bool
<span class="lineNum"> 595 </span> : operator==(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 596 </span><span class="lineCov"> 4 : const set<_Key, _Compare, _Alloc>& __y)</span>
<span class="lineNum"> 597 </span><span class="lineCov"> 4 : { return __x._M_t == __y._M_t; }</span>
<span class="lineNum"> 598 </span> :
<span class="lineNum"> 599 </span> : /**
<span class="lineNum"> 600 </span> : * @brief Set ordering relation.
<span class="lineNum"> 601 </span> : * @param x A %set.
<span class="lineNum"> 602 </span> : * @param y A %set of the same type as @a x.
<span class="lineNum"> 603 </span> : * @return True iff @a x is lexicographically less than @a y.
<span class="lineNum"> 604 </span> : *
<span class="lineNum"> 605 </span> : * This is a total ordering relation. It is linear in the size of the
<span class="lineNum"> 606 </span> : * maps. The elements must be comparable with @c <.
<span class="lineNum"> 607 </span> : *
<span class="lineNum"> 608 </span> : * See std::lexicographical_compare() for how the determination is made.
<span class="lineNum"> 609 </span> : */
<span class="lineNum"> 610 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 611 </span> : inline bool
<span class="lineNum"> 612 </span> : operator<(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 613 </span> : const set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 614 </span> : { return __x._M_t < __y._M_t; }
<span class="lineNum"> 615 </span> :
<span class="lineNum"> 616 </span> : /// Returns !(x == y).
<span class="lineNum"> 617 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 618 </span> : inline bool
<span class="lineNum"> 619 </span> : operator!=(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 620 </span> : const set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 621 </span> : { return !(__x == __y); }
<span class="lineNum"> 622 </span> :
<span class="lineNum"> 623 </span> : /// Returns y < x.
<span class="lineNum"> 624 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 625 </span> : inline bool
<span class="lineNum"> 626 </span> : operator>(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 627 </span> : const set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 628 </span> : { return __y < __x; }
<span class="lineNum"> 629 </span> :
<span class="lineNum"> 630 </span> : /// Returns !(y < x)
<span class="lineNum"> 631 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 632 </span> : inline bool
<span class="lineNum"> 633 </span> : operator<=(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 634 </span> : const set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 635 </span> : { return !(__y < __x); }
<span class="lineNum"> 636 </span> :
<span class="lineNum"> 637 </span> : /// Returns !(x < y)
<span class="lineNum"> 638 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 639 </span> : inline bool
<span class="lineNum"> 640 </span> : operator>=(const set<_Key, _Compare, _Alloc>& __x,
<span class="lineNum"> 641 </span> : const set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 642 </span> : { return !(__x < __y); }
<span class="lineNum"> 643 </span> :
<span class="lineNum"> 644 </span> : /// See std::set::swap().
<span class="lineNum"> 645 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 646 </span> : inline void
<span class="lineNum"> 647 </span> : swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 648 </span> : { __x.swap(__y); }
<span class="lineNum"> 649 </span> :
<span class="lineNum"> 650 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 651 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 652 </span> : inline void
<span class="lineNum"> 653 </span> : swap(set<_Key, _Compare, _Alloc>&& __x, set<_Key, _Compare, _Alloc>& __y)
<span class="lineNum"> 654 </span> : { __x.swap(__y); }
<span class="lineNum"> 655 </span> :
<span class="lineNum"> 656 </span> : template<typename _Key, typename _Compare, typename _Alloc>
<span class="lineNum"> 657 </span> : inline void
<span class="lineNum"> 658 </span> : swap(set<_Key, _Compare, _Alloc>& __x, set<_Key, _Compare, _Alloc>&& __y)
<span class="lineNum"> 659 </span> : { __x.swap(__y); }
<span class="lineNum"> 660 </span> : #endif
<span class="lineNum"> 661 </span> :
<span class="lineNum"> 662 </span> : _GLIBCXX_END_NESTED_NAMESPACE
<span class="lineNum"> 663 </span> :
<span class="lineNum"> 664 </span> : #endif /* _STL_SET_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>
|
