-
Notifications
You must be signed in to change notification settings - Fork 0
/
#usr#include#c++#7#bits#stl_algobase.h.gcov
1431 lines (1431 loc) · 71.9 KB
/
#usr#include#c++#7#bits#stl_algobase.h.gcov
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
-: 0:Source:/usr/include/c++/7/bits/stl_algobase.h
-: 0:Graph:/home/vagrant/CMakeFiles/unit_tests.dir/environment_tests.cpp.gcno
-: 0:Data:/home/vagrant/CMakeFiles/unit_tests.dir/environment_tests.cpp.gcda
-: 0:Runs:2
-: 0:Programs:2
-: 1:// Core algorithmic facilities -*- C++ -*-
-: 2:
-: 3:// Copyright (C) 2001-2017 Free Software Foundation, Inc.
-: 4://
-: 5:// This file is part of the GNU ISO C++ Library. This library is free
-: 6:// software; you can redistribute it and/or modify it under the
-: 7:// terms of the GNU General Public License as published by the
-: 8:// Free Software Foundation; either version 3, or (at your option)
-: 9:// any later version.
-: 10:
-: 11:// This library is distributed in the hope that it will be useful,
-: 12:// but WITHOUT ANY WARRANTY; without even the implied warranty of
-: 13:// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-: 14:// GNU General Public License for more details.
-: 15:
-: 16:// Under Section 7 of GPL version 3, you are granted additional
-: 17:// permissions described in the GCC Runtime Library Exception, version
-: 18:// 3.1, as published by the Free Software Foundation.
-: 19:
-: 20:// You should have received a copy of the GNU General Public License and
-: 21:// a copy of the GCC Runtime Library Exception along with this program;
-: 22:// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
-: 23:// <http://www.gnu.org/licenses/>.
-: 24:
-: 25:/*
-: 26: *
-: 27: * Copyright (c) 1994
-: 28: * Hewlett-Packard Company
-: 29: *
-: 30: * Permission to use, copy, modify, distribute and sell this software
-: 31: * and its documentation for any purpose is hereby granted without fee,
-: 32: * provided that the above copyright notice appear in all copies and
-: 33: * that both that copyright notice and this permission notice appear
-: 34: * in supporting documentation. Hewlett-Packard Company makes no
-: 35: * representations about the suitability of this software for any
-: 36: * purpose. It is provided "as is" without express or implied warranty.
-: 37: *
-: 38: *
-: 39: * Copyright (c) 1996-1998
-: 40: * Silicon Graphics Computer Systems, Inc.
-: 41: *
-: 42: * Permission to use, copy, modify, distribute and sell this software
-: 43: * and its documentation for any purpose is hereby granted without fee,
-: 44: * provided that the above copyright notice appear in all copies and
-: 45: * that both that copyright notice and this permission notice appear
-: 46: * in supporting documentation. Silicon Graphics makes no
-: 47: * representations about the suitability of this software for any
-: 48: * purpose. It is provided "as is" without express or implied warranty.
-: 49: */
-: 50:
-: 51:/** @file bits/stl_algobase.h
-: 52: * This is an internal header file, included by other library headers.
-: 53: * Do not attempt to use it directly. @headername{algorithm}
-: 54: */
-: 55:
-: 56:#ifndef _STL_ALGOBASE_H
-: 57:#define _STL_ALGOBASE_H 1
-: 58:
-: 59:#include <bits/c++config.h>
-: 60:#include <bits/functexcept.h>
-: 61:#include <bits/cpp_type_traits.h>
-: 62:#include <ext/type_traits.h>
-: 63:#include <ext/numeric_traits.h>
-: 64:#include <bits/stl_pair.h>
-: 65:#include <bits/stl_iterator_base_types.h>
-: 66:#include <bits/stl_iterator_base_funcs.h>
-: 67:#include <bits/stl_iterator.h>
-: 68:#include <bits/concept_check.h>
-: 69:#include <debug/debug.h>
-: 70:#include <bits/move.h> // For std::swap and _GLIBCXX_MOVE
-: 71:#include <bits/predefined_ops.h>
-: 72:
-: 73:namespace std _GLIBCXX_VISIBILITY(default)
-: 74:{
-: 75:_GLIBCXX_BEGIN_NAMESPACE_VERSION
-: 76:
-: 77:#if __cplusplus < 201103L
-: 78: // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a
-: 79: // nutshell, we are partially implementing the resolution of DR 187,
-: 80: // when it's safe, i.e., the value_types are equal.
-: 81: template<bool _BoolType>
-: 82: struct __iter_swap
-: 83: {
-: 84: template<typename _ForwardIterator1, typename _ForwardIterator2>
-: 85: static void
-: 86: iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
-: 87: {
-: 88: typedef typename iterator_traits<_ForwardIterator1>::value_type
-: 89: _ValueType1;
-: 90: _ValueType1 __tmp = _GLIBCXX_MOVE(*__a);
-: 91: *__a = _GLIBCXX_MOVE(*__b);
-: 92: *__b = _GLIBCXX_MOVE(__tmp);
-: 93: }
-: 94: };
-: 95:
-: 96: template<>
-: 97: struct __iter_swap<true>
-: 98: {
-: 99: template<typename _ForwardIterator1, typename _ForwardIterator2>
-: 100: static void
-: 101: iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
-: 102: {
-: 103: swap(*__a, *__b);
-: 104: }
-: 105: };
-: 106:#endif
-: 107:
-: 108: /**
-: 109: * @brief Swaps the contents of two iterators.
-: 110: * @ingroup mutating_algorithms
-: 111: * @param __a An iterator.
-: 112: * @param __b Another iterator.
-: 113: * @return Nothing.
-: 114: *
-: 115: * This function swaps the values pointed to by two iterators, not the
-: 116: * iterators themselves.
-: 117: */
-: 118: template<typename _ForwardIterator1, typename _ForwardIterator2>
-: 119: inline void
-: 120: iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
-: 121: {
-: 122: // concept requirements
-: 123: __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
-: 124: _ForwardIterator1>)
-: 125: __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
-: 126: _ForwardIterator2>)
-: 127:
-: 128:#if __cplusplus < 201103L
-: 129: typedef typename iterator_traits<_ForwardIterator1>::value_type
-: 130: _ValueType1;
-: 131: typedef typename iterator_traits<_ForwardIterator2>::value_type
-: 132: _ValueType2;
-: 133:
-: 134: __glibcxx_function_requires(_ConvertibleConcept<_ValueType1,
-: 135: _ValueType2>)
-: 136: __glibcxx_function_requires(_ConvertibleConcept<_ValueType2,
-: 137: _ValueType1>)
-: 138:
-: 139: typedef typename iterator_traits<_ForwardIterator1>::reference
-: 140: _ReferenceType1;
-: 141: typedef typename iterator_traits<_ForwardIterator2>::reference
-: 142: _ReferenceType2;
-: 143: std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value
-: 144: && __are_same<_ValueType1&, _ReferenceType1>::__value
-: 145: && __are_same<_ValueType2&, _ReferenceType2>::__value>::
-: 146: iter_swap(__a, __b);
-: 147:#else
-: 148: swap(*__a, *__b);
-: 149:#endif
-: 150: }
-: 151:
-: 152: /**
-: 153: * @brief Swap the elements of two sequences.
-: 154: * @ingroup mutating_algorithms
-: 155: * @param __first1 A forward iterator.
-: 156: * @param __last1 A forward iterator.
-: 157: * @param __first2 A forward iterator.
-: 158: * @return An iterator equal to @p first2+(last1-first1).
-: 159: *
-: 160: * Swaps each element in the range @p [first1,last1) with the
-: 161: * corresponding element in the range @p [first2,(last1-first1)).
-: 162: * The ranges must not overlap.
-: 163: */
-: 164: template<typename _ForwardIterator1, typename _ForwardIterator2>
-: 165: _ForwardIterator2
-: 166: swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
-: 167: _ForwardIterator2 __first2)
-: 168: {
-: 169: // concept requirements
-: 170: __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
-: 171: _ForwardIterator1>)
-: 172: __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
-: 173: _ForwardIterator2>)
-: 174: __glibcxx_requires_valid_range(__first1, __last1);
-: 175:
-: 176: for (; __first1 != __last1; ++__first1, (void)++__first2)
-: 177: std::iter_swap(__first1, __first2);
-: 178: return __first2;
-: 179: }
-: 180:
-: 181: /**
-: 182: * @brief This does what you think it does.
-: 183: * @ingroup sorting_algorithms
-: 184: * @param __a A thing of arbitrary type.
-: 185: * @param __b Another thing of arbitrary type.
-: 186: * @return The lesser of the parameters.
-: 187: *
-: 188: * This is the simple classic generic implementation. It will work on
-: 189: * temporary expressions, since they are only evaluated once, unlike a
-: 190: * preprocessor macro.
-: 191: */
-: 192: template<typename _Tp>
-: 193: _GLIBCXX14_CONSTEXPR
-: 194: inline const _Tp&
-: 195: min(const _Tp& __a, const _Tp& __b)
-: 196: {
-: 197: // concept requirements
-: 198: __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
-: 199: //return __b < __a ? __b : __a;
-: 200: if (__b < __a)
-: 201: return __b;
-: 202: return __a;
-: 203: }
-: 204:
-: 205: /**
-: 206: * @brief This does what you think it does.
-: 207: * @ingroup sorting_algorithms
-: 208: * @param __a A thing of arbitrary type.
-: 209: * @param __b Another thing of arbitrary type.
-: 210: * @return The greater of the parameters.
-: 211: *
-: 212: * This is the simple classic generic implementation. It will work on
-: 213: * temporary expressions, since they are only evaluated once, unlike a
-: 214: * preprocessor macro.
-: 215: */
-: 216: template<typename _Tp>
-: 217: _GLIBCXX14_CONSTEXPR
-: 218: inline const _Tp&
function _ZSt3maxImERKT_S2_S2_ called 82614 returned 100% blocks executed 100%
82614: 219: max(const _Tp& __a, const _Tp& __b)
-: 220: {
-: 221: // concept requirements
-: 222: __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
-: 223: //return __a < __b ? __b : __a;
82614: 224: if (__a < __b)
branch 0 taken 55% (fallthrough)
branch 1 taken 45%
45663: 225: return __b;
36951: 226: return __a;
-: 227: }
-: 228:
-: 229: /**
-: 230: * @brief This does what you think it does.
-: 231: * @ingroup sorting_algorithms
-: 232: * @param __a A thing of arbitrary type.
-: 233: * @param __b Another thing of arbitrary type.
-: 234: * @param __comp A @link comparison_functors comparison functor@endlink.
-: 235: * @return The lesser of the parameters.
-: 236: *
-: 237: * This will work on temporary expressions, since they are only evaluated
-: 238: * once, unlike a preprocessor macro.
-: 239: */
-: 240: template<typename _Tp, typename _Compare>
-: 241: _GLIBCXX14_CONSTEXPR
-: 242: inline const _Tp&
-: 243: min(const _Tp& __a, const _Tp& __b, _Compare __comp)
-: 244: {
-: 245: //return __comp(__b, __a) ? __b : __a;
-: 246: if (__comp(__b, __a))
-: 247: return __b;
-: 248: return __a;
-: 249: }
-: 250:
-: 251: /**
-: 252: * @brief This does what you think it does.
-: 253: * @ingroup sorting_algorithms
-: 254: * @param __a A thing of arbitrary type.
-: 255: * @param __b Another thing of arbitrary type.
-: 256: * @param __comp A @link comparison_functors comparison functor@endlink.
-: 257: * @return The greater of the parameters.
-: 258: *
-: 259: * This will work on temporary expressions, since they are only evaluated
-: 260: * once, unlike a preprocessor macro.
-: 261: */
-: 262: template<typename _Tp, typename _Compare>
-: 263: _GLIBCXX14_CONSTEXPR
-: 264: inline const _Tp&
-: 265: max(const _Tp& __a, const _Tp& __b, _Compare __comp)
-: 266: {
-: 267: //return __comp(__a, __b) ? __b : __a;
-: 268: if (__comp(__a, __b))
-: 269: return __b;
-: 270: return __a;
-: 271: }
-: 272:
-: 273: // Fallback implementation of the function in bits/stl_iterator.h used to
-: 274: // remove the __normal_iterator wrapper. See copy, fill, ...
-: 275: template<typename _Iterator>
-: 276: inline _Iterator
-: 277: __niter_base(_Iterator __it)
-: 278: { return __it; }
-: 279:
-: 280: // All of these auxiliary structs serve two purposes. (1) Replace
-: 281: // calls to copy with memmove whenever possible. (Memmove, not memcpy,
-: 282: // because the input and output ranges are permitted to overlap.)
-: 283: // (2) If we're using random access iterators, then write the loop as
-: 284: // a for loop with an explicit count.
-: 285:
-: 286: template<bool, bool, typename>
-: 287: struct __copy_move
-: 288: {
-: 289: template<typename _II, typename _OI>
-: 290: static _OI
-: 291: __copy_m(_II __first, _II __last, _OI __result)
-: 292: {
-: 293: for (; __first != __last; ++__result, (void)++__first)
-: 294: *__result = *__first;
-: 295: return __result;
-: 296: }
-: 297: };
-: 298:
-: 299:#if __cplusplus >= 201103L
-: 300: template<typename _Category>
-: 301: struct __copy_move<true, false, _Category>
-: 302: {
-: 303: template<typename _II, typename _OI>
-: 304: static _OI
-: 305: __copy_m(_II __first, _II __last, _OI __result)
-: 306: {
-: 307: for (; __first != __last; ++__result, (void)++__first)
-: 308: *__result = std::move(*__first);
-: 309: return __result;
-: 310: }
-: 311: };
-: 312:#endif
-: 313:
-: 314: template<>
-: 315: struct __copy_move<false, false, random_access_iterator_tag>
-: 316: {
-: 317: template<typename _II, typename _OI>
-: 318: static _OI
-: 319: __copy_m(_II __first, _II __last, _OI __result)
-: 320: {
-: 321: typedef typename iterator_traits<_II>::difference_type _Distance;
-: 322: for(_Distance __n = __last - __first; __n > 0; --__n)
-: 323: {
-: 324: *__result = *__first;
-: 325: ++__first;
-: 326: ++__result;
-: 327: }
-: 328: return __result;
-: 329: }
-: 330: };
-: 331:
-: 332:#if __cplusplus >= 201103L
-: 333: template<>
-: 334: struct __copy_move<true, false, random_access_iterator_tag>
-: 335: {
-: 336: template<typename _II, typename _OI>
-: 337: static _OI
-: 338: __copy_m(_II __first, _II __last, _OI __result)
-: 339: {
-: 340: typedef typename iterator_traits<_II>::difference_type _Distance;
-: 341: for(_Distance __n = __last - __first; __n > 0; --__n)
-: 342: {
-: 343: *__result = std::move(*__first);
-: 344: ++__first;
-: 345: ++__result;
-: 346: }
-: 347: return __result;
-: 348: }
-: 349: };
-: 350:#endif
-: 351:
-: 352: template<bool _IsMove>
-: 353: struct __copy_move<_IsMove, true, random_access_iterator_tag>
-: 354: {
-: 355: template<typename _Tp>
-: 356: static _Tp*
-: 357: __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result)
-: 358: {
-: 359:#if __cplusplus >= 201103L
-: 360: using __assignable = conditional<_IsMove,
-: 361: is_move_assignable<_Tp>,
-: 362: is_copy_assignable<_Tp>>;
-: 363: // trivial types can have deleted assignment
-: 364: static_assert( __assignable::type::value, "type is not assignable" );
-: 365:#endif
-: 366: const ptrdiff_t _Num = __last - __first;
-: 367: if (_Num)
-: 368: __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
-: 369: return __result + _Num;
-: 370: }
-: 371: };
-: 372:
-: 373: template<bool _IsMove, typename _II, typename _OI>
-: 374: inline _OI
-: 375: __copy_move_a(_II __first, _II __last, _OI __result)
-: 376: {
-: 377: typedef typename iterator_traits<_II>::value_type _ValueTypeI;
-: 378: typedef typename iterator_traits<_OI>::value_type _ValueTypeO;
-: 379: typedef typename iterator_traits<_II>::iterator_category _Category;
-: 380: const bool __simple = (__is_trivial(_ValueTypeI)
-: 381: && __is_pointer<_II>::__value
-: 382: && __is_pointer<_OI>::__value
-: 383: && __are_same<_ValueTypeI, _ValueTypeO>::__value);
-: 384:
-: 385: return std::__copy_move<_IsMove, __simple,
-: 386: _Category>::__copy_m(__first, __last, __result);
-: 387: }
-: 388:
-: 389: // Helpers for streambuf iterators (either istream or ostream).
-: 390: // NB: avoid including <iosfwd>, relatively large.
-: 391: template<typename _CharT>
-: 392: struct char_traits;
-: 393:
-: 394: template<typename _CharT, typename _Traits>
-: 395: class istreambuf_iterator;
-: 396:
-: 397: template<typename _CharT, typename _Traits>
-: 398: class ostreambuf_iterator;
-: 399:
-: 400: template<bool _IsMove, typename _CharT>
-: 401: typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
-: 402: ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
-: 403: __copy_move_a2(_CharT*, _CharT*,
-: 404: ostreambuf_iterator<_CharT, char_traits<_CharT> >);
-: 405:
-: 406: template<bool _IsMove, typename _CharT>
-: 407: typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
-: 408: ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type
-: 409: __copy_move_a2(const _CharT*, const _CharT*,
-: 410: ostreambuf_iterator<_CharT, char_traits<_CharT> >);
-: 411:
-: 412: template<bool _IsMove, typename _CharT>
-: 413: typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value,
-: 414: _CharT*>::__type
-: 415: __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >,
-: 416: istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*);
-: 417:
-: 418: template<bool _IsMove, typename _II, typename _OI>
-: 419: inline _OI
-: 420: __copy_move_a2(_II __first, _II __last, _OI __result)
-: 421: {
-: 422: return _OI(std::__copy_move_a<_IsMove>(std::__niter_base(__first),
-: 423: std::__niter_base(__last),
-: 424: std::__niter_base(__result)));
-: 425: }
-: 426:
-: 427: /**
-: 428: * @brief Copies the range [first,last) into result.
-: 429: * @ingroup mutating_algorithms
-: 430: * @param __first An input iterator.
-: 431: * @param __last An input iterator.
-: 432: * @param __result An output iterator.
-: 433: * @return result + (first - last)
-: 434: *
-: 435: * This inline function will boil down to a call to @c memmove whenever
-: 436: * possible. Failing that, if random access iterators are passed, then the
-: 437: * loop count will be known (and therefore a candidate for compiler
-: 438: * optimizations such as unrolling). Result may not be contained within
-: 439: * [first,last); the copy_backward function should be used instead.
-: 440: *
-: 441: * Note that the end of the output range is permitted to be contained
-: 442: * within [first,last).
-: 443: */
-: 444: template<typename _II, typename _OI>
-: 445: inline _OI
-: 446: copy(_II __first, _II __last, _OI __result)
-: 447: {
-: 448: // concept requirements
-: 449: __glibcxx_function_requires(_InputIteratorConcept<_II>)
-: 450: __glibcxx_function_requires(_OutputIteratorConcept<_OI,
-: 451: typename iterator_traits<_II>::value_type>)
-: 452: __glibcxx_requires_valid_range(__first, __last);
-: 453:
-: 454: return (std::__copy_move_a2<__is_move_iterator<_II>::__value>
-: 455: (std::__miter_base(__first), std::__miter_base(__last),
-: 456: __result));
-: 457: }
-: 458:
-: 459:#if __cplusplus >= 201103L
-: 460: /**
-: 461: * @brief Moves the range [first,last) into result.
-: 462: * @ingroup mutating_algorithms
-: 463: * @param __first An input iterator.
-: 464: * @param __last An input iterator.
-: 465: * @param __result An output iterator.
-: 466: * @return result + (first - last)
-: 467: *
-: 468: * This inline function will boil down to a call to @c memmove whenever
-: 469: * possible. Failing that, if random access iterators are passed, then the
-: 470: * loop count will be known (and therefore a candidate for compiler
-: 471: * optimizations such as unrolling). Result may not be contained within
-: 472: * [first,last); the move_backward function should be used instead.
-: 473: *
-: 474: * Note that the end of the output range is permitted to be contained
-: 475: * within [first,last).
-: 476: */
-: 477: template<typename _II, typename _OI>
-: 478: inline _OI
-: 479: move(_II __first, _II __last, _OI __result)
-: 480: {
-: 481: // concept requirements
-: 482: __glibcxx_function_requires(_InputIteratorConcept<_II>)
-: 483: __glibcxx_function_requires(_OutputIteratorConcept<_OI,
-: 484: typename iterator_traits<_II>::value_type>)
-: 485: __glibcxx_requires_valid_range(__first, __last);
-: 486:
-: 487: return std::__copy_move_a2<true>(std::__miter_base(__first),
-: 488: std::__miter_base(__last), __result);
-: 489: }
-: 490:
-: 491:#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp)
-: 492:#else
-: 493:#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp)
-: 494:#endif
-: 495:
-: 496: template<bool, bool, typename>
-: 497: struct __copy_move_backward
-: 498: {
-: 499: template<typename _BI1, typename _BI2>
-: 500: static _BI2
-: 501: __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-: 502: {
-: 503: while (__first != __last)
-: 504: *--__result = *--__last;
-: 505: return __result;
-: 506: }
-: 507: };
-: 508:
-: 509:#if __cplusplus >= 201103L
-: 510: template<typename _Category>
-: 511: struct __copy_move_backward<true, false, _Category>
-: 512: {
-: 513: template<typename _BI1, typename _BI2>
-: 514: static _BI2
-: 515: __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-: 516: {
-: 517: while (__first != __last)
-: 518: *--__result = std::move(*--__last);
-: 519: return __result;
-: 520: }
-: 521: };
-: 522:#endif
-: 523:
-: 524: template<>
-: 525: struct __copy_move_backward<false, false, random_access_iterator_tag>
-: 526: {
-: 527: template<typename _BI1, typename _BI2>
-: 528: static _BI2
-: 529: __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-: 530: {
-: 531: typename iterator_traits<_BI1>::difference_type __n;
-: 532: for (__n = __last - __first; __n > 0; --__n)
-: 533: *--__result = *--__last;
-: 534: return __result;
-: 535: }
-: 536: };
-: 537:
-: 538:#if __cplusplus >= 201103L
-: 539: template<>
-: 540: struct __copy_move_backward<true, false, random_access_iterator_tag>
-: 541: {
-: 542: template<typename _BI1, typename _BI2>
-: 543: static _BI2
-: 544: __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)
-: 545: {
-: 546: typename iterator_traits<_BI1>::difference_type __n;
-: 547: for (__n = __last - __first; __n > 0; --__n)
-: 548: *--__result = std::move(*--__last);
-: 549: return __result;
-: 550: }
-: 551: };
-: 552:#endif
-: 553:
-: 554: template<bool _IsMove>
-: 555: struct __copy_move_backward<_IsMove, true, random_access_iterator_tag>
-: 556: {
-: 557: template<typename _Tp>
-: 558: static _Tp*
-: 559: __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result)
-: 560: {
-: 561:#if __cplusplus >= 201103L
-: 562: using __assignable = conditional<_IsMove,
-: 563: is_move_assignable<_Tp>,
-: 564: is_copy_assignable<_Tp>>;
-: 565: // trivial types can have deleted assignment
-: 566: static_assert( __assignable::type::value, "type is not assignable" );
-: 567:#endif
-: 568: const ptrdiff_t _Num = __last - __first;
-: 569: if (_Num)
-: 570: __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num);
-: 571: return __result - _Num;
-: 572: }
-: 573: };
-: 574:
-: 575: template<bool _IsMove, typename _BI1, typename _BI2>
-: 576: inline _BI2
-: 577: __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)
-: 578: {
-: 579: typedef typename iterator_traits<_BI1>::value_type _ValueType1;
-: 580: typedef typename iterator_traits<_BI2>::value_type _ValueType2;
-: 581: typedef typename iterator_traits<_BI1>::iterator_category _Category;
-: 582: const bool __simple = (__is_trivial(_ValueType1)
-: 583: && __is_pointer<_BI1>::__value
-: 584: && __is_pointer<_BI2>::__value
-: 585: && __are_same<_ValueType1, _ValueType2>::__value);
-: 586:
-: 587: return std::__copy_move_backward<_IsMove, __simple,
-: 588: _Category>::__copy_move_b(__first,
-: 589: __last,
-: 590: __result);
-: 591: }
-: 592:
-: 593: template<bool _IsMove, typename _BI1, typename _BI2>
-: 594: inline _BI2
-: 595: __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)
-: 596: {
-: 597: return _BI2(std::__copy_move_backward_a<_IsMove>
-: 598: (std::__niter_base(__first), std::__niter_base(__last),
-: 599: std::__niter_base(__result)));
-: 600: }
-: 601:
-: 602: /**
-: 603: * @brief Copies the range [first,last) into result.
-: 604: * @ingroup mutating_algorithms
-: 605: * @param __first A bidirectional iterator.
-: 606: * @param __last A bidirectional iterator.
-: 607: * @param __result A bidirectional iterator.
-: 608: * @return result - (first - last)
-: 609: *
-: 610: * The function has the same effect as copy, but starts at the end of the
-: 611: * range and works its way to the start, returning the start of the result.
-: 612: * This inline function will boil down to a call to @c memmove whenever
-: 613: * possible. Failing that, if random access iterators are passed, then the
-: 614: * loop count will be known (and therefore a candidate for compiler
-: 615: * optimizations such as unrolling).
-: 616: *
-: 617: * Result may not be in the range (first,last]. Use copy instead. Note
-: 618: * that the start of the output range may overlap [first,last).
-: 619: */
-: 620: template<typename _BI1, typename _BI2>
-: 621: inline _BI2
-: 622: copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)
-: 623: {
-: 624: // concept requirements
-: 625: __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)
-: 626: __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)
-: 627: __glibcxx_function_requires(_ConvertibleConcept<
-: 628: typename iterator_traits<_BI1>::value_type,
-: 629: typename iterator_traits<_BI2>::value_type>)
-: 630: __glibcxx_requires_valid_range(__first, __last);
-: 631:
-: 632: return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value>
-: 633: (std::__miter_base(__first), std::__miter_base(__last),
-: 634: __result));
-: 635: }
-: 636:
-: 637:#if __cplusplus >= 201103L
-: 638: /**
-: 639: * @brief Moves the range [first,last) into result.
-: 640: * @ingroup mutating_algorithms
-: 641: * @param __first A bidirectional iterator.
-: 642: * @param __last A bidirectional iterator.
-: 643: * @param __result A bidirectional iterator.
-: 644: * @return result - (first - last)
-: 645: *
-: 646: * The function has the same effect as move, but starts at the end of the
-: 647: * range and works its way to the start, returning the start of the result.
-: 648: * This inline function will boil down to a call to @c memmove whenever
-: 649: * possible. Failing that, if random access iterators are passed, then the
-: 650: * loop count will be known (and therefore a candidate for compiler
-: 651: * optimizations such as unrolling).
-: 652: *
-: 653: * Result may not be in the range (first,last]. Use move instead. Note
-: 654: * that the start of the output range may overlap [first,last).
-: 655: */
-: 656: template<typename _BI1, typename _BI2>
-: 657: inline _BI2
-: 658: move_backward(_BI1 __first, _BI1 __last, _BI2 __result)
-: 659: {
-: 660: // concept requirements
-: 661: __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)
-: 662: __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)
-: 663: __glibcxx_function_requires(_ConvertibleConcept<
-: 664: typename iterator_traits<_BI1>::value_type,
-: 665: typename iterator_traits<_BI2>::value_type>)
-: 666: __glibcxx_requires_valid_range(__first, __last);
-: 667:
-: 668: return std::__copy_move_backward_a2<true>(std::__miter_base(__first),
-: 669: std::__miter_base(__last),
-: 670: __result);
-: 671: }
-: 672:
-: 673:#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp)
-: 674:#else
-: 675:#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp)
-: 676:#endif
-: 677:
-: 678: template<typename _ForwardIterator, typename _Tp>
-: 679: inline typename
-: 680: __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type
-: 681: __fill_a(_ForwardIterator __first, _ForwardIterator __last,
-: 682: const _Tp& __value)
-: 683: {
-: 684: for (; __first != __last; ++__first)
-: 685: *__first = __value;
-: 686: }
-: 687:
-: 688: template<typename _ForwardIterator, typename _Tp>
-: 689: inline typename
-: 690: __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type
-: 691: __fill_a(_ForwardIterator __first, _ForwardIterator __last,
-: 692: const _Tp& __value)
-: 693: {
-: 694: const _Tp __tmp = __value;
-: 695: for (; __first != __last; ++__first)
-: 696: *__first = __tmp;
-: 697: }
-: 698:
-: 699: // Specialization: for char types we can use memset.
-: 700: template<typename _Tp>
-: 701: inline typename
-: 702: __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type
-: 703: __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c)
-: 704: {
-: 705: const _Tp __tmp = __c;
-: 706: if (const size_t __len = __last - __first)
-: 707: __builtin_memset(__first, static_cast<unsigned char>(__tmp), __len);
-: 708: }
-: 709:
-: 710: /**
-: 711: * @brief Fills the range [first,last) with copies of value.
-: 712: * @ingroup mutating_algorithms
-: 713: * @param __first A forward iterator.
-: 714: * @param __last A forward iterator.
-: 715: * @param __value A reference-to-const of arbitrary type.
-: 716: * @return Nothing.
-: 717: *
-: 718: * This function fills a range with copies of the same value. For char
-: 719: * types filling contiguous areas of memory, this becomes an inline call
-: 720: * to @c memset or @c wmemset.
-: 721: */
-: 722: template<typename _ForwardIterator, typename _Tp>
-: 723: inline void
-: 724: fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
-: 725: {
-: 726: // concept requirements
-: 727: __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
-: 728: _ForwardIterator>)
-: 729: __glibcxx_requires_valid_range(__first, __last);
-: 730:
-: 731: std::__fill_a(std::__niter_base(__first), std::__niter_base(__last),
-: 732: __value);
-: 733: }
-: 734:
-: 735: template<typename _OutputIterator, typename _Size, typename _Tp>
-: 736: inline typename
-: 737: __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type
-: 738: __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)
-: 739: {
-: 740: for (__decltype(__n + 0) __niter = __n;
-: 741: __niter > 0; --__niter, ++__first)
-: 742: *__first = __value;
-: 743: return __first;
-: 744: }
-: 745:
-: 746: template<typename _OutputIterator, typename _Size, typename _Tp>
-: 747: inline typename
-: 748: __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type
-: 749: __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value)
-: 750: {
-: 751: const _Tp __tmp = __value;
-: 752: for (__decltype(__n + 0) __niter = __n;
-: 753: __niter > 0; --__niter, ++__first)
-: 754: *__first = __tmp;
-: 755: return __first;
-: 756: }
-: 757:
-: 758: template<typename _Size, typename _Tp>
-: 759: inline typename
-: 760: __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type
-: 761: __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c)
-: 762: {
-: 763: std::__fill_a(__first, __first + __n, __c);
-: 764: return __first + __n;
-: 765: }
-: 766:
-: 767: /**
-: 768: * @brief Fills the range [first,first+n) with copies of value.
-: 769: * @ingroup mutating_algorithms
-: 770: * @param __first An output iterator.
-: 771: * @param __n The count of copies to perform.
-: 772: * @param __value A reference-to-const of arbitrary type.
-: 773: * @return The iterator at first+n.
-: 774: *
-: 775: * This function fills a range with copies of the same value. For char
-: 776: * types filling contiguous areas of memory, this becomes an inline call
-: 777: * to @c memset or @ wmemset.
-: 778: *
-: 779: * _GLIBCXX_RESOLVE_LIB_DEFECTS
-: 780: * DR 865. More algorithms that throw away information
-: 781: */
-: 782: template<typename _OI, typename _Size, typename _Tp>
-: 783: inline _OI
-: 784: fill_n(_OI __first, _Size __n, const _Tp& __value)
-: 785: {
-: 786: // concept requirements
-: 787: __glibcxx_function_requires(_OutputIteratorConcept<_OI, _Tp>)
-: 788:
-: 789: return _OI(std::__fill_n_a(std::__niter_base(__first), __n, __value));
-: 790: }
-: 791:
-: 792: template<bool _BoolType>
-: 793: struct __equal
-: 794: {
-: 795: template<typename _II1, typename _II2>
-: 796: static bool
-: 797: equal(_II1 __first1, _II1 __last1, _II2 __first2)
-: 798: {
-: 799: for (; __first1 != __last1; ++__first1, (void)++__first2)
-: 800: if (!(*__first1 == *__first2))
-: 801: return false;
-: 802: return true;
-: 803: }
-: 804: };
-: 805:
-: 806: template<>
-: 807: struct __equal<true>
-: 808: {
-: 809: template<typename _Tp>
-: 810: static bool
-: 811: equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2)
-: 812: {
-: 813: if (const size_t __len = (__last1 - __first1))
-: 814: return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) * __len);
-: 815: return true;
-: 816: }
-: 817: };
-: 818:
-: 819: template<typename _II1, typename _II2>
-: 820: inline bool
-: 821: __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)
-: 822: {
-: 823: typedef typename iterator_traits<_II1>::value_type _ValueType1;
-: 824: typedef typename iterator_traits<_II2>::value_type _ValueType2;
-: 825: const bool __simple = ((__is_integer<_ValueType1>::__value
-: 826: || __is_pointer<_ValueType1>::__value)
-: 827: && __is_pointer<_II1>::__value
-: 828: && __is_pointer<_II2>::__value
-: 829: && __are_same<_ValueType1, _ValueType2>::__value);
-: 830:
-: 831: return std::__equal<__simple>::equal(__first1, __last1, __first2);
-: 832: }
-: 833:
-: 834: template<typename, typename>
-: 835: struct __lc_rai
-: 836: {
-: 837: template<typename _II1, typename _II2>
-: 838: static _II1
-: 839: __newlast1(_II1, _II1 __last1, _II2, _II2)
-: 840: { return __last1; }
-: 841:
-: 842: template<typename _II>
-: 843: static bool
-: 844: __cnd2(_II __first, _II __last)
-: 845: { return __first != __last; }
-: 846: };
-: 847:
-: 848: template<>
-: 849: struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag>
-: 850: {
-: 851: template<typename _RAI1, typename _RAI2>
-: 852: static _RAI1
-: 853: __newlast1(_RAI1 __first1, _RAI1 __last1,
-: 854: _RAI2 __first2, _RAI2 __last2)
-: 855: {
-: 856: const typename iterator_traits<_RAI1>::difference_type
-: 857: __diff1 = __last1 - __first1;
-: 858: const typename iterator_traits<_RAI2>::difference_type
-: 859: __diff2 = __last2 - __first2;
-: 860: return __diff2 < __diff1 ? __first1 + __diff2 : __last1;
-: 861: }
-: 862:
-: 863: template<typename _RAI>
-: 864: static bool
-: 865: __cnd2(_RAI, _RAI)
-: 866: { return true; }
-: 867: };
-: 868:
-: 869: template<typename _II1, typename _II2, typename _Compare>
-: 870: bool
-: 871: __lexicographical_compare_impl(_II1 __first1, _II1 __last1,
-: 872: _II2 __first2, _II2 __last2,
-: 873: _Compare __comp)
-: 874: {
-: 875: typedef typename iterator_traits<_II1>::iterator_category _Category1;
-: 876: typedef typename iterator_traits<_II2>::iterator_category _Category2;
-: 877: typedef std::__lc_rai<_Category1, _Category2> __rai_type;
-: 878:
-: 879: __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2);
-: 880: for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);
-: 881: ++__first1, (void)++__first2)
-: 882: {
-: 883: if (__comp(__first1, __first2))
-: 884: return true;
-: 885: if (__comp(__first2, __first1))
-: 886: return false;
-: 887: }
-: 888: return __first1 == __last1 && __first2 != __last2;
-: 889: }
-: 890:
-: 891: template<bool _BoolType>
-: 892: struct __lexicographical_compare
-: 893: {
-: 894: template<typename _II1, typename _II2>
-: 895: static bool __lc(_II1, _II1, _II2, _II2);
-: 896: };
-: 897:
-: 898: template<bool _BoolType>
-: 899: template<typename _II1, typename _II2>
-: 900: bool
-: 901: __lexicographical_compare<_BoolType>::
-: 902: __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)
-: 903: {
-: 904: return std::__lexicographical_compare_impl(__first1, __last1,
-: 905: __first2, __last2,
-: 906: __gnu_cxx::__ops::__iter_less_iter());
-: 907: }
-: 908:
-: 909: template<>
-: 910: struct __lexicographical_compare<true>
-: 911: {
-: 912: template<typename _Tp, typename _Up>
-: 913: static bool
-: 914: __lc(const _Tp* __first1, const _Tp* __last1,
-: 915: const _Up* __first2, const _Up* __last2)
-: 916: {
-: 917: const size_t __len1 = __last1 - __first1;
-: 918: const size_t __len2 = __last2 - __first2;
-: 919: if (const size_t __len = std::min(__len1, __len2))
-: 920: if (int __result = __builtin_memcmp(__first1, __first2, __len))
-: 921: return __result < 0;
-: 922: return __len1 < __len2;
-: 923: }
-: 924: };
-: 925:
-: 926: template<typename _II1, typename _II2>
-: 927: inline bool
-: 928: __lexicographical_compare_aux(_II1 __first1, _II1 __last1,
-: 929: _II2 __first2, _II2 __last2)
-: 930: {
-: 931: typedef typename iterator_traits<_II1>::value_type _ValueType1;
-: 932: typedef typename iterator_traits<_II2>::value_type _ValueType2;
-: 933: const bool __simple =
-: 934: (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value
-: 935: && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed
-: 936: && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed
-: 937: && __is_pointer<_II1>::__value
-: 938: && __is_pointer<_II2>::__value);
-: 939:
-: 940: return std::__lexicographical_compare<__simple>::__lc(__first1, __last1,
-: 941: __first2, __last2);
-: 942: }
-: 943:
-: 944: template<typename _ForwardIterator, typename _Tp, typename _Compare>
-: 945: _ForwardIterator
-: 946: __lower_bound(_ForwardIterator __first, _ForwardIterator __last,
-: 947: const _Tp& __val, _Compare __comp)
-: 948: {
-: 949: typedef typename iterator_traits<_ForwardIterator>::difference_type
-: 950: _DistanceType;
-: 951:
-: 952: _DistanceType __len = std::distance(__first, __last);
-: 953:
-: 954: while (__len > 0)
-: 955: {
-: 956: _DistanceType __half = __len >> 1;
-: 957: _ForwardIterator __middle = __first;
-: 958: std::advance(__middle, __half);
-: 959: if (__comp(__middle, __val))
-: 960: {
-: 961: __first = __middle;
-: 962: ++__first;
-: 963: __len = __len - __half - 1;
-: 964: }
-: 965: else
-: 966: __len = __half;
-: 967: }
-: 968: return __first;
-: 969: }
-: 970:
-: 971: /**
-: 972: * @brief Finds the first position in which @a val could be inserted
-: 973: * without changing the ordering.
-: 974: * @param __first An iterator.
-: 975: * @param __last Another iterator.
-: 976: * @param __val The search term.
-: 977: * @return An iterator pointing to the first element <em>not less
-: 978: * than</em> @a val, or end() if every element is less than
-: 979: * @a val.
-: 980: * @ingroup binary_search_algorithms
-: 981: */
-: 982: template<typename _ForwardIterator, typename _Tp>
-: 983: inline _ForwardIterator
-: 984: lower_bound(_ForwardIterator __first, _ForwardIterator __last,
-: 985: const _Tp& __val)
-: 986: {
-: 987: // concept requirements
-: 988: __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
-: 989: __glibcxx_function_requires(_LessThanOpConcept<
-: 990: typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
-: 991: __glibcxx_requires_partitioned_lower(__first, __last, __val);
-: 992: