64#if __cplusplus >= 201103L
70# if (__cplusplus <= 201103L || _GLIBCXX_USE_DEPRECATED)
77namespace std _GLIBCXX_VISIBILITY(default)
79_GLIBCXX_BEGIN_NAMESPACE_VERSION
82 template<
typename _Iterator,
typename _Compare>
86 _Iterator __c, _Compare __comp)
91 std::iter_swap(__result, __b);
92 else if (__comp(__a, __c))
93 std::iter_swap(__result, __c);
95 std::iter_swap(__result, __a);
97 else if (__comp(__a, __c))
98 std::iter_swap(__result, __a);
99 else if (__comp(__b, __c))
100 std::iter_swap(__result, __c);
102 std::iter_swap(__result, __b);
106 template<
typename _InputIterator,
typename _Predicate>
108 inline _InputIterator
113 __gnu_cxx::__ops::__negate(__pred),
120 template<
typename _InputIterator,
typename _Predicate,
typename _Distance>
125 for (; __len; --__len, (void) ++__first)
126 if (!__pred(__first))
148 template<
typename _ForwardIterator,
typename _Integer,
149 typename _UnaryPredicate>
153 _Integer __count, _UnaryPredicate __unary_pred,
157 while (__first != __last)
161 _ForwardIterator __i = __first;
163 while (__i != __last && __n != 1 && __unary_pred(__i))
181 template<
typename _RandomAccessIter,
typename _Integer,
182 typename _UnaryPredicate>
186 _Integer __count, _UnaryPredicate __unary_pred,
192 _DistanceType __tailSize = __last - __first;
193 _DistanceType __remainder = __count;
195 while (__remainder <= __tailSize)
197 __first += __remainder;
198 __tailSize -= __remainder;
201 _RandomAccessIter __backTrack = __first;
202 while (__unary_pred(--__backTrack))
204 if (--__remainder == 0)
205 return (__first - __count);
207 __remainder = __count + 1 - (__first - __backTrack);
212 template<
typename _ForwardIterator,
typename _Integer,
213 typename _UnaryPredicate>
216 __search_n(_ForwardIterator __first, _ForwardIterator __last,
218 _UnaryPredicate __unary_pred)
231 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
232 typename _BinaryPredicate>
235 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
236 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
237 forward_iterator_tag, forward_iterator_tag,
238 _BinaryPredicate __comp)
240 if (__first2 == __last2)
243 _ForwardIterator1 __result = __last1;
246 _ForwardIterator1 __new_result
247 = std::__search(__first1, __last1, __first2, __last2, __comp);
248 if (__new_result == __last1)
252 __result = __new_result;
253 __first1 = __new_result;
260 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
261 typename _BinaryPredicate>
263 _BidirectionalIterator1
264 __find_end(_BidirectionalIterator1 __first1,
265 _BidirectionalIterator1 __last1,
266 _BidirectionalIterator2 __first2,
267 _BidirectionalIterator2 __last2,
268 bidirectional_iterator_tag, bidirectional_iterator_tag,
269 _BinaryPredicate __comp)
272 __glibcxx_function_requires(_BidirectionalIteratorConcept<
273 _BidirectionalIterator1>)
274 __glibcxx_function_requires(_BidirectionalIteratorConcept<
275 _BidirectionalIterator2>)
277 typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1;
278 typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2;
280 _RevIterator1 __rlast1(__first1);
281 _RevIterator2 __rlast2(__first2);
282 _RevIterator1 __rresult =
std::__search(_RevIterator1(__last1), __rlast1,
283 _RevIterator2(__last2), __rlast2,
286 if (__rresult == __rlast1)
290 _BidirectionalIterator1 __result = __rresult.base();
322 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
323 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
324 inline _ForwardIterator1
325 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
326 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
329 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
330 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
331 __glibcxx_function_requires(_EqualOpConcept<
334 __glibcxx_requires_valid_range(__first1, __last1);
335 __glibcxx_requires_valid_range(__first2, __last2);
337 return std::__find_end(__first1, __last1, __first2, __last2,
340 __gnu_cxx::__ops::__iter_equal_to_iter());
371 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
372 typename _BinaryPredicate>
373 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
374 inline _ForwardIterator1
375 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
376 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
377 _BinaryPredicate __comp)
380 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
381 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
382 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
385 __glibcxx_requires_valid_range(__first1, __last1);
386 __glibcxx_requires_valid_range(__first2, __last2);
388 return std::__find_end(__first1, __last1, __first2, __last2,
391 __gnu_cxx::__ops::__iter_comp_iter(__comp));
394#if __cplusplus >= 201103L
407 template<
typename _InputIterator,
typename _Predicate>
408 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
410 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
411 {
return __last == std::find_if_not(__first, __last, __pred); }
425 template<
typename _InputIterator,
typename _Predicate>
426 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
428 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
429 {
return __last == _GLIBCXX_STD_A::find_if(__first, __last, __pred); }
444 template<
typename _InputIterator,
typename _Predicate>
445 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
447 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
448 {
return !std::none_of(__first, __last, __pred); }
460 template<
typename _InputIterator,
typename _Predicate>
461 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
462 inline _InputIterator
463 find_if_not(_InputIterator __first, _InputIterator __last,
467 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
468 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
470 __glibcxx_requires_valid_range(__first, __last);
472 __gnu_cxx::__ops::__pred_iter(__pred));
485 template<
typename _InputIterator,
typename _Predicate>
486 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
488 is_partitioned(_InputIterator __first, _InputIterator __last,
491 __first = std::find_if_not(__first, __last, __pred);
492 if (__first == __last)
495 return std::none_of(__first, __last, __pred);
507 template<
typename _ForwardIterator,
typename _Predicate>
508 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
510 partition_point(_ForwardIterator __first, _ForwardIterator __last,
514 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
515 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
519 __glibcxx_requires_valid_range(__first, __last);
528 _DistanceType __half = __len >> 1;
529 _ForwardIterator __middle = __first;
531 if (__pred(*__middle))
535 __len = __len - __half - 1;
544 template<
typename _InputIterator,
typename _OutputIterator,
548 __remove_copy_if(_InputIterator __first, _InputIterator __last,
549 _OutputIterator __result, _Predicate __pred)
551 for (; __first != __last; ++__first)
552 if (!__pred(__first))
554 *__result = *__first;
574 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
576 inline _OutputIterator
577 remove_copy(_InputIterator __first, _InputIterator __last,
578 _OutputIterator __result,
const _Tp& __value)
581 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
582 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
584 __glibcxx_function_requires(_EqualOpConcept<
586 __glibcxx_requires_valid_range(__first, __last);
588 return std::__remove_copy_if(__first, __last, __result,
589 __gnu_cxx::__ops::__iter_equals_val(__value));
607 template<
typename _InputIterator,
typename _OutputIterator,
610 inline _OutputIterator
611 remove_copy_if(_InputIterator __first, _InputIterator __last,
612 _OutputIterator __result, _Predicate __pred)
615 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
616 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
618 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
620 __glibcxx_requires_valid_range(__first, __last);
622 return std::__remove_copy_if(__first, __last, __result,
623 __gnu_cxx::__ops::__pred_iter(__pred));
626#if __cplusplus >= 201103L
642 template<
typename _InputIterator,
typename _OutputIterator,
646 copy_if(_InputIterator __first, _InputIterator __last,
647 _OutputIterator __result, _Predicate __pred)
650 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
651 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
653 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
655 __glibcxx_requires_valid_range(__first, __last);
657 for (; __first != __last; ++__first)
658 if (__pred(*__first))
660 *__result = *__first;
666 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
669 __copy_n(_InputIterator __first, _Size __n,
670 _OutputIterator __result, input_iterator_tag)
672 return std::__niter_wrap(__result,
673 __copy_n_a(__first, __n,
674 std::__niter_base(__result),
true));
677 template<
typename _RandomAccessIterator,
typename _Size,
678 typename _OutputIterator>
680 inline _OutputIterator
681 __copy_n(_RandomAccessIterator __first, _Size __n,
682 _OutputIterator __result, random_access_iterator_tag)
683 {
return std::copy(__first, __first + __n, __result); }
698 template<
typename _InputIterator,
typename _Size,
typename _OutputIterator>
700 inline _OutputIterator
701 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result)
704 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
705 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
708 const auto __n2 = std::__size_to_integer(__n);
712 __glibcxx_requires_can_increment(__first, __n2);
713 __glibcxx_requires_can_increment(__result, __n2);
715 return std::__copy_n(__first, __n2, __result,
734 template<
typename _InputIterator,
typename _OutputIterator1,
735 typename _OutputIterator2,
typename _Predicate>
738 partition_copy(_InputIterator __first, _InputIterator __last,
739 _OutputIterator1 __out_true, _OutputIterator2 __out_false,
743 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
744 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator1,
746 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator2,
748 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
750 __glibcxx_requires_valid_range(__first, __last);
752 for (; __first != __last; ++__first)
753 if (__pred(*__first))
755 *__out_true = *__first;
760 *__out_false = *__first;
785 template<
typename _ForwardIterator,
typename _Tp>
786 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
787 inline _ForwardIterator
788 remove(_ForwardIterator __first, _ForwardIterator __last,
792 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
794 __glibcxx_function_requires(_EqualOpConcept<
796 __glibcxx_requires_valid_range(__first, __last);
798 return std::__remove_if(__first, __last,
799 __gnu_cxx::__ops::__iter_equals_val(__value));
819 template<
typename _ForwardIterator,
typename _Predicate>
820 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
821 inline _ForwardIterator
822 remove_if(_ForwardIterator __first, _ForwardIterator __last,
826 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
828 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
830 __glibcxx_requires_valid_range(__first, __last);
832 return std::__remove_if(__first, __last,
833 __gnu_cxx::__ops::__pred_iter(__pred));
836 template<
typename _ForwardIterator,
typename _BinaryPredicate>
839 __adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
840 _BinaryPredicate __binary_pred)
842 if (__first == __last)
844 _ForwardIterator __next = __first;
845 while (++__next != __last)
847 if (__binary_pred(__first, __next))
854 template<
typename _ForwardIterator,
typename _BinaryPredicate>
857 __unique(_ForwardIterator __first, _ForwardIterator __last,
858 _BinaryPredicate __binary_pred)
861 __first = std::__adjacent_find(__first, __last, __binary_pred);
862 if (__first == __last)
866 _ForwardIterator __dest = __first;
868 while (++__first != __last)
869 if (!__binary_pred(__dest, __first))
870 *++__dest = _GLIBCXX_MOVE(*__first);
888 template<
typename _ForwardIterator>
889 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
890 inline _ForwardIterator
891 unique(_ForwardIterator __first, _ForwardIterator __last)
894 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
896 __glibcxx_function_requires(_EqualityComparableConcept<
898 __glibcxx_requires_valid_range(__first, __last);
900 return std::__unique(__first, __last,
901 __gnu_cxx::__ops::__iter_equal_to_iter());
919 template<
typename _ForwardIterator,
typename _BinaryPredicate>
920 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
921 inline _ForwardIterator
922 unique(_ForwardIterator __first, _ForwardIterator __last,
923 _BinaryPredicate __binary_pred)
926 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
928 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
931 __glibcxx_requires_valid_range(__first, __last);
933 return std::__unique(__first, __last,
934 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
943 template<
typename _ForwardIterator,
typename _OutputIterator,
944 typename _BinaryPredicate>
948 _OutputIterator __result, _BinaryPredicate __binary_pred,
952 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
956 _ForwardIterator __next = __first;
957 *__result = *__first;
958 while (++__next != __last)
959 if (!__binary_pred(__first, __next))
962 *++__result = *__first;
973 template<
typename _InputIterator,
typename _OutputIterator,
974 typename _BinaryPredicate>
978 _OutputIterator __result, _BinaryPredicate __binary_pred,
982 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
987 __decltype(__gnu_cxx::__ops::__iter_comp_val(__binary_pred))
989 = __gnu_cxx::__ops::__iter_comp_val(__binary_pred);
991 while (++__first != __last)
992 if (!__rebound_pred(__first, __value))
995 *++__result = __value;
1006 template<
typename _InputIterator,
typename _ForwardIterator,
1007 typename _BinaryPredicate>
1008 _GLIBCXX20_CONSTEXPR
1011 _ForwardIterator __result, _BinaryPredicate __binary_pred,
1015 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
1018 *__result = *__first;
1019 while (++__first != __last)
1020 if (!__binary_pred(__result, __first))
1021 *++__result = *__first;
1030 template<
typename _B
idirectionalIterator>
1031 _GLIBCXX20_CONSTEXPR
1033 __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last,
1037 if (__first == __last || __first == --__last)
1041 std::iter_swap(__first, __last);
1051 template<
typename _RandomAccessIterator>
1052 _GLIBCXX20_CONSTEXPR
1054 __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last,
1057 if (__first == __last)
1060 while (__first < __last)
1062 std::iter_swap(__first, __last);
1080 template<
typename _B
idirectionalIterator>
1081 _GLIBCXX20_CONSTEXPR
1083 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last)
1086 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1087 _BidirectionalIterator>)
1088 __glibcxx_requires_valid_range(__first, __last);
1108 template<
typename _B
idirectionalIterator,
typename _OutputIterator>
1109 _GLIBCXX20_CONSTEXPR
1111 reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last,
1112 _OutputIterator __result)
1115 __glibcxx_function_requires(_BidirectionalIteratorConcept<
1116 _BidirectionalIterator>)
1117 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1119 __glibcxx_requires_valid_range(__first, __last);
1121 while (__first != __last)
1124 *__result = *__last;
1134 template<
typename _Eucl
ideanRingElement>
1135 _GLIBCXX20_CONSTEXPR
1136 _EuclideanRingElement
1137 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
1141 _EuclideanRingElement __t = __m % __n;
1148_GLIBCXX_BEGIN_INLINE_ABI_NAMESPACE(_V2)
1151 template<
typename _ForwardIterator>
1152 _GLIBCXX20_CONSTEXPR
1155 _ForwardIterator __middle,
1156 _ForwardIterator __last,
1159 if (__first == __middle)
1161 else if (__last == __middle)
1164 _ForwardIterator __first2 = __middle;
1167 std::iter_swap(__first, __first2);
1170 if (__first == __middle)
1171 __middle = __first2;
1173 while (__first2 != __last);
1175 _ForwardIterator __ret = __first;
1177 __first2 = __middle;
1179 while (__first2 != __last)
1181 std::iter_swap(__first, __first2);
1184 if (__first == __middle)
1185 __middle = __first2;
1186 else if (__first2 == __last)
1187 __first2 = __middle;
1193 template<
typename _B
idirectionalIterator>
1194 _GLIBCXX20_CONSTEXPR
1195 _BidirectionalIterator
1197 _BidirectionalIterator __middle,
1198 _BidirectionalIterator __last,
1202 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1203 _BidirectionalIterator>)
1205 if (__first == __middle)
1207 else if (__last == __middle)
1213 while (__first != __middle && __middle != __last)
1215 std::iter_swap(__first, --__last);
1219 if (__first == __middle)
1232 template<
typename _RandomAccessIterator>
1233 _GLIBCXX20_CONSTEXPR
1234 _RandomAccessIterator
1236 _RandomAccessIterator __middle,
1237 _RandomAccessIterator __last,
1241 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1242 _RandomAccessIterator>)
1244 if (__first == __middle)
1246 else if (__last == __middle)
1254#if __cplusplus >= 201103L
1255 typedef typename make_unsigned<_Distance>::type _UDistance;
1257 typedef _Distance _UDistance;
1260 _Distance __n = __last - __first;
1261 _Distance __k = __middle - __first;
1263 if (__k == __n - __k)
1265 std::swap_ranges(__first, __middle, __middle);
1269 _RandomAccessIterator __p = __first;
1270 _RandomAccessIterator __ret = __first + (__last - __middle);
1274 if (__k < __n - __k)
1276 if (__is_pod(_ValueType) && __k == 1)
1278 _ValueType __t = _GLIBCXX_MOVE(*__p);
1279 _GLIBCXX_MOVE3(__p + 1, __p + __n, __p);
1280 *(__p + __n - 1) = _GLIBCXX_MOVE(__t);
1283 _RandomAccessIterator __q = __p + __k;
1284 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1286 std::iter_swap(__p, __q);
1290 __n =
static_cast<_UDistance
>(__n) %
static_cast<_UDistance
>(__k);
1293 std::swap(__n, __k);
1299 if (__is_pod(_ValueType) && __k == 1)
1301 _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1));
1302 _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n);
1303 *__p = _GLIBCXX_MOVE(__t);
1306 _RandomAccessIterator __q = __p + __n;
1308 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1312 std::iter_swap(__p, __q);
1314 __n =
static_cast<_UDistance
>(__n) %
static_cast<_UDistance
>(__k);
1317 std::swap(__n, __k);
1345 template<
typename _ForwardIterator>
1346 _GLIBCXX20_CONSTEXPR
1347 inline _ForwardIterator
1348 rotate(_ForwardIterator __first, _ForwardIterator __middle,
1349 _ForwardIterator __last)
1352 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1354 __glibcxx_requires_valid_range(__first, __middle);
1355 __glibcxx_requires_valid_range(__middle, __last);
1361_GLIBCXX_END_INLINE_ABI_NAMESPACE(_V2)
1383 template<
typename _ForwardIterator,
typename _OutputIterator>
1384 _GLIBCXX20_CONSTEXPR
1385 inline _OutputIterator
1386 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
1387 _ForwardIterator __last, _OutputIterator __result)
1390 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
1391 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1393 __glibcxx_requires_valid_range(__first, __middle);
1394 __glibcxx_requires_valid_range(__middle, __last);
1396 return std::copy(__first, __middle,
1397 std::copy(__middle, __last, __result));
1401 template<
typename _ForwardIterator,
typename _Predicate>
1402 _GLIBCXX20_CONSTEXPR
1407 if (__first == __last)
1410 while (__pred(*__first))
1411 if (++__first == __last)
1414 _ForwardIterator __next = __first;
1416 while (++__next != __last)
1417 if (__pred(*__next))
1419 std::iter_swap(__first, __next);
1427 template<
typename _B
idirectionalIterator,
typename _Predicate>
1428 _GLIBCXX20_CONSTEXPR
1429 _BidirectionalIterator
1430 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last,
1436 if (__first == __last)
1438 else if (__pred(*__first))
1444 if (__first == __last)
1446 else if (!
bool(__pred(*__last)))
1450 std::iter_swap(__first, __last);
1464 template<
typename _ForwardIterator,
typename _Pointer,
typename _Predicate,
1468 _ForwardIterator __last,
1469 _Predicate __pred, _Distance __len,
1471 _Distance __buffer_size)
1476 if (__len <= __buffer_size)
1478 _ForwardIterator __result1 = __first;
1479 _Pointer __result2 = __buffer;
1484 *__result2 = _GLIBCXX_MOVE(*__first);
1487 for (; __first != __last; ++__first)
1488 if (__pred(__first))
1490 *__result1 = _GLIBCXX_MOVE(*__first);
1495 *__result2 = _GLIBCXX_MOVE(*__first);
1499 _GLIBCXX_MOVE3(__buffer, __result2, __result1);
1503 _ForwardIterator __middle = __first;
1505 _ForwardIterator __left_split =
1507 __len / 2, __buffer,
1512 _Distance __right_len = __len - __len / 2;
1513 _ForwardIterator __right_split =
1520 __buffer, __buffer_size);
1522 return std::rotate(__left_split, __middle, __right_split);
1525 template<
typename _ForwardIterator,
typename _Predicate>
1527 __stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1532 if (__first == __last)
1535 typedef typename iterator_traits<_ForwardIterator>::value_type
1537 typedef typename iterator_traits<_ForwardIterator>::difference_type
1540 _Temporary_buffer<_ForwardIterator, _ValueType>
1544 _DistanceType(__buf.requested_size()),
1546 _DistanceType(__buf.size()));
1566 template<
typename _ForwardIterator,
typename _Predicate>
1567 inline _ForwardIterator
1568 stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1572 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1574 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
1576 __glibcxx_requires_valid_range(__first, __last);
1578 return std::__stable_partition(__first, __last,
1579 __gnu_cxx::__ops::__pred_iter(__pred));
1586 template<
typename _RandomAccessIterator,
typename _Compare>
1587 _GLIBCXX20_CONSTEXPR
1589 __heap_select(_RandomAccessIterator __first,
1590 _RandomAccessIterator __middle,
1591 _RandomAccessIterator __last, _Compare __comp)
1593 std::__make_heap(__first, __middle, __comp);
1594 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1595 if (__comp(__i, __first))
1596 std::__pop_heap(__first, __middle, __i, __comp);
1601 template<
typename _InputIterator,
typename _RandomAccessIterator,
1603 _GLIBCXX20_CONSTEXPR
1604 _RandomAccessIterator
1605 __partial_sort_copy(_InputIterator __first, _InputIterator __last,
1606 _RandomAccessIterator __result_first,
1607 _RandomAccessIterator __result_last,
1610 typedef typename iterator_traits<_InputIterator>::value_type
1612 typedef iterator_traits<_RandomAccessIterator> _RItTraits;
1613 typedef typename _RItTraits::difference_type _DistanceType;
1615 if (__result_first == __result_last)
1616 return __result_last;
1617 _RandomAccessIterator __result_real_last = __result_first;
1618 while (__first != __last && __result_real_last != __result_last)
1620 *__result_real_last = *__first;
1621 ++__result_real_last;
1625 std::__make_heap(__result_first, __result_real_last, __comp);
1626 while (__first != __last)
1628 if (__comp(__first, __result_first))
1629 std::__adjust_heap(__result_first, _DistanceType(0),
1630 _DistanceType(__result_real_last
1632 _InputValueType(*__first), __comp);
1635 std::__sort_heap(__result_first, __result_real_last, __comp);
1636 return __result_real_last;
1659 template<
typename _InputIterator,
typename _RandomAccessIterator>
1660 _GLIBCXX20_CONSTEXPR
1661 inline _RandomAccessIterator
1662 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1663 _RandomAccessIterator __result_first,
1664 _RandomAccessIterator __result_last)
1666#ifdef _GLIBCXX_CONCEPT_CHECKS
1674 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1675 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1677 __glibcxx_function_requires(_LessThanOpConcept<_InputValueType,
1679 __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>)
1680 __glibcxx_requires_valid_range(__first, __last);
1681 __glibcxx_requires_irreflexive(__first, __last);
1682 __glibcxx_requires_valid_range(__result_first, __result_last);
1684 return std::__partial_sort_copy(__first, __last,
1685 __result_first, __result_last,
1686 __gnu_cxx::__ops::__iter_less_iter());
1709 template<
typename _InputIterator,
typename _RandomAccessIterator,
1711 _GLIBCXX20_CONSTEXPR
1712 inline _RandomAccessIterator
1713 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1714 _RandomAccessIterator __result_first,
1715 _RandomAccessIterator __result_last,
1718#ifdef _GLIBCXX_CONCEPT_CHECKS
1726 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
1727 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1728 _RandomAccessIterator>)
1729 __glibcxx_function_requires(_ConvertibleConcept<_InputValueType,
1731 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1732 _InputValueType, _OutputValueType>)
1733 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1734 _OutputValueType, _OutputValueType>)
1735 __glibcxx_requires_valid_range(__first, __last);
1736 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
1737 __glibcxx_requires_valid_range(__result_first, __result_last);
1739 return std::__partial_sort_copy(__first, __last,
1740 __result_first, __result_last,
1741 __gnu_cxx::__ops::__iter_comp_iter(__comp));
1747 template<
typename _RandomAccessIterator,
typename _Compare>
1748 _GLIBCXX20_CONSTEXPR
1750 __unguarded_linear_insert(_RandomAccessIterator __last,
1753 typename iterator_traits<_RandomAccessIterator>::value_type
1754 __val = _GLIBCXX_MOVE(*__last);
1755 _RandomAccessIterator __next = __last;
1757 while (__comp(__val, __next))
1759 *__last = _GLIBCXX_MOVE(*__next);
1763 *__last = _GLIBCXX_MOVE(__val);
1767 template<
typename _RandomAccessIterator,
typename _Compare>
1768 _GLIBCXX20_CONSTEXPR
1770 __insertion_sort(_RandomAccessIterator __first,
1771 _RandomAccessIterator __last, _Compare __comp)
1773 if (__first == __last)
return;
1775 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1777 if (__comp(__i, __first))
1779 typename iterator_traits<_RandomAccessIterator>::value_type
1780 __val = _GLIBCXX_MOVE(*__i);
1781 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1782 *__first = _GLIBCXX_MOVE(__val);
1785 std::__unguarded_linear_insert(__i,
1786 __gnu_cxx::__ops::__val_comp_iter(__comp));
1791 template<
typename _RandomAccessIterator,
typename _Compare>
1792 _GLIBCXX20_CONSTEXPR
1794 __unguarded_insertion_sort(_RandomAccessIterator __first,
1795 _RandomAccessIterator __last, _Compare __comp)
1797 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1798 std::__unguarded_linear_insert(__i,
1799 __gnu_cxx::__ops::__val_comp_iter(__comp));
1806 enum { _S_threshold = 16 };
1809 template<
typename _RandomAccessIterator,
typename _Compare>
1810 _GLIBCXX20_CONSTEXPR
1812 __final_insertion_sort(_RandomAccessIterator __first,
1813 _RandomAccessIterator __last, _Compare __comp)
1815 if (__last - __first >
int(_S_threshold))
1817 std::__insertion_sort(__first, __first +
int(_S_threshold), __comp);
1818 std::__unguarded_insertion_sort(__first +
int(_S_threshold), __last,
1822 std::__insertion_sort(__first, __last, __comp);
1826 template<
typename _RandomAccessIterator,
typename _Compare>
1827 _GLIBCXX20_CONSTEXPR
1828 _RandomAccessIterator
1829 __unguarded_partition(_RandomAccessIterator __first,
1830 _RandomAccessIterator __last,
1831 _RandomAccessIterator __pivot, _Compare __comp)
1835 while (__comp(__first, __pivot))
1838 while (__comp(__pivot, __last))
1840 if (!(__first < __last))
1842 std::iter_swap(__first, __last);
1848 template<
typename _RandomAccessIterator,
typename _Compare>
1849 _GLIBCXX20_CONSTEXPR
1850 inline _RandomAccessIterator
1851 __unguarded_partition_pivot(_RandomAccessIterator __first,
1852 _RandomAccessIterator __last, _Compare __comp)
1854 _RandomAccessIterator __mid = __first + (__last - __first) / 2;
1857 return std::__unguarded_partition(__first + 1, __last, __first, __comp);
1860 template<
typename _RandomAccessIterator,
typename _Compare>
1861 _GLIBCXX20_CONSTEXPR
1863 __partial_sort(_RandomAccessIterator __first,
1864 _RandomAccessIterator __middle,
1865 _RandomAccessIterator __last,
1868 std::__heap_select(__first, __middle, __last, __comp);
1869 std::__sort_heap(__first, __middle, __comp);
1873 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1874 _GLIBCXX20_CONSTEXPR
1876 __introsort_loop(_RandomAccessIterator __first,
1877 _RandomAccessIterator __last,
1878 _Size __depth_limit, _Compare __comp)
1880 while (__last - __first >
int(_S_threshold))
1882 if (__depth_limit == 0)
1884 std::__partial_sort(__first, __last, __last, __comp);
1888 _RandomAccessIterator __cut =
1889 std::__unguarded_partition_pivot(__first, __last, __comp);
1890 std::__introsort_loop(__cut, __last, __depth_limit, __comp);
1897 template<
typename _RandomAccessIterator,
typename _Compare>
1898 _GLIBCXX20_CONSTEXPR
1900 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
1903 if (__first != __last)
1905 std::__introsort_loop(__first, __last,
1908 std::__final_insertion_sort(__first, __last, __comp);
1912 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1913 _GLIBCXX20_CONSTEXPR
1915 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
1916 _RandomAccessIterator __last, _Size __depth_limit,
1919 while (__last - __first > 3)
1921 if (__depth_limit == 0)
1923 std::__heap_select(__first, __nth + 1, __last, __comp);
1925 std::iter_swap(__first, __nth);
1929 _RandomAccessIterator __cut =
1930 std::__unguarded_partition_pivot(__first, __last, __comp);
1936 std::__insertion_sort(__first, __last, __comp);
1960 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
1961 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
1962 inline _ForwardIterator
1963 lower_bound(_ForwardIterator __first, _ForwardIterator __last,
1964 const _Tp& __val, _Compare __comp)
1967 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
1968 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1970 __glibcxx_requires_partitioned_lower_pred(__first, __last,
1973 return std::__lower_bound(__first, __last, __val,
1974 __gnu_cxx::__ops::__iter_comp_val(__comp));
1977 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
1978 _GLIBCXX20_CONSTEXPR
1980 __upper_bound(_ForwardIterator __first, _ForwardIterator __last,
1981 const _Tp& __val, _Compare __comp)
1983 typedef typename iterator_traits<_ForwardIterator>::difference_type
1990 _DistanceType __half = __len >> 1;
1991 _ForwardIterator __middle = __first;
1993 if (__comp(__val, __middle))
1999 __len = __len - __half - 1;
2016 template<
typename _ForwardIterator,
typename _Tp>
2017 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2018 inline _ForwardIterator
2019 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2023 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2024 __glibcxx_function_requires(_LessThanOpConcept<
2026 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2028 return std::__upper_bound(__first, __last, __val,
2029 __gnu_cxx::__ops::__val_less_iter());
2047 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2048 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2049 inline _ForwardIterator
2050 upper_bound(_ForwardIterator __first, _ForwardIterator __last,
2051 const _Tp& __val, _Compare __comp)
2054 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2055 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2057 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2060 return std::__upper_bound(__first, __last, __val,
2061 __gnu_cxx::__ops::__val_comp_iter(__comp));
2064 template<
typename _ForwardIterator,
typename _Tp,
2065 typename _CompareItTp,
typename _CompareTpIt>
2066 _GLIBCXX20_CONSTEXPR
2068 __equal_range(_ForwardIterator __first, _ForwardIterator __last,
2070 _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it)
2072 typedef typename iterator_traits<_ForwardIterator>::difference_type
2079 _DistanceType __half = __len >> 1;
2080 _ForwardIterator __middle = __first;
2082 if (__comp_it_val(__middle, __val))
2086 __len = __len - __half - 1;
2088 else if (__comp_val_it(__val, __middle))
2092 _ForwardIterator __left
2093 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2095 _ForwardIterator __right
2096 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2120 template<
typename _ForwardIterator,
typename _Tp>
2121 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2123 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2127 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2128 __glibcxx_function_requires(_LessThanOpConcept<
2130 __glibcxx_function_requires(_LessThanOpConcept<
2132 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2133 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2135 return std::__equal_range(__first, __last, __val,
2136 __gnu_cxx::__ops::__iter_less_val(),
2137 __gnu_cxx::__ops::__val_less_iter());
2157 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2158 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2160 equal_range(_ForwardIterator __first, _ForwardIterator __last,
2161 const _Tp& __val, _Compare __comp)
2164 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2165 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2167 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2169 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2171 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2174 return std::__equal_range(__first, __last, __val,
2175 __gnu_cxx::__ops::__iter_comp_val(__comp),
2176 __gnu_cxx::__ops::__val_comp_iter(__comp));
2191 template<
typename _ForwardIterator,
typename _Tp>
2192 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2194 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2198 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2199 __glibcxx_function_requires(_LessThanOpConcept<
2201 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2202 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2204 _ForwardIterator __i
2205 = std::__lower_bound(__first, __last, __val,
2206 __gnu_cxx::__ops::__iter_less_val());
2207 return __i != __last && !(__val < *__i);
2225 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2226 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2228 binary_search(_ForwardIterator __first, _ForwardIterator __last,
2229 const _Tp& __val, _Compare __comp)
2232 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
2233 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2235 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2237 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2240 _ForwardIterator __i
2241 = std::__lower_bound(__first, __last, __val,
2242 __gnu_cxx::__ops::__iter_comp_val(__comp));
2243 return __i != __last && !bool(__comp(__val, *__i));
2249 template<
typename _InputIterator1,
typename _InputIterator2,
2250 typename _OutputIterator,
typename _Compare>
2253 _InputIterator2 __first2, _InputIterator2 __last2,
2254 _OutputIterator __result, _Compare __comp)
2256 while (__first1 != __last1 && __first2 != __last2)
2258 if (__comp(__first2, __first1))
2260 *__result = _GLIBCXX_MOVE(*__first2);
2265 *__result = _GLIBCXX_MOVE(*__first1);
2270 if (__first1 != __last1)
2271 _GLIBCXX_MOVE3(__first1, __last1, __result);
2275 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2276 typename _BidirectionalIterator3,
typename _Compare>
2279 _BidirectionalIterator1 __last1,
2280 _BidirectionalIterator2 __first2,
2281 _BidirectionalIterator2 __last2,
2282 _BidirectionalIterator3 __result,
2285 if (__first1 == __last1)
2287 _GLIBCXX_MOVE_BACKWARD3(__first2, __last2, __result);
2290 else if (__first2 == __last2)
2297 if (__comp(__last2, __last1))
2299 *--__result = _GLIBCXX_MOVE(*__last1);
2300 if (__first1 == __last1)
2302 _GLIBCXX_MOVE_BACKWARD3(__first2, ++__last2, __result);
2309 *--__result = _GLIBCXX_MOVE(*__last2);
2310 if (__first2 == __last2)
2318 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2320 _BidirectionalIterator1
2322 _BidirectionalIterator1 __middle,
2323 _BidirectionalIterator1 __last,
2324 _Distance __len1, _Distance __len2,
2325 _BidirectionalIterator2 __buffer,
2326 _Distance __buffer_size)
2328 _BidirectionalIterator2 __buffer_end;
2329 if (__len1 > __len2 && __len2 <= __buffer_size)
2333 __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2334 _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
2335 return _GLIBCXX_MOVE3(__buffer, __buffer_end, __first);
2340 else if (__len1 <= __buffer_size)
2344 __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2345 _GLIBCXX_MOVE3(__middle, __last, __first);
2346 return _GLIBCXX_MOVE_BACKWARD3(__buffer, __buffer_end, __last);
2352 return std::rotate(__first, __middle, __last);
2356 template<
typename _BidirectionalIterator,
typename _Distance,
2357 typename _Pointer,
typename _Compare>
2360 _BidirectionalIterator __middle,
2361 _BidirectionalIterator __last,
2362 _Distance __len1, _Distance __len2,
2363 _Pointer __buffer, _Compare __comp)
2365 if (__len1 <= __len2)
2367 _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2373 _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2375 __buffer_end, __last, __comp);
2379 template<
typename _BidirectionalIterator,
typename _Distance,
2380 typename _Pointer,
typename _Compare>
2382 __merge_adaptive_resize(_BidirectionalIterator __first,
2383 _BidirectionalIterator __middle,
2384 _BidirectionalIterator __last,
2385 _Distance __len1, _Distance __len2,
2386 _Pointer __buffer, _Distance __buffer_size,
2389 if (__len1 <= __buffer_size || __len2 <= __buffer_size)
2391 __len1, __len2, __buffer, __comp);
2394 _BidirectionalIterator __first_cut = __first;
2395 _BidirectionalIterator __second_cut = __middle;
2396 _Distance __len11 = 0;
2397 _Distance __len22 = 0;
2398 if (__len1 > __len2)
2400 __len11 = __len1 / 2;
2403 = std::__lower_bound(__middle, __last, *__first_cut,
2404 __gnu_cxx::__ops::__iter_comp_val(__comp));
2409 __len22 = __len2 / 2;
2412 = std::__upper_bound(__first, __middle, *__second_cut,
2413 __gnu_cxx::__ops::__val_comp_iter(__comp));
2417 _BidirectionalIterator __new_middle
2419 _Distance(__len1 - __len11), __len22,
2420 __buffer, __buffer_size);
2421 std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
2423 __buffer, __buffer_size, __comp);
2424 std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
2425 _Distance(__len1 - __len11),
2426 _Distance(__len2 - __len22),
2427 __buffer, __buffer_size, __comp);
2432 template<
typename _BidirectionalIterator,
typename _Distance,
2436 _BidirectionalIterator __middle,
2437 _BidirectionalIterator __last,
2438 _Distance __len1, _Distance __len2,
2441 if (__len1 == 0 || __len2 == 0)
2444 if (__len1 + __len2 == 2)
2446 if (__comp(__middle, __first))
2447 std::iter_swap(__first, __middle);
2451 _BidirectionalIterator __first_cut = __first;
2452 _BidirectionalIterator __second_cut = __middle;
2453 _Distance __len11 = 0;
2454 _Distance __len22 = 0;
2455 if (__len1 > __len2)
2457 __len11 = __len1 / 2;
2460 = std::__lower_bound(__middle, __last, *__first_cut,
2461 __gnu_cxx::__ops::__iter_comp_val(__comp));
2466 __len22 = __len2 / 2;
2469 = std::__upper_bound(__first, __middle, *__second_cut,
2470 __gnu_cxx::__ops::__val_comp_iter(__comp));
2474 _BidirectionalIterator __new_middle
2475 = std::rotate(__first_cut, __middle, __second_cut);
2477 __len11, __len22, __comp);
2479 __len1 - __len11, __len2 - __len22, __comp);
2482 template<
typename _B
idirectionalIterator,
typename _Compare>
2484 __inplace_merge(_BidirectionalIterator __first,
2485 _BidirectionalIterator __middle,
2486 _BidirectionalIterator __last,
2489 typedef typename iterator_traits<_BidirectionalIterator>::value_type
2491 typedef typename iterator_traits<_BidirectionalIterator>::difference_type
2494 if (__first == __middle || __middle == __last)
2497 const _DistanceType __len1 =
std::distance(__first, __middle);
2498 const _DistanceType __len2 =
std::distance(__middle, __last);
2501 typedef _Temporary_buffer<_BidirectionalIterator, _ValueType> _TmpBuf;
2504 _TmpBuf __buf(__first,
std::min(__len1, __len2));
2506 if (__builtin_expect(__buf.size() == __buf.requested_size(),
true))
2508 (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp);
2509 else if (__builtin_expect(__buf.begin() == 0,
false))
2511 (__first, __middle, __last, __len1, __len2, __comp);
2513 std::__merge_adaptive_resize
2514 (__first, __middle, __last, __len1, __len2, __buf.begin(),
2515 _DistanceType(__buf.size()), __comp);
2518 (__first, __middle, __last, __len1, __len2, __comp);
2540 template<
typename _B
idirectionalIterator>
2542 inplace_merge(_BidirectionalIterator __first,
2543 _BidirectionalIterator __middle,
2544 _BidirectionalIterator __last)
2547 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2548 _BidirectionalIterator>)
2549 __glibcxx_function_requires(_LessThanComparableConcept<
2551 __glibcxx_requires_sorted(__first, __middle);
2552 __glibcxx_requires_sorted(__middle, __last);
2553 __glibcxx_requires_irreflexive(__first, __last);
2555 std::__inplace_merge(__first, __middle, __last,
2556 __gnu_cxx::__ops::__iter_less_iter());
2581 template<
typename _B
idirectionalIterator,
typename _Compare>
2583 inplace_merge(_BidirectionalIterator __first,
2584 _BidirectionalIterator __middle,
2585 _BidirectionalIterator __last,
2589 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2590 _BidirectionalIterator>)
2591 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2594 __glibcxx_requires_sorted_pred(__first, __middle, __comp);
2595 __glibcxx_requires_sorted_pred(__middle, __last, __comp);
2596 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2598 std::__inplace_merge(__first, __middle, __last,
2599 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2604 template<
typename _InputIterator,
typename _OutputIterator,
2608 _InputIterator __first2, _InputIterator __last2,
2609 _OutputIterator __result, _Compare __comp)
2611 while (__first1 != __last1 && __first2 != __last2)
2613 if (__comp(__first2, __first1))
2615 *__result = _GLIBCXX_MOVE(*__first2);
2620 *__result = _GLIBCXX_MOVE(*__first1);
2625 return _GLIBCXX_MOVE3(__first2, __last2,
2626 _GLIBCXX_MOVE3(__first1, __last1,
2630 template<
typename _RandomAccessIterator1,
typename _RandomAccessIterator2,
2631 typename _Distance,
typename _Compare>
2633 __merge_sort_loop(_RandomAccessIterator1 __first,
2634 _RandomAccessIterator1 __last,
2635 _RandomAccessIterator2 __result, _Distance __step_size,
2638 const _Distance __two_step = 2 * __step_size;
2640 while (__last - __first >= __two_step)
2643 __first + __step_size,
2644 __first + __two_step,
2646 __first += __two_step;
2648 __step_size =
std::min(_Distance(__last - __first), __step_size);
2651 __first + __step_size, __last, __result, __comp);
2654 template<
typename _RandomAccessIterator,
typename _Distance,
2656 _GLIBCXX20_CONSTEXPR
2658 __chunk_insertion_sort(_RandomAccessIterator __first,
2659 _RandomAccessIterator __last,
2660 _Distance __chunk_size, _Compare __comp)
2662 while (__last - __first >= __chunk_size)
2664 std::__insertion_sort(__first, __first + __chunk_size, __comp);
2665 __first += __chunk_size;
2667 std::__insertion_sort(__first, __last, __comp);
2670 enum { _S_chunk_size = 7 };
2672 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2674 __merge_sort_with_buffer(_RandomAccessIterator __first,
2675 _RandomAccessIterator __last,
2676 _Pointer __buffer, _Compare __comp)
2678 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
2681 const _Distance __len = __last - __first;
2682 const _Pointer __buffer_last = __buffer + __len;
2684 _Distance __step_size = _S_chunk_size;
2685 std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
2687 while (__step_size < __len)
2689 std::__merge_sort_loop(__first, __last, __buffer,
2690 __step_size, __comp);
2692 std::__merge_sort_loop(__buffer, __buffer_last, __first,
2693 __step_size, __comp);
2698 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2700 __stable_sort_adaptive(_RandomAccessIterator __first,
2701 _RandomAccessIterator __middle,
2702 _RandomAccessIterator __last,
2703 _Pointer __buffer, _Compare __comp)
2705 std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2706 std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2709 __middle - __first, __last - __middle,
2713 template<
typename _RandomAccessIterator,
typename _Pointer,
2714 typename _Distance,
typename _Compare>
2716 __stable_sort_adaptive_resize(_RandomAccessIterator __first,
2717 _RandomAccessIterator __last,
2718 _Pointer __buffer, _Distance __buffer_size,
2721 const _Distance __len = (__last - __first + 1) / 2;
2722 const _RandomAccessIterator __middle = __first + __len;
2723 if (__len > __buffer_size)
2725 std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
2726 __buffer_size, __comp);
2727 std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
2728 __buffer_size, __comp);
2729 std::__merge_adaptive_resize(__first, __middle, __last,
2730 _Distance(__middle - __first),
2731 _Distance(__last - __middle),
2732 __buffer, __buffer_size,
2736 std::__stable_sort_adaptive(__first, __middle, __last,
2741 template<
typename _RandomAccessIterator,
typename _Compare>
2744 _RandomAccessIterator __last, _Compare __comp)
2746 if (__last - __first < 15)
2748 std::__insertion_sort(__first, __last, __comp);
2751 _RandomAccessIterator __middle = __first + (__last - __first) / 2;
2767 template<
typename _InputIterator1,
typename _InputIterator2,
2769 _GLIBCXX20_CONSTEXPR
2771 __includes(_InputIterator1 __first1, _InputIterator1 __last1,
2772 _InputIterator2 __first2, _InputIterator2 __last2,
2775 while (__first1 != __last1 && __first2 != __last2)
2777 if (__comp(__first2, __first1))
2779 if (!__comp(__first1, __first2))
2784 return __first2 == __last2;
2805 template<
typename _InputIterator1,
typename _InputIterator2>
2806 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2808 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2809 _InputIterator2 __first2, _InputIterator2 __last2)
2812 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2813 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2814 __glibcxx_function_requires(_LessThanOpConcept<
2817 __glibcxx_function_requires(_LessThanOpConcept<
2820 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
2821 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
2822 __glibcxx_requires_irreflexive2(__first1, __last1);
2823 __glibcxx_requires_irreflexive2(__first2, __last2);
2825 return std::__includes(__first1, __last1, __first2, __last2,
2826 __gnu_cxx::__ops::__iter_less_iter());
2850 template<
typename _InputIterator1,
typename _InputIterator2,
2852 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
2854 includes(_InputIterator1 __first1, _InputIterator1 __last1,
2855 _InputIterator2 __first2, _InputIterator2 __last2,
2859 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
2860 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
2861 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2864 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2867 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
2868 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
2869 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
2870 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
2872 return std::__includes(__first1, __last1, __first2, __last2,
2873 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2886 template<
typename _B
idirectionalIterator,
typename _Compare>
2887 _GLIBCXX20_CONSTEXPR
2889 __next_permutation(_BidirectionalIterator __first,
2890 _BidirectionalIterator __last, _Compare __comp)
2892 if (__first == __last)
2894 _BidirectionalIterator __i = __first;
2903 _BidirectionalIterator __ii = __i;
2905 if (__comp(__i, __ii))
2907 _BidirectionalIterator __j = __last;
2908 while (!__comp(__i, --__j))
2910 std::iter_swap(__i, __j);
2936 template<
typename _B
idirectionalIterator>
2937 _GLIBCXX20_CONSTEXPR
2939 next_permutation(_BidirectionalIterator __first,
2940 _BidirectionalIterator __last)
2943 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2944 _BidirectionalIterator>)
2945 __glibcxx_function_requires(_LessThanComparableConcept<
2947 __glibcxx_requires_valid_range(__first, __last);
2948 __glibcxx_requires_irreflexive(__first, __last);
2950 return std::__next_permutation
2951 (__first, __last, __gnu_cxx::__ops::__iter_less_iter());
2969 template<
typename _B
idirectionalIterator,
typename _Compare>
2970 _GLIBCXX20_CONSTEXPR
2972 next_permutation(_BidirectionalIterator __first,
2973 _BidirectionalIterator __last, _Compare __comp)
2976 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2977 _BidirectionalIterator>)
2978 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2981 __glibcxx_requires_valid_range(__first, __last);
2982 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2984 return std::__next_permutation
2985 (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
2988 template<
typename _B
idirectionalIterator,
typename _Compare>
2989 _GLIBCXX20_CONSTEXPR
2991 __prev_permutation(_BidirectionalIterator __first,
2992 _BidirectionalIterator __last, _Compare __comp)
2994 if (__first == __last)
2996 _BidirectionalIterator __i = __first;
3005 _BidirectionalIterator __ii = __i;
3007 if (__comp(__ii, __i))
3009 _BidirectionalIterator __j = __last;
3010 while (!__comp(--__j, __i))
3012 std::iter_swap(__i, __j);
3039 template<
typename _B
idirectionalIterator>
3040 _GLIBCXX20_CONSTEXPR
3042 prev_permutation(_BidirectionalIterator __first,
3043 _BidirectionalIterator __last)
3046 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3047 _BidirectionalIterator>)
3048 __glibcxx_function_requires(_LessThanComparableConcept<
3050 __glibcxx_requires_valid_range(__first, __last);
3051 __glibcxx_requires_irreflexive(__first, __last);
3053 return std::__prev_permutation(__first, __last,
3054 __gnu_cxx::__ops::__iter_less_iter());
3072 template<
typename _B
idirectionalIterator,
typename _Compare>
3073 _GLIBCXX20_CONSTEXPR
3075 prev_permutation(_BidirectionalIterator __first,
3076 _BidirectionalIterator __last, _Compare __comp)
3079 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3080 _BidirectionalIterator>)
3081 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3084 __glibcxx_requires_valid_range(__first, __last);
3085 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3087 return std::__prev_permutation(__first, __last,
3088 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3094 template<
typename _InputIterator,
typename _OutputIterator,
3095 typename _Predicate,
typename _Tp>
3096 _GLIBCXX20_CONSTEXPR
3098 __replace_copy_if(_InputIterator __first, _InputIterator __last,
3099 _OutputIterator __result,
3100 _Predicate __pred,
const _Tp& __new_value)
3102 for (; __first != __last; ++__first, (void)++__result)
3103 if (__pred(__first))
3104 *__result = __new_value;
3106 *__result = *__first;
3124 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
3125 _GLIBCXX20_CONSTEXPR
3126 inline _OutputIterator
3127 replace_copy(_InputIterator __first, _InputIterator __last,
3128 _OutputIterator __result,
3129 const _Tp& __old_value,
const _Tp& __new_value)
3132 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3133 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3135 __glibcxx_function_requires(_EqualOpConcept<
3137 __glibcxx_requires_valid_range(__first, __last);
3139 return std::__replace_copy_if(__first, __last, __result,
3140 __gnu_cxx::__ops::__iter_equals_val(__old_value),
3159 template<
typename _InputIterator,
typename _OutputIterator,
3160 typename _Predicate,
typename _Tp>
3161 _GLIBCXX20_CONSTEXPR
3162 inline _OutputIterator
3163 replace_copy_if(_InputIterator __first, _InputIterator __last,
3164 _OutputIterator __result,
3165 _Predicate __pred,
const _Tp& __new_value)
3168 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3169 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3171 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3173 __glibcxx_requires_valid_range(__first, __last);
3175 return std::__replace_copy_if(__first, __last, __result,
3176 __gnu_cxx::__ops::__pred_iter(__pred),
3180#if __cplusplus >= 201103L
3188 template<
typename _ForwardIterator>
3189 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3191 is_sorted(_ForwardIterator __first, _ForwardIterator __last)
3192 {
return std::is_sorted_until(__first, __last) == __last; }
3203 template<
typename _ForwardIterator,
typename _Compare>
3204 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3206 is_sorted(_ForwardIterator __first, _ForwardIterator __last,
3208 {
return std::is_sorted_until(__first, __last, __comp) == __last; }
3210 template<
typename _ForwardIterator,
typename _Compare>
3211 _GLIBCXX20_CONSTEXPR
3213 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3216 if (__first == __last)
3219 _ForwardIterator __next = __first;
3220 for (++__next; __next != __last; __first = __next, (void)++__next)
3221 if (__comp(__next, __first))
3234 template<
typename _ForwardIterator>
3235 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3236 inline _ForwardIterator
3237 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last)
3240 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3241 __glibcxx_function_requires(_LessThanComparableConcept<
3243 __glibcxx_requires_valid_range(__first, __last);
3244 __glibcxx_requires_irreflexive(__first, __last);
3246 return std::__is_sorted_until(__first, __last,
3247 __gnu_cxx::__ops::__iter_less_iter());
3259 template<
typename _ForwardIterator,
typename _Compare>
3260 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3261 inline _ForwardIterator
3262 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3266 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3267 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3270 __glibcxx_requires_valid_range(__first, __last);
3271 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3273 return std::__is_sorted_until(__first, __last,
3274 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3285 template<
typename _Tp>
3286 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3291 __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)
3293 return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a)
3306 template<
typename _Tp,
typename _Compare>
3307 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3309 minmax(
const _Tp& __a,
const _Tp& __b, _Compare __comp)
3315 template<
typename _ForwardIterator,
typename _Compare>
3316 _GLIBCXX14_CONSTEXPR
3318 __minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3321 _ForwardIterator __next = __first;
3322 if (__first == __last
3323 || ++__next == __last)
3326 _ForwardIterator __min{}, __max{};
3327 if (__comp(__next, __first))
3341 while (__first != __last)
3344 if (++__next == __last)
3346 if (__comp(__first, __min))
3348 else if (!__comp(__first, __max))
3353 if (__comp(__next, __first))
3355 if (__comp(__next, __min))
3357 if (!__comp(__first, __max))
3362 if (__comp(__first, __min))
3364 if (!__comp(__next, __max))
3386 template<
typename _ForwardIterator>
3387 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3389 minmax_element(_ForwardIterator __first, _ForwardIterator __last)
3392 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3393 __glibcxx_function_requires(_LessThanComparableConcept<
3395 __glibcxx_requires_valid_range(__first, __last);
3396 __glibcxx_requires_irreflexive(__first, __last);
3398 return std::__minmax_element(__first, __last,
3399 __gnu_cxx::__ops::__iter_less_iter());
3414 template<
typename _ForwardIterator,
typename _Compare>
3415 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3417 minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3421 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3422 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3425 __glibcxx_requires_valid_range(__first, __last);
3426 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3428 return std::__minmax_element(__first, __last,
3429 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3432 template<
typename _Tp>
3433 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3435 minmax(initializer_list<_Tp> __l)
3437 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
3439 std::__minmax_element(__l.begin(), __l.end(),
3440 __gnu_cxx::__ops::__iter_less_iter());
3444 template<
typename _Tp,
typename _Compare>
3445 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
3447 minmax(initializer_list<_Tp> __l, _Compare __comp)
3449 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
3451 std::__minmax_element(__l.begin(), __l.end(),
3452 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3470 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3471 typename _BinaryPredicate>
3472 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3474 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3475 _ForwardIterator2 __first2, _BinaryPredicate __pred)
3478 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
3479 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
3480 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
3483 __glibcxx_requires_valid_range(__first1, __last1);
3485 return std::__is_permutation(__first1, __last1, __first2,
3486 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3489#if __cplusplus > 201103L
3490 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3491 typename _BinaryPredicate>
3492 _GLIBCXX20_CONSTEXPR
3494 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3495 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3496 _BinaryPredicate __pred)
3499 =
typename iterator_traits<_ForwardIterator1>::iterator_category;
3501 =
typename iterator_traits<_ForwardIterator2>::iterator_category;
3502 using _It1_is_RA = is_same<_Cat1, random_access_iterator_tag>;
3503 using _It2_is_RA = is_same<_Cat2, random_access_iterator_tag>;
3504 constexpr bool __ra_iters = _It1_is_RA() && _It2_is_RA();
3515 for (; __first1 != __last1 && __first2 != __last2;
3516 ++__first1, (void)++__first2)
3517 if (!__pred(__first1, __first2))
3522 if (__first1 == __last1)
3529 if (__d1 == 0 && __d2 == 0)
3535 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3538 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3541 auto __matches = std::__count_if(__first2, __last2,
3542 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3544 || std::__count_if(__scan, __last1,
3545 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3565 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3566 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3568 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3569 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
3571 __glibcxx_requires_valid_range(__first1, __last1);
3572 __glibcxx_requires_valid_range(__first2, __last2);
3575 std::__is_permutation(__first1, __last1, __first2, __last2,
3576 __gnu_cxx::__ops::__iter_equal_to_iter());
3593 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3594 typename _BinaryPredicate>
3595 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3597 is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3598 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3599 _BinaryPredicate __pred)
3601 __glibcxx_requires_valid_range(__first1, __last1);
3602 __glibcxx_requires_valid_range(__first2, __last2);
3604 return std::__is_permutation(__first1, __last1, __first2, __last2,
3605 __gnu_cxx::__ops::__iter_comp_iter(__pred));
3609#ifdef __glibcxx_clamp
3621 template<
typename _Tp>
3622 [[nodiscard]]
constexpr const _Tp&
3623 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi)
3625 __glibcxx_assert(!(__hi < __lo));
3641 template<
typename _Tp,
typename _Compare>
3642 [[nodiscard]]
constexpr const _Tp&
3643 clamp(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi, _Compare __comp)
3645 __glibcxx_assert(!__comp(__hi, __lo));
3671 template<
typename _IntType,
typename _UniformRandomBitGenerator>
3674 _UniformRandomBitGenerator&& __g)
3693 template<
typename _RandomAccessIterator,
3694 typename _UniformRandomNumberGenerator>
3696 shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
3697 _UniformRandomNumberGenerator&& __g)
3700 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
3701 _RandomAccessIterator>)
3702 __glibcxx_requires_valid_range(__first, __last);
3704 if (__first == __last)
3710 typedef typename std::make_unsigned<_DistanceType>::type __ud_type;
3712 typedef typename __distr_type::param_type __p_type;
3714 typedef typename remove_reference<_UniformRandomNumberGenerator>::type
3719 const __uc_type __urngrange = __g.max() - __g.min();
3720 const __uc_type __urange = __uc_type(__last - __first);
3722 if (__urngrange / __urange >= __urange)
3725 _RandomAccessIterator __i = __first + 1;
3731 if ((__urange % 2) == 0)
3733 __distr_type __d{0, 1};
3734 std::iter_swap(__i++, __first + __d(__g));
3741 while (__i != __last)
3743 const __uc_type __swap_range = __uc_type(__i - __first) + 1;
3748 std::iter_swap(__i++, __first + __pospos.
first);
3749 std::iter_swap(__i++, __first + __pospos.
second);
3757 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
3758 std::iter_swap(__i, __first + __d(__g, __p_type(0, __i - __first)));
3762_GLIBCXX_BEGIN_NAMESPACE_ALGO
3776 template<
typename _InputIterator,
typename _Function>
3777 _GLIBCXX20_CONSTEXPR
3779 for_each(_InputIterator __first, _InputIterator __last, _Function __f)
3782 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3783 __glibcxx_requires_valid_range(__first, __last);
3784 for (; __first != __last; ++__first)
3789#if __cplusplus >= 201703L
3802 template<
typename _InputIterator,
typename _Size,
typename _Function>
3803 _GLIBCXX20_CONSTEXPR
3807 auto __n2 = std::__size_to_integer(__n);
3809 if constexpr (is_base_of_v<random_access_iterator_tag, _Cat>)
3813 auto __last = __first + __n2;
3814 std::for_each(__first, __last,
std::move(__f));
3838 template<
typename _InputIterator,
typename _Tp>
3839 _GLIBCXX20_CONSTEXPR
3840 inline _InputIterator
3841 find(_InputIterator __first, _InputIterator __last,
3845 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3846 __glibcxx_function_requires(_EqualOpConcept<
3848 __glibcxx_requires_valid_range(__first, __last);
3850 __gnu_cxx::__ops::__iter_equals_val(__val));
3863 template<
typename _InputIterator,
typename _Predicate>
3864 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3865 inline _InputIterator
3866 find_if(_InputIterator __first, _InputIterator __last,
3870 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3871 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3873 __glibcxx_requires_valid_range(__first, __last);
3876 __gnu_cxx::__ops::__pred_iter(__pred));
3895 template<
typename _InputIterator,
typename _ForwardIterator>
3896 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3898 find_first_of(_InputIterator __first1, _InputIterator __last1,
3899 _ForwardIterator __first2, _ForwardIterator __last2)
3902 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3903 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3904 __glibcxx_function_requires(_EqualOpConcept<
3907 __glibcxx_requires_valid_range(__first1, __last1);
3908 __glibcxx_requires_valid_range(__first2, __last2);
3910 for (; __first1 != __last1; ++__first1)
3911 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3912 if (*__first1 == *__iter)
3936 template<
typename _InputIterator,
typename _ForwardIterator,
3937 typename _BinaryPredicate>
3938 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3940 find_first_of(_InputIterator __first1, _InputIterator __last1,
3941 _ForwardIterator __first2, _ForwardIterator __last2,
3942 _BinaryPredicate __comp)
3945 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
3946 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3947 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
3950 __glibcxx_requires_valid_range(__first1, __last1);
3951 __glibcxx_requires_valid_range(__first2, __last2);
3953 for (; __first1 != __last1; ++__first1)
3954 for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter)
3955 if (__comp(*__first1, *__iter))
3969 template<
typename _ForwardIterator>
3970 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3971 inline _ForwardIterator
3972 adjacent_find(_ForwardIterator __first, _ForwardIterator __last)
3975 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
3976 __glibcxx_function_requires(_EqualityComparableConcept<
3978 __glibcxx_requires_valid_range(__first, __last);
3980 return std::__adjacent_find(__first, __last,
3981 __gnu_cxx::__ops::__iter_equal_to_iter());
3995 template<
typename _ForwardIterator,
typename _BinaryPredicate>
3996 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
3997 inline _ForwardIterator
3998 adjacent_find(_ForwardIterator __first, _ForwardIterator __last,
3999 _BinaryPredicate __binary_pred)
4002 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4003 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4006 __glibcxx_requires_valid_range(__first, __last);
4008 return std::__adjacent_find(__first, __last,
4009 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));
4021 template<
typename _InputIterator,
typename _Tp>
4022 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4023 inline typename iterator_traits<_InputIterator>::difference_type
4024 count(_InputIterator __first, _InputIterator __last,
const _Tp& __value)
4027 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4028 __glibcxx_function_requires(_EqualOpConcept<
4030 __glibcxx_requires_valid_range(__first, __last);
4032 return std::__count_if(__first, __last,
4033 __gnu_cxx::__ops::__iter_equals_val(__value));
4045 template<
typename _InputIterator,
typename _Predicate>
4046 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4047 inline typename iterator_traits<_InputIterator>::difference_type
4048 count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred)
4051 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4052 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4054 __glibcxx_requires_valid_range(__first, __last);
4056 return std::__count_if(__first, __last,
4057 __gnu_cxx::__ops::__pred_iter(__pred));
4086 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
4087 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4088 inline _ForwardIterator1
4089 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
4090 _ForwardIterator2 __first2, _ForwardIterator2 __last2)
4093 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>)
4094 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>)
4095 __glibcxx_function_requires(_EqualOpConcept<
4098 __glibcxx_requires_valid_range(__first1, __last1);
4099 __glibcxx_requires_valid_range(__first2, __last2);
4101 return std::__search(__first1, __last1, __first2, __last2,
4102 __gnu_cxx::__ops::__iter_equal_to_iter());
4120 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp>
4121 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4122 inline _ForwardIterator
4123 search_n(_ForwardIterator __first, _ForwardIterator __last,
4124 _Integer __count,
const _Tp& __val)
4127 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4128 __glibcxx_function_requires(_EqualOpConcept<
4130 __glibcxx_requires_valid_range(__first, __last);
4132 return std::__search_n(__first, __last, __count,
4133 __gnu_cxx::__ops::__iter_equals_val(__val));
4154 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp,
4155 typename _BinaryPredicate>
4156 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4157 inline _ForwardIterator
4158 search_n(_ForwardIterator __first, _ForwardIterator __last,
4159 _Integer __count,
const _Tp& __val,
4160 _BinaryPredicate __binary_pred)
4163 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4164 __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate,
4166 __glibcxx_requires_valid_range(__first, __last);
4168 return std::__search_n(__first, __last, __count,
4169 __gnu_cxx::__ops::__iter_comp_val(__binary_pred, __val));
4172#if __cplusplus >= 201703L
4180 template<
typename _ForwardIterator,
typename _Searcher>
4181 _GLIBCXX_NODISCARD _GLIBCXX20_CONSTEXPR
4182 inline _ForwardIterator
4183 search(_ForwardIterator __first, _ForwardIterator __last,
4184 const _Searcher& __searcher)
4185 {
return __searcher(__first, __last).first; }
4204 template<
typename _InputIterator,
typename _OutputIterator,
4205 typename _UnaryOperation>
4206 _GLIBCXX20_CONSTEXPR
4208 transform(_InputIterator __first, _InputIterator __last,
4209 _OutputIterator __result, _UnaryOperation __unary_op)
4212 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4213 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4215 __typeof__(__unary_op(*__first))>)
4216 __glibcxx_requires_valid_range(__first, __last);
4218 for (; __first != __last; ++__first, (void)++__result)
4219 *__result = __unary_op(*__first);
4242 template<
typename _InputIterator1,
typename _InputIterator2,
4243 typename _OutputIterator,
typename _BinaryOperation>
4244 _GLIBCXX20_CONSTEXPR
4246 transform(_InputIterator1 __first1, _InputIterator1 __last1,
4247 _InputIterator2 __first2, _OutputIterator __result,
4248 _BinaryOperation __binary_op)
4251 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4252 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4253 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4255 __typeof__(__binary_op(*__first1,*__first2))>)
4256 __glibcxx_requires_valid_range(__first1, __last1);
4258 for (; __first1 != __last1; ++__first1, (void)++__first2, ++__result)
4259 *__result = __binary_op(*__first1, *__first2);
4276 template<
typename _ForwardIterator,
typename _Tp>
4277 _GLIBCXX20_CONSTEXPR
4279 replace(_ForwardIterator __first, _ForwardIterator __last,
4280 const _Tp& __old_value,
const _Tp& __new_value)
4283 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4285 __glibcxx_function_requires(_EqualOpConcept<
4287 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4289 __glibcxx_requires_valid_range(__first, __last);
4291 for (; __first != __last; ++__first)
4292 if (*__first == __old_value)
4293 *__first = __new_value;
4309 template<
typename _ForwardIterator,
typename _Predicate,
typename _Tp>
4310 _GLIBCXX20_CONSTEXPR
4312 replace_if(_ForwardIterator __first, _ForwardIterator __last,
4313 _Predicate __pred,
const _Tp& __new_value)
4316 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4318 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4320 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4322 __glibcxx_requires_valid_range(__first, __last);
4324 for (; __first != __last; ++__first)
4325 if (__pred(*__first))
4326 *__first = __new_value;
4341 template<
typename _ForwardIterator,
typename _Generator>
4342 _GLIBCXX20_CONSTEXPR
4344 generate(_ForwardIterator __first, _ForwardIterator __last,
4348 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
4349 __glibcxx_function_requires(_GeneratorConcept<_Generator,
4351 __glibcxx_requires_valid_range(__first, __last);
4353 for (; __first != __last; ++__first)
4374 template<
typename _OutputIterator,
typename _Size,
typename _Generator>
4375 _GLIBCXX20_CONSTEXPR
4377 generate_n(_OutputIterator __first, _Size __n, _Generator __gen)
4380 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4382 __typeof__(__gen())>)
4384 typedef __decltype(std::__size_to_integer(__n)) _IntSize;
4385 for (_IntSize __niter = std::__size_to_integer(__n);
4386 __niter > 0; --__niter, (void) ++__first)
4409 template<
typename _InputIterator,
typename _OutputIterator>
4410 _GLIBCXX20_CONSTEXPR
4411 inline _OutputIterator
4412 unique_copy(_InputIterator __first, _InputIterator __last,
4413 _OutputIterator __result)
4416 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4417 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4419 __glibcxx_function_requires(_EqualityComparableConcept<
4421 __glibcxx_requires_valid_range(__first, __last);
4423 if (__first == __last)
4426 __gnu_cxx::__ops::__iter_equal_to_iter(),
4449 template<
typename _InputIterator,
typename _OutputIterator,
4450 typename _BinaryPredicate>
4451 _GLIBCXX20_CONSTEXPR
4452 inline _OutputIterator
4453 unique_copy(_InputIterator __first, _InputIterator __last,
4454 _OutputIterator __result,
4455 _BinaryPredicate __binary_pred)
4458 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
4459 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4461 __glibcxx_requires_valid_range(__first, __last);
4463 if (__first == __last)
4466 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred),
4471#if __cplusplus <= 201103L || _GLIBCXX_USE_DEPRECATED
4488 template<
typename _RandomAccessIterator>
4489 _GLIBCXX14_DEPRECATED_SUGGEST(
"std::shuffle")
4491 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
4494 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4495 _RandomAccessIterator>)
4496 __glibcxx_requires_valid_range(__first, __last);
4498 if (__first != __last)
4499 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4502 _RandomAccessIterator __j = __first
4503 + std::rand() % ((__i - __first) + 1);
4505 std::iter_swap(__i, __j);
4527 template<
typename _RandomAccessIterator,
typename _RandomNumberGenerator>
4528 _GLIBCXX14_DEPRECATED_SUGGEST(
"std::shuffle")
4530 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last,
4531#if __cplusplus >= 201103L
4532 _RandomNumberGenerator&& __rand)
4534 _RandomNumberGenerator& __rand)
4538 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4539 _RandomAccessIterator>)
4540 __glibcxx_requires_valid_range(__first, __last);
4542 if (__first == __last)
4544 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
4546 _RandomAccessIterator __j = __first + __rand((__i - __first) + 1);
4548 std::iter_swap(__i, __j);
4569 template<
typename _ForwardIterator,
typename _Predicate>
4570 _GLIBCXX20_CONSTEXPR
4571 inline _ForwardIterator
4572 partition(_ForwardIterator __first, _ForwardIterator __last,
4576 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4578 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4580 __glibcxx_requires_valid_range(__first, __last);
4604 template<
typename _RandomAccessIterator>
4605 _GLIBCXX20_CONSTEXPR
4607 partial_sort(_RandomAccessIterator __first,
4608 _RandomAccessIterator __middle,
4609 _RandomAccessIterator __last)
4612 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4613 _RandomAccessIterator>)
4614 __glibcxx_function_requires(_LessThanComparableConcept<
4616 __glibcxx_requires_valid_range(__first, __middle);
4617 __glibcxx_requires_valid_range(__middle, __last);
4618 __glibcxx_requires_irreflexive(__first, __last);
4620 std::__partial_sort(__first, __middle, __last,
4621 __gnu_cxx::__ops::__iter_less_iter());
4643 template<
typename _RandomAccessIterator,
typename _Compare>
4644 _GLIBCXX20_CONSTEXPR
4646 partial_sort(_RandomAccessIterator __first,
4647 _RandomAccessIterator __middle,
4648 _RandomAccessIterator __last,
4652 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4653 _RandomAccessIterator>)
4654 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4657 __glibcxx_requires_valid_range(__first, __middle);
4658 __glibcxx_requires_valid_range(__middle, __last);
4659 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4661 std::__partial_sort(__first, __middle, __last,
4662 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4680 template<
typename _RandomAccessIterator>
4681 _GLIBCXX20_CONSTEXPR
4683 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4684 _RandomAccessIterator __last)
4687 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4688 _RandomAccessIterator>)
4689 __glibcxx_function_requires(_LessThanComparableConcept<
4691 __glibcxx_requires_valid_range(__first, __nth);
4692 __glibcxx_requires_valid_range(__nth, __last);
4693 __glibcxx_requires_irreflexive(__first, __last);
4695 if (__first == __last || __nth == __last)
4698 std::__introselect(__first, __nth, __last,
4700 __gnu_cxx::__ops::__iter_less_iter());
4720 template<
typename _RandomAccessIterator,
typename _Compare>
4721 _GLIBCXX20_CONSTEXPR
4723 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth,
4724 _RandomAccessIterator __last, _Compare __comp)
4727 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4728 _RandomAccessIterator>)
4729 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4732 __glibcxx_requires_valid_range(__first, __nth);
4733 __glibcxx_requires_valid_range(__nth, __last);
4734 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4736 if (__first == __last || __nth == __last)
4739 std::__introselect(__first, __nth, __last,
4741 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4758 template<
typename _RandomAccessIterator>
4759 _GLIBCXX20_CONSTEXPR
4761 sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4764 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4765 _RandomAccessIterator>)
4766 __glibcxx_function_requires(_LessThanComparableConcept<
4768 __glibcxx_requires_valid_range(__first, __last);
4769 __glibcxx_requires_irreflexive(__first, __last);
4771 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
4789 template<
typename _RandomAccessIterator,
typename _Compare>
4790 _GLIBCXX20_CONSTEXPR
4792 sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4796 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4797 _RandomAccessIterator>)
4798 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4801 __glibcxx_requires_valid_range(__first, __last);
4802 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4804 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
4807 template<
typename _InputIterator1,
typename _InputIterator2,
4808 typename _OutputIterator,
typename _Compare>
4809 _GLIBCXX20_CONSTEXPR
4811 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4812 _InputIterator2 __first2, _InputIterator2 __last2,
4813 _OutputIterator __result, _Compare __comp)
4815 while (__first1 != __last1 && __first2 != __last2)
4817 if (__comp(__first2, __first1))
4819 *__result = *__first2;
4824 *__result = *__first1;
4829 return std::copy(__first2, __last2,
4830 std::copy(__first1, __last1, __result));
4852 template<
typename _InputIterator1,
typename _InputIterator2,
4853 typename _OutputIterator>
4854 _GLIBCXX20_CONSTEXPR
4855 inline _OutputIterator
4856 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4857 _InputIterator2 __first2, _InputIterator2 __last2,
4858 _OutputIterator __result)
4861 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4862 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4863 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4865 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4867 __glibcxx_function_requires(_LessThanOpConcept<
4870 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
4871 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
4872 __glibcxx_requires_irreflexive2(__first1, __last1);
4873 __glibcxx_requires_irreflexive2(__first2, __last2);
4875 return _GLIBCXX_STD_A::__merge(__first1, __last1,
4876 __first2, __last2, __result,
4877 __gnu_cxx::__ops::__iter_less_iter());
4903 template<
typename _InputIterator1,
typename _InputIterator2,
4904 typename _OutputIterator,
typename _Compare>
4905 _GLIBCXX20_CONSTEXPR
4906 inline _OutputIterator
4907 merge(_InputIterator1 __first1, _InputIterator1 __last1,
4908 _InputIterator2 __first2, _InputIterator2 __last2,
4909 _OutputIterator __result, _Compare __comp)
4912 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
4913 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
4914 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4916 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4918 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4921 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
4922 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
4923 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
4924 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
4926 return _GLIBCXX_STD_A::__merge(__first1, __last1,
4927 __first2, __last2, __result,
4928 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4931 template<
typename _RandomAccessIterator,
typename _Compare>
4933 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4936 typedef typename iterator_traits<_RandomAccessIterator>::value_type
4938 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
4941 if (__first == __last)
4945 typedef _Temporary_buffer<_RandomAccessIterator, _ValueType> _TmpBuf;
4948 _TmpBuf __buf(__first, (__last - __first + 1) / 2);
4950 if (__builtin_expect(__buf.requested_size() == __buf.size(),
true))
4951 std::__stable_sort_adaptive(__first,
4952 __first + _DistanceType(__buf.size()),
4953 __last, __buf.begin(), __comp);
4954 else if (__builtin_expect(__buf.begin() == 0,
false))
4957 std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
4958 _DistanceType(__buf.size()), __comp);
4981 template<
typename _RandomAccessIterator>
4983 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last)
4986 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4987 _RandomAccessIterator>)
4988 __glibcxx_function_requires(_LessThanComparableConcept<
4990 __glibcxx_requires_valid_range(__first, __last);
4991 __glibcxx_requires_irreflexive(__first, __last);
4993 _GLIBCXX_STD_A::__stable_sort(__first, __last,
4994 __gnu_cxx::__ops::__iter_less_iter());
5015 template<
typename _RandomAccessIterator,
typename _Compare>
5017 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
5021 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5022 _RandomAccessIterator>)
5023 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5026 __glibcxx_requires_valid_range(__first, __last);
5027 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5029 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5030 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5033 template<
typename _InputIterator1,
typename _InputIterator2,
5034 typename _OutputIterator,
5036 _GLIBCXX20_CONSTEXPR
5038 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5039 _InputIterator2 __first2, _InputIterator2 __last2,
5040 _OutputIterator __result, _Compare __comp)
5042 while (__first1 != __last1 && __first2 != __last2)
5044 if (__comp(__first1, __first2))
5046 *__result = *__first1;
5049 else if (__comp(__first2, __first1))
5051 *__result = *__first2;
5056 *__result = *__first1;
5062 return std::copy(__first2, __last2,
5063 std::copy(__first1, __last1, __result));
5085 template<
typename _InputIterator1,
typename _InputIterator2,
5086 typename _OutputIterator>
5087 _GLIBCXX20_CONSTEXPR
5088 inline _OutputIterator
5089 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5090 _InputIterator2 __first2, _InputIterator2 __last2,
5091 _OutputIterator __result)
5094 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5095 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5096 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5098 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5100 __glibcxx_function_requires(_LessThanOpConcept<
5103 __glibcxx_function_requires(_LessThanOpConcept<
5106 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5107 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5108 __glibcxx_requires_irreflexive2(__first1, __last1);
5109 __glibcxx_requires_irreflexive2(__first2, __last2);
5111 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5112 __first2, __last2, __result,
5113 __gnu_cxx::__ops::__iter_less_iter());
5136 template<
typename _InputIterator1,
typename _InputIterator2,
5137 typename _OutputIterator,
typename _Compare>
5138 _GLIBCXX20_CONSTEXPR
5139 inline _OutputIterator
5140 set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5141 _InputIterator2 __first2, _InputIterator2 __last2,
5142 _OutputIterator __result, _Compare __comp)
5145 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5146 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5147 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5149 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5151 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5154 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5157 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5158 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5159 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5160 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5162 return _GLIBCXX_STD_A::__set_union(__first1, __last1,
5163 __first2, __last2, __result,
5164 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5167 template<
typename _InputIterator1,
typename _InputIterator2,
5168 typename _OutputIterator,
5170 _GLIBCXX20_CONSTEXPR
5172 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5173 _InputIterator2 __first2, _InputIterator2 __last2,
5174 _OutputIterator __result, _Compare __comp)
5176 while (__first1 != __last1 && __first2 != __last2)
5177 if (__comp(__first1, __first2))
5179 else if (__comp(__first2, __first1))
5183 *__result = *__first1;
5209 template<
typename _InputIterator1,
typename _InputIterator2,
5210 typename _OutputIterator>
5211 _GLIBCXX20_CONSTEXPR
5212 inline _OutputIterator
5213 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5214 _InputIterator2 __first2, _InputIterator2 __last2,
5215 _OutputIterator __result)
5218 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5219 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5220 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5222 __glibcxx_function_requires(_LessThanOpConcept<
5225 __glibcxx_function_requires(_LessThanOpConcept<
5228 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5229 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5230 __glibcxx_requires_irreflexive2(__first1, __last1);
5231 __glibcxx_requires_irreflexive2(__first2, __last2);
5233 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5234 __first2, __last2, __result,
5235 __gnu_cxx::__ops::__iter_less_iter());
5259 template<
typename _InputIterator1,
typename _InputIterator2,
5260 typename _OutputIterator,
typename _Compare>
5261 _GLIBCXX20_CONSTEXPR
5262 inline _OutputIterator
5263 set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5264 _InputIterator2 __first2, _InputIterator2 __last2,
5265 _OutputIterator __result, _Compare __comp)
5268 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5269 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5270 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5272 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5275 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5278 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5279 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5280 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5281 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5283 return _GLIBCXX_STD_A::__set_intersection(__first1, __last1,
5284 __first2, __last2, __result,
5285 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5288 template<
typename _InputIterator1,
typename _InputIterator2,
5289 typename _OutputIterator,
5291 _GLIBCXX20_CONSTEXPR
5293 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5294 _InputIterator2 __first2, _InputIterator2 __last2,
5295 _OutputIterator __result, _Compare __comp)
5297 while (__first1 != __last1 && __first2 != __last2)
5298 if (__comp(__first1, __first2))
5300 *__result = *__first1;
5304 else if (__comp(__first2, __first1))
5311 return std::copy(__first1, __last1, __result);
5334 template<
typename _InputIterator1,
typename _InputIterator2,
5335 typename _OutputIterator>
5336 _GLIBCXX20_CONSTEXPR
5337 inline _OutputIterator
5338 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5339 _InputIterator2 __first2, _InputIterator2 __last2,
5340 _OutputIterator __result)
5343 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5344 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5345 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5347 __glibcxx_function_requires(_LessThanOpConcept<
5350 __glibcxx_function_requires(_LessThanOpConcept<
5353 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5354 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5355 __glibcxx_requires_irreflexive2(__first1, __last1);
5356 __glibcxx_requires_irreflexive2(__first2, __last2);
5358 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5359 __first2, __last2, __result,
5360 __gnu_cxx::__ops::__iter_less_iter());
5386 template<
typename _InputIterator1,
typename _InputIterator2,
5387 typename _OutputIterator,
typename _Compare>
5388 _GLIBCXX20_CONSTEXPR
5389 inline _OutputIterator
5390 set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5391 _InputIterator2 __first2, _InputIterator2 __last2,
5392 _OutputIterator __result, _Compare __comp)
5395 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5396 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5397 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5399 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5402 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5405 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5406 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5407 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5408 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5410 return _GLIBCXX_STD_A::__set_difference(__first1, __last1,
5411 __first2, __last2, __result,
5412 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5415 template<
typename _InputIterator1,
typename _InputIterator2,
5416 typename _OutputIterator,
5418 _GLIBCXX20_CONSTEXPR
5420 __set_symmetric_difference(_InputIterator1 __first1,
5421 _InputIterator1 __last1,
5422 _InputIterator2 __first2,
5423 _InputIterator2 __last2,
5424 _OutputIterator __result,
5427 while (__first1 != __last1 && __first2 != __last2)
5428 if (__comp(__first1, __first2))
5430 *__result = *__first1;
5434 else if (__comp(__first2, __first1))
5436 *__result = *__first2;
5445 return std::copy(__first2, __last2,
5446 std::copy(__first1, __last1, __result));
5467 template<
typename _InputIterator1,
typename _InputIterator2,
5468 typename _OutputIterator>
5469 _GLIBCXX20_CONSTEXPR
5470 inline _OutputIterator
5471 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5472 _InputIterator2 __first2, _InputIterator2 __last2,
5473 _OutputIterator __result)
5476 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5477 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5478 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5480 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5482 __glibcxx_function_requires(_LessThanOpConcept<
5485 __glibcxx_function_requires(_LessThanOpConcept<
5488 __glibcxx_requires_sorted_set(__first1, __last1, __first2);
5489 __glibcxx_requires_sorted_set(__first2, __last2, __first1);
5490 __glibcxx_requires_irreflexive2(__first1, __last1);
5491 __glibcxx_requires_irreflexive2(__first2, __last2);
5493 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5494 __first2, __last2, __result,
5495 __gnu_cxx::__ops::__iter_less_iter());
5519 template<
typename _InputIterator1,
typename _InputIterator2,
5520 typename _OutputIterator,
typename _Compare>
5521 _GLIBCXX20_CONSTEXPR
5522 inline _OutputIterator
5523 set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5524 _InputIterator2 __first2, _InputIterator2 __last2,
5525 _OutputIterator __result,
5529 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
5530 __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
5531 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5533 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5535 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5538 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5541 __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp);
5542 __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp);
5543 __glibcxx_requires_irreflexive_pred2(__first1, __last1, __comp);
5544 __glibcxx_requires_irreflexive_pred2(__first2, __last2, __comp);
5546 return _GLIBCXX_STD_A::__set_symmetric_difference(__first1, __last1,
5547 __first2, __last2, __result,
5548 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5551 template<
typename _ForwardIterator,
typename _Compare>
5552 _GLIBCXX14_CONSTEXPR
5554 __min_element(_ForwardIterator __first, _ForwardIterator __last,
5557 if (__first == __last)
5559 _ForwardIterator __result = __first;
5560 while (++__first != __last)
5561 if (__comp(__first, __result))
5573 template<
typename _ForwardIterator>
5574 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
5576 inline min_element(_ForwardIterator __first, _ForwardIterator __last)
5579 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5580 __glibcxx_function_requires(_LessThanComparableConcept<
5582 __glibcxx_requires_valid_range(__first, __last);
5583 __glibcxx_requires_irreflexive(__first, __last);
5585 return _GLIBCXX_STD_A::__min_element(__first, __last,
5586 __gnu_cxx::__ops::__iter_less_iter());
5598 template<
typename _ForwardIterator,
typename _Compare>
5599 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
5600 inline _ForwardIterator
5601 min_element(_ForwardIterator __first, _ForwardIterator __last,
5605 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5606 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5609 __glibcxx_requires_valid_range(__first, __last);
5610 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5612 return _GLIBCXX_STD_A::__min_element(__first, __last,
5613 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5616 template<
typename _ForwardIterator,
typename _Compare>
5617 _GLIBCXX14_CONSTEXPR
5619 __max_element(_ForwardIterator __first, _ForwardIterator __last,
5622 if (__first == __last)
return __first;
5623 _ForwardIterator __result = __first;
5624 while (++__first != __last)
5625 if (__comp(__result, __first))
5637 template<
typename _ForwardIterator>
5638 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
5639 inline _ForwardIterator
5640 max_element(_ForwardIterator __first, _ForwardIterator __last)
5643 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5644 __glibcxx_function_requires(_LessThanComparableConcept<
5646 __glibcxx_requires_valid_range(__first, __last);
5647 __glibcxx_requires_irreflexive(__first, __last);
5649 return _GLIBCXX_STD_A::__max_element(__first, __last,
5650 __gnu_cxx::__ops::__iter_less_iter());
5662 template<
typename _ForwardIterator,
typename _Compare>
5663 _GLIBCXX_NODISCARD _GLIBCXX14_CONSTEXPR
5664 inline _ForwardIterator
5665 max_element(_ForwardIterator __first, _ForwardIterator __last,
5669 __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
5670 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5673 __glibcxx_requires_valid_range(__first, __last);
5674 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5676 return _GLIBCXX_STD_A::__max_element(__first, __last,
5677 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5680#if __cplusplus >= 201103L
5682 template<
typename _Tp>
5683 _GLIBCXX14_CONSTEXPR
5685 min(initializer_list<_Tp> __l)
5687 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
5688 return *_GLIBCXX_STD_A::__min_element(__l.begin(), __l.end(),
5689 __gnu_cxx::__ops::__iter_less_iter());
5692 template<
typename _Tp,
typename _Compare>
5693 _GLIBCXX14_CONSTEXPR
5695 min(initializer_list<_Tp> __l, _Compare __comp)
5697 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
5698 return *_GLIBCXX_STD_A::__min_element(__l.begin(), __l.end(),
5699 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5702 template<
typename _Tp>
5703 _GLIBCXX14_CONSTEXPR
5705 max(initializer_list<_Tp> __l)
5707 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
5708 return *_GLIBCXX_STD_A::__max_element(__l.begin(), __l.end(),
5709 __gnu_cxx::__ops::__iter_less_iter());
5712 template<
typename _Tp,
typename _Compare>
5713 _GLIBCXX14_CONSTEXPR
5715 max(initializer_list<_Tp> __l, _Compare __comp)
5717 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
5718 return *_GLIBCXX_STD_A::__max_element(__l.begin(), __l.end(),
5719 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5723#if __cplusplus >= 201402L
5725 template<
typename _InputIterator,
typename _RandomAccessIterator,
5726 typename _Size,
typename _UniformRandomBitGenerator>
5727 _RandomAccessIterator
5730 _Size __n, _UniformRandomBitGenerator&& __g)
5733 using __param_type =
typename __distrib_type::param_type;
5734 __distrib_type __d{};
5735 _Size __sample_sz = 0;
5736 while (__first != __last && __sample_sz != __n)
5738 __out[__sample_sz++] = *__first;
5741 for (
auto __pop_sz = __sample_sz; __first != __last;
5742 ++__first, (void) ++__pop_sz)
5744 const auto __k = __d(__g, __param_type{0, __pop_sz});
5746 __out[__k] = *__first;
5748 return __out + __sample_sz;
5752 template<
typename _ForwardIterator,
typename _OutputIterator,
typename _Cat,
5753 typename _Size,
typename _UniformRandomBitGenerator>
5755 __sample(_ForwardIterator __first, _ForwardIterator __last,
5757 _OutputIterator __out, _Cat,
5758 _Size __n, _UniformRandomBitGenerator&& __g)
5761 using __param_type =
typename __distrib_type::param_type;
5766 if (__first == __last)
5769 __distrib_type __d{};
5771 __n =
std::min(__n, __unsampled_sz);
5776 const __uc_type __urngrange = __g.max() - __g.min();
5777 if (__urngrange / __uc_type(__unsampled_sz) >= __uc_type(__unsampled_sz))
5781 while (__n != 0 && __unsampled_sz >= 2)
5787 if (__p.
first < __n)
5789 *__out++ = *__first;
5795 if (__n == 0)
break;
5800 *__out++ = *__first;
5810 for (; __n != 0; ++__first)
5811 if (__d(__g, __param_type{0, --__unsampled_sz}) < __n)
5813 *__out++ = *__first;
5820#ifdef __glibcxx_sample
5822 template<typename _PopulationIterator, typename _SampleIterator,
5823 typename _Distance,
typename _UniformRandomBitGenerator>
5825 sample(_PopulationIterator __first, _PopulationIterator __last,
5826 _SampleIterator __out, _Distance __n,
5827 _UniformRandomBitGenerator&& __g)
5829 using __pop_cat =
typename
5831 using __samp_cat =
typename
5835 __or_<is_convertible<__pop_cat, forward_iterator_tag>,
5836 is_convertible<__samp_cat, random_access_iterator_tag>>::value,
5837 "output range must use a RandomAccessIterator when input range"
5838 " does not meet the ForwardIterator requirements");
5841 "sample size must be an integer type");
5844 return _GLIBCXX_STD_A::
5845 __sample(__first, __last, __pop_cat{}, __out, __samp_cat{}, __d,
5850_GLIBCXX_END_NAMESPACE_ALGO
5851_GLIBCXX_END_NAMESPACE_VERSION
typename remove_reference< _Tp >::type remove_reference_t
Alias template for remove_reference.
typename common_type< _Tp... >::type common_type_t
Alias template for common_type.
typename make_unsigned< _Tp >::type make_unsigned_t
Alias template for make_unsigned.
pair(_T1, _T2) -> pair< _T1, _T2 >
Two pairs of the same type are equal iff their members are equal.
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.
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
constexpr _InputIterator for_each_n(_InputIterator __first, _Size __n, _Function __f)
Apply a function to every element of a sequence.
constexpr const _Tp & clamp(const _Tp &, const _Tp &, const _Tp &)
Returns the value clamped between lo and hi.
constexpr const _Tp & max(const _Tp &, const _Tp &)
This does what you think it does.
constexpr pair< const _Tp &, const _Tp & > minmax(const _Tp &, const _Tp &)
Determines min and max at once as an ordered pair.
constexpr const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
ISO C++ entities toplevel namespace is std.
_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.
_RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator &&__g)
Reservoir sampling algorithm.
void __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Compare __comp)
This is a helper function for the merge routines.
constexpr _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...
constexpr _OutputIterator __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag)
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.
pair< _IntType, _IntType > __gen_two_uniform_ints(_IntType __b0, _IntType __b1, _UniformRandomBitGenerator &&__g)
Generate two uniformly distributed integers using a single distribution invocation.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
void __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
This is a helper function for the stable sorting routines.
constexpr _ForwardIterator __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag)
This is a helper function for the rotate algorithm.
constexpr _Tp __lg(_Tp __n)
This is a helper function for the sort routines and for random.tcc.
constexpr _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.
constexpr _EuclideanRingElement __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n)
constexpr _ForwardIterator __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag)
This is a helper function...
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.
constexpr void __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag)
_SampleIterator sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator __out, _Distance __n, _UniformRandomBitGenerator &&__g)
Take a random sample from a population.
constexpr void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
constexpr 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.
constexpr _ForwardIterator __search_n_aux(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, _UnaryPredicate __unary_pred, std::forward_iterator_tag)
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.
_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(__...
constexpr _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.
Traits class for iterators.
Struct holding two objects of arbitrary type.
_T1 first
The first member.
_T2 second
The second member.
Marking output iterators.
Forward iterators support a superset of input iterator operations.
Bidirectional iterators support a superset of forward iterator operations.
Random-access iterators support a superset of bidirectional iterator operations.
Uniform discrete distribution for random numbers. A discrete random distribution on the range with e...