65 #if __cplusplus >= 201103L 71 namespace std _GLIBCXX_VISIBILITY(default)
73 _GLIBCXX_BEGIN_NAMESPACE_VERSION
76 template<
typename _Iterator,
typename _Compare>
79 _Iterator __c, _Compare __comp)
85 else if (__comp(__a, __c))
90 else if (__comp(__a, __c))
92 else if (__comp(__b, __c))
99 template<
typename _InputIterator,
typename _Predicate>
100 inline _InputIterator
101 __find_if(_InputIterator __first, _InputIterator __last,
104 while (__first != __last && !__pred(__first))
110 template<
typename _RandomAccessIterator,
typename _Predicate>
111 _RandomAccessIterator
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
115 typename iterator_traits<_RandomAccessIterator>::difference_type
116 __trip_count = (__last - __first) >> 2;
118 for (; __trip_count > 0; --__trip_count)
137 switch (__last - __first)
157 template<
typename _Iterator,
typename _Predicate>
159 __find_if(_Iterator __first, _Iterator __last, _Predicate __pred)
161 return __find_if(__first, __last, __pred,
166 template<
typename _InputIterator,
typename _Predicate>
167 inline _InputIterator
172 __gnu_cxx::__ops::__negate(__pred),
179 template<
typename _InputIterator,
typename _Predicate,
typename _Distance>
183 for (; __len; --__len, (void) ++__first)
184 if (!__pred(__first))
202 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
203 typename _BinaryPredicate>
205 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
206 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
207 _BinaryPredicate __predicate)
210 if (__first1 == __last1 || __first2 == __last2)
214 _ForwardIterator2 __p1(__first2);
215 if (++__p1 == __last2)
217 __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2));
220 _ForwardIterator2 __p;
221 _ForwardIterator1 __current = __first1;
227 __gnu_cxx::__ops::__iter_comp_iter(__predicate, __first2));
229 if (__first1 == __last1)
233 __current = __first1;
234 if (++__current == __last1)
237 while (__predicate(__current, __p))
239 if (++__p == __last2)
241 if (++__current == __last1)
254 template<
typename _ForwardIterator,
typename _Integer,
255 typename _UnaryPredicate>
258 _Integer __count, _UnaryPredicate __unary_pred,
262 while (__first != __last)
264 typename iterator_traits<_ForwardIterator>::difference_type
266 _ForwardIterator __i = __first;
268 while (__i != __last && __n != 1 && __unary_pred(__i))
286 template<
typename _RandomAccessIter,
typename _Integer,
287 typename _UnaryPredicate>
290 _Integer __count, _UnaryPredicate __unary_pred,
293 typedef typename std::iterator_traits<_RandomAccessIter>::difference_type
296 _DistanceType __tailSize = __last - __first;
297 _DistanceType __remainder = __count;
299 while (__remainder <= __tailSize)
301 __first += __remainder;
302 __tailSize -= __remainder;
305 _RandomAccessIter __backTrack = __first;
306 while (__unary_pred(--__backTrack))
308 if (--__remainder == 0)
309 return (__first - __count);
311 __remainder = __count + 1 - (__first - __backTrack);
316 template<
typename _ForwardIterator,
typename _Integer,
317 typename _UnaryPredicate>
319 __search_n(_ForwardIterator __first, _ForwardIterator __last,
321 _UnaryPredicate __unary_pred)
334 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
335 typename _BinaryPredicate>
337 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
338 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
340 _BinaryPredicate __comp)
342 if (__first2 == __last2)
345 _ForwardIterator1 __result = __last1;
348 _ForwardIterator1 __new_result
349 = std::__search(__first1, __last1, __first2, __last2, __comp);
350 if (__new_result == __last1)
354 __result = __new_result;
355 __first1 = __new_result;
362 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
363 typename _BinaryPredicate>
364 _BidirectionalIterator1
365 __find_end(_BidirectionalIterator1 __first1,
366 _BidirectionalIterator1 __last1,
367 _BidirectionalIterator2 __first2,
368 _BidirectionalIterator2 __last2,
370 _BinaryPredicate __comp)
373 __glibcxx_function_requires(_BidirectionalIteratorConcept<
374 _BidirectionalIterator1>)
375 __glibcxx_function_requires(_BidirectionalIteratorConcept<
376 _BidirectionalIterator2>)
381 _RevIterator1 __rlast1(__first1);
382 _RevIterator2 __rlast2(__first2);
383 _RevIterator1 __rresult = std::__search(_RevIterator1(__last1), __rlast1,
384 _RevIterator2(__last2), __rlast2,
387 if (__rresult == __rlast1)
391 _BidirectionalIterator1 __result = __rresult.base();
423 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
424 inline _ForwardIterator1
425 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
426 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
429 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
430 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
431 __glibcxx_function_requires(_EqualOpConcept<
432 typename iterator_traits<_ForwardIterator1>::value_type,
433 typename iterator_traits<_ForwardIterator2>::value_type>)
434 __glibcxx_requires_valid_range(__first1, __last1);
435 __glibcxx_requires_valid_range(__first2, __last2);
437 return std::__find_end(__first1, __last1, __first2, __last2,
440 __gnu_cxx::__ops::__iter_equal_to_iter());
471 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
472 typename _BinaryPredicate>
473 inline _ForwardIterator1
474 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
475 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
476 _BinaryPredicate __comp)
479 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
480 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
481 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
482 typename iterator_traits<_ForwardIterator1>::value_type,
483 typename iterator_traits<_ForwardIterator2>::value_type>)
484 __glibcxx_requires_valid_range(__first1, __last1);
485 __glibcxx_requires_valid_range(__first2, __last2);
487 return std::__find_end(__first1, __last1, __first2, __last2,
490 __gnu_cxx::__ops::__iter_comp_iter(__comp));
493 #if __cplusplus >= 201103L 506 template<
typename _InputIterator,
typename _Predicate>
508 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
523 template<
typename _InputIterator,
typename _Predicate>
525 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
541 template<
typename _InputIterator,
typename _Predicate>
543 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
556 template<
typename _InputIterator,
typename _Predicate>
557 inline _InputIterator
558 find_if_not(_InputIterator __first, _InputIterator __last,
562 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
563 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
564 typename iterator_traits<_InputIterator>::value_type>)
565 __glibcxx_requires_valid_range(__first, __last);
567 __gnu_cxx::__ops::__pred_iter(__pred));
580 template<
typename _InputIterator,
typename _Predicate>
582 is_partitioned(_InputIterator __first, _InputIterator __last,
586 if (__first == __last)
601 template<
typename _ForwardIterator,
typename _Predicate>
603 partition_point(_ForwardIterator __first, _ForwardIterator __last,
607 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
608 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
609 typename iterator_traits<_ForwardIterator>::value_type>)
612 __glibcxx_requires_valid_range(__first, __last);
614 typedef typename iterator_traits<_ForwardIterator>::difference_type
618 _DistanceType __half;
619 _ForwardIterator __middle;
626 if (__pred(*__middle))
630 __len = __len - __half - 1;
639 template<
typename _InputIterator,
typename _OutputIterator,
642 __remove_copy_if(_InputIterator __first, _InputIterator __last,
643 _OutputIterator __result, _Predicate __pred)
645 for (; __first != __last; ++__first)
646 if (!__pred(__first))
648 *__result = *__first;
668 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
669 inline _OutputIterator
670 remove_copy(_InputIterator __first, _InputIterator __last,
671 _OutputIterator __result,
const _Tp& __value)
674 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
675 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
676 typename iterator_traits<_InputIterator>::value_type>)
677 __glibcxx_function_requires(_EqualOpConcept<
678 typename iterator_traits<_InputIterator>::value_type, _Tp>)
679 __glibcxx_requires_valid_range(__first, __last);
681 return std::__remove_copy_if(__first, __last, __result,
682 __gnu_cxx::__ops::__iter_equals_val(__value));
700 template<
typename _InputIterator,
typename _OutputIterator,
702 inline _OutputIterator
703 remove_copy_if(_InputIterator __first, _InputIterator __last,
704 _OutputIterator __result, _Predicate __pred)
707 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
708 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
709 typename iterator_traits<_InputIterator>::value_type>)
710 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
711 typename iterator_traits<_InputIterator>::value_type>)
712 __glibcxx_requires_valid_range(__first, __last);
714 return std::__remove_copy_if(__first, __last, __result,
715 __gnu_cxx::__ops::__pred_iter(__pred));
718 #if __cplusplus >= 201103L 734 template<
typename _InputIterator,
typename _OutputIterator,
737 copy_if(_InputIterator __first, _InputIterator __last,
738 _OutputIterator __result, _Predicate __pred)
741 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
742 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
743 typename iterator_traits<_InputIterator>::value_type>)
744 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
745 typename iterator_traits<_InputIterator>::value_type>)
746 __glibcxx_requires_valid_range(__first, __last);
748 for (; __first != __last; ++__first)
749 if (__pred(*__first))
751 *__result = *__first;
757 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
759 __copy_n(_InputIterator __first, _Size __n,
766 *__result = *__first;
777 template<
typename _RandomAccessIterator,
typename _Size,
778 typename _OutputIterator>
779 inline _OutputIterator
780 __copy_n(_RandomAccessIterator __first, _Size __n,
782 {
return std::copy(__first, __first + __n, __result); }
797 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
798 inline _OutputIterator
799 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result)
802 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
803 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
804 typename iterator_traits<_InputIterator>::value_type>)
806 return std::__copy_n(__first, __n, __result,
825 template<
typename _InputIterator,
typename _OutputIterator1,
826 typename _OutputIterator2,
typename _Predicate>
828 partition_copy(_InputIterator __first, _InputIterator __last,
829 _OutputIterator1 __out_true, _OutputIterator2 __out_false,
833 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
834 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator1,
835 typename iterator_traits<_InputIterator>::value_type>)
836 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator2,
837 typename iterator_traits<_InputIterator>::value_type>)
838 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
839 typename iterator_traits<_InputIterator>::value_type>)
840 __glibcxx_requires_valid_range(__first, __last);
842 for (; __first != __last; ++__first)
843 if (__pred(*__first))
845 *__out_true = *__first;
850 *__out_false = *__first;
858 template<
typename _ForwardIterator,
typename _Predicate>
860 __remove_if(_ForwardIterator __first, _ForwardIterator __last,
864 if (__first == __last)
866 _ForwardIterator __result = __first;
868 for (; __first != __last; ++__first)
869 if (!__pred(__first))
871 *__result = _GLIBCXX_MOVE(*__first);
894 template<
typename _ForwardIterator,
typename _Tp>
895 inline _ForwardIterator
896 remove(_ForwardIterator __first, _ForwardIterator __last,
900 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
902 __glibcxx_function_requires(_EqualOpConcept<
903 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
904 __glibcxx_requires_valid_range(__first, __last);
906 return std::__remove_if(__first, __last,
907 __gnu_cxx::__ops::__iter_equals_val(__value));
927 template<
typename _ForwardIterator,
typename _Predicate>
928 inline _ForwardIterator
929 remove_if(_ForwardIterator __first, _ForwardIterator __last,
933 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
935 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
936 typename iterator_traits<_ForwardIterator>::value_type>)
937 __glibcxx_requires_valid_range(__first, __last);
939 return std::__remove_if(__first, __last,
940 __gnu_cxx::__ops::__pred_iter(__pred));
943 template<
typename _ForwardIterator,
typename _BinaryPredicate>
945 __adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
946 _BinaryPredicate __binary_pred)
948 if (__first == __last)
950 _ForwardIterator __next = __first;
951 while (++__next != __last)
953 if (__binary_pred(__first, __next))
960 template<
typename _ForwardIterator,
typename _BinaryPredicate>
962 __unique(_ForwardIterator __first, _ForwardIterator __last,
963 _BinaryPredicate __binary_pred)
966 __first = std::__adjacent_find(__first, __last, __binary_pred);
967 if (__first == __last)
971 _ForwardIterator __dest = __first;
973 while (++__first != __last)
974 if (!__binary_pred(__dest, __first))
975 *++__dest = _GLIBCXX_MOVE(*__first);
993 template<
typename _ForwardIterator>
994 inline _ForwardIterator
995 unique(_ForwardIterator __first, _ForwardIterator __last)
998 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1000 __glibcxx_function_requires(_EqualityComparableConcept<
1001 typename iterator_traits<_ForwardIterator>::value_type>)
1002 __glibcxx_requires_valid_range(__first, __last);
1004 return std::__unique(__first, __last,
1005 __gnu_cxx::__ops::__iter_equal_to_iter());
1023 template<
typename _ForwardIterator,
typename _BinaryPredicate>
1024 inline _ForwardIterator
1025 unique(_ForwardIterator __first, _ForwardIterator __last,
1026 _BinaryPredicate __binary_pred)
1029 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1031 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1032 typename iterator_traits<_ForwardIterator>::value_type,
1033 typename iterator_traits<_ForwardIterator>::value_type>)
1034 __glibcxx_requires_valid_range(__first, __last);
1036 return std::__unique(__first, __last,
1037 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
1046 template<
typename _ForwardIterator,
typename _OutputIterator,
1047 typename _BinaryPredicate>
1050 _OutputIterator __result, _BinaryPredicate __binary_pred,
1054 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1055 typename iterator_traits<_ForwardIterator>::value_type,
1056 typename iterator_traits<_ForwardIterator>::value_type>)
1058 _ForwardIterator __next = __first;
1059 *__result = *__first;
1060 while (++__next != __last)
1061 if (!__binary_pred(__first, __next))
1064 *++__result = *__first;
1075 template<
typename _InputIterator,
typename _OutputIterator,
1076 typename _BinaryPredicate>
1079 _OutputIterator __result, _BinaryPredicate __binary_pred,
1083 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1084 typename iterator_traits<_InputIterator>::value_type,
1085 typename iterator_traits<_InputIterator>::value_type>)
1087 typename iterator_traits<_InputIterator>::value_type __value = *__first;
1088 __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred))
1090 = __gnu_cxx::__ops::__iter_comp_val(__binary_pred);
1091 *__result = __value;
1092 while (++__first != __last)
1093 if (!__rebound_pred(__first, __value))
1096 *++__result = __value;
1107 template<
typename _InputIterator,
typename _ForwardIterator,
1108 typename _BinaryPredicate>
1111 _ForwardIterator __result, _BinaryPredicate __binary_pred,
1115 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1116 typename iterator_traits<_ForwardIterator>::value_type,
1117 typename iterator_traits<_InputIterator>::value_type>)
1118 *__result = *__first;
1119 while (++__first != __last)
1120 if (!__binary_pred(__result, __first))
1121 *++__result = *__first;
1130 template<
typename _B
idirectionalIterator>
1132 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
1136 if (__first == __last || __first == --__last)
1150 template<
typename _RandomAccessIterator>
1152 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
1155 if (__first == __last)
1158 while (__first < __last)
1178 template<
typename _B
idirectionalIterator>
1180 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
1183 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1184 _BidirectionalIterator>)
1185 __glibcxx_requires_valid_range(__first, __last);
1205 template<
typename _B
idirectionalIterator,
typename _OutputIterator>
1207 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
1208 _OutputIterator __result)
1211 __glibcxx_function_requires(_BidirectionalIteratorConcept<
1212 _BidirectionalIterator>)
1213 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1214 typename iterator_traits<_BidirectionalIterator>::value_type>)
1215 __glibcxx_requires_valid_range(__first, __last);
1217 while (__first != __last)
1220 *__result = *__last;
1230 template<
typename _Eucl
ideanRingElement>
1231 _EuclideanRingElement
1232 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
1236 _EuclideanRingElement __t = __m % __n;
1243 inline namespace _V2
1247 template<
typename _ForwardIterator>
1250 _ForwardIterator __middle,
1251 _ForwardIterator __last,
1254 if (__first == __middle)
1256 else if (__last == __middle)
1259 _ForwardIterator __first2 = __middle;
1265 if (__first == __middle)
1266 __middle = __first2;
1268 while (__first2 != __last);
1270 _ForwardIterator __ret = __first;
1272 __first2 = __middle;
1274 while (__first2 != __last)
1279 if (__first == __middle)
1280 __middle = __first2;
1281 else if (__first2 == __last)
1282 __first2 = __middle;
1288 template<
typename _B
idirectionalIterator>
1289 _BidirectionalIterator
1291 _BidirectionalIterator __middle,
1292 _BidirectionalIterator __last,
1296 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1297 _BidirectionalIterator>)
1299 if (__first == __middle)
1301 else if (__last == __middle)
1307 while (__first != __middle && __middle != __last)
1313 if (__first == __middle)
1326 template<
typename _RandomAccessIterator>
1327 _RandomAccessIterator
1329 _RandomAccessIterator __middle,
1330 _RandomAccessIterator __last,
1334 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1335 _RandomAccessIterator>)
1337 if (__first == __middle)
1339 else if (__last == __middle)
1342 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
1344 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1347 _Distance __n = __last - __first;
1348 _Distance __k = __middle - __first;
1350 if (__k == __n - __k)
1356 _RandomAccessIterator __p = __first;
1357 _RandomAccessIterator __ret = __first + (__last - __middle);
1361 if (__k < __n - __k)
1363 if (__is_pod(_ValueType) && __k == 1)
1365 _ValueType __t = _GLIBCXX_MOVE(*__p);
1366 _GLIBCXX_MOVE3(__p + 1, __p + __n, __p);
1367 *(__p + __n - 1) = _GLIBCXX_MOVE(__t);
1370 _RandomAccessIterator __q = __p + __k;
1371 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1380 std::swap(__n, __k);
1386 if (__is_pod(_ValueType) && __k == 1)
1388 _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1));
1389 _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n);
1390 *__p = _GLIBCXX_MOVE(__t);
1393 _RandomAccessIterator __q = __p + __n;
1395 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1404 std::swap(__n, __k);
1432 template<
typename _ForwardIterator>
1433 inline _ForwardIterator
1434 rotate(_ForwardIterator __first, _ForwardIterator __middle,
1435 _ForwardIterator __last)
1438 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1440 __glibcxx_requires_valid_range(__first, __middle);
1441 __glibcxx_requires_valid_range(__middle, __last);
1443 return std::__rotate(__first, __middle, __last,
1469 template<
typename _ForwardIterator,
typename _OutputIterator>
1470 inline _OutputIterator
1471 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
1472 _ForwardIterator __last, _OutputIterator __result)
1475 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
1476 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1477 typename iterator_traits<_ForwardIterator>::value_type>)
1478 __glibcxx_requires_valid_range(__first, __middle);
1479 __glibcxx_requires_valid_range(__middle, __last);
1481 return std::copy(__first, __middle,
1482 std::copy(__middle, __last, __result));
1486 template<
typename _ForwardIterator,
typename _Predicate>
1491 if (__first == __last)
1494 while (__pred(*__first))
1495 if (++__first == __last)
1498 _ForwardIterator __next = __first;
1500 while (++__next != __last)
1501 if (__pred(*__next))
1511 template<
typename _B
idirectionalIterator,
typename _Predicate>
1512 _BidirectionalIterator
1513 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
1519 if (__first == __last)
1521 else if (__pred(*__first))
1527 if (__first == __last)
1529 else if (!
bool(__pred(*__last)))
1546 template<
typename _ForwardIterator,
typename _Pointer,
typename _Predicate,
1550 _ForwardIterator __last,
1551 _Predicate __pred, _Distance __len,
1553 _Distance __buffer_size)
1558 if (__len <= __buffer_size)
1560 _ForwardIterator __result1 = __first;
1561 _Pointer __result2 = __buffer;
1566 *__result2 = _GLIBCXX_MOVE(*__first);
1569 for (; __first != __last; ++__first)
1570 if (__pred(__first))
1572 *__result1 = _GLIBCXX_MOVE(*__first);
1577 *__result2 = _GLIBCXX_MOVE(*__first);
1581 _GLIBCXX_MOVE3(__buffer, __result2, __result1);
1585 _ForwardIterator __middle = __first;
1587 _ForwardIterator __left_split =
1589 __len / 2, __buffer,
1594 _Distance __right_len = __len - __len / 2;
1595 _ForwardIterator __right_split =
1602 __buffer, __buffer_size);
1604 return std::rotate(__left_split, __middle, __right_split);
1607 template<
typename _ForwardIterator,
typename _Predicate>
1609 __stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1614 if (__first == __last)
1617 typedef typename iterator_traits<_ForwardIterator>::value_type
1619 typedef typename iterator_traits<_ForwardIterator>::difference_type
1628 _DistanceType(__buf.
size()));
1648 template<
typename _ForwardIterator,
typename _Predicate>
1649 inline _ForwardIterator
1650 stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1654 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1656 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
1657 typename iterator_traits<_ForwardIterator>::value_type>)
1658 __glibcxx_requires_valid_range(__first, __last);
1660 return std::__stable_partition(__first, __last,
1661 __gnu_cxx::__ops::__pred_iter(__pred));
1665 template<
typename _RandomAccessIterator,
typename _Compare>
1668 _RandomAccessIterator __middle,
1669 _RandomAccessIterator __last, _Compare __comp)
1671 std::__make_heap(__first, __middle, __comp);
1672 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1673 if (__comp(__i, __first))
1674 std::__pop_heap(__first, __middle, __i, __comp);
1679 template<
typename _InputIterator,
typename _RandomAccessIterator,
1681 _RandomAccessIterator
1682 __partial_sort_copy(_InputIterator __first, _InputIterator __last,
1683 _RandomAccessIterator __result_first,
1684 _RandomAccessIterator __result_last,
1687 typedef typename iterator_traits<_InputIterator>::value_type
1689 typedef iterator_traits<_RandomAccessIterator> _RItTraits;
1690 typedef typename _RItTraits::difference_type _DistanceType;
1692 if (__result_first == __result_last)
1693 return __result_last;
1694 _RandomAccessIterator __result_real_last = __result_first;
1695 while (__first != __last && __result_real_last != __result_last)
1697 *__result_real_last = *__first;
1698 ++__result_real_last;
1702 std::__make_heap(__result_first, __result_real_last, __comp);
1703 while (__first != __last)
1705 if (__comp(__first, __result_first))
1706 std::__adjust_heap(__result_first, _DistanceType(0),
1707 _DistanceType(__result_real_last
1709 _InputValueType(*__first), __comp);
1712 std::__sort_heap(__result_first, __result_real_last, __comp);
1713 return __result_real_last;
1734 template<
typename _InputIterator,
typename _RandomAccessIterator>
1735 inline _RandomAccessIterator
1736 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1737 _RandomAccessIterator __result_first,
1738 _RandomAccessIterator __result_last)
1740 #ifdef _GLIBCXX_CONCEPT_CHECKS 1741 typedef typename iterator_traits<_InputIterator>::value_type
1743 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1748 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1749 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1751 __glibcxx_function_requires(_LessThanOpConcept<_InputValueType,
1753 __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>)
1754 __glibcxx_requires_valid_range(__first, __last);
1755 __glibcxx_requires_irreflexive(__first, __last);
1756 __glibcxx_requires_valid_range(__result_first, __result_last);
1758 return std::__partial_sort_copy(__first, __last,
1759 __result_first, __result_last,
1760 __gnu_cxx::__ops::__iter_less_iter());
1783 template<
typename _InputIterator,
typename _RandomAccessIterator,
1785 inline _RandomAccessIterator
1786 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1787 _RandomAccessIterator __result_first,
1788 _RandomAccessIterator __result_last,
1791 #ifdef _GLIBCXX_CONCEPT_CHECKS 1792 typedef typename iterator_traits<_InputIterator>::value_type
1794 typedef typename iterator_traits<_RandomAccessIterator>::value_type
1799 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1800 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1801 _RandomAccessIterator>)
1802 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1804 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1805 _InputValueType, _OutputValueType>)
1806 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1807 _OutputValueType, _OutputValueType>)
1808 __glibcxx_requires_valid_range(__first, __last);
1809 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
1810 __glibcxx_requires_valid_range(__result_first, __result_last);
1812 return std::__partial_sort_copy(__first, __last,
1813 __result_first, __result_last,
1814 __gnu_cxx::__ops::__iter_comp_iter(__comp));
1818 template<
typename _RandomAccessIterator,
typename _Compare>
1823 typename iterator_traits<_RandomAccessIterator>::value_type
1824 __val = _GLIBCXX_MOVE(*__last);
1825 _RandomAccessIterator __next = __last;
1827 while (__comp(__val, __next))
1829 *__last = _GLIBCXX_MOVE(*__next);
1833 *__last = _GLIBCXX_MOVE(__val);
1837 template<
typename _RandomAccessIterator,
typename _Compare>
1840 _RandomAccessIterator __last, _Compare __comp)
1842 if (__first == __last)
return;
1844 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1846 if (__comp(__i, __first))
1848 typename iterator_traits<_RandomAccessIterator>::value_type
1849 __val = _GLIBCXX_MOVE(*__i);
1850 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1851 *__first = _GLIBCXX_MOVE(__val);
1855 __gnu_cxx::__ops::__val_comp_iter(__comp));
1860 template<
typename _RandomAccessIterator,
typename _Compare>
1863 _RandomAccessIterator __last, _Compare __comp)
1865 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1867 __gnu_cxx::__ops::__val_comp_iter(__comp));
1874 enum { _S_threshold = 16 };
1877 template<
typename _RandomAccessIterator,
typename _Compare>
1880 _RandomAccessIterator __last, _Compare __comp)
1882 if (__last - __first >
int(_S_threshold))
1893 template<
typename _RandomAccessIterator,
typename _Compare>
1894 _RandomAccessIterator
1896 _RandomAccessIterator __last,
1897 _RandomAccessIterator __pivot, _Compare __comp)
1901 while (__comp(__first, __pivot))
1904 while (__comp(__pivot, __last))
1906 if (!(__first < __last))
1914 template<
typename _RandomAccessIterator,
typename _Compare>
1915 inline _RandomAccessIterator
1917 _RandomAccessIterator __last, _Compare __comp)
1919 _RandomAccessIterator __mid = __first + (__last - __first) / 2;
1925 template<
typename _RandomAccessIterator,
typename _Compare>
1927 __partial_sort(_RandomAccessIterator __first,
1928 _RandomAccessIterator __middle,
1929 _RandomAccessIterator __last,
1933 std::__sort_heap(__first, __middle, __comp);
1937 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1940 _RandomAccessIterator __last,
1941 _Size __depth_limit, _Compare __comp)
1943 while (__last - __first >
int(_S_threshold))
1945 if (__depth_limit == 0)
1947 std::__partial_sort(__first, __last, __last, __comp);
1951 _RandomAccessIterator __cut =
1960 template<
typename _RandomAccessIterator,
typename _Compare>
1962 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
1965 if (__first != __last)
1974 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1976 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
1977 _RandomAccessIterator __last, _Size __depth_limit,
1980 while (__last - __first > 3)
1982 if (__depth_limit == 0)
1990 _RandomAccessIterator __cut =
2020 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2021 inline _ForwardIterator
2022 lower_bound(_ForwardIterator __first, _ForwardIterator __last,
2023 const _Tp& __val, _Compare __comp)
2026 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2027 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2028 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2029 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2032 return std::__lower_bound(__first, __last, __val,
2033 __gnu_cxx::__ops::__iter_comp_val(__comp));
2036 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2038 __upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2039 const _Tp& __val, _Compare __comp)
2041 typedef typename iterator_traits<_ForwardIterator>::difference_type
2048 _DistanceType __half = __len >> 1;
2049 _ForwardIterator __middle = __first;
2051 if (__comp(__val, __middle))
2057 __len = __len - __half - 1;
2074 template<
typename _ForwardIterator,
typename _Tp>
2075 inline _ForwardIterator
2076 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2080 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2081 __glibcxx_function_requires(_LessThanOpConcept<
2082 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2083 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2085 return std::__upper_bound(__first, __last, __val,
2086 __gnu_cxx::__ops::__val_less_iter());
2104 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2105 inline _ForwardIterator
2106 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2107 const _Tp& __val, _Compare __comp)
2110 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2111 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2112 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2113 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2116 return std::__upper_bound(__first, __last, __val,
2117 __gnu_cxx::__ops::__val_comp_iter(__comp));
2120 template<
typename _ForwardIterator,
typename _Tp,
2121 typename _CompareItTp,
typename _CompareTpIt>
2123 __equal_range(_ForwardIterator __first, _ForwardIterator __last,
2125 _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it)
2127 typedef typename iterator_traits<_ForwardIterator>::difference_type
2134 _DistanceType __half = __len >> 1;
2135 _ForwardIterator __middle = __first;
2137 if (__comp_it_val(__middle, __val))
2141 __len = __len - __half - 1;
2143 else if (__comp_val_it(__val, __middle))
2147 _ForwardIterator __left
2148 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2150 _ForwardIterator __right
2151 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2175 template<
typename _ForwardIterator,
typename _Tp>
2177 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2181 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2182 __glibcxx_function_requires(_LessThanOpConcept<
2183 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2184 __glibcxx_function_requires(_LessThanOpConcept<
2185 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2186 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2187 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2189 return std::__equal_range(__first, __last, __val,
2190 __gnu_cxx::__ops::__iter_less_val(),
2191 __gnu_cxx::__ops::__val_less_iter());
2211 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2213 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2214 const _Tp& __val, _Compare __comp)
2217 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2218 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2219 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
2220 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2221 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2222 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2224 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2227 return std::__equal_range(__first, __last, __val,
2228 __gnu_cxx::__ops::__iter_comp_val(__comp),
2229 __gnu_cxx::__ops::__val_comp_iter(__comp));
2244 template<
typename _ForwardIterator,
typename _Tp>
2246 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2250 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2251 __glibcxx_function_requires(_LessThanOpConcept<
2252 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2253 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2254 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2256 _ForwardIterator __i
2257 = std::__lower_bound(__first, __last, __val,
2258 __gnu_cxx::__ops::__iter_less_val());
2259 return __i != __last && !(__val < *__i);
2277 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2279 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2280 const _Tp& __val, _Compare __comp)
2283 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2284 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2285 _Tp,
typename iterator_traits<_ForwardIterator>::value_type>)
2286 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2288 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2291 _ForwardIterator __i
2292 = std::__lower_bound(__first, __last, __val,
2293 __gnu_cxx::__ops::__iter_comp_val(__comp));
2294 return __i != __last && !bool(__comp(__val, *__i));
2300 template<
typename _InputIterator1,
typename _InputIterator2,
2301 typename _OutputIterator,
typename _Compare>
2304 _InputIterator2 __first2, _InputIterator2 __last2,
2305 _OutputIterator __result, _Compare __comp)
2307 while (__first1 != __last1 && __first2 != __last2)
2309 if (__comp(__first2, __first1))
2311 *__result = _GLIBCXX_MOVE(*__first2);
2316 *__result = _GLIBCXX_MOVE(*__first1);
2321 if (__first1 != __last1)
2322 _GLIBCXX_MOVE3(__first1, __last1, __result);
2326 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2327 typename _BidirectionalIterator3,
typename _Compare>
2330 _BidirectionalIterator1 __last1,
2331 _BidirectionalIterator2 __first2,
2332 _BidirectionalIterator2 __last2,
2333 _BidirectionalIterator3 __result,
2336 if (__first1 == __last1)
2338 _GLIBCXX_MOVE_BACKWARD3(__first2, __last2, __result);
2341 else if (__first2 == __last2)
2348 if (__comp(__last2, __last1))
2350 *--__result = _GLIBCXX_MOVE(*__last1);
2351 if (__first1 == __last1)
2353 _GLIBCXX_MOVE_BACKWARD3(__first2, ++__last2, __result);
2360 *--__result = _GLIBCXX_MOVE(*__last2);
2361 if (__first2 == __last2)
2369 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2371 _BidirectionalIterator1
2373 _BidirectionalIterator1 __middle,
2374 _BidirectionalIterator1 __last,
2375 _Distance __len1, _Distance __len2,
2376 _BidirectionalIterator2 __buffer,
2377 _Distance __buffer_size)
2379 _BidirectionalIterator2 __buffer_end;
2380 if (__len1 > __len2 && __len2 <= __buffer_size)
2384 __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2385 _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
2386 return _GLIBCXX_MOVE3(__buffer, __buffer_end, __first);
2391 else if (__len1 <= __buffer_size)
2395 __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2396 _GLIBCXX_MOVE3(__middle, __last, __first);
2397 return _GLIBCXX_MOVE_BACKWARD3(__buffer, __buffer_end, __last);
2407 template<
typename _BidirectionalIterator,
typename _Distance,
2408 typename _Pointer,
typename _Compare>
2411 _BidirectionalIterator __middle,
2412 _BidirectionalIterator __last,
2413 _Distance __len1, _Distance __len2,
2414 _Pointer __buffer, _Distance __buffer_size,
2417 if (__len1 <= __len2 && __len1 <= __buffer_size)
2419 _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2423 else if (__len2 <= __buffer_size)
2425 _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2427 __buffer_end, __last, __comp);
2431 _BidirectionalIterator __first_cut = __first;
2432 _BidirectionalIterator __second_cut = __middle;
2433 _Distance __len11 = 0;
2434 _Distance __len22 = 0;
2435 if (__len1 > __len2)
2437 __len11 = __len1 / 2;
2440 = std::__lower_bound(__middle, __last, *__first_cut,
2441 __gnu_cxx::__ops::__iter_comp_val(__comp));
2446 __len22 = __len2 / 2;
2449 = std::__upper_bound(__first, __middle, *__second_cut,
2450 __gnu_cxx::__ops::__val_comp_iter(__comp));
2454 _BidirectionalIterator __new_middle
2456 __len1 - __len11, __len22, __buffer,
2459 __len22, __buffer, __buffer_size, __comp);
2462 __len2 - __len22, __buffer,
2463 __buffer_size, __comp);
2468 template<
typename _BidirectionalIterator,
typename _Distance,
2472 _BidirectionalIterator __middle,
2473 _BidirectionalIterator __last,
2474 _Distance __len1, _Distance __len2,
2477 if (__len1 == 0 || __len2 == 0)
2480 if (__len1 + __len2 == 2)
2482 if (__comp(__middle, __first))
2487 _BidirectionalIterator __first_cut = __first;
2488 _BidirectionalIterator __second_cut = __middle;
2489 _Distance __len11 = 0;
2490 _Distance __len22 = 0;
2491 if (__len1 > __len2)
2493 __len11 = __len1 / 2;
2496 = std::__lower_bound(__middle, __last, *__first_cut,
2497 __gnu_cxx::__ops::__iter_comp_val(__comp));
2502 __len22 = __len2 / 2;
2505 = std::__upper_bound(__first, __middle, *__second_cut,
2506 __gnu_cxx::__ops::__val_comp_iter(__comp));
2510 _BidirectionalIterator __new_middle
2511 =
std::rotate(__first_cut, __middle, __second_cut);
2513 __len11, __len22, __comp);
2515 __len1 - __len11, __len2 - __len22, __comp);
2518 template<
typename _B
idirectionalIterator,
typename _Compare>
2520 __inplace_merge(_BidirectionalIterator __first,
2521 _BidirectionalIterator __middle,
2522 _BidirectionalIterator __last,
2525 typedef typename iterator_traits<_BidirectionalIterator>::value_type
2527 typedef typename iterator_traits<_BidirectionalIterator>::difference_type
2530 if (__first == __middle || __middle == __last)
2533 const _DistanceType __len1 =
std::distance(__first, __middle);
2534 const _DistanceType __len2 =
std::distance(__middle, __last);
2537 _TmpBuf __buf(__first, __len1 + __len2);
2539 if (__buf.begin() == 0)
2541 (__first, __middle, __last, __len1, __len2, __comp);
2544 (__first, __middle, __last, __len1, __len2, __buf.begin(),
2545 _DistanceType(__buf.size()), __comp);
2566 template<
typename _B
idirectionalIterator>
2568 inplace_merge(_BidirectionalIterator __first,
2569 _BidirectionalIterator __middle,
2570 _BidirectionalIterator __last)
2573 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2574 _BidirectionalIterator>)
2575 __glibcxx_function_requires(_LessThanComparableConcept<
2576 typename iterator_traits<_BidirectionalIterator>::value_type>)
2577 __glibcxx_requires_sorted(__first, __middle);
2578 __glibcxx_requires_sorted(__middle, __last);
2579 __glibcxx_requires_irreflexive(__first, __last);
2581 std::__inplace_merge(__first, __middle, __last,
2582 __gnu_cxx::__ops::__iter_less_iter());
2607 template<
typename _B
idirectionalIterator,
typename _Compare>
2609 inplace_merge(_BidirectionalIterator __first,
2610 _BidirectionalIterator __middle,
2611 _BidirectionalIterator __last,
2615 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2616 _BidirectionalIterator>)
2617 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2618 typename iterator_traits<_BidirectionalIterator>::value_type,
2619 typename iterator_traits<_BidirectionalIterator>::value_type>)
2620 __glibcxx_requires_sorted_pred(__first, __middle, __comp);
2621 __glibcxx_requires_sorted_pred(__middle, __last, __comp);
2622 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2624 std::__inplace_merge(__first, __middle, __last,
2625 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2630 template<
typename _InputIterator,
typename _OutputIterator,
2634 _InputIterator __first2, _InputIterator __last2,
2635 _OutputIterator __result, _Compare __comp)
2637 while (__first1 != __last1 && __first2 != __last2)
2639 if (__comp(__first2, __first1))
2641 *__result = _GLIBCXX_MOVE(*__first2);
2646 *__result = _GLIBCXX_MOVE(*__first1);
2651 return _GLIBCXX_MOVE3(__first2, __last2,
2652 _GLIBCXX_MOVE3(__first1, __last1,
2656 template<
typename _RandomAccessIterator1,
typename _RandomAccessIterator2,
2657 typename _Distance,
typename _Compare>
2659 __merge_sort_loop(_RandomAccessIterator1 __first,
2660 _RandomAccessIterator1 __last,
2661 _RandomAccessIterator2 __result, _Distance __step_size,
2664 const _Distance __two_step = 2 * __step_size;
2666 while (__last - __first >= __two_step)
2669 __first + __step_size,
2670 __first + __two_step,
2672 __first += __two_step;
2674 __step_size =
std::min(_Distance(__last - __first), __step_size);
2677 __first + __step_size, __last, __result, __comp);
2680 template<
typename _RandomAccessIterator,
typename _Distance,
2683 __chunk_insertion_sort(_RandomAccessIterator __first,
2684 _RandomAccessIterator __last,
2685 _Distance __chunk_size, _Compare __comp)
2687 while (__last - __first >= __chunk_size)
2690 __first += __chunk_size;
2695 enum { _S_chunk_size = 7 };
2697 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2699 __merge_sort_with_buffer(_RandomAccessIterator __first,
2700 _RandomAccessIterator __last,
2701 _Pointer __buffer, _Compare __comp)
2703 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
2706 const _Distance __len = __last - __first;
2707 const _Pointer __buffer_last = __buffer + __len;
2709 _Distance __step_size = _S_chunk_size;
2710 std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
2712 while (__step_size < __len)
2714 std::__merge_sort_loop(__first, __last, __buffer,
2715 __step_size, __comp);
2717 std::__merge_sort_loop(__buffer, __buffer_last, __first,
2718 __step_size, __comp);
2723 template<
typename _RandomAccessIterator,
typename _Pointer,
2724 typename _Distance,
typename _Compare>
2726 __stable_sort_adaptive(_RandomAccessIterator __first,
2727 _RandomAccessIterator __last,
2728 _Pointer __buffer, _Distance __buffer_size,
2731 const _Distance __len = (__last - __first + 1) / 2;
2732 const _RandomAccessIterator __middle = __first + __len;
2733 if (__len > __buffer_size)
2735 std::__stable_sort_adaptive(__first, __middle, __buffer,
2736 __buffer_size, __comp);
2737 std::__stable_sort_adaptive(__middle, __last, __buffer,
2738 __buffer_size, __comp);
2742 std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2743 std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2746 _Distance(__middle - __first),
2747 _Distance(__last - __middle),
2748 __buffer, __buffer_size,
2753 template<
typename _RandomAccessIterator,
typename _Compare>
2756 _RandomAccessIterator __last, _Compare __comp)
2758 if (__last - __first < 15)
2763 _RandomAccessIterator __middle = __first + (__last - __first) / 2;
2779 template<
typename _InputIterator1,
typename _InputIterator2,
2782 __includes(_InputIterator1 __first1, _InputIterator1 __last1,
2783 _InputIterator2 __first2, _InputIterator2 __last2,
2786 while (__first1 != __last1 && __first2 != __last2)
2787 if (__comp(__first2, __first1))
2789 else if (__comp(__first1, __first2))
2797 return __first2 == __last2;
2818 template<
typename _InputIterator1,
typename _InputIterator2>
2820 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2821 _InputIterator2 __first2, _InputIterator2 __last2)
2824 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2825 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2826 __glibcxx_function_requires(_LessThanOpConcept<
2827 typename iterator_traits<_InputIterator1>::value_type,
2828 typename iterator_traits<_InputIterator2>::value_type>)
2829 __glibcxx_function_requires(_LessThanOpConcept<
2830 typename iterator_traits<_InputIterator2>::value_type,
2831 typename iterator_traits<_InputIterator1>::value_type>)
2832 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
2833 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
2834 __glibcxx_requires_irreflexive2(__first1, __last1);
2835 __glibcxx_requires_irreflexive2(__first2, __last2);
2837 return std::__includes(__first1, __last1, __first2, __last2,
2838 __gnu_cxx::__ops::__iter_less_iter());
2862 template<
typename _InputIterator1,
typename _InputIterator2,
2865 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2866 _InputIterator2 __first2, _InputIterator2 __last2,
2870 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2871 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2872 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2873 typename iterator_traits<_InputIterator1>::value_type,
2874 typename iterator_traits<_InputIterator2>::value_type>)
2875 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2876 typename iterator_traits<_InputIterator2>::value_type,
2877 typename iterator_traits<_InputIterator1>::value_type>)
2878 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
2879 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
2880 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
2881 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
2883 return std::__includes(__first1, __last1, __first2, __last2,
2884 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2897 template<
typename _B
idirectionalIterator,
typename _Compare>
2899 __next_permutation(_BidirectionalIterator __first,
2900 _BidirectionalIterator __last, _Compare __comp)
2902 if (__first == __last)
2904 _BidirectionalIterator __i = __first;
2913 _BidirectionalIterator __ii = __i;
2915 if (__comp(__i, __ii))
2917 _BidirectionalIterator __j = __last;
2918 while (!__comp(__i, --__j))
2946 template<
typename _B
idirectionalIterator>
2948 next_permutation(_BidirectionalIterator __first,
2949 _BidirectionalIterator __last)
2952 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2953 _BidirectionalIterator>)
2954 __glibcxx_function_requires(_LessThanComparableConcept<
2955 typename iterator_traits<_BidirectionalIterator>::value_type>)
2956 __glibcxx_requires_valid_range(__first, __last);
2957 __glibcxx_requires_irreflexive(__first, __last);
2959 return std::__next_permutation
2960 (__first, __last, __gnu_cxx::__ops::__iter_less_iter());
2978 template<
typename _B
idirectionalIterator,
typename _Compare>
2980 next_permutation(_BidirectionalIterator __first,
2981 _BidirectionalIterator __last, _Compare __comp)
2984 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2985 _BidirectionalIterator>)
2986 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2987 typename iterator_traits<_BidirectionalIterator>::value_type,
2988 typename iterator_traits<_BidirectionalIterator>::value_type>)
2989 __glibcxx_requires_valid_range(__first, __last);
2990 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2992 return std::__next_permutation
2993 (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
2996 template<
typename _B
idirectionalIterator,
typename _Compare>
2998 __prev_permutation(_BidirectionalIterator __first,
2999 _BidirectionalIterator __last, _Compare __comp)
3001 if (__first == __last)
3003 _BidirectionalIterator __i = __first;
3012 _BidirectionalIterator __ii = __i;
3014 if (__comp(__ii, __i))
3016 _BidirectionalIterator __j = __last;
3017 while (!__comp(--__j, __i))
3046 template<
typename _B
idirectionalIterator>
3048 prev_permutation(_BidirectionalIterator __first,
3049 _BidirectionalIterator __last)
3052 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3053 _BidirectionalIterator>)
3054 __glibcxx_function_requires(_LessThanComparableConcept<
3055 typename iterator_traits<_BidirectionalIterator>::value_type>)
3056 __glibcxx_requires_valid_range(__first, __last);
3057 __glibcxx_requires_irreflexive(__first, __last);
3059 return std::__prev_permutation(__first, __last,
3060 __gnu_cxx::__ops::__iter_less_iter());
3078 template<
typename _B
idirectionalIterator,
typename _Compare>
3080 prev_permutation(_BidirectionalIterator __first,
3081 _BidirectionalIterator __last, _Compare __comp)
3084 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3085 _BidirectionalIterator>)
3086 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3087 typename iterator_traits<_BidirectionalIterator>::value_type,
3088 typename iterator_traits<_BidirectionalIterator>::value_type>)
3089 __glibcxx_requires_valid_range(__first, __last);
3090 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3092 return std::__prev_permutation(__first, __last,
3093 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3099 template<
typename _InputIterator,
typename _OutputIterator,
3100 typename _Predicate,
typename _Tp>
3102 __replace_copy_if(_InputIterator __first, _InputIterator __last,
3103 _OutputIterator __result,
3104 _Predicate __pred,
const _Tp& __new_value)
3106 for (; __first != __last; ++__first, (void)++__result)
3107 if (__pred(__first))
3108 *__result = __new_value;
3110 *__result = *__first;
3128 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
3129 inline _OutputIterator
3130 replace_copy(_InputIterator __first, _InputIterator __last,
3131 _OutputIterator __result,
3132 const _Tp& __old_value,
const _Tp& __new_value)
3135 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3136 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3137 typename iterator_traits<_InputIterator>::value_type>)
3138 __glibcxx_function_requires(_EqualOpConcept<
3139 typename iterator_traits<_InputIterator>::value_type, _Tp>)
3140 __glibcxx_requires_valid_range(__first, __last);
3142 return std::__replace_copy_if(__first, __last, __result,
3143 __gnu_cxx::__ops::__iter_equals_val(__old_value),
3162 template<
typename _InputIterator,
typename _OutputIterator,
3163 typename _Predicate,
typename _Tp>
3164 inline _OutputIterator
3165 replace_copy_if(_InputIterator __first, _InputIterator __last,
3166 _OutputIterator __result,
3167 _Predicate __pred,
const _Tp& __new_value)
3170 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3171 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3172 typename iterator_traits<_InputIterator>::value_type>)
3173 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3174 typename iterator_traits<_InputIterator>::value_type>)
3175 __glibcxx_requires_valid_range(__first, __last);
3177 return std::__replace_copy_if(__first, __last, __result,
3178 __gnu_cxx::__ops::__pred_iter(__pred),
3182 template<
typename _InputIterator,
typename _Predicate>
3183 typename iterator_traits<_InputIterator>::difference_type
3184 __count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
3186 typename iterator_traits<_InputIterator>::difference_type __n = 0;
3187 for (; __first != __last; ++__first)
3188 if (__pred(__first))
3193 #if __cplusplus >= 201103L 3201 template<
typename _ForwardIterator>
3203 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3215 template<
typename _ForwardIterator,
typename _Compare>
3217 is_sorted(_ForwardIterator __first, _ForwardIterator __last,
3221 template<
typename _ForwardIterator,
typename _Compare>
3223 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3226 if (__first == __last)
3229 _ForwardIterator __next = __first;
3230 for (++__next; __next != __last; __first = __next, (void)++__next)
3231 if (__comp(__next, __first))
3244 template<
typename _ForwardIterator>
3245 inline _ForwardIterator
3246 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
3249 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3250 __glibcxx_function_requires(_LessThanComparableConcept<
3251 typename iterator_traits<_ForwardIterator>::value_type>)
3252 __glibcxx_requires_valid_range(__first, __last);
3253 __glibcxx_requires_irreflexive(__first, __last);
3255 return std::__is_sorted_until(__first, __last,
3256 __gnu_cxx::__ops::__iter_less_iter());
3268 template<
typename _ForwardIterator,
typename _Compare>
3269 inline _ForwardIterator
3270 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3274 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3275 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3276 typename iterator_traits<_ForwardIterator>::value_type,
3277 typename iterator_traits<_ForwardIterator>::value_type>)
3278 __glibcxx_requires_valid_range(__first, __last);
3279 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3281 return std::__is_sorted_until(__first, __last,
3282 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3293 template<
typename _Tp>
3294 _GLIBCXX14_CONSTEXPR
3299 __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
3301 return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a)
3314 template<
typename _Tp,
typename _Compare>
3315 _GLIBCXX14_CONSTEXPR
3317 minmax(
const _Tp& __a,
const _Tp& __b, _Compare __comp)
3323 template<
typename _ForwardIterator,
typename _Compare>
3324 _GLIBCXX14_CONSTEXPR
3326 __minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3329 _ForwardIterator __next = __first;
3330 if (__first == __last
3331 || ++__next == __last)
3334 _ForwardIterator __min{}, __max{};
3335 if (__comp(__next, __first))
3349 while (__first != __last)
3352 if (++__next == __last)
3354 if (__comp(__first, __min))
3356 else if (!__comp(__first, __max))
3361 if (__comp(__next, __first))
3363 if (__comp(__next, __min))
3365 if (!__comp(__first, __max))
3370 if (__comp(__first, __min))
3372 if (!__comp(__next, __max))
3394 template<
typename _ForwardIterator>
3395 _GLIBCXX14_CONSTEXPR
3397 minmax_element(_ForwardIterator __first, _ForwardIterator __last)
3400 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3401 __glibcxx_function_requires(_LessThanComparableConcept<
3402 typename iterator_traits<_ForwardIterator>::value_type>)
3403 __glibcxx_requires_valid_range(__first, __last);
3404 __glibcxx_requires_irreflexive(__first, __last);
3406 return std::__minmax_element(__first, __last,
3407 __gnu_cxx::__ops::__iter_less_iter());
3422 template<
typename _ForwardIterator,
typename _Compare>
3423 _GLIBCXX14_CONSTEXPR
3425 minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3429 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3430 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3431 typename iterator_traits<_ForwardIterator>::value_type,
3432 typename iterator_traits<_ForwardIterator>::value_type>)
3433 __glibcxx_requires_valid_range(__first, __last);
3434 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3436 return std::__minmax_element(__first, __last,
3437 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3441 template<
typename _Tp>
3442 _GLIBCXX14_CONSTEXPR
3447 template<
typename _Tp,
typename _Compare>
3448 _GLIBCXX14_CONSTEXPR
3453 template<
typename _Tp>
3454 _GLIBCXX14_CONSTEXPR
3459 template<
typename _Tp,
typename _Compare>
3460 _GLIBCXX14_CONSTEXPR
3465 template<
typename _Tp>
3466 _GLIBCXX14_CONSTEXPR
3475 template<
typename _Tp,
typename _Compare>
3476 _GLIBCXX14_CONSTEXPR
3485 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3486 typename _BinaryPredicate>
3488 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3489 _ForwardIterator2 __first2, _BinaryPredicate __pred)
3493 for (; __first1 != __last1; ++__first1, (void)++__first2)
3494 if (!__pred(__first1, __first2))
3497 if (__first1 == __last1)
3502 _ForwardIterator2 __last2 = __first2;
3504 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3507 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3511 = std::__count_if(__first2, __last2,
3512 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3513 if (0 == __matches ||
3514 std::__count_if(__scan, __last1,
3515 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3534 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3536 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3537 _ForwardIterator2 __first2)
3540 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
3541 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
3542 __glibcxx_function_requires(_EqualOpConcept<
3543 typename iterator_traits<_ForwardIterator1>::value_type,
3544 typename iterator_traits<_ForwardIterator2>::value_type>)
3545 __glibcxx_requires_valid_range(__first1, __last1);
3547 return std::__is_permutation(__first1, __last1, __first2,
3548 __gnu_cxx::__ops::__iter_equal_to_iter());
3565 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3566 typename _BinaryPredicate>
3568 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3569 _ForwardIterator2 __first2, _BinaryPredicate __pred)
3572 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
3573 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
3574 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
3575 typename iterator_traits<_ForwardIterator1>::value_type,
3576 typename iterator_traits<_ForwardIterator2>::value_type>)
3577 __glibcxx_requires_valid_range(__first1, __last1);
3579 return std::__is_permutation(__first1, __last1, __first2,
3580 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3583 #if __cplusplus > 201103L 3584 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3585 typename _BinaryPredicate>
3587 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3588 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3589 _BinaryPredicate __pred)
3592 =
typename iterator_traits<_ForwardIterator1>::iterator_category;
3594 =
typename iterator_traits<_ForwardIterator2>::iterator_category;
3597 constexpr
bool __ra_iters = _It1_is_RA() && _It2_is_RA();
3608 for (; __first1 != __last1 && __first2 != __last2;
3609 ++__first1, (void)++__first2)
3610 if (!__pred(__first1, __first2))
3615 if (__first1 == __last1)
3622 if (__d1 == 0 && __d2 == 0)
3628 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3631 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3634 auto __matches = std::__count_if(__first2, __last2,
3635 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3637 || std::__count_if(__scan, __last1,
3638 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3658 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3660 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3661 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
3663 __glibcxx_requires_valid_range(__first1, __last1);
3664 __glibcxx_requires_valid_range(__first2, __last2);
3667 std::__is_permutation(__first1, __last1, __first2, __last2,
3668 __gnu_cxx::__ops::__iter_equal_to_iter());
3685 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3686 typename _BinaryPredicate>
3688 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3689 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3690 _BinaryPredicate __pred)
3692 __glibcxx_requires_valid_range(__first1, __last1);
3693 __glibcxx_requires_valid_range(__first2, __last2);
3695 return std::__is_permutation(__first1, __last1, __first2, __last2,
3696 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3699 #if __cplusplus > 201402L 3701 #define __cpp_lib_clamp 201603 3711 template<
typename _Tp>
3712 constexpr
const _Tp&
3713 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi)
3715 __glibcxx_assert(!(__hi < __lo));
3716 return (__val < __lo) ? __lo : (__hi < __val) ? __hi : __val;
3729 template<
typename _Tp,
typename _Compare>
3730 constexpr
const _Tp&
3731 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi, _Compare __comp)
3733 __glibcxx_assert(!__comp(__hi, __lo));
3734 return __comp(__val, __lo) ? __lo : __comp(__hi, __val) ? __hi : __val;
3739 #ifdef _GLIBCXX_USE_C99_STDINT_TR1 3761 template<
typename _IntType,
typename _UniformRandomBitGenerator>
3764 _UniformRandomBitGenerator&& __g)
3783 template<
typename _RandomAccessIterator,
3784 typename _UniformRandomNumberGenerator>
3786 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
3787 _UniformRandomNumberGenerator&& __g)
3790 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
3791 _RandomAccessIterator>)
3792 __glibcxx_requires_valid_range(__first, __last);
3794 if (__first == __last)
3797 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
3800 typedef typename std::make_unsigned<_DistanceType>::type __ud_type;
3802 typedef typename __distr_type::param_type __p_type;
3804 typedef typename remove_reference<_UniformRandomNumberGenerator>::type
3809 const __uc_type __urngrange = __g.max() - __g.min();
3810 const __uc_type __urange = __uc_type(__last - __first);
3812 if (__urngrange / __urange >= __urange)
3815 _RandomAccessIterator __i = __first + 1;
3821 if ((__urange % 2) == 0)
3823 __distr_type __d{0, 1};
3831 while (__i != __last)
3833 const __uc_type __swap_range = __uc_type(__i - __first) + 1;
3847 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
3848 std::iter_swap(__i, __first + __d(__g, __p_type(0, __i - __first)));
3854 _GLIBCXX_BEGIN_NAMESPACE_ALGO
3868 template<
typename _InputIterator,
typename _Function>
3870 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
3873 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3874 __glibcxx_requires_valid_range(__first, __last);
3875 for (; __first != __last; ++__first)
3889 template<
typename _InputIterator,
typename _Tp>
3890 inline _InputIterator
3891 find(_InputIterator __first, _InputIterator __last,
3895 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3896 __glibcxx_function_requires(_EqualOpConcept<
3897 typename iterator_traits<_InputIterator>::value_type, _Tp>)
3898 __glibcxx_requires_valid_range(__first, __last);
3900 __gnu_cxx::__ops::__iter_equals_val(__val));
3913 template<
typename _InputIterator,
typename _Predicate>
3914 inline _InputIterator
3915 find_if(_InputIterator __first, _InputIterator __last,
3919 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3920 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3921 typename iterator_traits<_InputIterator>::value_type>)
3922 __glibcxx_requires_valid_range(__first, __last);
3925 __gnu_cxx::__ops::__pred_iter(__pred));
3944 template<
typename _InputIterator,
typename _ForwardIterator>
3946 find_first_of(_InputIterator __first1, _InputIterator __last1,
3947 _ForwardIterator __first2, _ForwardIterator __last2)
3950 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3951 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3952 __glibcxx_function_requires(_EqualOpConcept<
3953 typename iterator_traits<_InputIterator>::value_type,
3954 typename iterator_traits<_ForwardIterator>::value_type>)
3955 __glibcxx_requires_valid_range(__first1, __last1);
3956 __glibcxx_requires_valid_range(__first2, __last2);
3958 for (; __first1 != __last1; ++__first1)
3959 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3960 if (*__first1 == *__iter)
3984 template<
typename _InputIterator,
typename _ForwardIterator,
3985 typename _BinaryPredicate>
3987 find_first_of(_InputIterator __first1, _InputIterator __last1,
3988 _ForwardIterator __first2, _ForwardIterator __last2,
3989 _BinaryPredicate __comp)
3992 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3993 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3994 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
3995 typename iterator_traits<_InputIterator>::value_type,
3996 typename iterator_traits<_ForwardIterator>::value_type>)
3997 __glibcxx_requires_valid_range(__first1, __last1);
3998 __glibcxx_requires_valid_range(__first2, __last2);
4000 for (; __first1 != __last1; ++__first1)
4001 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
4002 if (__comp(*__first1, *__iter))
4016 template<
typename _ForwardIterator>
4017 inline _ForwardIterator
4018 adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
4021 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4022 __glibcxx_function_requires(_EqualityComparableConcept<
4023 typename iterator_traits<_ForwardIterator>::value_type>)
4024 __glibcxx_requires_valid_range(__first, __last);
4026 return std::__adjacent_find(__first, __last,
4027 __gnu_cxx::__ops::__iter_equal_to_iter());
4041 template<
typename _ForwardIterator,
typename _BinaryPredicate>
4042 inline _ForwardIterator
4043 adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
4044 _BinaryPredicate __binary_pred)
4047 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4048 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4049 typename iterator_traits<_ForwardIterator>::value_type,
4050 typename iterator_traits<_ForwardIterator>::value_type>)
4051 __glibcxx_requires_valid_range(__first, __last);
4053 return std::__adjacent_find(__first, __last,
4054 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
4066 template<
typename _InputIterator,
typename _Tp>
4067 inline typename iterator_traits<_InputIterator>::difference_type
4068 count(_InputIterator __first, _InputIterator __last,
const _Tp& __value)
4071 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4072 __glibcxx_function_requires(_EqualOpConcept<
4073 typename iterator_traits<_InputIterator>::value_type, _Tp>)
4074 __glibcxx_requires_valid_range(__first, __last);
4076 return std::__count_if(__first, __last,
4077 __gnu_cxx::__ops::__iter_equals_val(__value));
4089 template<
typename _InputIterator,
typename _Predicate>
4090 inline typename iterator_traits<_InputIterator>::difference_type
4091 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
4094 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4095 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4096 typename iterator_traits<_InputIterator>::value_type>)
4097 __glibcxx_requires_valid_range(__first, __last);
4099 return std::__count_if(__first, __last,
4100 __gnu_cxx::__ops::__pred_iter(__pred));
4129 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
4130 inline _ForwardIterator1
4131 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
4132 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
4135 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
4136 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
4137 __glibcxx_function_requires(_EqualOpConcept<
4138 typename iterator_traits<_ForwardIterator1>::value_type,
4139 typename iterator_traits<_ForwardIterator2>::value_type>)
4140 __glibcxx_requires_valid_range(__first1, __last1);
4141 __glibcxx_requires_valid_range(__first2, __last2);
4143 return std::__search(__first1, __last1, __first2, __last2,
4144 __gnu_cxx::__ops::__iter_equal_to_iter());
4168 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
4169 typename _BinaryPredicate>
4170 inline _ForwardIterator1
4171 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
4172 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
4173 _BinaryPredicate __predicate)
4176 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
4177 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
4178 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4179 typename iterator_traits<_ForwardIterator1>::value_type,
4180 typename iterator_traits<_ForwardIterator2>::value_type>)
4181 __glibcxx_requires_valid_range(__first1, __last1);
4182 __glibcxx_requires_valid_range(__first2, __last2);
4184 return std::__search(__first1, __last1, __first2, __last2,
4185 __gnu_cxx::__ops::__iter_comp_iter(__predicate));
4203 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp>
4204 inline _ForwardIterator
4205 search_n(_ForwardIterator __first, _ForwardIterator __last,
4206 _Integer __count,
const _Tp& __val)
4209 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4210 __glibcxx_function_requires(_EqualOpConcept<
4211 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4212 __glibcxx_requires_valid_range(__first, __last);
4214 return std::__search_n(__first, __last, __count,
4215 __gnu_cxx::__ops::__iter_equals_val(__val));
4236 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp,
4237 typename _BinaryPredicate>
4238 inline _ForwardIterator
4239 search_n(_ForwardIterator __first, _ForwardIterator __last,
4240 _Integer __count,
const _Tp& __val,
4241 _BinaryPredicate __binary_pred)
4244 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4245 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4246 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4247 __glibcxx_requires_valid_range(__first, __last);
4249 return std::__search_n(__first, __last, __count,
4250 __gnu_cxx::__ops::__iter_comp_val(__binary_pred, __val));
4253 #if __cplusplus > 201402L 4261 template<
typename _ForwardIterator,
typename _Searcher>
4262 inline _ForwardIterator
4263 search(_ForwardIterator __first, _ForwardIterator __last,
4264 const _Searcher& __searcher)
4265 {
return __searcher(__first, __last).first; }
4284 template<
typename _InputIterator,
typename _OutputIterator,
4285 typename _UnaryOperation>
4287 transform(_InputIterator __first, _InputIterator __last,
4288 _OutputIterator __result, _UnaryOperation __unary_op)
4291 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4292 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4294 __typeof__(__unary_op(*__first))>)
4295 __glibcxx_requires_valid_range(__first, __last);
4297 for (; __first != __last; ++__first, (void)++__result)
4298 *__result = __unary_op(*__first);
4321 template<
typename _InputIterator1,
typename _InputIterator2,
4322 typename _OutputIterator,
typename _BinaryOperation>
4324 transform(_InputIterator1 __first1, _InputIterator1 __last1,
4325 _InputIterator2 __first2, _OutputIterator __result,
4326 _BinaryOperation __binary_op)
4329 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4330 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4331 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4333 __typeof__(__binary_op(*__first1,*__first2))>)
4334 __glibcxx_requires_valid_range(__first1, __last1);
4336 for (; __first1 != __last1; ++__first1, (void)++__first2, ++__result)
4337 *__result = __binary_op(*__first1, *__first2);
4354 template<
typename _ForwardIterator,
typename _Tp>
4356 replace(_ForwardIterator __first, _ForwardIterator __last,
4357 const _Tp& __old_value,
const _Tp& __new_value)
4360 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4362 __glibcxx_function_requires(_EqualOpConcept<
4363 typename iterator_traits<_ForwardIterator>::value_type, _Tp>)
4364 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4365 typename iterator_traits<_ForwardIterator>::value_type>)
4366 __glibcxx_requires_valid_range(__first, __last);
4368 for (; __first != __last; ++__first)
4369 if (*__first == __old_value)
4370 *__first = __new_value;
4386 template<
typename _ForwardIterator,
typename _Predicate,
typename _Tp>
4388 replace_if(_ForwardIterator __first, _ForwardIterator __last,
4389 _Predicate __pred,
const _Tp& __new_value)
4392 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4394 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4395 typename iterator_traits<_ForwardIterator>::value_type>)
4396 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4397 typename iterator_traits<_ForwardIterator>::value_type>)
4398 __glibcxx_requires_valid_range(__first, __last);
4400 for (; __first != __last; ++__first)
4401 if (__pred(*__first))
4402 *__first = __new_value;
4418 template<
typename _ForwardIterator,
typename _Generator>
4420 generate(_ForwardIterator __first, _ForwardIterator __last,
4424 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4425 __glibcxx_function_requires(_GeneratorConcept<_Generator,
4426 typename iterator_traits<_ForwardIterator>::value_type>)
4427 __glibcxx_requires_valid_range(__first, __last);
4429 for (; __first != __last; ++__first)
4449 template<
typename _OutputIterator,
typename _Size,
typename _Generator>
4451 generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
4454 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4456 __typeof__(__gen())>)
4458 for (__decltype(__n + 0) __niter = __n;
4459 __niter > 0; --__niter, (void) ++__first)
4485 template<
typename _InputIterator,
typename _OutputIterator>
4486 inline _OutputIterator
4487 unique_copy(_InputIterator __first, _InputIterator __last,
4488 _OutputIterator __result)
4491 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4492 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4493 typename iterator_traits<_InputIterator>::value_type>)
4494 __glibcxx_function_requires(_EqualityComparableConcept<
4495 typename iterator_traits<_InputIterator>::value_type>)
4496 __glibcxx_requires_valid_range(__first, __last);
4498 if (__first == __last)
4501 __gnu_cxx::__ops::__iter_equal_to_iter(),
4525 template<
typename _InputIterator,
typename _OutputIterator,
4526 typename _BinaryPredicate>
4527 inline _OutputIterator
4528 unique_copy(_InputIterator __first, _InputIterator __last,
4529 _OutputIterator __result,
4530 _BinaryPredicate __binary_pred)
4533 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4534 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4535 typename iterator_traits<_InputIterator>::value_type>)
4536 __glibcxx_requires_valid_range(__first, __last);
4538 if (__first == __last)
4541 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred),
4558 template<
typename _RandomAccessIterator>
4560 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
4563 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4564 _RandomAccessIterator>)
4565 __glibcxx_requires_valid_range(__first, __last);
4567 if (__first != __last)
4568 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4571 _RandomAccessIterator __j = __first
4572 + std::rand() % ((__i - __first) + 1);
4593 template<
typename _RandomAccessIterator,
typename _RandomNumberGenerator>
4595 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
4596 #
if __cplusplus >= 201103L
4597 _RandomNumberGenerator&& __rand)
4599 _RandomNumberGenerator& __rand)
4603 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4604 _RandomAccessIterator>)
4605 __glibcxx_requires_valid_range(__first, __last);
4607 if (__first == __last)
4609 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4611 _RandomAccessIterator __j = __first + __rand((__i - __first) + 1);
4633 template<
typename _ForwardIterator,
typename _Predicate>
4634 inline _ForwardIterator
4635 partition(_ForwardIterator __first, _ForwardIterator __last,
4639 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4641 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4642 typename iterator_traits<_ForwardIterator>::value_type>)
4643 __glibcxx_requires_valid_range(__first, __last);
4666 template<
typename _RandomAccessIterator>
4668 partial_sort(_RandomAccessIterator __first,
4669 _RandomAccessIterator __middle,
4670 _RandomAccessIterator __last)
4673 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4674 _RandomAccessIterator>)
4675 __glibcxx_function_requires(_LessThanComparableConcept<
4676 typename iterator_traits<_RandomAccessIterator>::value_type>)
4677 __glibcxx_requires_valid_range(__first, __middle);
4678 __glibcxx_requires_valid_range(__middle, __last);
4679 __glibcxx_requires_irreflexive(__first, __last);
4681 std::__partial_sort(__first, __middle, __last,
4682 __gnu_cxx::__ops::__iter_less_iter());
4704 template<
typename _RandomAccessIterator,
typename _Compare>
4706 partial_sort(_RandomAccessIterator __first,
4707 _RandomAccessIterator __middle,
4708 _RandomAccessIterator __last,
4712 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4713 _RandomAccessIterator>)
4714 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4715 typename iterator_traits<_RandomAccessIterator>::value_type,
4716 typename iterator_traits<_RandomAccessIterator>::value_type>)
4717 __glibcxx_requires_valid_range(__first, __middle);
4718 __glibcxx_requires_valid_range(__middle, __last);
4719 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4721 std::__partial_sort(__first, __middle, __last,
4722 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4740 template<
typename _RandomAccessIterator>
4742 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4743 _RandomAccessIterator __last)
4746 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4747 _RandomAccessIterator>)
4748 __glibcxx_function_requires(_LessThanComparableConcept<
4749 typename iterator_traits<_RandomAccessIterator>::value_type>)
4750 __glibcxx_requires_valid_range(__first, __nth);
4751 __glibcxx_requires_valid_range(__nth, __last);
4752 __glibcxx_requires_irreflexive(__first, __last);
4754 if (__first == __last || __nth == __last)
4757 std::__introselect(__first, __nth, __last,
4759 __gnu_cxx::__ops::__iter_less_iter());
4779 template<
typename _RandomAccessIterator,
typename _Compare>
4781 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4782 _RandomAccessIterator __last, _Compare __comp)
4785 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4786 _RandomAccessIterator>)
4787 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4788 typename iterator_traits<_RandomAccessIterator>::value_type,
4789 typename iterator_traits<_RandomAccessIterator>::value_type>)
4790 __glibcxx_requires_valid_range(__first, __nth);
4791 __glibcxx_requires_valid_range(__nth, __last);
4792 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4794 if (__first == __last || __nth == __last)
4797 std::__introselect(__first, __nth, __last,
4799 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4816 template<
typename _RandomAccessIterator>
4818 sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4821 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4822 _RandomAccessIterator>)
4823 __glibcxx_function_requires(_LessThanComparableConcept<
4824 typename iterator_traits<_RandomAccessIterator>::value_type>)
4825 __glibcxx_requires_valid_range(__first, __last);
4826 __glibcxx_requires_irreflexive(__first, __last);
4828 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
4846 template<
typename _RandomAccessIterator,
typename _Compare>
4848 sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4852 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4853 _RandomAccessIterator>)
4854 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4855 typename iterator_traits<_RandomAccessIterator>::value_type,
4856 typename iterator_traits<_RandomAccessIterator>::value_type>)
4857 __glibcxx_requires_valid_range(__first, __last);
4858 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4860 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
4863 template<
typename _InputIterator1,
typename _InputIterator2,
4864 typename _OutputIterator,
typename _Compare>
4866 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4867 _InputIterator2 __first2, _InputIterator2 __last2,
4868 _OutputIterator __result, _Compare __comp)
4870 while (__first1 != __last1 && __first2 != __last2)
4872 if (__comp(__first2, __first1))
4874 *__result = *__first2;
4879 *__result = *__first1;
4884 return std::copy(__first2, __last2,
4885 std::copy(__first1, __last1, __result));
4907 template<
typename _InputIterator1,
typename _InputIterator2,
4908 typename _OutputIterator>
4909 inline _OutputIterator
4910 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4911 _InputIterator2 __first2, _InputIterator2 __last2,
4912 _OutputIterator __result)
4915 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4916 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4917 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4918 typename iterator_traits<_InputIterator1>::value_type>)
4919 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4920 typename iterator_traits<_InputIterator2>::value_type>)
4921 __glibcxx_function_requires(_LessThanOpConcept<
4922 typename iterator_traits<_InputIterator2>::value_type,
4923 typename iterator_traits<_InputIterator1>::value_type>)
4924 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
4925 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
4926 __glibcxx_requires_irreflexive2(__first1, __last1);
4927 __glibcxx_requires_irreflexive2(__first2, __last2);
4929 return _GLIBCXX_STD_A::__merge(__first1, __last1,
4930 __first2, __last2, __result,
4931 __gnu_cxx::__ops::__iter_less_iter());
4957 template<
typename _InputIterator1,
typename _InputIterator2,
4958 typename _OutputIterator,
typename _Compare>
4959 inline _OutputIterator
4960 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4961 _InputIterator2 __first2, _InputIterator2 __last2,
4962 _OutputIterator __result, _Compare __comp)
4965 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4966 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4967 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4968 typename iterator_traits<_InputIterator1>::value_type>)
4969 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4970 typename iterator_traits<_InputIterator2>::value_type>)
4971 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4972 typename iterator_traits<_InputIterator2>::value_type,
4973 typename iterator_traits<_InputIterator1>::value_type>)
4974 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
4975 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
4976 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
4977 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
4979 return _GLIBCXX_STD_A::__merge(__first1, __last1,
4980 __first2, __last2, __result,
4981 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4984 template<
typename _RandomAccessIterator,
typename _Compare>
4986 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4989 typedef typename iterator_traits<_RandomAccessIterator>::value_type
4991 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
4997 if (__buf.begin() == 0)
5000 std::__stable_sort_adaptive(__first, __last, __buf.begin(),
5001 _DistanceType(__buf.size()), __comp);
5021 template<
typename _RandomAccessIterator>
5023 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
5026 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5027 _RandomAccessIterator>)
5028 __glibcxx_function_requires(_LessThanComparableConcept<
5029 typename iterator_traits<_RandomAccessIterator>::value_type>)
5030 __glibcxx_requires_valid_range(__first, __last);
5031 __glibcxx_requires_irreflexive(__first, __last);
5033 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5034 __gnu_cxx::__ops::__iter_less_iter());
5055 template<
typename _RandomAccessIterator,
typename _Compare>
5057 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
5061 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5062 _RandomAccessIterator>)
5063 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5064 typename iterator_traits<_RandomAccessIterator>::value_type,
5065 typename iterator_traits<_RandomAccessIterator>::value_type>)
5066 __glibcxx_requires_valid_range(__first, __last);
5067 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5069 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5070 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5073 template<
typename _InputIterator1,
typename _InputIterator2,
5074 typename _OutputIterator,
5077 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5078 _InputIterator2 __first2, _InputIterator2 __last2,
5079 _OutputIterator __result, _Compare __comp)
5081 while (__first1 != __last1 && __first2 != __last2)
5083 if (__comp(__first1, __first2))
5085 *__result = *__first1;
5088 else if (__comp(__first2, __first1))
5090 *__result = *__first2;
5095 *__result = *__first1;
5101 return std::copy(__first2, __last2,
5102 std::copy(__first1, __last1, __result));
5124 template<
typename _InputIterator1,
typename _InputIterator2,
5125 typename _OutputIterator>
5126 inline _OutputIterator
5127 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5128 _InputIterator2 __first2, _InputIterator2 __last2,
5129 _OutputIterator __result)
5132 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5133 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5134 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5135 typename iterator_traits<_InputIterator1>::value_type>)
5136 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5137 typename iterator_traits<_InputIterator2>::value_type>)
5138 __glibcxx_function_requires(_LessThanOpConcept<
5139 typename iterator_traits<_InputIterator1>::value_type,
5140 typename iterator_traits<_InputIterator2>::value_type>)
5141 __glibcxx_function_requires(_LessThanOpConcept<
5142 typename iterator_traits<_InputIterator2>::value_type,
5143 typename iterator_traits<_InputIterator1>::value_type>)
5144 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5145 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5146 __glibcxx_requires_irreflexive2(__first1, __last1);
5147 __glibcxx_requires_irreflexive2(__first2, __last2);
5149 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5150 __first2, __last2, __result,
5151 __gnu_cxx::__ops::__iter_less_iter());
5174 template<
typename _InputIterator1,
typename _InputIterator2,
5175 typename _OutputIterator,
typename _Compare>
5176 inline _OutputIterator
5177 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5178 _InputIterator2 __first2, _InputIterator2 __last2,
5179 _OutputIterator __result, _Compare __comp)
5182 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5183 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5184 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5185 typename iterator_traits<_InputIterator1>::value_type>)
5186 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5187 typename iterator_traits<_InputIterator2>::value_type>)
5188 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5189 typename iterator_traits<_InputIterator1>::value_type,
5190 typename iterator_traits<_InputIterator2>::value_type>)
5191 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5192 typename iterator_traits<_InputIterator2>::value_type,
5193 typename iterator_traits<_InputIterator1>::value_type>)
5194 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5195 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5196 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5197 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5199 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5200 __first2, __last2, __result,
5201 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5204 template<
typename _InputIterator1,
typename _InputIterator2,
5205 typename _OutputIterator,
5208 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5209 _InputIterator2 __first2, _InputIterator2 __last2,
5210 _OutputIterator __result, _Compare __comp)
5212 while (__first1 != __last1 && __first2 != __last2)
5213 if (__comp(__first1, __first2))
5215 else if (__comp(__first2, __first1))
5219 *__result = *__first1;
5245 template<
typename _InputIterator1,
typename _InputIterator2,
5246 typename _OutputIterator>
5247 inline _OutputIterator
5248 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5249 _InputIterator2 __first2, _InputIterator2 __last2,
5250 _OutputIterator __result)
5253 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5254 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5255 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5256 typename iterator_traits<_InputIterator1>::value_type>)
5257 __glibcxx_function_requires(_LessThanOpConcept<
5258 typename iterator_traits<_InputIterator1>::value_type,
5259 typename iterator_traits<_InputIterator2>::value_type>)
5260 __glibcxx_function_requires(_LessThanOpConcept<
5261 typename iterator_traits<_InputIterator2>::value_type,
5262 typename iterator_traits<_InputIterator1>::value_type>)
5263 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5264 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5265 __glibcxx_requires_irreflexive2(__first1, __last1);
5266 __glibcxx_requires_irreflexive2(__first2, __last2);
5268 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5269 __first2, __last2, __result,
5270 __gnu_cxx::__ops::__iter_less_iter());
5294 template<
typename _InputIterator1,
typename _InputIterator2,
5295 typename _OutputIterator,
typename _Compare>
5296 inline _OutputIterator
5297 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5298 _InputIterator2 __first2, _InputIterator2 __last2,
5299 _OutputIterator __result, _Compare __comp)
5302 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5303 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5304 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5305 typename iterator_traits<_InputIterator1>::value_type>)
5306 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5307 typename iterator_traits<_InputIterator1>::value_type,
5308 typename iterator_traits<_InputIterator2>::value_type>)
5309 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5310 typename iterator_traits<_InputIterator2>::value_type,
5311 typename iterator_traits<_InputIterator1>::value_type>)
5312 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5313 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5314 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5315 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5317 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5318 __first2, __last2, __result,
5319 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5322 template<
typename _InputIterator1,
typename _InputIterator2,
5323 typename _OutputIterator,
5326 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5327 _InputIterator2 __first2, _InputIterator2 __last2,
5328 _OutputIterator __result, _Compare __comp)
5330 while (__first1 != __last1 && __first2 != __last2)
5331 if (__comp(__first1, __first2))
5333 *__result = *__first1;
5337 else if (__comp(__first2, __first1))
5344 return std::copy(__first1, __last1, __result);
5367 template<
typename _InputIterator1,
typename _InputIterator2,
5368 typename _OutputIterator>
5369 inline _OutputIterator
5370 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5371 _InputIterator2 __first2, _InputIterator2 __last2,
5372 _OutputIterator __result)
5375 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5376 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5377 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5378 typename iterator_traits<_InputIterator1>::value_type>)
5379 __glibcxx_function_requires(_LessThanOpConcept<
5380 typename iterator_traits<_InputIterator1>::value_type,
5381 typename iterator_traits<_InputIterator2>::value_type>)
5382 __glibcxx_function_requires(_LessThanOpConcept<
5383 typename iterator_traits<_InputIterator2>::value_type,
5384 typename iterator_traits<_InputIterator1>::value_type>)
5385 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5386 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5387 __glibcxx_requires_irreflexive2(__first1, __last1);
5388 __glibcxx_requires_irreflexive2(__first2, __last2);
5390 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5391 __first2, __last2, __result,
5392 __gnu_cxx::__ops::__iter_less_iter());
5418 template<
typename _InputIterator1,
typename _InputIterator2,
5419 typename _OutputIterator,
typename _Compare>
5420 inline _OutputIterator
5421 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5422 _InputIterator2 __first2, _InputIterator2 __last2,
5423 _OutputIterator __result, _Compare __comp)
5426 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5427 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5428 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5429 typename iterator_traits<_InputIterator1>::value_type>)
5430 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5431 typename iterator_traits<_InputIterator1>::value_type,
5432 typename iterator_traits<_InputIterator2>::value_type>)
5433 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5434 typename iterator_traits<_InputIterator2>::value_type,
5435 typename iterator_traits<_InputIterator1>::value_type>)
5436 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5437 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5438 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5439 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5441 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5442 __first2, __last2, __result,
5443 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5446 template<
typename _InputIterator1,
typename _InputIterator2,
5447 typename _OutputIterator,
5450 __set_symmetric_difference(_InputIterator1 __first1,
5451 _InputIterator1 __last1,
5452 _InputIterator2 __first2,
5453 _InputIterator2 __last2,
5454 _OutputIterator __result,
5457 while (__first1 != __last1 && __first2 != __last2)
5458 if (__comp(__first1, __first2))
5460 *__result = *__first1;
5464 else if (__comp(__first2, __first1))
5466 *__result = *__first2;
5475 return std::copy(__first2, __last2,
5476 std::copy(__first1, __last1, __result));
5497 template<
typename _InputIterator1,
typename _InputIterator2,
5498 typename _OutputIterator>
5499 inline _OutputIterator
5500 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5501 _InputIterator2 __first2, _InputIterator2 __last2,
5502 _OutputIterator __result)
5505 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5506 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5507 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5508 typename iterator_traits<_InputIterator1>::value_type>)
5509 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5510 typename iterator_traits<_InputIterator2>::value_type>)
5511 __glibcxx_function_requires(_LessThanOpConcept<
5512 typename iterator_traits<_InputIterator1>::value_type,
5513 typename iterator_traits<_InputIterator2>::value_type>)
5514 __glibcxx_function_requires(_LessThanOpConcept<
5515 typename iterator_traits<_InputIterator2>::value_type,
5516 typename iterator_traits<_InputIterator1>::value_type>)
5517 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5518 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5519 __glibcxx_requires_irreflexive2(__first1, __last1);
5520 __glibcxx_requires_irreflexive2(__first2, __last2);
5522 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5523 __first2, __last2, __result,
5524 __gnu_cxx::__ops::__iter_less_iter());
5548 template<
typename _InputIterator1,
typename _InputIterator2,
5549 typename _OutputIterator,
typename _Compare>
5550 inline _OutputIterator
5551 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5552 _InputIterator2 __first2, _InputIterator2 __last2,
5553 _OutputIterator __result,
5557 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5558 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5559 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5560 typename iterator_traits<_InputIterator1>::value_type>)
5561 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5562 typename iterator_traits<_InputIterator2>::value_type>)
5563 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5564 typename iterator_traits<_InputIterator1>::value_type,
5565 typename iterator_traits<_InputIterator2>::value_type>)
5566 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5567 typename iterator_traits<_InputIterator2>::value_type,
5568 typename iterator_traits<_InputIterator1>::value_type>)
5569 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5570 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5571 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5572 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5574 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5575 __first2, __last2, __result,
5576 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5579 template<
typename _ForwardIterator,
typename _Compare>
5580 _GLIBCXX14_CONSTEXPR
5582 __min_element(_ForwardIterator __first, _ForwardIterator __last,
5585 if (__first == __last)
5587 _ForwardIterator __result = __first;
5588 while (++__first != __last)
5589 if (__comp(__first, __result))
5601 template<
typename _ForwardIterator>
5602 _GLIBCXX14_CONSTEXPR
5604 inline min_element(_ForwardIterator __first, _ForwardIterator __last)
5607 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5608 __glibcxx_function_requires(_LessThanComparableConcept<
5609 typename iterator_traits<_ForwardIterator>::value_type>)
5610 __glibcxx_requires_valid_range(__first, __last);
5611 __glibcxx_requires_irreflexive(__first, __last);
5613 return _GLIBCXX_STD_A::__min_element(__first, __last,
5614 __gnu_cxx::__ops::__iter_less_iter());
5626 template<
typename _ForwardIterator,
typename _Compare>
5627 _GLIBCXX14_CONSTEXPR
5628 inline _ForwardIterator
5629 min_element(_ForwardIterator __first, _ForwardIterator __last,
5633 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5634 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5635 typename iterator_traits<_ForwardIterator>::value_type,
5636 typename iterator_traits<_ForwardIterator>::value_type>)
5637 __glibcxx_requires_valid_range(__first, __last);
5638 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5640 return _GLIBCXX_STD_A::__min_element(__first, __last,
5641 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5644 template<
typename _ForwardIterator,
typename _Compare>
5645 _GLIBCXX14_CONSTEXPR
5647 __max_element(_ForwardIterator __first, _ForwardIterator __last,
5650 if (__first == __last)
return __first;
5651 _ForwardIterator __result = __first;
5652 while (++__first != __last)
5653 if (__comp(__result, __first))
5665 template<
typename _ForwardIterator>
5666 _GLIBCXX14_CONSTEXPR
5667 inline _ForwardIterator
5668 max_element(_ForwardIterator __first, _ForwardIterator __last)
5671 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5672 __glibcxx_function_requires(_LessThanComparableConcept<
5673 typename iterator_traits<_ForwardIterator>::value_type>)
5674 __glibcxx_requires_valid_range(__first, __last);
5675 __glibcxx_requires_irreflexive(__first, __last);
5677 return _GLIBCXX_STD_A::__max_element(__first, __last,
5678 __gnu_cxx::__ops::__iter_less_iter());
5690 template<
typename _ForwardIterator,
typename _Compare>
5691 _GLIBCXX14_CONSTEXPR
5692 inline _ForwardIterator
5693 max_element(_ForwardIterator __first, _ForwardIterator __last,
5697 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5698 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5699 typename iterator_traits<_ForwardIterator>::value_type,
5700 typename iterator_traits<_ForwardIterator>::value_type>)
5701 __glibcxx_requires_valid_range(__first, __last);
5702 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5704 return _GLIBCXX_STD_A::__max_element(__first, __last,
5705 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5708 #if __cplusplus >= 201402L 5710 template<
typename _InputIterator,
typename _RandomAccessIterator,
5711 typename _Size,
typename _UniformRandomBitGenerator>
5712 _RandomAccessIterator
5715 _Size __n, _UniformRandomBitGenerator&& __g)
5718 using __param_type =
typename __distrib_type::param_type;
5719 __distrib_type __d{};
5720 _Size __sample_sz = 0;
5721 while (__first != __last && __sample_sz != __n)
5723 __out[__sample_sz++] = *__first;
5726 for (
auto __pop_sz = __sample_sz; __first != __last;
5727 ++__first, (void) ++__pop_sz)
5729 const auto __k = __d(__g, __param_type{0, __pop_sz});
5731 __out[__k] = *__first;
5733 return __out + __sample_sz;
5737 template<
typename _ForwardIterator,
typename _OutputIterator,
typename _Cat,
5738 typename _Size,
typename _UniformRandomBitGenerator>
5740 __sample(_ForwardIterator __first, _ForwardIterator __last,
5742 _OutputIterator __out, _Cat,
5743 _Size __n, _UniformRandomBitGenerator&& __g)
5746 using __param_type =
typename __distrib_type::param_type;
5751 __distrib_type __d{};
5753 __n =
std::min(__n, __unsampled_sz);
5758 const __uc_type __urngrange = __g.max() - __g.min();
5759 if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
5763 while (__n != 0 && __unsampled_sz >= 2)
5769 if (__p.
first < __n)
5771 *__out++ = *__first;
5777 if (__n == 0)
break;
5782 *__out++ = *__first;
5792 for (; __n != 0; ++__first)
5793 if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
5795 *__out++ = *__first;
5801 #if __cplusplus > 201402L 5802 #define __cpp_lib_sample 201603 5804 template<
typename _PopulationIterator,
typename _SampleIterator,
5805 typename _Distance,
typename _UniformRandomBitGenerator>
5807 sample(_PopulationIterator __first, _PopulationIterator __last,
5808 _SampleIterator __out, _Distance __n,
5809 _UniformRandomBitGenerator&& __g)
5811 using __pop_cat =
typename 5812 std::iterator_traits<_PopulationIterator>::iterator_category;
5813 using __samp_cat =
typename 5814 std::iterator_traits<_SampleIterator>::iterator_category;
5819 "output range must use a RandomAccessIterator when input range" 5820 " does not meet the ForwardIterator requirements");
5823 "sample size must be an integer type");
5825 typename iterator_traits<_PopulationIterator>::difference_type __d = __n;
5827 __sample(__first, __last, __pop_cat{}, __out, __samp_cat{}, __d,
5828 std::forward<_UniformRandomBitGenerator>(__g));
5833 _GLIBCXX_END_NAMESPACE_ALGO
5834 _GLIBCXX_END_NAMESPACE_VERSION
_GLIBCXX14_CONSTEXPR _ForwardIterator min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
Return the minimum element in a range using comparison functor.
constexpr int __lg(int __n)
This is a helper function for the sort routines and for random.tcc.
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
void __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the sort routines.
_ForwardIterator __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, _UnaryPredicate __unary_pred, std::forward_iterator_tag)
Random-access iterators support a superset of bidirectional iterator operations.
_GLIBCXX14_CONSTEXPR pair< const _Tp &, const _Tp & > minmax(const _Tp &, const _Tp &)
Determines min and max at once as an ordered pair.
_RandomAccessIterator __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __pivot, _Compare __comp)
This is a helper function...
_InputIterator find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
Find the first element in a sequence for which a predicate is true.
Marking output iterators.
void iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)
Swaps the contents of two iterators.
iterator begin()
As per Table mumble.
_T1 first
second_type is the second bound type
Uniform discrete distribution for random numbers. A discrete random distribution on the range with e...
_RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator &&__g)
Reservoir sampling algorithm.
size_type size() const
As per Table mumble.
void __unguarded_linear_insert(_RandomAccessIterator __last, _Compare __comp)
This is a helper function for the sort routine.
ISO C++ entities toplevel namespace is std.
_T2 second
first is a copy of the first object
bool none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
Checks that a predicate is false for all the elements of a sequence.
typename remove_reference< _Tp >::type remove_reference_t
Alias template for remove_reference.
Struct holding two objects of arbitrary type.
Bidirectional iterators support a superset of forward iterator operations.
size_type requested_size() const
Returns the size requested by the constructor; may be >size().
_InputIterator __find_if_not_n(_InputIterator __first, _Distance &__len, _Predicate __pred)
Like find_if_not(), but uses and updates a count of the remaining range length instead of comparing a...
_OutputIterator __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator __out, _Cat, _Size __n, _UniformRandomBitGenerator &&__g)
Selection sampling algorithm.
_GLIBCXX14_CONSTEXPR _ForwardIterator max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
Return the maximum element in a range using comparison functor.
_ForwardIterator __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag)
This is a helper function...
_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
void __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp)
This is a helper function for the merge routines.
constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)
A convenience wrapper for creating a pair from two objects.
_GLIBCXX14_CONSTEXPR pair< _ForwardIterator, _ForwardIterator > minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
Return a pair of iterators pointing to the minimum and maximum elements in a range.
_InputIterator __find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag)
This is an overload used by find algos for the Input Iterator case.
_InputIterator __find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred)
Provided for stable_partition to use.
_OutputIterator __move_merge(_InputIterator __first1, _InputIterator __last1, _InputIterator __first2, _InputIterator __last2, _OutputIterator __result, _Compare __comp)
This is a helper function for the __merge_sort_loop routines.
typename make_unsigned< _Tp >::type make_unsigned_t
Alias template for make_unsigned.
_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
_ForwardIterator __stable_partition_adaptive(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size)
This is a helper function... Requires __first != __last and !__pred(__first) and __len == distance(__...
void __move_median_to_first(_Iterator __result, _Iterator __a, _Iterator __b, _Iterator __c, _Compare __comp)
Swaps the median value of *__a, *__b and *__c under __comp to *__result.
_EuclideanRingElement __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
void __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the sort routine.
_RandomAccessIterator __unguarded_partition_pivot(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function...
_OutputIterator __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag)
void __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the sort routine.
void __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp)
This is a helper function for the __merge_adaptive routines.
void __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
This is a helper function for the __merge_adaptive routines.
void __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the sort routine.
_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
_ForwardIterator2 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2)
Swap the elements of two sequences.
void __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag)
pair< _IntType, _IntType > __gen_two_uniform_ints(_IntType __b0, _IntType __b1, _UniformRandomBitGenerator &&__g)
Generate two uniformly distributed integers using a single distribution invocation.
_ForwardIterator __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag)
This is a helper function for the rotate algorithm.
Forward iterators support a superset of input iterator operations.
_InputIterator find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred)
Find the first element in a sequence for which a predicate is false.
void __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the stable sorting routines.
_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
void __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp)
This is a helper function for the merge routines.
_ForwardIterator rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
Rotate the elements of a sequence.
typename common_type< _Tp... >::type common_type_t
Alias template for common_type.
_ForwardIterator is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
Determines the end of a sorted sequence using comparison functor.
_BidirectionalIterator1 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size)
This is a helper function for the merge routines.
void __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp)
This is a helper function for the sort routine.