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
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
|
<!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_algobase.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_algobase.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%">79</td>
</tr>
<tr>
<td class="headerItem" width="20%">Code covered:</td>
<td class="headerValue" width="20%">91.1 %</td>
<td width="20%"></td>
<td class="headerItem" width="20%">Executed lines:</td>
<td class="headerValue" width="20%">72</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> : // Core algorithmic facilities -*- 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-1998
<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_algobase.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_ALGOBASE_H
<span class="lineNum"> 63 </span> : #define _STL_ALGOBASE_H 1
<span class="lineNum"> 64 </span> :
<span class="lineNum"> 65 </span> : #include <bits/c++config.h>
<span class="lineNum"> 66 </span> : #include <cstddef>
<span class="lineNum"> 67 </span> : #include <bits/functexcept.h>
<span class="lineNum"> 68 </span> : #include <bits/cpp_type_traits.h>
<span class="lineNum"> 69 </span> : #include <ext/type_traits.h>
<span class="lineNum"> 70 </span> : #include <ext/numeric_traits.h>
<span class="lineNum"> 71 </span> : #include <bits/stl_pair.h>
<span class="lineNum"> 72 </span> : #include <bits/stl_iterator_base_types.h>
<span class="lineNum"> 73 </span> : #include <bits/stl_iterator_base_funcs.h>
<span class="lineNum"> 74 </span> : #include <bits/stl_iterator.h>
<span class="lineNum"> 75 </span> : #include <bits/concept_check.h>
<span class="lineNum"> 76 </span> : #include <debug/debug.h>
<span class="lineNum"> 77 </span> : #include <bits/stl_move.h> // For std::swap and _GLIBCXX_MOVE
<span class="lineNum"> 78 </span> :
<span class="lineNum"> 79 </span> : _GLIBCXX_BEGIN_NAMESPACE(std)
<span class="lineNum"> 80 </span> :
<span class="lineNum"> 81 </span> : // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a
<span class="lineNum"> 82 </span> : // nutshell, we are partially implementing the resolution of DR 187,
<span class="lineNum"> 83 </span> : // when it's safe, i.e., the value_types are equal.
<span class="lineNum"> 84 </span> : template<bool _BoolType>
<span class="lineNum"> 85 </span> : struct __iter_swap
<span class="lineNum"> 86 </span> : {
<span class="lineNum"> 87 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2>
<span class="lineNum"> 88 </span> : static void
<span class="lineNum"> 89 </span> : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
<span class="lineNum"> 90 </span> : {
<span class="lineNum"> 91 </span> : typedef typename iterator_traits<_ForwardIterator1>::value_type
<span class="lineNum"> 92 </span> : _ValueType1;
<span class="lineNum"> 93 </span> : _ValueType1 __tmp = _GLIBCXX_MOVE(*__a);
<span class="lineNum"> 94 </span> : *__a = _GLIBCXX_MOVE(*__b);
<span class="lineNum"> 95 </span> : *__b = _GLIBCXX_MOVE(__tmp);
<span class="lineNum"> 96 </span> : }
<span class="lineNum"> 97 </span> : };
<span class="lineNum"> 98 </span> :
<span class="lineNum"> 99 </span> : template<>
<span class="lineNum"> 100 </span> : struct __iter_swap<true>
<span class="lineNum"> 101 </span> : {
<span class="lineNum"> 102 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2>
<span class="lineNum"> 103 </span> : static void
<span class="lineNum"> 104 </span><span class="lineCov"> 7080 : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span>
<span class="lineNum"> 105 </span> : {
<span class="lineNum"> 106 </span><span class="lineCov"> 7080 : swap(*__a, *__b);</span>
<span class="lineNum"> 107 </span><span class="lineCov"> 7080 : }</span>
<span class="lineNum"> 108 </span> : };
<span class="lineNum"> 109 </span> :
<span class="lineNum"> 110 </span> : /**
<span class="lineNum"> 111 </span> : * @brief Swaps the contents of two iterators.
<span class="lineNum"> 112 </span> : * @param a An iterator.
<span class="lineNum"> 113 </span> : * @param b Another iterator.
<span class="lineNum"> 114 </span> : * @return Nothing.
<span class="lineNum"> 115 </span> : *
<span class="lineNum"> 116 </span> : * This function swaps the values pointed to by two iterators, not the
<span class="lineNum"> 117 </span> : * iterators themselves.
<span class="lineNum"> 118 </span> : */
<span class="lineNum"> 119 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2>
<span class="lineNum"> 120 </span> : inline void
<span class="lineNum"> 121 </span><span class="lineCov"> 7080 : iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</span>
<span class="lineNum"> 122 </span> : {
<span class="lineNum"> 123 </span> : typedef typename iterator_traits<_ForwardIterator1>::value_type
<span class="lineNum"> 124 </span> : _ValueType1;
<span class="lineNum"> 125 </span> : typedef typename iterator_traits<_ForwardIterator2>::value_type
<span class="lineNum"> 126 </span> : _ValueType2;
<span class="lineNum"> 127 </span> :
<span class="lineNum"> 128 </span> : // concept requirements
<span class="lineNum"> 129 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
<span class="lineNum"> 130 </span> : _ForwardIterator1>)
<span class="lineNum"> 131 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
<span class="lineNum"> 132 </span> : _ForwardIterator2>)
<span class="lineNum"> 133 </span> : __glibcxx_function_requires(_ConvertibleConcept<_ValueType1,
<span class="lineNum"> 134 </span> : _ValueType2>)
<span class="lineNum"> 135 </span> : __glibcxx_function_requires(_ConvertibleConcept<_ValueType2,
<span class="lineNum"> 136 </span> : _ValueType1>)
<span class="lineNum"> 137 </span> :
<span class="lineNum"> 138 </span> : typedef typename iterator_traits<_ForwardIterator1>::reference
<span class="lineNum"> 139 </span> : _ReferenceType1;
<span class="lineNum"> 140 </span> : typedef typename iterator_traits<_ForwardIterator2>::reference
<span class="lineNum"> 141 </span> : _ReferenceType2;
<span class="lineNum"> 142 </span><span class="lineCov"> 7080 : std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value</span>
<span class="lineNum"> 143 </span> : && __are_same<_ValueType1&, _ReferenceType1>::__value
<span class="lineNum"> 144 </span> : && __are_same<_ValueType2&, _ReferenceType2>::__value>::
<span class="lineNum"> 145 </span> : iter_swap(__a, __b);
<span class="lineNum"> 146 </span><span class="lineCov"> 7080 : }</span>
<span class="lineNum"> 147 </span> :
<span class="lineNum"> 148 </span> : /**
<span class="lineNum"> 149 </span> : * @brief Swap the elements of two sequences.
<span class="lineNum"> 150 </span> : * @param first1 A forward iterator.
<span class="lineNum"> 151 </span> : * @param last1 A forward iterator.
<span class="lineNum"> 152 </span> : * @param first2 A forward iterator.
<span class="lineNum"> 153 </span> : * @return An iterator equal to @p first2+(last1-first1).
<span class="lineNum"> 154 </span> : *
<span class="lineNum"> 155 </span> : * Swaps each element in the range @p [first1,last1) with the
<span class="lineNum"> 156 </span> : * corresponding element in the range @p [first2,(last1-first1)).
<span class="lineNum"> 157 </span> : * The ranges must not overlap.
<span class="lineNum"> 158 </span> : */
<span class="lineNum"> 159 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2>
<span class="lineNum"> 160 </span> : _ForwardIterator2
<span class="lineNum"> 161 </span> : swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
<span class="lineNum"> 162 </span> : _ForwardIterator2 __first2)
<span class="lineNum"> 163 </span> : {
<span class="lineNum"> 164 </span> : // concept requirements
<span class="lineNum"> 165 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
<span class="lineNum"> 166 </span> : _ForwardIterator1>)
<span class="lineNum"> 167 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
<span class="lineNum"> 168 </span> : _ForwardIterator2>)
<span class="lineNum"> 169 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 170 </span> :
<span class="lineNum"> 171 </span> : for (; __first1 != __last1; ++__first1, ++__first2)
<span class="lineNum"> 172 </span> : std::iter_swap(__first1, __first2);
<span class="lineNum"> 173 </span> : return __first2;
<span class="lineNum"> 174 </span> : }
<span class="lineNum"> 175 </span> :
<span class="lineNum"> 176 </span> : /**
<span class="lineNum"> 177 </span> : * @brief This does what you think it does.
<span class="lineNum"> 178 </span> : * @param a A thing of arbitrary type.
<span class="lineNum"> 179 </span> : * @param b Another thing of arbitrary type.
<span class="lineNum"> 180 </span> : * @return The lesser of the parameters.
<span class="lineNum"> 181 </span> : *
<span class="lineNum"> 182 </span> : * This is the simple classic generic implementation. It will work on
<span class="lineNum"> 183 </span> : * temporary expressions, since they are only evaluated once, unlike a
<span class="lineNum"> 184 </span> : * preprocessor macro.
<span class="lineNum"> 185 </span> : */
<span class="lineNum"> 186 </span> : template<typename _Tp>
<span class="lineNum"> 187 </span> : inline const _Tp&
<span class="lineNum"> 188 </span><span class="lineNoCov"> 0 : min(const _Tp& __a, const _Tp& __b)</span>
<span class="lineNum"> 189 </span> : {
<span class="lineNum"> 190 </span> : // concept requirements
<span class="lineNum"> 191 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
<span class="lineNum"> 192 </span> : //return __b < __a ? __b : __a;
<span class="lineNum"> 193 </span><span class="lineNoCov"> 0 : if (__b < __a)</span>
<span class="lineNum"> 194 </span><span class="lineNoCov"> 0 : return __b;</span>
<span class="lineNum"> 195 </span><span class="lineNoCov"> 0 : return __a;</span>
<span class="lineNum"> 196 </span> : }
<span class="lineNum"> 197 </span> :
<span class="lineNum"> 198 </span> : /**
<span class="lineNum"> 199 </span> : * @brief This does what you think it does.
<span class="lineNum"> 200 </span> : * @param a A thing of arbitrary type.
<span class="lineNum"> 201 </span> : * @param b Another thing of arbitrary type.
<span class="lineNum"> 202 </span> : * @return The greater of the parameters.
<span class="lineNum"> 203 </span> : *
<span class="lineNum"> 204 </span> : * This is the simple classic generic implementation. It will work on
<span class="lineNum"> 205 </span> : * temporary expressions, since they are only evaluated once, unlike a
<span class="lineNum"> 206 </span> : * preprocessor macro.
<span class="lineNum"> 207 </span> : */
<span class="lineNum"> 208 </span> : template<typename _Tp>
<span class="lineNum"> 209 </span> : inline const _Tp&
<span class="lineNum"> 210 </span><span class="lineCov"> 20743 : max(const _Tp& __a, const _Tp& __b)</span>
<span class="lineNum"> 211 </span> : {
<span class="lineNum"> 212 </span> : // concept requirements
<span class="lineNum"> 213 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
<span class="lineNum"> 214 </span> : //return __a < __b ? __b : __a;
<span class="lineNum"> 215 </span><span class="lineCov"> 20743 : if (__a < __b)</span>
<span class="lineNum"> 216 </span><span class="lineCov"> 4790 : return __b;</span>
<span class="lineNum"> 217 </span><span class="lineCov"> 15953 : return __a;</span>
<span class="lineNum"> 218 </span> : }
<span class="lineNum"> 219 </span> :
<span class="lineNum"> 220 </span> : /**
<span class="lineNum"> 221 </span> : * @brief This does what you think it does.
<span class="lineNum"> 222 </span> : * @param a A thing of arbitrary type.
<span class="lineNum"> 223 </span> : * @param b Another thing of arbitrary type.
<span class="lineNum"> 224 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink.
<span class="lineNum"> 225 </span> : * @return The lesser of the parameters.
<span class="lineNum"> 226 </span> : *
<span class="lineNum"> 227 </span> : * This will work on temporary expressions, since they are only evaluated
<span class="lineNum"> 228 </span> : * once, unlike a preprocessor macro.
<span class="lineNum"> 229 </span> : */
<span class="lineNum"> 230 </span> : template<typename _Tp, typename _Compare>
<span class="lineNum"> 231 </span> : inline const _Tp&
<span class="lineNum"> 232 </span> : min(const _Tp& __a, const _Tp& __b, _Compare __comp)
<span class="lineNum"> 233 </span> : {
<span class="lineNum"> 234 </span> : //return __comp(__b, __a) ? __b : __a;
<span class="lineNum"> 235 </span> : if (__comp(__b, __a))
<span class="lineNum"> 236 </span> : return __b;
<span class="lineNum"> 237 </span> : return __a;
<span class="lineNum"> 238 </span> : }
<span class="lineNum"> 239 </span> :
<span class="lineNum"> 240 </span> : /**
<span class="lineNum"> 241 </span> : * @brief This does what you think it does.
<span class="lineNum"> 242 </span> : * @param a A thing of arbitrary type.
<span class="lineNum"> 243 </span> : * @param b Another thing of arbitrary type.
<span class="lineNum"> 244 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink.
<span class="lineNum"> 245 </span> : * @return The greater of the parameters.
<span class="lineNum"> 246 </span> : *
<span class="lineNum"> 247 </span> : * This will work on temporary expressions, since they are only evaluated
<span class="lineNum"> 248 </span> : * once, unlike a preprocessor macro.
<span class="lineNum"> 249 </span> : */
<span class="lineNum"> 250 </span> : template<typename _Tp, typename _Compare>
<span class="lineNum"> 251 </span> : inline const _Tp&
<span class="lineNum"> 252 </span> : max(const _Tp& __a, const _Tp& __b, _Compare __comp)
<span class="lineNum"> 253 </span> : {
<span class="lineNum"> 254 </span> : //return __comp(__a, __b) ? __b : __a;
<span class="lineNum"> 255 </span> : if (__comp(__a, __b))
<span class="lineNum"> 256 </span> : return __b;
<span class="lineNum"> 257 </span> : return __a;
<span class="lineNum"> 258 </span> : }
<span class="lineNum"> 259 </span> :
<span class="lineNum"> 260 </span> :
<span class="lineNum"> 261 </span> : // If _Iterator is a __normal_iterator return its base (a plain pointer,
<span class="lineNum"> 262 </span> : // normally) otherwise return it untouched. See copy, fill, ...
<span class="lineNum"> 263 </span> : template<typename _Iterator,
<span class="lineNum"> 264 </span> : bool _IsNormal = __is_normal_iterator<_Iterator>::__value>
<span class="lineNum"> 265 </span> : struct __niter_base
<span class="lineNum"> 266 </span> : {
<span class="lineNum"> 267 </span> : static _Iterator
<span class="lineNum"> 268 </span><span class="lineCov"> 256058 : __b(_Iterator __it)</span>
<span class="lineNum"> 269 </span><span class="lineCov"> 256058 : { return __it; }</span>
<span class="lineNum"> 270 </span> : };
<span class="lineNum"> 271 </span> :
<span class="lineNum"> 272 </span> : template<typename _Iterator>
<span class="lineNum"> 273 </span> : struct __niter_base<_Iterator, true>
<span class="lineNum"> 274 </span> : {
<span class="lineNum"> 275 </span> : static typename _Iterator::iterator_type
<span class="lineNum"> 276 </span><span class="lineCov"> 23362 : __b(_Iterator __it)</span>
<span class="lineNum"> 277 </span><span class="lineCov"> 23362 : { return __it.base(); }</span>
<span class="lineNum"> 278 </span> : };
<span class="lineNum"> 279 </span> :
<span class="lineNum"> 280 </span> : // Likewise, for move_iterator.
<span class="lineNum"> 281 </span> : template<typename _Iterator,
<span class="lineNum"> 282 </span> : bool _IsMove = __is_move_iterator<_Iterator>::__value>
<span class="lineNum"> 283 </span> : struct __miter_base
<span class="lineNum"> 284 </span> : {
<span class="lineNum"> 285 </span> : static _Iterator
<span class="lineNum"> 286 </span><span class="lineCov"> 156418 : __b(_Iterator __it)</span>
<span class="lineNum"> 287 </span><span class="lineCov"> 156418 : { return __it; }</span>
<span class="lineNum"> 288 </span> : };
<span class="lineNum"> 289 </span> :
<span class="lineNum"> 290 </span> : template<typename _Iterator>
<span class="lineNum"> 291 </span> : struct __miter_base<_Iterator, true>
<span class="lineNum"> 292 </span> : {
<span class="lineNum"> 293 </span> : static typename _Iterator::iterator_type
<span class="lineNum"> 294 </span> : __b(_Iterator __it)
<span class="lineNum"> 295 </span> : { return __it.base(); }
<span class="lineNum"> 296 </span> : };
<span class="lineNum"> 297 </span> :
<span class="lineNum"> 298 </span> : // All of these auxiliary structs serve two purposes. (1) Replace
<span class="lineNum"> 299 </span> : // calls to copy with memmove whenever possible. (Memmove, not memcpy,
<span class="lineNum"> 300 </span> : // because the input and output ranges are permitted to overlap.)
<span class="lineNum"> 301 </span> : // (2) If we're using random access iterators, then write the loop as
<span class="lineNum"> 302 </span> : // a for loop with an explicit count.
<span class="lineNum"> 303 </span> :
<span class="lineNum"> 304 </span> : template<bool, bool, typename>
<span class="lineNum"> 305 </span> : struct __copy_move
<span class="lineNum"> 306 </span> : {
<span class="lineNum"> 307 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 308 </span> : static _OI
<span class="lineNum"> 309 </span><span class="lineCov"> 42335 : __copy_m(_II __first, _II __last, _OI __result)</span>
<span class="lineNum"> 310 </span> : {
<span class="lineNum"> 311 </span><span class="lineCov"> 159330 : for (; __first != __last; ++__result, ++__first)</span>
<span class="lineNum"> 312 </span><span class="lineCov"> 112959 : *__result = *__first;</span>
<span class="lineNum"> 313 </span><span class="lineCov"> 42335 : return __result;</span>
<span class="lineNum"> 314 </span> : }
<span class="lineNum"> 315 </span> : };
<span class="lineNum"> 316 </span> :
<span class="lineNum"> 317 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 318 </span> : template<typename _Category>
<span class="lineNum"> 319 </span> : struct __copy_move<true, false, _Category>
<span class="lineNum"> 320 </span> : {
<span class="lineNum"> 321 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 322 </span> : static _OI
<span class="lineNum"> 323 </span> : __copy_m(_II __first, _II __last, _OI __result)
<span class="lineNum"> 324 </span> : {
<span class="lineNum"> 325 </span> : for (; __first != __last; ++__result, ++__first)
<span class="lineNum"> 326 </span> : *__result = std::move(*__first);
<span class="lineNum"> 327 </span> : return __result;
<span class="lineNum"> 328 </span> : }
<span class="lineNum"> 329 </span> : };
<span class="lineNum"> 330 </span> : #endif
<span class="lineNum"> 331 </span> :
<span class="lineNum"> 332 </span> : template<>
<span class="lineNum"> 333 </span> : struct __copy_move<false, false, random_access_iterator_tag>
<span class="lineNum"> 334 </span> : {
<span class="lineNum"> 335 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 336 </span> : static _OI
<span class="lineNum"> 337 </span><span class="lineCov"> 945 : __copy_m(_II __first, _II __last, _OI __result)</span>
<span class="lineNum"> 338 </span> : {
<span class="lineNum"> 339 </span> : typedef typename iterator_traits<_II>::difference_type _Distance;
<span class="lineNum"> 340 </span><span class="lineCov"> 12957 : for(_Distance __n = __last - __first; __n > 0; --__n)</span>
<span class="lineNum"> 341 </span> : {
<span class="lineNum"> 342 </span><span class="lineCov"> 12012 : *__result = *__first;</span>
<span class="lineNum"> 343 </span><span class="lineCov"> 12012 : ++__first;</span>
<span class="lineNum"> 344 </span><span class="lineCov"> 12012 : ++__result;</span>
<span class="lineNum"> 345 </span> : }
<span class="lineNum"> 346 </span><span class="lineCov"> 945 : return __result;</span>
<span class="lineNum"> 347 </span> : }
<span class="lineNum"> 348 </span> : };
<span class="lineNum"> 349 </span> :
<span class="lineNum"> 350 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 351 </span> : template<>
<span class="lineNum"> 352 </span> : struct __copy_move<true, false, random_access_iterator_tag>
<span class="lineNum"> 353 </span> : {
<span class="lineNum"> 354 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 355 </span> : static _OI
<span class="lineNum"> 356 </span> : __copy_m(_II __first, _II __last, _OI __result)
<span class="lineNum"> 357 </span> : {
<span class="lineNum"> 358 </span> : typedef typename iterator_traits<_II>::difference_type _Distance;
<span class="lineNum"> 359 </span> : for(_Distance __n = __last - __first; __n > 0; --__n)
<span class="lineNum"> 360 </span> : {
<span class="lineNum"> 361 </span> : *__result = std::move(*__first);
<span class="lineNum"> 362 </span> : ++__first;
<span class="lineNum"> 363 </span> : ++__result;
<span class="lineNum"> 364 </span> : }
<span class="lineNum"> 365 </span> : return __result;
<span class="lineNum"> 366 </span> : }
<span class="lineNum"> 367 </span> : };
<span class="lineNum"> 368 </span> : #endif
<span class="lineNum"> 369 </span> :
<span class="lineNum"> 370 </span> : template<bool _IsMove>
<span class="lineNum"> 371 </span> : struct __copy_move<_IsMove, true, random_access_iterator_tag>
<span class="lineNum"> 372 </span> : {
<span class="lineNum"> 373 </span> : template<typename _Tp>
<span class="lineNum"> 374 </span> : static _Tp*
<span class="lineNum"> 375 </span><span class="lineCov"> 27153 : __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)</span>
<span class="lineNum"> 376 </span> : {
<span class="lineNum"> 377 </span><span class="lineCov"> 27153 : __builtin_memmove(__result, __first,</span>
<span class="lineNum"> 378 </span> : sizeof(_Tp) * (__last - __first));
<span class="lineNum"> 379 </span><span class="lineCov"> 27153 : return __result + (__last - __first);</span>
<span class="lineNum"> 380 </span> : }
<span class="lineNum"> 381 </span> : };
<span class="lineNum"> 382 </span> :
<span class="lineNum"> 383 </span> : template<bool _IsMove, typename _II, typename _OI>
<span class="lineNum"> 384 </span> : inline _OI
<span class="lineNum"> 385 </span><span class="lineCov"> 70433 : __copy_move_a(_II __first, _II __last, _OI __result)</span>
<span class="lineNum"> 386 </span> : {
<span class="lineNum"> 387 </span> : typedef typename iterator_traits<_II>::value_type _ValueTypeI;
<span class="lineNum"> 388 </span> : typedef typename iterator_traits<_OI>::value_type _ValueTypeO;
<span class="lineNum"> 389 </span> : typedef typename iterator_traits<_II>::iterator_category _Category;
<span class="lineNum"> 390 </span> : const bool __simple = (__is_pod(_ValueTypeI)
<span class="lineNum"> 391 </span> : && __is_pointer<_II>::__value
<span class="lineNum"> 392 </span> : && __is_pointer<_OI>::__value
<span class="lineNum"> 393 </span><span class="lineCov"> 70433 : && __are_same<_ValueTypeI, _ValueTypeO>::__value);</span>
<span class="lineNum"> 394 </span> :
<span class="lineNum"> 395 </span> : return std::__copy_move<_IsMove, __simple,
<span class="lineNum"> 396 </span><span class="lineCov"> 70433 : _Category>::__copy_m(__first, __last, __result);</span>
<span class="lineNum"> 397 </span> : }
<span class="lineNum"> 398 </span> :
<span class="lineNum"> 399 </span> : // Helpers for streambuf iterators (either istream or ostream).
<span class="lineNum"> 400 </span> : // NB: avoid including <iosfwd>, relatively large.
<span class="lineNum"> 401 </span> : template<typename _CharT>
<span class="lineNum"> 402 </span> : struct char_traits;
<span class="lineNum"> 403 </span> :
<span class="lineNum"> 404 </span> : template<typename _CharT, typename _Traits>
<span class="lineNum"> 405 </span> : class istreambuf_iterator;
<span class="lineNum"> 406 </span> :
<span class="lineNum"> 407 </span> : template<typename _CharT, typename _Traits>
<span class="lineNum"> 408 </span> : class ostreambuf_iterator;
<span class="lineNum"> 409 </span> :
<span class="lineNum"> 410 </span> : template<bool _IsMove, typename _CharT>
<span class="lineNum"> 411 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
<span class="lineNum"> 412 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
<span class="lineNum"> 413 </span> : __copy_move_a2(_CharT*, _CharT*,
<span class="lineNum"> 414 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> >);
<span class="lineNum"> 415 </span> :
<span class="lineNum"> 416 </span> : template<bool _IsMove, typename _CharT>
<span class="lineNum"> 417 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
<span class="lineNum"> 418 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
<span class="lineNum"> 419 </span> : __copy_move_a2(const _CharT*, const _CharT*,
<span class="lineNum"> 420 </span> : ostreambuf_iterator<_CharT, char_traits<_CharT> >);
<span class="lineNum"> 421 </span> :
<span class="lineNum"> 422 </span> : template<bool _IsMove, typename _CharT>
<span class="lineNum"> 423 </span> : typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
<span class="lineNum"> 424 </span> : _CharT*>::__type
<span class="lineNum"> 425 </span> : __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >,
<span class="lineNum"> 426 </span> : istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*);
<span class="lineNum"> 427 </span> :
<span class="lineNum"> 428 </span> : template<bool _IsMove, typename _II, typename _OI>
<span class="lineNum"> 429 </span> : inline _OI
<span class="lineNum"> 430 </span><span class="lineCov"> 70433 : __copy_move_a2(_II __first, _II __last, _OI __result)</span>
<span class="lineNum"> 431 </span> : {
<span class="lineNum"> 432 </span> : return _OI(std::__copy_move_a<_IsMove>
<span class="lineNum"> 433 </span> : (std::__niter_base<_II>::__b(__first),
<span class="lineNum"> 434 </span> : std::__niter_base<_II>::__b(__last),
<span class="lineNum"> 435 </span><span class="lineCov"> 70433 : std::__niter_base<_OI>::__b(__result)));</span>
<span class="lineNum"> 436 </span> : }
<span class="lineNum"> 437 </span> :
<span class="lineNum"> 438 </span> : /**
<span class="lineNum"> 439 </span> : * @brief Copies the range [first,last) into result.
<span class="lineNum"> 440 </span> : * @param first An input iterator.
<span class="lineNum"> 441 </span> : * @param last An input iterator.
<span class="lineNum"> 442 </span> : * @param result An output iterator.
<span class="lineNum"> 443 </span> : * @return result + (first - last)
<span class="lineNum"> 444 </span> : *
<span class="lineNum"> 445 </span> : * This inline function will boil down to a call to @c memmove whenever
<span class="lineNum"> 446 </span> : * possible. Failing that, if random access iterators are passed, then the
<span class="lineNum"> 447 </span> : * loop count will be known (and therefore a candidate for compiler
<span class="lineNum"> 448 </span> : * optimizations such as unrolling). Result may not be contained within
<span class="lineNum"> 449 </span> : * [first,last); the copy_backward function should be used instead.
<span class="lineNum"> 450 </span> : *
<span class="lineNum"> 451 </span> : * Note that the end of the output range is permitted to be contained
<span class="lineNum"> 452 </span> : * within [first,last).
<span class="lineNum"> 453 </span> : */
<span class="lineNum"> 454 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 455 </span> : inline _OI
<span class="lineNum"> 456 </span><span class="lineCov"> 70433 : copy(_II __first, _II __last, _OI __result)</span>
<span class="lineNum"> 457 </span> : {
<span class="lineNum"> 458 </span> : // concept requirements
<span class="lineNum"> 459 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II>)
<span class="lineNum"> 460 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI,
<span class="lineNum"> 461 </span> : typename iterator_traits<_II>::value_type>)
<span class="lineNum"> 462 </span> : __glibcxx_requires_valid_range(__first, __last);
<span class="lineNum"> 463 </span> :
<span class="lineNum"> 464 </span> : return (std::__copy_move_a2<__is_move_iterator<_II>::__value>
<span class="lineNum"> 465 </span> : (std::__miter_base<_II>::__b(__first),
<span class="lineNum"> 466 </span><span class="lineCov"> 70433 : std::__miter_base<_II>::__b(__last), __result));</span>
<span class="lineNum"> 467 </span> : }
<span class="lineNum"> 468 </span> :
<span class="lineNum"> 469 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 470 </span> : /**
<span class="lineNum"> 471 </span> : * @brief Moves the range [first,last) into result.
<span class="lineNum"> 472 </span> : * @param first An input iterator.
<span class="lineNum"> 473 </span> : * @param last An input iterator.
<span class="lineNum"> 474 </span> : * @param result An output iterator.
<span class="lineNum"> 475 </span> : * @return result + (first - last)
<span class="lineNum"> 476 </span> : *
<span class="lineNum"> 477 </span> : * This inline function will boil down to a call to @c memmove whenever
<span class="lineNum"> 478 </span> : * possible. Failing that, if random access iterators are passed, then the
<span class="lineNum"> 479 </span> : * loop count will be known (and therefore a candidate for compiler
<span class="lineNum"> 480 </span> : * optimizations such as unrolling). Result may not be contained within
<span class="lineNum"> 481 </span> : * [first,last); the move_backward function should be used instead.
<span class="lineNum"> 482 </span> : *
<span class="lineNum"> 483 </span> : * Note that the end of the output range is permitted to be contained
<span class="lineNum"> 484 </span> : * within [first,last).
<span class="lineNum"> 485 </span> : */
<span class="lineNum"> 486 </span> : template<typename _II, typename _OI>
<span class="lineNum"> 487 </span> : inline _OI
<span class="lineNum"> 488 </span> : move(_II __first, _II __last, _OI __result)
<span class="lineNum"> 489 </span> : {
<span class="lineNum"> 490 </span> : // concept requirements
<span class="lineNum"> 491 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II>)
<span class="lineNum"> 492 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI,
<span class="lineNum"> 493 </span> : typename iterator_traits<_II>::value_type>)
<span class="lineNum"> 494 </span> : __glibcxx_requires_valid_range(__first, __last);
<span class="lineNum"> 495 </span> :
<span class="lineNum"> 496 </span> : return (std::__copy_move_a2<true>
<span class="lineNum"> 497 </span> : (std::__miter_base<_II>::__b(__first),
<span class="lineNum"> 498 </span> : std::__miter_base<_II>::__b(__last), __result));
<span class="lineNum"> 499 </span> : }
<span class="lineNum"> 500 </span> :
<span class="lineNum"> 501 </span> : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp)
<span class="lineNum"> 502 </span> : #else
<span class="lineNum"> 503 </span> : #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp)
<span class="lineNum"> 504 </span> : #endif
<span class="lineNum"> 505 </span> :
<span class="lineNum"> 506 </span> : template<bool, bool, typename>
<span class="lineNum"> 507 </span> : struct __copy_move_backward
<span class="lineNum"> 508 </span> : {
<span class="lineNum"> 509 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 510 </span> : static _BI2
<span class="lineNum"> 511 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
<span class="lineNum"> 512 </span> : {
<span class="lineNum"> 513 </span> : while (__first != __last)
<span class="lineNum"> 514 </span> : *--__result = *--__last;
<span class="lineNum"> 515 </span> : return __result;
<span class="lineNum"> 516 </span> : }
<span class="lineNum"> 517 </span> : };
<span class="lineNum"> 518 </span> :
<span class="lineNum"> 519 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 520 </span> : template<typename _Category>
<span class="lineNum"> 521 </span> : struct __copy_move_backward<true, false, _Category>
<span class="lineNum"> 522 </span> : {
<span class="lineNum"> 523 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 524 </span> : static _BI2
<span class="lineNum"> 525 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
<span class="lineNum"> 526 </span> : {
<span class="lineNum"> 527 </span> : while (__first != __last)
<span class="lineNum"> 528 </span> : *--__result = std::move(*--__last);
<span class="lineNum"> 529 </span> : return __result;
<span class="lineNum"> 530 </span> : }
<span class="lineNum"> 531 </span> : };
<span class="lineNum"> 532 </span> : #endif
<span class="lineNum"> 533 </span> :
<span class="lineNum"> 534 </span> : template<>
<span class="lineNum"> 535 </span> : struct __copy_move_backward<false, false, random_access_iterator_tag>
<span class="lineNum"> 536 </span> : {
<span class="lineNum"> 537 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 538 </span> : static _BI2
<span class="lineNum"> 539 </span><span class="lineCov"> 150 : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</span>
<span class="lineNum"> 540 </span> : {
<span class="lineNum"> 541 </span> : typename iterator_traits<_BI1>::difference_type __n;
<span class="lineNum"> 542 </span><span class="lineCov"> 524 : for (__n = __last - __first; __n > 0; --__n)</span>
<span class="lineNum"> 543 </span><span class="lineCov"> 374 : *--__result = *--__last;</span>
<span class="lineNum"> 544 </span><span class="lineCov"> 150 : return __result;</span>
<span class="lineNum"> 545 </span> : }
<span class="lineNum"> 546 </span> : };
<span class="lineNum"> 547 </span> :
<span class="lineNum"> 548 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 549 </span> : template<>
<span class="lineNum"> 550 </span> : struct __copy_move_backward<true, false, random_access_iterator_tag>
<span class="lineNum"> 551 </span> : {
<span class="lineNum"> 552 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 553 </span> : static _BI2
<span class="lineNum"> 554 </span> : __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
<span class="lineNum"> 555 </span> : {
<span class="lineNum"> 556 </span> : typename iterator_traits<_BI1>::difference_type __n;
<span class="lineNum"> 557 </span> : for (__n = __last - __first; __n > 0; --__n)
<span class="lineNum"> 558 </span> : *--__result = std::move(*--__last);
<span class="lineNum"> 559 </span> : return __result;
<span class="lineNum"> 560 </span> : }
<span class="lineNum"> 561 </span> : };
<span class="lineNum"> 562 </span> : #endif
<span class="lineNum"> 563 </span> :
<span class="lineNum"> 564 </span> : template<bool _IsMove>
<span class="lineNum"> 565 </span> : struct __copy_move_backward<_IsMove, true, random_access_iterator_tag>
<span class="lineNum"> 566 </span> : {
<span class="lineNum"> 567 </span> : template<typename _Tp>
<span class="lineNum"> 568 </span> : static _Tp*
<span class="lineNum"> 569 </span><span class="lineCov"> 7626 : __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result)</span>
<span class="lineNum"> 570 </span> : {
<span class="lineNum"> 571 </span><span class="lineCov"> 7626 : const ptrdiff_t _Num = __last - __first;</span>
<span class="lineNum"> 572 </span><span class="lineCov"> 7626 : __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num);</span>
<span class="lineNum"> 573 </span><span class="lineCov"> 7626 : return __result - _Num;</span>
<span class="lineNum"> 574 </span> : }
<span class="lineNum"> 575 </span> : };
<span class="lineNum"> 576 </span> :
<span class="lineNum"> 577 </span> : template<bool _IsMove, typename _BI1, typename _BI2>
<span class="lineNum"> 578 </span> : inline _BI2
<span class="lineNum"> 579 </span><span class="lineCov"> 7776 : __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)</span>
<span class="lineNum"> 580 </span> : {
<span class="lineNum"> 581 </span> : typedef typename iterator_traits<_BI1>::value_type _ValueType1;
<span class="lineNum"> 582 </span> : typedef typename iterator_traits<_BI2>::value_type _ValueType2;
<span class="lineNum"> 583 </span> : typedef typename iterator_traits<_BI1>::iterator_category _Category;
<span class="lineNum"> 584 </span> : const bool __simple = (__is_pod(_ValueType1)
<span class="lineNum"> 585 </span> : && __is_pointer<_BI1>::__value
<span class="lineNum"> 586 </span> : && __is_pointer<_BI2>::__value
<span class="lineNum"> 587 </span><span class="lineCov"> 7776 : && __are_same<_ValueType1, _ValueType2>::__value);</span>
<span class="lineNum"> 588 </span> :
<span class="lineNum"> 589 </span> : return std::__copy_move_backward<_IsMove, __simple,
<span class="lineNum"> 590 </span> : _Category>::__copy_move_b(__first,
<span class="lineNum"> 591 </span> : __last,
<span class="lineNum"> 592 </span><span class="lineCov"> 7776 : __result);</span>
<span class="lineNum"> 593 </span> : }
<span class="lineNum"> 594 </span> :
<span class="lineNum"> 595 </span> : template<bool _IsMove, typename _BI1, typename _BI2>
<span class="lineNum"> 596 </span> : inline _BI2
<span class="lineNum"> 597 </span><span class="lineCov"> 7776 : __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)</span>
<span class="lineNum"> 598 </span> : {
<span class="lineNum"> 599 </span> : return _BI2(std::__copy_move_backward_a<_IsMove>
<span class="lineNum"> 600 </span> : (std::__niter_base<_BI1>::__b(__first),
<span class="lineNum"> 601 </span> : std::__niter_base<_BI1>::__b(__last),
<span class="lineNum"> 602 </span><span class="lineCov"> 7776 : std::__niter_base<_BI2>::__b(__result)));</span>
<span class="lineNum"> 603 </span> : }
<span class="lineNum"> 604 </span> :
<span class="lineNum"> 605 </span> : /**
<span class="lineNum"> 606 </span> : * @brief Copies the range [first,last) into result.
<span class="lineNum"> 607 </span> : * @param first A bidirectional iterator.
<span class="lineNum"> 608 </span> : * @param last A bidirectional iterator.
<span class="lineNum"> 609 </span> : * @param result A bidirectional iterator.
<span class="lineNum"> 610 </span> : * @return result - (first - last)
<span class="lineNum"> 611 </span> : *
<span class="lineNum"> 612 </span> : * The function has the same effect as copy, but starts at the end of the
<span class="lineNum"> 613 </span> : * range and works its way to the start, returning the start of the result.
<span class="lineNum"> 614 </span> : * This inline function will boil down to a call to @c memmove whenever
<span class="lineNum"> 615 </span> : * possible. Failing that, if random access iterators are passed, then the
<span class="lineNum"> 616 </span> : * loop count will be known (and therefore a candidate for compiler
<span class="lineNum"> 617 </span> : * optimizations such as unrolling).
<span class="lineNum"> 618 </span> : *
<span class="lineNum"> 619 </span> : * Result may not be in the range [first,last). Use copy instead. Note
<span class="lineNum"> 620 </span> : * that the start of the output range may overlap [first,last).
<span class="lineNum"> 621 </span> : */
<span class="lineNum"> 622 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 623 </span> : inline _BI2
<span class="lineNum"> 624 </span><span class="lineCov"> 7776 : copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)</span>
<span class="lineNum"> 625 </span> : {
<span class="lineNum"> 626 </span> : // concept requirements
<span class="lineNum"> 627 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)
<span class="lineNum"> 628 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)
<span class="lineNum"> 629 </span> : __glibcxx_function_requires(_ConvertibleConcept<
<span class="lineNum"> 630 </span> : typename iterator_traits<_BI1>::value_type,
<span class="lineNum"> 631 </span> : typename iterator_traits<_BI2>::value_type>)
<span class="lineNum"> 632 </span> : __glibcxx_requires_valid_range(__first, __last);
<span class="lineNum"> 633 </span> :
<span class="lineNum"> 634 </span> : return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value>
<span class="lineNum"> 635 </span> : (std::__miter_base<_BI1>::__b(__first),
<span class="lineNum"> 636 </span><span class="lineCov"> 7776 : std::__miter_base<_BI1>::__b(__last), __result));</span>
<span class="lineNum"> 637 </span> : }
<span class="lineNum"> 638 </span> :
<span class="lineNum"> 639 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__
<span class="lineNum"> 640 </span> : /**
<span class="lineNum"> 641 </span> : * @brief Moves the range [first,last) into result.
<span class="lineNum"> 642 </span> : * @param first A bidirectional iterator.
<span class="lineNum"> 643 </span> : * @param last A bidirectional iterator.
<span class="lineNum"> 644 </span> : * @param result A bidirectional iterator.
<span class="lineNum"> 645 </span> : * @return result - (first - last)
<span class="lineNum"> 646 </span> : *
<span class="lineNum"> 647 </span> : * The function has the same effect as move, but starts at the end of the
<span class="lineNum"> 648 </span> : * range and works its way to the start, returning the start of the result.
<span class="lineNum"> 649 </span> : * This inline function will boil down to a call to @c memmove whenever
<span class="lineNum"> 650 </span> : * possible. Failing that, if random access iterators are passed, then the
<span class="lineNum"> 651 </span> : * loop count will be known (and therefore a candidate for compiler
<span class="lineNum"> 652 </span> : * optimizations such as unrolling).
<span class="lineNum"> 653 </span> : *
<span class="lineNum"> 654 </span> : * Result may not be in the range [first,last). Use move instead. Note
<span class="lineNum"> 655 </span> : * that the start of the output range may overlap [first,last).
<span class="lineNum"> 656 </span> : */
<span class="lineNum"> 657 </span> : template<typename _BI1, typename _BI2>
<span class="lineNum"> 658 </span> : inline _BI2
<span class="lineNum"> 659 </span> : move_backward(_BI1 __first, _BI1 __last, _BI2 __result)
<span class="lineNum"> 660 </span> : {
<span class="lineNum"> 661 </span> : // concept requirements
<span class="lineNum"> 662 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)
<span class="lineNum"> 663 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)
<span class="lineNum"> 664 </span> : __glibcxx_function_requires(_ConvertibleConcept<
<span class="lineNum"> 665 </span> : typename iterator_traits<_BI1>::value_type,
<span class="lineNum"> 666 </span> : typename iterator_traits<_BI2>::value_type>)
<span class="lineNum"> 667 </span> : __glibcxx_requires_valid_range(__first, __last);
<span class="lineNum"> 668 </span> :
<span class="lineNum"> 669 </span> : return (std::__copy_move_backward_a2<true>
<span class="lineNum"> 670 </span> : (std::__miter_base<_BI1>::__b(__first),
<span class="lineNum"> 671 </span> : std::__miter_base<_BI1>::__b(__last), __result));
<span class="lineNum"> 672 </span> : }
<span class="lineNum"> 673 </span> :
<span class="lineNum"> 674 </span> : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp)
<span class="lineNum"> 675 </span> : #else
<span class="lineNum"> 676 </span> : #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp)
<span class="lineNum"> 677 </span> : #endif
<span class="lineNum"> 678 </span> :
<span class="lineNum"> 679 </span> : template<typename _ForwardIterator, typename _Tp>
<span class="lineNum"> 680 </span> : inline typename
<span class="lineNum"> 681 </span> : __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type
<span class="lineNum"> 682 </span> : __fill_a(_ForwardIterator __first, _ForwardIterator __last,
<span class="lineNum"> 683 </span><span class="lineCov"> 22386 : const _Tp& __value)</span>
<span class="lineNum"> 684 </span> : {
<span class="lineNum"> 685 </span><span class="lineCov"> 22386 : for (; __first != __last; ++__first)</span>
<span class="lineNum"> 686 </span><span class="lineNoCov"> 0 : *__first = __value;</span>
<span class="lineNum"> 687 </span><span class="lineCov"> 22386 : }</span>
<span class="lineNum"> 688 </span> :
<span class="lineNum"> 689 </span> : template<typename _ForwardIterator, typename _Tp>
<span class="lineNum"> 690 </span> : inline typename
<span class="lineNum"> 691 </span> : __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type
<span class="lineNum"> 692 </span> : __fill_a(_ForwardIterator __first, _ForwardIterator __last,
<span class="lineNum"> 693 </span> : const _Tp& __value)
<span class="lineNum"> 694 </span> : {
<span class="lineNum"> 695 </span> : const _Tp __tmp = __value;
<span class="lineNum"> 696 </span> : for (; __first != __last; ++__first)
<span class="lineNum"> 697 </span> : *__first = __tmp;
<span class="lineNum"> 698 </span> : }
<span class="lineNum"> 699 </span> :
<span class="lineNum"> 700 </span> : // Specialization: for char types we can use memset.
<span class="lineNum"> 701 </span> : template<typename _Tp>
<span class="lineNum"> 702 </span> : inline typename
<span class="lineNum"> 703 </span> : __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type
<span class="lineNum"> 704 </span> : __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c)
<span class="lineNum"> 705 </span> : {
<span class="lineNum"> 706 </span> : const _Tp __tmp = __c;
<span class="lineNum"> 707 </span> : __builtin_memset(__first, static_cast<unsigned char>(__tmp),
<span class="lineNum"> 708 </span> : __last - __first);
<span class="lineNum"> 709 </span> : }
<span class="lineNum"> 710 </span> :
<span class="lineNum"> 711 </span> : /**
<span class="lineNum"> 712 </span> : * @brief Fills the range [first,last) with copies of value.
<span class="lineNum"> 713 </span> : * @param first A forward iterator.
<span class="lineNum"> 714 </span> : * @param last A forward iterator.
<span class="lineNum"> 715 </span> : * @param value A reference-to-const of arbitrary type.
<span class="lineNum"> 716 </span> : * @return Nothing.
<span class="lineNum"> 717 </span> : *
<span class="lineNum"> 718 </span> : * This function fills a range with copies of the same value. For char
<span class="lineNum"> 719 </span> : * types filling contiguous areas of memory, this becomes an inline call
<span class="lineNum"> 720 </span> : * to @c memset or @c wmemset.
<span class="lineNum"> 721 </span> : */
<span class="lineNum"> 722 </span> : template<typename _ForwardIterator, typename _Tp>
<span class="lineNum"> 723 </span> : inline void
<span class="lineNum"> 724 </span><span class="lineCov"> 22386 : fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)</span>
<span class="lineNum"> 725 </span> : {
<span class="lineNum"> 726 </span> : // concept requirements
<span class="lineNum"> 727 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
<span class="lineNum"> 728 </span> : _ForwardIterator>)
<span class="lineNum"> 729 </span> : __glibcxx_requires_valid_range(__first, __last);
<span class="lineNum"> 730 </span> :
<span class="lineNum"> 731 </span><span class="lineCov"> 22386 : std::__fill_a(std::__niter_base<_ForwardIterator>::__b(__first),</span>
<span class="lineNum"> 732 </span> : std::__niter_base<_ForwardIterator>::__b(__last), __value);
<span class="lineNum"> 733 </span><span class="lineCov"> 22386 : }</span>
<span class="lineNum"> 734 </span> :
<span class="lineNum"> 735 </span> : template<typename _OutputIterator, typename _Size, typename _Tp>
<span class="lineNum"> 736 </span> : inline typename
<span class="lineNum"> 737 </span> : __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type
<span class="lineNum"> 738 </span> : __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)
<span class="lineNum"> 739 </span> : {
<span class="lineNum"> 740 </span> : for (; __n > 0; --__n, ++__first)
<span class="lineNum"> 741 </span> : *__first = __value;
<span class="lineNum"> 742 </span> : return __first;
<span class="lineNum"> 743 </span> : }
<span class="lineNum"> 744 </span> :
<span class="lineNum"> 745 </span> : template<typename _OutputIterator, typename _Size, typename _Tp>
<span class="lineNum"> 746 </span> : inline typename
<span class="lineNum"> 747 </span> : __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type
<span class="lineNum"> 748 </span><span class="lineCov"> 9 : __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)</span>
<span class="lineNum"> 749 </span> : {
<span class="lineNum"> 750 </span><span class="lineCov"> 9 : const _Tp __tmp = __value;</span>
<span class="lineNum"> 751 </span><span class="lineCov"> 9 : for (; __n > 0; --__n, ++__first)</span>
<span class="lineNum"> 752 </span><span class="lineNoCov"> 0 : *__first = __tmp;</span>
<span class="lineNum"> 753 </span><span class="lineCov"> 9 : return __first;</span>
<span class="lineNum"> 754 </span> : }
<span class="lineNum"> 755 </span> :
<span class="lineNum"> 756 </span> : template<typename _Size, typename _Tp>
<span class="lineNum"> 757 </span> : inline typename
<span class="lineNum"> 758 </span> : __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type
<span class="lineNum"> 759 </span> : __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c)
<span class="lineNum"> 760 </span> : {
<span class="lineNum"> 761 </span> : std::__fill_a(__first, __first + __n, __c);
<span class="lineNum"> 762 </span> : return __first + __n;
<span class="lineNum"> 763 </span> : }
<span class="lineNum"> 764 </span> :
<span class="lineNum"> 765 </span> : /**
<span class="lineNum"> 766 </span> : * @brief Fills the range [first,first+n) with copies of value.
<span class="lineNum"> 767 </span> : * @param first An output iterator.
<span class="lineNum"> 768 </span> : * @param n The count of copies to perform.
<span class="lineNum"> 769 </span> : * @param value A reference-to-const of arbitrary type.
<span class="lineNum"> 770 </span> : * @return The iterator at first+n.
<span class="lineNum"> 771 </span> : *
<span class="lineNum"> 772 </span> : * This function fills a range with copies of the same value. For char
<span class="lineNum"> 773 </span> : * types filling contiguous areas of memory, this becomes an inline call
<span class="lineNum"> 774 </span> : * to @c memset or @ wmemset.
<span class="lineNum"> 775 </span> : */
<span class="lineNum"> 776 </span> : template<typename _OI, typename _Size, typename _Tp>
<span class="lineNum"> 777 </span> : inline _OI
<span class="lineNum"> 778 </span><span class="lineCov"> 9 : fill_n(_OI __first, _Size __n, const _Tp& __value)</span>
<span class="lineNum"> 779 </span> : {
<span class="lineNum"> 780 </span> : // concept requirements
<span class="lineNum"> 781 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OI, _Tp>)
<span class="lineNum"> 782 </span> :
<span class="lineNum"> 783 </span> : return _OI(std::__fill_n_a(std::__niter_base<_OI>::__b(__first),
<span class="lineNum"> 784 </span><span class="lineCov"> 9 : __n, __value));</span>
<span class="lineNum"> 785 </span> : }
<span class="lineNum"> 786 </span> :
<span class="lineNum"> 787 </span> : template<bool _BoolType>
<span class="lineNum"> 788 </span> : struct __equal
<span class="lineNum"> 789 </span> : {
<span class="lineNum"> 790 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 791 </span> : static bool
<span class="lineNum"> 792 </span><span class="lineCov"> 4 : equal(_II1 __first1, _II1 __last1, _II2 __first2)</span>
<span class="lineNum"> 793 </span> : {
<span class="lineNum"> 794 </span><span class="lineCov"> 51 : for (; __first1 != __last1; ++__first1, ++__first2)</span>
<span class="lineNum"> 795 </span><span class="lineCov"> 47 : if (!(*__first1 == *__first2))</span>
<span class="lineNum"> 796 </span><span class="lineNoCov"> 0 : return false;</span>
<span class="lineNum"> 797 </span><span class="lineCov"> 4 : return true;</span>
<span class="lineNum"> 798 </span> : }
<span class="lineNum"> 799 </span> : };
<span class="lineNum"> 800 </span> :
<span class="lineNum"> 801 </span> : template<>
<span class="lineNum"> 802 </span> : struct __equal<true>
<span class="lineNum"> 803 </span> : {
<span class="lineNum"> 804 </span> : template<typename _Tp>
<span class="lineNum"> 805 </span> : static bool
<span class="lineNum"> 806 </span> : equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2)
<span class="lineNum"> 807 </span> : {
<span class="lineNum"> 808 </span> : return !__builtin_memcmp(__first1, __first2, sizeof(_Tp)
<span class="lineNum"> 809 </span> : * (__last1 - __first1));
<span class="lineNum"> 810 </span> : }
<span class="lineNum"> 811 </span> : };
<span class="lineNum"> 812 </span> :
<span class="lineNum"> 813 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 814 </span> : inline bool
<span class="lineNum"> 815 </span><span class="lineCov"> 4 : __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)</span>
<span class="lineNum"> 816 </span> : {
<span class="lineNum"> 817 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1;
<span class="lineNum"> 818 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2;
<span class="lineNum"> 819 </span> : const bool __simple = (__is_integer<_ValueType1>::__value
<span class="lineNum"> 820 </span> : && __is_pointer<_II1>::__value
<span class="lineNum"> 821 </span> : && __is_pointer<_II2>::__value
<span class="lineNum"> 822 </span><span class="lineCov"> 4 : && __are_same<_ValueType1, _ValueType2>::__value);</span>
<span class="lineNum"> 823 </span> :
<span class="lineNum"> 824 </span><span class="lineCov"> 4 : return std::__equal<__simple>::equal(__first1, __last1, __first2);</span>
<span class="lineNum"> 825 </span> : }
<span class="lineNum"> 826 </span> :
<span class="lineNum"> 827 </span> :
<span class="lineNum"> 828 </span> : template<typename, typename>
<span class="lineNum"> 829 </span> : struct __lc_rai
<span class="lineNum"> 830 </span> : {
<span class="lineNum"> 831 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 832 </span> : static _II1
<span class="lineNum"> 833 </span> : __newlast1(_II1, _II1 __last1, _II2, _II2)
<span class="lineNum"> 834 </span> : { return __last1; }
<span class="lineNum"> 835 </span> :
<span class="lineNum"> 836 </span> : template<typename _II>
<span class="lineNum"> 837 </span> : static bool
<span class="lineNum"> 838 </span> : __cnd2(_II __first, _II __last)
<span class="lineNum"> 839 </span> : { return __first != __last; }
<span class="lineNum"> 840 </span> : };
<span class="lineNum"> 841 </span> :
<span class="lineNum"> 842 </span> : template<>
<span class="lineNum"> 843 </span> : struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag>
<span class="lineNum"> 844 </span> : {
<span class="lineNum"> 845 </span> : template<typename _RAI1, typename _RAI2>
<span class="lineNum"> 846 </span> : static _RAI1
<span class="lineNum"> 847 </span> : __newlast1(_RAI1 __first1, _RAI1 __last1,
<span class="lineNum"> 848 </span> : _RAI2 __first2, _RAI2 __last2)
<span class="lineNum"> 849 </span> : {
<span class="lineNum"> 850 </span> : const typename iterator_traits<_RAI1>::difference_type
<span class="lineNum"> 851 </span> : __diff1 = __last1 - __first1;
<span class="lineNum"> 852 </span> : const typename iterator_traits<_RAI2>::difference_type
<span class="lineNum"> 853 </span> : __diff2 = __last2 - __first2;
<span class="lineNum"> 854 </span> : return __diff2 < __diff1 ? __first1 + __diff2 : __last1;
<span class="lineNum"> 855 </span> : }
<span class="lineNum"> 856 </span> :
<span class="lineNum"> 857 </span> : template<typename _RAI>
<span class="lineNum"> 858 </span> : static bool
<span class="lineNum"> 859 </span> : __cnd2(_RAI, _RAI)
<span class="lineNum"> 860 </span> : { return true; }
<span class="lineNum"> 861 </span> : };
<span class="lineNum"> 862 </span> :
<span class="lineNum"> 863 </span> : template<bool _BoolType>
<span class="lineNum"> 864 </span> : struct __lexicographical_compare
<span class="lineNum"> 865 </span> : {
<span class="lineNum"> 866 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 867 </span> : static bool __lc(_II1, _II1, _II2, _II2);
<span class="lineNum"> 868 </span> : };
<span class="lineNum"> 869 </span> :
<span class="lineNum"> 870 </span> : template<bool _BoolType>
<span class="lineNum"> 871 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 872 </span> : bool
<span class="lineNum"> 873 </span> : __lexicographical_compare<_BoolType>::
<span class="lineNum"> 874 </span> : __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)
<span class="lineNum"> 875 </span> : {
<span class="lineNum"> 876 </span> : typedef typename iterator_traits<_II1>::iterator_category _Category1;
<span class="lineNum"> 877 </span> : typedef typename iterator_traits<_II2>::iterator_category _Category2;
<span class="lineNum"> 878 </span> : typedef std::__lc_rai<_Category1, _Category2> __rai_type;
<span class="lineNum"> 879 </span> :
<span class="lineNum"> 880 </span> : __last1 = __rai_type::__newlast1(__first1, __last1,
<span class="lineNum"> 881 </span> : __first2, __last2);
<span class="lineNum"> 882 </span> : for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);
<span class="lineNum"> 883 </span> : ++__first1, ++__first2)
<span class="lineNum"> 884 </span> : {
<span class="lineNum"> 885 </span> : if (*__first1 < *__first2)
<span class="lineNum"> 886 </span> : return true;
<span class="lineNum"> 887 </span> : if (*__first2 < *__first1)
<span class="lineNum"> 888 </span> : return false;
<span class="lineNum"> 889 </span> : }
<span class="lineNum"> 890 </span> : return __first1 == __last1 && __first2 != __last2;
<span class="lineNum"> 891 </span> : }
<span class="lineNum"> 892 </span> :
<span class="lineNum"> 893 </span> : template<>
<span class="lineNum"> 894 </span> : struct __lexicographical_compare<true>
<span class="lineNum"> 895 </span> : {
<span class="lineNum"> 896 </span> : template<typename _Tp, typename _Up>
<span class="lineNum"> 897 </span> : static bool
<span class="lineNum"> 898 </span> : __lc(const _Tp* __first1, const _Tp* __last1,
<span class="lineNum"> 899 </span> : const _Up* __first2, const _Up* __last2)
<span class="lineNum"> 900 </span> : {
<span class="lineNum"> 901 </span> : const size_t __len1 = __last1 - __first1;
<span class="lineNum"> 902 </span> : const size_t __len2 = __last2 - __first2;
<span class="lineNum"> 903 </span> : const int __result = __builtin_memcmp(__first1, __first2,
<span class="lineNum"> 904 </span> : std::min(__len1, __len2));
<span class="lineNum"> 905 </span> : return __result != 0 ? __result < 0 : __len1 < __len2;
<span class="lineNum"> 906 </span> : }
<span class="lineNum"> 907 </span> : };
<span class="lineNum"> 908 </span> :
<span class="lineNum"> 909 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 910 </span> : inline bool
<span class="lineNum"> 911 </span> : __lexicographical_compare_aux(_II1 __first1, _II1 __last1,
<span class="lineNum"> 912 </span> : _II2 __first2, _II2 __last2)
<span class="lineNum"> 913 </span> : {
<span class="lineNum"> 914 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1;
<span class="lineNum"> 915 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2;
<span class="lineNum"> 916 </span> : const bool __simple =
<span class="lineNum"> 917 </span> : (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value
<span class="lineNum"> 918 </span> : && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed
<span class="lineNum"> 919 </span> : && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed
<span class="lineNum"> 920 </span> : && __is_pointer<_II1>::__value
<span class="lineNum"> 921 </span> : && __is_pointer<_II2>::__value);
<span class="lineNum"> 922 </span> :
<span class="lineNum"> 923 </span> : return std::__lexicographical_compare<__simple>::__lc(__first1, __last1,
<span class="lineNum"> 924 </span> : __first2, __last2);
<span class="lineNum"> 925 </span> : }
<span class="lineNum"> 926 </span> :
<span class="lineNum"> 927 </span> : _GLIBCXX_END_NAMESPACE
<span class="lineNum"> 928 </span> :
<span class="lineNum"> 929 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P)
<span class="lineNum"> 930 </span> :
<span class="lineNum"> 931 </span> : /**
<span class="lineNum"> 932 </span> : * @brief Tests a range for element-wise equality.
<span class="lineNum"> 933 </span> : * @param first1 An input iterator.
<span class="lineNum"> 934 </span> : * @param last1 An input iterator.
<span class="lineNum"> 935 </span> : * @param first2 An input iterator.
<span class="lineNum"> 936 </span> : * @return A boolean true or false.
<span class="lineNum"> 937 </span> : *
<span class="lineNum"> 938 </span> : * This compares the elements of two ranges using @c == and returns true or
<span class="lineNum"> 939 </span> : * false depending on whether all of the corresponding elements of the
<span class="lineNum"> 940 </span> : * ranges are equal.
<span class="lineNum"> 941 </span> : */
<span class="lineNum"> 942 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 943 </span> : inline bool
<span class="lineNum"> 944 </span><span class="lineCov"> 4 : equal(_II1 __first1, _II1 __last1, _II2 __first2)</span>
<span class="lineNum"> 945 </span> : {
<span class="lineNum"> 946 </span> : // concept requirements
<span class="lineNum"> 947 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>)
<span class="lineNum"> 948 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>)
<span class="lineNum"> 949 </span> : __glibcxx_function_requires(_EqualOpConcept<
<span class="lineNum"> 950 </span> : typename iterator_traits<_II1>::value_type,
<span class="lineNum"> 951 </span> : typename iterator_traits<_II2>::value_type>)
<span class="lineNum"> 952 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 953 </span> :
<span class="lineNum"> 954 </span> : return std::__equal_aux(std::__niter_base<_II1>::__b(__first1),
<span class="lineNum"> 955 </span> : std::__niter_base<_II1>::__b(__last1),
<span class="lineNum"> 956 </span><span class="lineCov"> 4 : std::__niter_base<_II2>::__b(__first2));</span>
<span class="lineNum"> 957 </span> : }
<span class="lineNum"> 958 </span> :
<span class="lineNum"> 959 </span> : /**
<span class="lineNum"> 960 </span> : * @brief Tests a range for element-wise equality.
<span class="lineNum"> 961 </span> : * @param first1 An input iterator.
<span class="lineNum"> 962 </span> : * @param last1 An input iterator.
<span class="lineNum"> 963 </span> : * @param first2 An input iterator.
<span class="lineNum"> 964 </span> : * @param binary_pred A binary predicate @link s20_3_1_base
<span class="lineNum"> 965 </span> : * functor@endlink.
<span class="lineNum"> 966 </span> : * @return A boolean true or false.
<span class="lineNum"> 967 </span> : *
<span class="lineNum"> 968 </span> : * This compares the elements of two ranges using the binary_pred
<span class="lineNum"> 969 </span> : * parameter, and returns true or
<span class="lineNum"> 970 </span> : * false depending on whether all of the corresponding elements of the
<span class="lineNum"> 971 </span> : * ranges are equal.
<span class="lineNum"> 972 </span> : */
<span class="lineNum"> 973 </span> : template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
<span class="lineNum"> 974 </span> : inline bool
<span class="lineNum"> 975 </span> : equal(_IIter1 __first1, _IIter1 __last1,
<span class="lineNum"> 976 </span> : _IIter2 __first2, _BinaryPredicate __binary_pred)
<span class="lineNum"> 977 </span> : {
<span class="lineNum"> 978 </span> : // concept requirements
<span class="lineNum"> 979 </span> : __glibcxx_function_requires(_InputIteratorConcept<_IIter1>)
<span class="lineNum"> 980 </span> : __glibcxx_function_requires(_InputIteratorConcept<_IIter2>)
<span class="lineNum"> 981 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 982 </span> :
<span class="lineNum"> 983 </span> : for (; __first1 != __last1; ++__first1, ++__first2)
<span class="lineNum"> 984 </span> : if (!bool(__binary_pred(*__first1, *__first2)))
<span class="lineNum"> 985 </span> : return false;
<span class="lineNum"> 986 </span> : return true;
<span class="lineNum"> 987 </span> : }
<span class="lineNum"> 988 </span> :
<span class="lineNum"> 989 </span> : /**
<span class="lineNum"> 990 </span> : * @brief Performs "dictionary" comparison on ranges.
<span class="lineNum"> 991 </span> : * @param first1 An input iterator.
<span class="lineNum"> 992 </span> : * @param last1 An input iterator.
<span class="lineNum"> 993 </span> : * @param first2 An input iterator.
<span class="lineNum"> 994 </span> : * @param last2 An input iterator.
<span class="lineNum"> 995 </span> : * @return A boolean true or false.
<span class="lineNum"> 996 </span> : *
<span class="lineNum"> 997 </span> : * "Returns true if the sequence of elements defined by the range
<span class="lineNum"> 998 </span> : * [first1,last1) is lexicographically less than the sequence of elements
<span class="lineNum"> 999 </span> : * defined by the range [first2,last2). Returns false otherwise."
<span class="lineNum"> 1000 </span> : * (Quoted from [25.3.8]/1.) If the iterators are all character pointers,
<span class="lineNum"> 1001 </span> : * then this is an inline call to @c memcmp.
<span class="lineNum"> 1002 </span> : */
<span class="lineNum"> 1003 </span> : template<typename _II1, typename _II2>
<span class="lineNum"> 1004 </span> : inline bool
<span class="lineNum"> 1005 </span> : lexicographical_compare(_II1 __first1, _II1 __last1,
<span class="lineNum"> 1006 </span> : _II2 __first2, _II2 __last2)
<span class="lineNum"> 1007 </span> : {
<span class="lineNum"> 1008 </span> : // concept requirements
<span class="lineNum"> 1009 </span> : typedef typename iterator_traits<_II1>::value_type _ValueType1;
<span class="lineNum"> 1010 </span> : typedef typename iterator_traits<_II2>::value_type _ValueType2;
<span class="lineNum"> 1011 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>)
<span class="lineNum"> 1012 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>)
<span class="lineNum"> 1013 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>)
<span class="lineNum"> 1014 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>)
<span class="lineNum"> 1015 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 1016 </span> : __glibcxx_requires_valid_range(__first2, __last2);
<span class="lineNum"> 1017 </span> :
<span class="lineNum"> 1018 </span> : return std::__lexicographical_compare_aux
<span class="lineNum"> 1019 </span> : (std::__niter_base<_II1>::__b(__first1),
<span class="lineNum"> 1020 </span> : std::__niter_base<_II1>::__b(__last1),
<span class="lineNum"> 1021 </span> : std::__niter_base<_II2>::__b(__first2),
<span class="lineNum"> 1022 </span> : std::__niter_base<_II2>::__b(__last2));
<span class="lineNum"> 1023 </span> : }
<span class="lineNum"> 1024 </span> :
<span class="lineNum"> 1025 </span> : /**
<span class="lineNum"> 1026 </span> : * @brief Performs "dictionary" comparison on ranges.
<span class="lineNum"> 1027 </span> : * @param first1 An input iterator.
<span class="lineNum"> 1028 </span> : * @param last1 An input iterator.
<span class="lineNum"> 1029 </span> : * @param first2 An input iterator.
<span class="lineNum"> 1030 </span> : * @param last2 An input iterator.
<span class="lineNum"> 1031 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink.
<span class="lineNum"> 1032 </span> : * @return A boolean true or false.
<span class="lineNum"> 1033 </span> : *
<span class="lineNum"> 1034 </span> : * The same as the four-parameter @c lexicographical_compare, but uses the
<span class="lineNum"> 1035 </span> : * comp parameter instead of @c <.
<span class="lineNum"> 1036 </span> : */
<span class="lineNum"> 1037 </span> : template<typename _II1, typename _II2, typename _Compare>
<span class="lineNum"> 1038 </span> : bool
<span class="lineNum"> 1039 </span> : lexicographical_compare(_II1 __first1, _II1 __last1,
<span class="lineNum"> 1040 </span> : _II2 __first2, _II2 __last2, _Compare __comp)
<span class="lineNum"> 1041 </span> : {
<span class="lineNum"> 1042 </span> : typedef typename iterator_traits<_II1>::iterator_category _Category1;
<span class="lineNum"> 1043 </span> : typedef typename iterator_traits<_II2>::iterator_category _Category2;
<span class="lineNum"> 1044 </span> : typedef std::__lc_rai<_Category1, _Category2> __rai_type;
<span class="lineNum"> 1045 </span> :
<span class="lineNum"> 1046 </span> : // concept requirements
<span class="lineNum"> 1047 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II1>)
<span class="lineNum"> 1048 </span> : __glibcxx_function_requires(_InputIteratorConcept<_II2>)
<span class="lineNum"> 1049 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 1050 </span> : __glibcxx_requires_valid_range(__first2, __last2);
<span class="lineNum"> 1051 </span> :
<span class="lineNum"> 1052 </span> : __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2);
<span class="lineNum"> 1053 </span> : for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);
<span class="lineNum"> 1054 </span> : ++__first1, ++__first2)
<span class="lineNum"> 1055 </span> : {
<span class="lineNum"> 1056 </span> : if (__comp(*__first1, *__first2))
<span class="lineNum"> 1057 </span> : return true;
<span class="lineNum"> 1058 </span> : if (__comp(*__first2, *__first1))
<span class="lineNum"> 1059 </span> : return false;
<span class="lineNum"> 1060 </span> : }
<span class="lineNum"> 1061 </span> : return __first1 == __last1 && __first2 != __last2;
<span class="lineNum"> 1062 </span> : }
<span class="lineNum"> 1063 </span> :
<span class="lineNum"> 1064 </span> : /**
<span class="lineNum"> 1065 </span> : * @brief Finds the places in ranges which don't match.
<span class="lineNum"> 1066 </span> : * @param first1 An input iterator.
<span class="lineNum"> 1067 </span> : * @param last1 An input iterator.
<span class="lineNum"> 1068 </span> : * @param first2 An input iterator.
<span class="lineNum"> 1069 </span> : * @return A pair of iterators pointing to the first mismatch.
<span class="lineNum"> 1070 </span> : *
<span class="lineNum"> 1071 </span> : * This compares the elements of two ranges using @c == and returns a pair
<span class="lineNum"> 1072 </span> : * of iterators. The first iterator points into the first range, the
<span class="lineNum"> 1073 </span> : * second iterator points into the second range, and the elements pointed
<span class="lineNum"> 1074 </span> : * to by the iterators are not equal.
<span class="lineNum"> 1075 </span> : */
<span class="lineNum"> 1076 </span> : template<typename _InputIterator1, typename _InputIterator2>
<span class="lineNum"> 1077 </span> : pair<_InputIterator1, _InputIterator2>
<span class="lineNum"> 1078 </span> : mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
<span class="lineNum"> 1079 </span> : _InputIterator2 __first2)
<span class="lineNum"> 1080 </span> : {
<span class="lineNum"> 1081 </span> : // concept requirements
<span class="lineNum"> 1082 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
<span class="lineNum"> 1083 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
<span class="lineNum"> 1084 </span> : __glibcxx_function_requires(_EqualOpConcept<
<span class="lineNum"> 1085 </span> : typename iterator_traits<_InputIterator1>::value_type,
<span class="lineNum"> 1086 </span> : typename iterator_traits<_InputIterator2>::value_type>)
<span class="lineNum"> 1087 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 1088 </span> :
<span class="lineNum"> 1089 </span> : while (__first1 != __last1 && *__first1 == *__first2)
<span class="lineNum"> 1090 </span> : {
<span class="lineNum"> 1091 </span> : ++__first1;
<span class="lineNum"> 1092 </span> : ++__first2;
<span class="lineNum"> 1093 </span> : }
<span class="lineNum"> 1094 </span> : return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
<span class="lineNum"> 1095 </span> : }
<span class="lineNum"> 1096 </span> :
<span class="lineNum"> 1097 </span> : /**
<span class="lineNum"> 1098 </span> : * @brief Finds the places in ranges which don't match.
<span class="lineNum"> 1099 </span> : * @param first1 An input iterator.
<span class="lineNum"> 1100 </span> : * @param last1 An input iterator.
<span class="lineNum"> 1101 </span> : * @param first2 An input iterator.
<span class="lineNum"> 1102 </span> : * @param binary_pred A binary predicate @link s20_3_1_base
<span class="lineNum"> 1103 </span> : * functor@endlink.
<span class="lineNum"> 1104 </span> : * @return A pair of iterators pointing to the first mismatch.
<span class="lineNum"> 1105 </span> : *
<span class="lineNum"> 1106 </span> : * This compares the elements of two ranges using the binary_pred
<span class="lineNum"> 1107 </span> : * parameter, and returns a pair
<span class="lineNum"> 1108 </span> : * of iterators. The first iterator points into the first range, the
<span class="lineNum"> 1109 </span> : * second iterator points into the second range, and the elements pointed
<span class="lineNum"> 1110 </span> : * to by the iterators are not equal.
<span class="lineNum"> 1111 </span> : */
<span class="lineNum"> 1112 </span> : template<typename _InputIterator1, typename _InputIterator2,
<span class="lineNum"> 1113 </span> : typename _BinaryPredicate>
<span class="lineNum"> 1114 </span> : pair<_InputIterator1, _InputIterator2>
<span class="lineNum"> 1115 </span> : mismatch(_InputIterator1 __first1, _InputIterator1 __last1,
<span class="lineNum"> 1116 </span> : _InputIterator2 __first2, _BinaryPredicate __binary_pred)
<span class="lineNum"> 1117 </span> : {
<span class="lineNum"> 1118 </span> : // concept requirements
<span class="lineNum"> 1119 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
<span class="lineNum"> 1120 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
<span class="lineNum"> 1121 </span> : __glibcxx_requires_valid_range(__first1, __last1);
<span class="lineNum"> 1122 </span> :
<span class="lineNum"> 1123 </span> : while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2)))
<span class="lineNum"> 1124 </span> : {
<span class="lineNum"> 1125 </span> : ++__first1;
<span class="lineNum"> 1126 </span> : ++__first2;
<span class="lineNum"> 1127 </span> : }
<span class="lineNum"> 1128 </span> : return pair<_InputIterator1, _InputIterator2>(__first1, __first2);
<span class="lineNum"> 1129 </span> : }
<span class="lineNum"> 1130 </span> :
<span class="lineNum"> 1131 </span> : _GLIBCXX_END_NESTED_NAMESPACE
<span class="lineNum"> 1132 </span> :
<span class="lineNum"> 1133 </span> : // NB: This file is included within many other C++ includes, as a way
<span class="lineNum"> 1134 </span> : // of getting the base algorithms. So, make sure that parallel bits
<span class="lineNum"> 1135 </span> : // come in too if requested.
<span class="lineNum"> 1136 </span> : #ifdef _GLIBCXX_PARALLEL
<span class="lineNum"> 1137 </span> : # include <parallel/algobase.h>
<span class="lineNum"> 1138 </span> : #endif
<span class="lineNum"> 1139 </span> :
<span class="lineNum"> 1140 </span> : #endif
</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>
|
