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>
148 template<
typename _ForwardIterator,
typename _Integer,
149 typename _UnaryPredicate>
157 while (__first != __last)
181 template<
typename _RandomAccessIter,
typename _Integer,
182 typename _UnaryPredicate>
205 return (__first - __count);
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>
324 inline _ForwardIterator1
331 __glibcxx_function_requires(_EqualOpConcept<
340 __gnu_cxx::__ops::__iter_equal_to_iter());
371 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
372 typename _BinaryPredicate>
374 inline _ForwardIterator1
391 __gnu_cxx::__ops::__iter_comp_iter(__comp));
394#if __cplusplus >= 201103L
407 template<
typename _InputIterator,
typename _Predicate>
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>
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>
447 any_of(_InputIterator __first, _InputIterator __last, _Predicate
__pred)
448 {
return !std::none_of(__first, __last,
__pred); }
460 template<
typename _InputIterator,
typename _Predicate>
462 inline _InputIterator
463 find_if_not(_InputIterator __first, _InputIterator __last,
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>
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>
515 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
519 __glibcxx_requires_valid_range(__first, __last);
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)
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)
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)
651 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
653 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
655 __glibcxx_requires_valid_range(__first, __last);
657 for (; __first != __last; ++__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)
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>
737 pair<_OutputIterator1, _OutputIterator2>
738 partition_copy(_InputIterator __first, _InputIterator __last,
748 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
750 __glibcxx_requires_valid_range(__first, __last);
752 for (; __first != __last; ++__first)
785 template<
typename _ForwardIterator,
typename _Tp>
787 inline _ForwardIterator
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>
821 inline _ForwardIterator
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>
890 inline _ForwardIterator
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>
921 inline _ForwardIterator
926 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
931 __glibcxx_requires_valid_range(__first, __last);
933 return std::__unique(__first, __last,
943 template<
typename _ForwardIterator,
typename _OutputIterator,
944 typename _BinaryPredicate>
957 *__result = *__first;
958 while (++__next != __last)
962 *++__result = *__first;
973 template<
typename _InputIterator,
typename _OutputIterator,
974 typename _BinaryPredicate>
991 while (++__first != __last)
995 *++__result = __value;
1006 template<
typename _InputIterator,
typename _ForwardIterator,
1007 typename _BinaryPredicate>
1008 _GLIBCXX20_CONSTEXPR
1018 *__result = *__first;
1019 while (++__first != __last)
1021 *++__result = *__first;
1030 template<
typename _B
idirectionalIterator>
1031 _GLIBCXX20_CONSTEXPR
1037 if (__first == __last || __first == --__last)
1041 std::iter_swap(__first, __last);
1051 template<
typename _RandomAccessIterator>
1052 _GLIBCXX20_CONSTEXPR
1057 if (__first == __last)
1060 while (__first < __last)
1062 std::iter_swap(__first, __last);
1080 template<
typename _B
idirectionalIterator>
1081 _GLIBCXX20_CONSTEXPR
1086 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
1088 __glibcxx_requires_valid_range(__first, __last);
1108 template<
typename _B
idirectionalIterator,
typename _OutputIterator>
1109 _GLIBCXX20_CONSTEXPR
1112 _OutputIterator __result)
1115 __glibcxx_function_requires(_BidirectionalIteratorConcept<
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
1148_GLIBCXX_BEGIN_INLINE_ABI_NAMESPACE(_V2)
1151 template<
typename _ForwardIterator>
1152 _GLIBCXX20_CONSTEXPR
1159 if (__first == __middle)
1161 else if (__last == __middle)
1170 if (__first == __middle)
1184 if (__first == __middle)
1193 template<
typename _B
idirectionalIterator>
1194 _GLIBCXX20_CONSTEXPR
1195 _BidirectionalIterator
1202 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
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
1241 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1244 if (__first == __middle)
1246 else if (__last == __middle)
1259 std::swap_ranges(__first, __middle, __middle);
1272 _ValueType __t = _GLIBCXX_MOVE(*__p);
1273 _GLIBCXX_MOVE3(__p + 1, __p + __n, __p);
1274 *(__p + __n - 1) = _GLIBCXX_MOVE(__t);
1280 std::iter_swap(__p, __q);
1287 std::swap(__n,
__k);
1295 _ValueType __t = _GLIBCXX_MOVE(*(__p + __n - 1));
1296 _GLIBCXX_MOVE_BACKWARD3(__p, __p + __n - 1, __p + __n);
1297 *__p = _GLIBCXX_MOVE(__t);
1306 std::iter_swap(__p, __q);
1311 std::swap(__n,
__k);
1339 template<
typename _ForwardIterator>
1340 _GLIBCXX20_CONSTEXPR
1341 inline _ForwardIterator
1346 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1348 __glibcxx_requires_valid_range(__first, __middle);
1349 __glibcxx_requires_valid_range(__middle, __last);
1355_GLIBCXX_END_INLINE_ABI_NAMESPACE(_V2)
1377 template<
typename _ForwardIterator,
typename _OutputIterator>
1378 _GLIBCXX20_CONSTEXPR
1379 inline _OutputIterator
1385 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
1387 __glibcxx_requires_valid_range(__first, __middle);
1388 __glibcxx_requires_valid_range(__middle, __last);
1390 return std::copy(__first, __middle,
1391 std::copy(__middle, __last, __result));
1395 template<
typename _ForwardIterator,
typename _Predicate>
1396 _GLIBCXX20_CONSTEXPR
1401 if (__first == __last)
1405 if (++__first == __last)
1410 while (++__next != __last)
1413 std::iter_swap(__first, __next);
1421 template<
typename _B
idirectionalIterator,
typename _Predicate>
1422 _GLIBCXX20_CONSTEXPR
1423 _BidirectionalIterator
1430 if (__first == __last)
1432 else if (
__pred(*__first))
1438 if (__first == __last)
1440 else if (!
bool(
__pred(*__last)))
1444 std::iter_swap(__first, __last);
1458 template<
typename _ForwardIterator,
typename _Pointer,
typename _Predicate,
1481 for (; __first != __last; ++__first)
1519 template<
typename _ForwardIterator,
typename _Predicate>
1521 __stable_partition(_ForwardIterator __first, _ForwardIterator __last,
1526 if (__first == __last)
1529 typedef typename iterator_traits<_ForwardIterator>::value_type
1531 typedef typename iterator_traits<_ForwardIterator>::difference_type
1534 _Temporary_buffer<_ForwardIterator, _ValueType>
1538 _DistanceType(__buf.requested_size()),
1540 _DistanceType(__buf.size()));
1560 template<
typename _ForwardIterator,
typename _Predicate>
1561 inline _ForwardIterator
1566 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
1568 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
1570 __glibcxx_requires_valid_range(__first, __last);
1572 return std::__stable_partition(__first, __last,
1573 __gnu_cxx::__ops::__pred_iter(
__pred));
1580 template<
typename _RandomAccessIterator,
typename _Compare>
1581 _GLIBCXX20_CONSTEXPR
1583 __heap_select(_RandomAccessIterator __first,
1584 _RandomAccessIterator __middle,
1585 _RandomAccessIterator __last, _Compare __comp)
1587 std::__make_heap(__first, __middle, __comp);
1588 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1589 if (__comp(__i, __first))
1590 std::__pop_heap(__first, __middle, __i, __comp);
1595 template<
typename _InputIterator,
typename _RandomAccessIterator,
1597 _GLIBCXX20_CONSTEXPR
1598 _RandomAccessIterator
1599 __partial_sort_copy(_InputIterator __first, _InputIterator __last,
1600 _RandomAccessIterator __result_first,
1601 _RandomAccessIterator __result_last,
1604 typedef typename iterator_traits<_InputIterator>::value_type
1606 typedef iterator_traits<_RandomAccessIterator> _RItTraits;
1607 typedef typename _RItTraits::difference_type _DistanceType;
1609 if (__result_first == __result_last)
1610 return __result_last;
1611 _RandomAccessIterator __result_real_last = __result_first;
1612 while (__first != __last && __result_real_last != __result_last)
1614 *__result_real_last = *__first;
1615 ++__result_real_last;
1619 std::__make_heap(__result_first, __result_real_last, __comp);
1620 while (__first != __last)
1622 if (__comp(__first, __result_first))
1623 std::__adjust_heap(__result_first, _DistanceType(0),
1624 _DistanceType(__result_real_last
1626 _InputValueType(*__first), __comp);
1629 std::__sort_heap(__result_first, __result_real_last, __comp);
1630 return __result_real_last;
1653 template<
typename _InputIterator,
typename _RandomAccessIterator>
1654 _GLIBCXX20_CONSTEXPR
1655 inline _RandomAccessIterator
1656 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1660#ifdef _GLIBCXX_CONCEPT_CHECKS
1674 __glibcxx_requires_valid_range(__first, __last);
1675 __glibcxx_requires_irreflexive(__first, __last);
1680 __gnu_cxx::__ops::__iter_less_iter());
1703 template<
typename _InputIterator,
typename _RandomAccessIterator,
1705 _GLIBCXX20_CONSTEXPR
1706 inline _RandomAccessIterator
1707 partial_sort_copy(_InputIterator __first, _InputIterator __last,
1712#ifdef _GLIBCXX_CONCEPT_CHECKS
1721 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
1725 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1727 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1729 __glibcxx_requires_valid_range(__first, __last);
1730 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
1735 __gnu_cxx::__ops::__iter_comp_iter(__comp));
1741 template<
typename _RandomAccessIterator,
typename _Compare>
1742 _GLIBCXX20_CONSTEXPR
1744 __unguarded_linear_insert(_RandomAccessIterator __last,
1747 typename iterator_traits<_RandomAccessIterator>::value_type
1748 __val = _GLIBCXX_MOVE(*__last);
1749 _RandomAccessIterator __next = __last;
1751 while (__comp(__val, __next))
1753 *__last = _GLIBCXX_MOVE(*__next);
1757 *__last = _GLIBCXX_MOVE(__val);
1761 template<
typename _RandomAccessIterator,
typename _Compare>
1762 _GLIBCXX20_CONSTEXPR
1764 __insertion_sort(_RandomAccessIterator __first,
1765 _RandomAccessIterator __last, _Compare __comp)
1767 if (__first == __last)
return;
1769 for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)
1771 if (__comp(__i, __first))
1773 typename iterator_traits<_RandomAccessIterator>::value_type
1774 __val = _GLIBCXX_MOVE(*__i);
1775 _GLIBCXX_MOVE_BACKWARD3(__first, __i, __i + 1);
1776 *__first = _GLIBCXX_MOVE(__val);
1780 __gnu_cxx::__ops::__val_comp_iter(__comp));
1785 template<
typename _RandomAccessIterator,
typename _Compare>
1786 _GLIBCXX20_CONSTEXPR
1788 __unguarded_insertion_sort(_RandomAccessIterator __first,
1789 _RandomAccessIterator __last, _Compare __comp)
1791 for (_RandomAccessIterator __i = __first; __i != __last; ++__i)
1793 __gnu_cxx::__ops::__val_comp_iter(__comp));
1800 enum { _S_threshold = 16 };
1803 template<
typename _RandomAccessIterator,
typename _Compare>
1804 _GLIBCXX20_CONSTEXPR
1806 __final_insertion_sort(_RandomAccessIterator __first,
1807 _RandomAccessIterator __last, _Compare __comp)
1809 if (__last - __first >
int(_S_threshold))
1820 template<
typename _RandomAccessIterator,
typename _Compare>
1821 _GLIBCXX20_CONSTEXPR
1822 _RandomAccessIterator
1823 __unguarded_partition(_RandomAccessIterator __first,
1824 _RandomAccessIterator __last,
1825 _RandomAccessIterator __pivot, _Compare __comp)
1829 while (__comp(__first, __pivot))
1832 while (__comp(__pivot, __last))
1834 if (!(__first < __last))
1836 std::iter_swap(__first, __last);
1842 template<
typename _RandomAccessIterator,
typename _Compare>
1843 _GLIBCXX20_CONSTEXPR
1844 inline _RandomAccessIterator
1845 __unguarded_partition_pivot(_RandomAccessIterator __first,
1846 _RandomAccessIterator __last, _Compare __comp)
1848 _RandomAccessIterator __mid = __first + (__last - __first) / 2;
1854 template<
typename _RandomAccessIterator,
typename _Compare>
1855 _GLIBCXX20_CONSTEXPR
1857 __partial_sort(_RandomAccessIterator __first,
1858 _RandomAccessIterator __middle,
1859 _RandomAccessIterator __last,
1863 std::__sort_heap(__first, __middle, __comp);
1867 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1868 _GLIBCXX20_CONSTEXPR
1870 __introsort_loop(_RandomAccessIterator __first,
1871 _RandomAccessIterator __last,
1872 _Size __depth_limit, _Compare __comp)
1874 while (__last - __first >
int(_S_threshold))
1876 if (__depth_limit == 0)
1882 _RandomAccessIterator __cut =
1891 template<
typename _RandomAccessIterator,
typename _Compare>
1892 _GLIBCXX20_CONSTEXPR
1894 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
1897 if (__first != __last)
1906 template<
typename _RandomAccessIterator,
typename _Size,
typename _Compare>
1907 _GLIBCXX20_CONSTEXPR
1909 __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth,
1910 _RandomAccessIterator __last, _Size __depth_limit,
1913 while (__last - __first > 3)
1915 if (__depth_limit == 0)
1919 std::iter_swap(__first, __nth);
1923 _RandomAccessIterator __cut =
1954 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
1955 _GLIBCXX20_CONSTEXPR
1956 inline _ForwardIterator
1958 const _Tp& __val, _Compare __comp)
1962 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
1964 __glibcxx_requires_partitioned_lower_pred(__first, __last,
1967 return std::__lower_bound(__first, __last, __val,
1968 __gnu_cxx::__ops::__iter_comp_val(__comp));
1971 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
1972 _GLIBCXX20_CONSTEXPR
1974 __upper_bound(_ForwardIterator __first, _ForwardIterator __last,
1975 const _Tp& __val, _Compare __comp)
1977 typedef typename iterator_traits<_ForwardIterator>::difference_type
1984 _DistanceType __half = __len >> 1;
1985 _ForwardIterator __middle = __first;
1987 if (__comp(__val, __middle))
1993 __len = __len - __half - 1;
2010 template<
typename _ForwardIterator,
typename _Tp>
2011 _GLIBCXX20_CONSTEXPR
2012 inline _ForwardIterator
2018 __glibcxx_function_requires(_LessThanOpConcept<
2020 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2022 return std::__upper_bound(__first, __last, __val,
2023 __gnu_cxx::__ops::__val_less_iter());
2041 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2042 _GLIBCXX20_CONSTEXPR
2043 inline _ForwardIterator
2045 const _Tp& __val, _Compare __comp)
2049 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2051 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2054 return std::__upper_bound(__first, __last, __val,
2055 __gnu_cxx::__ops::__val_comp_iter(__comp));
2058 template<
typename _ForwardIterator,
typename _Tp,
2059 typename _CompareItTp,
typename _CompareTpIt>
2060 _GLIBCXX20_CONSTEXPR
2061 pair<_ForwardIterator, _ForwardIterator>
2062 __equal_range(_ForwardIterator __first, _ForwardIterator __last,
2064 _CompareItTp __comp_it_val, _CompareTpIt __comp_val_it)
2066 typedef typename iterator_traits<_ForwardIterator>::difference_type
2073 _DistanceType __half = __len >> 1;
2074 _ForwardIterator __middle = __first;
2076 if (__comp_it_val(__middle, __val))
2080 __len = __len - __half - 1;
2082 else if (__comp_val_it(__val, __middle))
2086 _ForwardIterator __left
2087 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2089 _ForwardIterator __right
2090 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2091 return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
2094 return pair<_ForwardIterator, _ForwardIterator>(__first, __first);
2114 template<
typename _ForwardIterator,
typename _Tp>
2115 _GLIBCXX20_CONSTEXPR
2116 inline pair<_ForwardIterator, _ForwardIterator>
2122 __glibcxx_function_requires(_LessThanOpConcept<
2124 __glibcxx_function_requires(_LessThanOpConcept<
2126 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2127 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2129 return std::__equal_range(__first, __last, __val,
2130 __gnu_cxx::__ops::__iter_less_val(),
2131 __gnu_cxx::__ops::__val_less_iter());
2151 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2152 _GLIBCXX20_CONSTEXPR
2153 inline pair<_ForwardIterator, _ForwardIterator>
2155 const _Tp& __val, _Compare __comp)
2159 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2161 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2163 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2165 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2168 return std::__equal_range(__first, __last, __val,
2169 __gnu_cxx::__ops::__iter_comp_val(__comp),
2170 __gnu_cxx::__ops::__val_comp_iter(__comp));
2185 template<
typename _ForwardIterator,
typename _Tp>
2186 _GLIBCXX20_CONSTEXPR
2193 __glibcxx_function_requires(_LessThanOpConcept<
2195 __glibcxx_requires_partitioned_lower(__first, __last, __val);
2196 __glibcxx_requires_partitioned_upper(__first, __last, __val);
2199 = std::__lower_bound(__first, __last, __val,
2200 __gnu_cxx::__ops::__iter_less_val());
2201 return __i != __last && !(__val < *__i);
2219 template<
typename _ForwardIterator,
typename _Tp,
typename _Compare>
2220 _GLIBCXX20_CONSTEXPR
2223 const _Tp& __val, _Compare __comp)
2227 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2229 __glibcxx_requires_partitioned_lower_pred(__first, __last,
2231 __glibcxx_requires_partitioned_upper_pred(__first, __last,
2235 = std::__lower_bound(__first, __last, __val,
2236 __gnu_cxx::__ops::__iter_comp_val(__comp));
2237 return __i != __last && !bool(__comp(__val, *__i));
2243 template<
typename _InputIterator1,
typename _InputIterator2,
2244 typename _OutputIterator,
typename _Compare>
2248 _OutputIterator __result, _Compare __comp)
2254 *__result = _GLIBCXX_MOVE(*
__first2);
2259 *__result = _GLIBCXX_MOVE(*
__first1);
2269 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2270 typename _BidirectionalIterator3,
typename _Compare>
2293 *--__result = _GLIBCXX_MOVE(*
__last1);
2303 *--__result = _GLIBCXX_MOVE(*
__last2);
2312 template<
typename _BidirectionalIterator1,
typename _BidirectionalIterator2,
2314 _BidirectionalIterator1
2328 _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
2339 _GLIBCXX_MOVE3(__middle, __last, __first);
2346 return std::rotate(__first, __middle, __last);
2350 template<
typename _BidirectionalIterator,
typename _Distance,
2351 typename _Pointer,
typename _Compare>
2357 _Pointer
__buffer, _Compare __comp)
2373 template<
typename _BidirectionalIterator,
typename _Distance,
2374 typename _Pointer,
typename _Compare>
2376 __merge_adaptive_resize(_BidirectionalIterator __first,
2377 _BidirectionalIterator __middle,
2378 _BidirectionalIterator __last,
2379 _Distance __len1, _Distance __len2,
2380 _Pointer __buffer, _Distance __buffer_size,
2383 if (__len1 <= __buffer_size || __len2 <= __buffer_size)
2385 __len1, __len2, __buffer, __comp);
2388 _BidirectionalIterator __first_cut = __first;
2389 _BidirectionalIterator __second_cut = __middle;
2390 _Distance __len11 = 0;
2391 _Distance __len22 = 0;
2392 if (__len1 > __len2)
2394 __len11 = __len1 / 2;
2397 = std::__lower_bound(__middle, __last, *__first_cut,
2398 __gnu_cxx::__ops::__iter_comp_val(__comp));
2403 __len22 = __len2 / 2;
2406 = std::__upper_bound(__first, __middle, *__second_cut,
2407 __gnu_cxx::__ops::__val_comp_iter(__comp));
2411 _BidirectionalIterator __new_middle
2413 _Distance(__len1 - __len11), __len22,
2414 __buffer, __buffer_size);
2415 std::__merge_adaptive_resize(__first, __first_cut, __new_middle,
2417 __buffer, __buffer_size, __comp);
2418 std::__merge_adaptive_resize(__new_middle, __second_cut, __last,
2419 _Distance(__len1 - __len11),
2420 _Distance(__len2 - __len22),
2421 __buffer, __buffer_size, __comp);
2426 template<
typename _BidirectionalIterator,
typename _Distance,
2440 if (__comp(__middle, __first))
2441 std::iter_swap(__first, __middle);
2454 = std::__lower_bound(__middle, __last, *
__first_cut,
2455 __gnu_cxx::__ops::__iter_comp_val(__comp));
2464 __gnu_cxx::__ops::__val_comp_iter(__comp));
2476 template<
typename _B
idirectionalIterator,
typename _Compare>
2478 __inplace_merge(_BidirectionalIterator __first,
2479 _BidirectionalIterator __middle,
2480 _BidirectionalIterator __last,
2483 typedef typename iterator_traits<_BidirectionalIterator>::value_type
2485 typedef typename iterator_traits<_BidirectionalIterator>::difference_type
2488 if (__first == __middle || __middle == __last)
2491 const _DistanceType __len1 =
std::distance(__first, __middle);
2492 const _DistanceType __len2 =
std::distance(__middle, __last);
2495 typedef _Temporary_buffer<_BidirectionalIterator, _ValueType> _TmpBuf;
2498 _TmpBuf __buf(__first,
std::min(__len1, __len2));
2500 if (__builtin_expect(__buf.size() == __buf.requested_size(),
true))
2502 (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp);
2503 else if (__builtin_expect(__buf.begin() == 0,
false))
2505 (__first, __middle, __last, __len1, __len2, __comp);
2507 std::__merge_adaptive_resize
2508 (__first, __middle, __last, __len1, __len2, __buf.begin(),
2509 _DistanceType(__buf.size()), __comp);
2512 (__first, __middle, __last, __len1, __len2, __comp);
2534 template<
typename _B
idirectionalIterator>
2541 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2543 __glibcxx_function_requires(_LessThanComparableConcept<
2545 __glibcxx_requires_sorted(__first, __middle);
2546 __glibcxx_requires_sorted(__middle, __last);
2547 __glibcxx_requires_irreflexive(__first, __last);
2549 std::__inplace_merge(__first, __middle, __last,
2550 __gnu_cxx::__ops::__iter_less_iter());
2575 template<
typename _B
idirectionalIterator,
typename _Compare>
2583 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<
2585 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2588 __glibcxx_requires_sorted_pred(__first, __middle, __comp);
2589 __glibcxx_requires_sorted_pred(__middle, __last, __comp);
2590 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2592 std::__inplace_merge(__first, __middle, __last,
2593 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2598 template<
typename _InputIterator,
typename _OutputIterator,
2603 _OutputIterator __result, _Compare __comp)
2609 *__result = _GLIBCXX_MOVE(*
__first2);
2614 *__result = _GLIBCXX_MOVE(*
__first1);
2624 template<
typename _RandomAccessIterator1,
typename _RandomAccessIterator2,
2625 typename _Distance,
typename _Compare>
2627 __merge_sort_loop(_RandomAccessIterator1 __first,
2628 _RandomAccessIterator1 __last,
2629 _RandomAccessIterator2 __result, _Distance __step_size,
2632 const _Distance __two_step = 2 * __step_size;
2634 while (__last - __first >= __two_step)
2637 __first + __step_size,
2638 __first + __two_step,
2640 __first += __two_step;
2642 __step_size =
std::min(_Distance(__last - __first), __step_size);
2645 __first + __step_size, __last, __result, __comp);
2648 template<
typename _RandomAccessIterator,
typename _Distance,
2650 _GLIBCXX20_CONSTEXPR
2652 __chunk_insertion_sort(_RandomAccessIterator __first,
2653 _RandomAccessIterator __last,
2654 _Distance __chunk_size, _Compare __comp)
2656 while (__last - __first >= __chunk_size)
2659 __first += __chunk_size;
2664 enum { _S_chunk_size = 7 };
2666 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2668 __merge_sort_with_buffer(_RandomAccessIterator __first,
2669 _RandomAccessIterator __last,
2670 _Pointer __buffer, _Compare __comp)
2672 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
2675 const _Distance __len = __last - __first;
2676 const _Pointer __buffer_last = __buffer + __len;
2678 _Distance __step_size = _S_chunk_size;
2679 std::__chunk_insertion_sort(__first, __last, __step_size, __comp);
2681 while (__step_size < __len)
2683 std::__merge_sort_loop(__first, __last, __buffer,
2684 __step_size, __comp);
2686 std::__merge_sort_loop(__buffer, __buffer_last, __first,
2687 __step_size, __comp);
2692 template<
typename _RandomAccessIterator,
typename _Po
inter,
typename _Compare>
2694 __stable_sort_adaptive(_RandomAccessIterator __first,
2695 _RandomAccessIterator __middle,
2696 _RandomAccessIterator __last,
2697 _Pointer __buffer, _Compare __comp)
2699 std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2700 std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2703 __middle - __first, __last - __middle,
2707 template<
typename _RandomAccessIterator,
typename _Pointer,
2708 typename _Distance,
typename _Compare>
2710 __stable_sort_adaptive_resize(_RandomAccessIterator __first,
2711 _RandomAccessIterator __last,
2712 _Pointer __buffer, _Distance __buffer_size,
2715 const _Distance __len = (__last - __first + 1) / 2;
2716 const _RandomAccessIterator __middle = __first + __len;
2717 if (__len > __buffer_size)
2719 std::__stable_sort_adaptive_resize(__first, __middle, __buffer,
2720 __buffer_size, __comp);
2721 std::__stable_sort_adaptive_resize(__middle, __last, __buffer,
2722 __buffer_size, __comp);
2723 std::__merge_adaptive_resize(__first, __middle, __last,
2724 _Distance(__middle - __first),
2725 _Distance(__last - __middle),
2726 __buffer, __buffer_size,
2730 std::__stable_sort_adaptive(__first, __middle, __last,
2735 template<
typename _RandomAccessIterator,
typename _Compare>
2740 if (__last - __first < 15)
2761 template<
typename _InputIterator1,
typename _InputIterator2,
2763 _GLIBCXX20_CONSTEXPR
2765 __includes(_InputIterator1 __first1, _InputIterator1 __last1,
2766 _InputIterator2 __first2, _InputIterator2 __last2,
2769 while (__first1 != __last1 && __first2 != __last2)
2771 if (__comp(__first2, __first1))
2773 if (!__comp(__first1, __first2))
2778 return __first2 == __last2;
2799 template<
typename _InputIterator1,
typename _InputIterator2>
2800 _GLIBCXX20_CONSTEXPR
2808 __glibcxx_function_requires(_LessThanOpConcept<
2811 __glibcxx_function_requires(_LessThanOpConcept<
2820 __gnu_cxx::__ops::__iter_less_iter());
2844 template<
typename _InputIterator1,
typename _InputIterator2,
2846 _GLIBCXX20_CONSTEXPR
2855 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2858 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2867 __gnu_cxx::__ops::__iter_comp_iter(__comp));
2880 template<
typename _B
idirectionalIterator,
typename _Compare>
2881 _GLIBCXX20_CONSTEXPR
2883 __next_permutation(_BidirectionalIterator __first,
2884 _BidirectionalIterator __last, _Compare __comp)
2886 if (__first == __last)
2888 _BidirectionalIterator __i = __first;
2897 _BidirectionalIterator __ii = __i;
2899 if (__comp(__i, __ii))
2901 _BidirectionalIterator __j = __last;
2902 while (!__comp(__i, --__j))
2904 std::iter_swap(__i, __j);
2930 template<
typename _B
idirectionalIterator>
2931 _GLIBCXX20_CONSTEXPR
2937 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2939 __glibcxx_function_requires(_LessThanComparableConcept<
2941 __glibcxx_requires_valid_range(__first, __last);
2942 __glibcxx_requires_irreflexive(__first, __last);
2944 return std::__next_permutation
2945 (__first, __last, __gnu_cxx::__ops::__iter_less_iter());
2963 template<
typename _B
idirectionalIterator,
typename _Compare>
2964 _GLIBCXX20_CONSTEXPR
2970 __glibcxx_function_requires(_BidirectionalIteratorConcept<
2972 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
2975 __glibcxx_requires_valid_range(__first, __last);
2976 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
2978 return std::__next_permutation
2979 (__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
2982 template<
typename _B
idirectionalIterator,
typename _Compare>
2983 _GLIBCXX20_CONSTEXPR
2985 __prev_permutation(_BidirectionalIterator __first,
2986 _BidirectionalIterator __last, _Compare __comp)
2988 if (__first == __last)
2990 _BidirectionalIterator __i = __first;
2999 _BidirectionalIterator __ii = __i;
3001 if (__comp(__ii, __i))
3003 _BidirectionalIterator __j = __last;
3004 while (!__comp(--__j, __i))
3006 std::iter_swap(__i, __j);
3033 template<
typename _B
idirectionalIterator>
3034 _GLIBCXX20_CONSTEXPR
3040 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3042 __glibcxx_function_requires(_LessThanComparableConcept<
3044 __glibcxx_requires_valid_range(__first, __last);
3045 __glibcxx_requires_irreflexive(__first, __last);
3047 return std::__prev_permutation(__first, __last,
3048 __gnu_cxx::__ops::__iter_less_iter());
3066 template<
typename _B
idirectionalIterator,
typename _Compare>
3067 _GLIBCXX20_CONSTEXPR
3073 __glibcxx_function_requires(_BidirectionalIteratorConcept<
3075 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3078 __glibcxx_requires_valid_range(__first, __last);
3079 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3081 return std::__prev_permutation(__first, __last,
3082 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3088 template<
typename _InputIterator,
typename _OutputIterator,
3089 typename _Predicate,
typename _Tp>
3090 _GLIBCXX20_CONSTEXPR
3092 __replace_copy_if(_InputIterator __first, _InputIterator __last,
3093 _OutputIterator __result,
3094 _Predicate __pred,
const _Tp& __new_value)
3096 for (; __first != __last; ++__first, (void)++__result)
3097 if (__pred(__first))
3098 *__result = __new_value;
3100 *__result = *__first;
3118 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
3119 _GLIBCXX20_CONSTEXPR
3120 inline _OutputIterator
3121 replace_copy(_InputIterator __first, _InputIterator __last,
3122 _OutputIterator __result,
3127 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3129 __glibcxx_function_requires(_EqualOpConcept<
3131 __glibcxx_requires_valid_range(__first, __last);
3133 return std::__replace_copy_if(__first, __last, __result,
3153 template<
typename _InputIterator,
typename _OutputIterator,
3154 typename _Predicate,
typename _Tp>
3155 _GLIBCXX20_CONSTEXPR
3156 inline _OutputIterator
3157 replace_copy_if(_InputIterator __first, _InputIterator __last,
3158 _OutputIterator __result,
3163 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
3165 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3167 __glibcxx_requires_valid_range(__first, __last);
3169 return std::__replace_copy_if(__first, __last, __result,
3170 __gnu_cxx::__ops::__pred_iter(
__pred),
3174#if __cplusplus >= 201103L
3182 template<
typename _ForwardIterator>
3183 _GLIBCXX20_CONSTEXPR
3186 {
return std::is_sorted_until(__first, __last) == __last; }
3197 template<
typename _ForwardIterator,
typename _Compare>
3198 _GLIBCXX20_CONSTEXPR
3202 {
return std::is_sorted_until(__first, __last, __comp) == __last; }
3204 template<
typename _ForwardIterator,
typename _Compare>
3205 _GLIBCXX20_CONSTEXPR
3207 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last,
3210 if (__first == __last)
3213 _ForwardIterator __next = __first;
3214 for (++__next; __next != __last; __first = __next, (void)++__next)
3215 if (__comp(__next, __first))
3228 template<
typename _ForwardIterator>
3229 _GLIBCXX20_CONSTEXPR
3230 inline _ForwardIterator
3235 __glibcxx_function_requires(_LessThanComparableConcept<
3237 __glibcxx_requires_valid_range(__first, __last);
3238 __glibcxx_requires_irreflexive(__first, __last);
3240 return std::__is_sorted_until(__first, __last,
3241 __gnu_cxx::__ops::__iter_less_iter());
3253 template<
typename _ForwardIterator,
typename _Compare>
3254 _GLIBCXX20_CONSTEXPR
3255 inline _ForwardIterator
3261 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3264 __glibcxx_requires_valid_range(__first, __last);
3265 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3267 return std::__is_sorted_until(__first, __last,
3268 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3279 template<
typename _Tp>
3280 _GLIBCXX14_CONSTEXPR
3281 inline pair<const _Tp&, const _Tp&>
3300 template<
typename _Tp,
typename _Compare>
3301 _GLIBCXX14_CONSTEXPR
3302 inline pair<const _Tp&, const _Tp&>
3303 minmax(
const _Tp& __a,
const _Tp& __b, _Compare __comp)
3309 template<
typename _ForwardIterator,
typename _Compare>
3310 _GLIBCXX14_CONSTEXPR
3311 pair<_ForwardIterator, _ForwardIterator>
3312 __minmax_element(_ForwardIterator __first, _ForwardIterator __last,
3315 _ForwardIterator __next = __first;
3316 if (__first == __last
3317 || ++__next == __last)
3318 return std::make_pair(__first, __first);
3320 _ForwardIterator __min{}, __max{};
3321 if (__comp(__next, __first))
3335 while (__first != __last)
3338 if (++__next == __last)
3340 if (__comp(__first, __min))
3342 else if (!__comp(__first, __max))
3347 if (__comp(__next, __first))
3349 if (__comp(__next, __min))
3351 if (!__comp(__first, __max))
3356 if (__comp(__first, __min))
3358 if (!__comp(__next, __max))
3366 return std::make_pair(__min, __max);
3380 template<
typename _ForwardIterator>
3381 _GLIBCXX14_CONSTEXPR
3382 inline pair<_ForwardIterator, _ForwardIterator>
3387 __glibcxx_function_requires(_LessThanComparableConcept<
3389 __glibcxx_requires_valid_range(__first, __last);
3390 __glibcxx_requires_irreflexive(__first, __last);
3392 return std::__minmax_element(__first, __last,
3393 __gnu_cxx::__ops::__iter_less_iter());
3408 template<
typename _ForwardIterator,
typename _Compare>
3409 _GLIBCXX14_CONSTEXPR
3410 inline pair<_ForwardIterator, _ForwardIterator>
3416 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
3419 __glibcxx_requires_valid_range(__first, __last);
3420 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
3422 return std::__minmax_element(__first, __last,
3423 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3426 template<
typename _Tp>
3427 _GLIBCXX14_CONSTEXPR
3428 inline pair<_Tp, _Tp>
3429 minmax(initializer_list<_Tp> __l)
3431 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
3432 pair<const _Tp*, const _Tp*> __p =
3433 std::__minmax_element(__l.begin(), __l.end(),
3434 __gnu_cxx::__ops::__iter_less_iter());
3435 return std::make_pair(*__p.first, *__p.second);
3438 template<
typename _Tp,
typename _Compare>
3439 _GLIBCXX14_CONSTEXPR
3440 inline pair<_Tp, _Tp>
3441 minmax(initializer_list<_Tp> __l, _Compare __comp)
3443 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
3444 pair<const _Tp*, const _Tp*> __p =
3445 std::__minmax_element(__l.begin(), __l.end(),
3446 __gnu_cxx::__ops::__iter_comp_iter(__comp));
3447 return std::make_pair(*__p.first, *__p.second);
3464 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3465 typename _BinaryPredicate>
3466 _GLIBCXX20_CONSTEXPR
3480 __gnu_cxx::__ops::__iter_comp_iter(
__pred));
3483#if __cplusplus > 201103L
3484 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3485 typename _BinaryPredicate>
3486 _GLIBCXX20_CONSTEXPR
3488 __is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
3489 _ForwardIterator2 __first2, _ForwardIterator2 __last2,
3490 _BinaryPredicate __pred)
3493 =
typename iterator_traits<_ForwardIterator1>::iterator_category;
3495 =
typename iterator_traits<_ForwardIterator2>::iterator_category;
3496 using _It1_is_RA = is_same<_Cat1, random_access_iterator_tag>;
3497 using _It2_is_RA = is_same<_Cat2, random_access_iterator_tag>;
3498 constexpr bool __ra_iters = _It1_is_RA() && _It2_is_RA();
3509 for (; __first1 != __last1 && __first2 != __last2;
3510 ++__first1, (void)++__first2)
3511 if (!__pred(__first1, __first2))
3516 if (__first1 == __last1)
3523 if (__d1 == 0 && __d2 == 0)
3529 for (_ForwardIterator1 __scan = __first1; __scan != __last1; ++__scan)
3532 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan)))
3535 auto __matches = std::__count_if(__first2, __last2,
3536 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan));
3538 || std::__count_if(__scan, __last1,
3539 __gnu_cxx::__ops::__iter_comp_iter(__pred, __scan))
3559 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
3560 _GLIBCXX20_CONSTEXPR
3570 __gnu_cxx::__ops::__iter_equal_to_iter());
3587 template<
typename _ForwardIterator1,
typename _ForwardIterator2,
3588 typename _BinaryPredicate>
3589 _GLIBCXX20_CONSTEXPR
3599 __gnu_cxx::__ops::__iter_comp_iter(
__pred));
3603#ifdef __glibcxx_clamp
3615 template<
typename _Tp>
3616 constexpr const _Tp&
3635 template<
typename _Tp,
typename _Compare>
3636 constexpr const _Tp&
3639 __glibcxx_assert(!__comp(
__hi,
__lo));
3665 template<
typename _IntType,
typename _UniformRandomBitGenerator>
3666 pair<_IntType, _IntType>
3672 return std::make_pair(__x /
__b1, __x %
__b1);
3687 template<
typename _RandomAccessIterator,
3688 typename _UniformRandomNumberGenerator>
3694 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
3696 __glibcxx_requires_valid_range(__first, __last);
3698 if (__first == __last)
3704 typedef typename std::make_unsigned<_DistanceType>::type
__ud_type;
3706 typedef typename __distr_type::param_type
__p_type;
3708 typedef typename remove_reference<_UniformRandomNumberGenerator>::type
3728 std::iter_swap(__i++, __first + __d(
__g));
3735 while (__i != __last)
3742 std::iter_swap(__i++, __first +
__pospos.first);
3743 std::iter_swap(__i++, __first +
__pospos.second);
3752 std::iter_swap(__i, __first + __d(
__g,
__p_type(0, __i - __first)));
3756_GLIBCXX_BEGIN_NAMESPACE_ALGO
3770 template<
typename _InputIterator,
typename _Function>
3771 _GLIBCXX20_CONSTEXPR
3773 for_each(_InputIterator __first, _InputIterator __last,
_Function __f)
3777 __glibcxx_requires_valid_range(__first, __last);
3778 for (; __first != __last; ++__first)
3783#if __cplusplus >= 201703L
3796 template<
typename _InputIterator,
typename _Size,
typename _Function>
3797 _GLIBCXX20_CONSTEXPR
3801 auto __n2 = std::__size_to_integer(__n);
3807 auto __last = __first +
__n2;
3808 std::for_each(__first, __last,
std::move(__f));
3832 template<
typename _InputIterator,
typename _Tp>
3833 _GLIBCXX20_CONSTEXPR
3834 inline _InputIterator
3835 find(_InputIterator __first, _InputIterator __last,
3840 __glibcxx_function_requires(_EqualOpConcept<
3842 __glibcxx_requires_valid_range(__first, __last);
3844 __gnu_cxx::__ops::__iter_equals_val(__val));
3857 template<
typename _InputIterator,
typename _Predicate>
3858 _GLIBCXX20_CONSTEXPR
3859 inline _InputIterator
3860 find_if(_InputIterator __first, _InputIterator __last,
3865 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
3867 __glibcxx_requires_valid_range(__first, __last);
3870 __gnu_cxx::__ops::__pred_iter(
__pred));
3889 template<
typename _InputIterator,
typename _ForwardIterator>
3890 _GLIBCXX20_CONSTEXPR
3898 __glibcxx_function_requires(_EqualOpConcept<
3930 template<
typename _InputIterator,
typename _ForwardIterator,
3931 typename _BinaryPredicate>
3932 _GLIBCXX20_CONSTEXPR
3963 template<
typename _ForwardIterator>
3964 _GLIBCXX20_CONSTEXPR
3965 inline _ForwardIterator
3970 __glibcxx_function_requires(_EqualityComparableConcept<
3972 __glibcxx_requires_valid_range(__first, __last);
3974 return std::__adjacent_find(__first, __last,
3975 __gnu_cxx::__ops::__iter_equal_to_iter());
3989 template<
typename _ForwardIterator,
typename _BinaryPredicate>
3990 _GLIBCXX20_CONSTEXPR
3991 inline _ForwardIterator
4000 __glibcxx_requires_valid_range(__first, __last);
4002 return std::__adjacent_find(__first, __last,
4015 template<
typename _InputIterator,
typename _Tp>
4016 _GLIBCXX20_CONSTEXPR
4017 inline typename iterator_traits<_InputIterator>::difference_type
4018 count(_InputIterator __first, _InputIterator __last,
const _Tp& __value)
4022 __glibcxx_function_requires(_EqualOpConcept<
4024 __glibcxx_requires_valid_range(__first, __last);
4026 return std::__count_if(__first, __last,
4027 __gnu_cxx::__ops::__iter_equals_val(__value));
4039 template<
typename _InputIterator,
typename _Predicate>
4040 _GLIBCXX20_CONSTEXPR
4041 inline typename iterator_traits<_InputIterator>::difference_type
4042 count_if(_InputIterator __first, _InputIterator __last, _Predicate
__pred)
4046 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4048 __glibcxx_requires_valid_range(__first, __last);
4050 return std::__count_if(__first, __last,
4051 __gnu_cxx::__ops::__pred_iter(
__pred));
4080 template<
typename _ForwardIterator1,
typename _ForwardIterator2>
4081 _GLIBCXX20_CONSTEXPR
4082 inline _ForwardIterator1
4089 __glibcxx_function_requires(_EqualOpConcept<
4096 __gnu_cxx::__ops::__iter_equal_to_iter());
4114 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp>
4115 _GLIBCXX20_CONSTEXPR
4116 inline _ForwardIterator
4118 _Integer __count,
const _Tp& __val)
4122 __glibcxx_function_requires(_EqualOpConcept<
4124 __glibcxx_requires_valid_range(__first, __last);
4126 return std::__search_n(__first, __last, __count,
4127 __gnu_cxx::__ops::__iter_equals_val(__val));
4148 template<
typename _ForwardIterator,
typename _Integer,
typename _Tp,
4149 typename _BinaryPredicate>
4150 _GLIBCXX20_CONSTEXPR
4151 inline _ForwardIterator
4153 _Integer __count,
const _Tp& __val,
4160 __glibcxx_requires_valid_range(__first, __last);
4162 return std::__search_n(__first, __last, __count,
4166#if __cplusplus >= 201703L
4174 template<
typename _ForwardIterator,
typename _Searcher>
4175 _GLIBCXX20_CONSTEXPR
4176 inline _ForwardIterator
4179 {
return __searcher(__first, __last).first; }
4198 template<
typename _InputIterator,
typename _OutputIterator,
4199 typename _UnaryOperation>
4200 _GLIBCXX20_CONSTEXPR
4202 transform(_InputIterator __first, _InputIterator __last,
4207 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4210 __glibcxx_requires_valid_range(__first, __last);
4212 for (; __first != __last; ++__first, (
void)++__result)
4236 template<
typename _InputIterator1,
typename _InputIterator2,
4237 typename _OutputIterator,
typename _BinaryOperation>
4238 _GLIBCXX20_CONSTEXPR
4247 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4270 template<
typename _ForwardIterator,
typename _Tp>
4271 _GLIBCXX20_CONSTEXPR
4277 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4279 __glibcxx_function_requires(_EqualOpConcept<
4281 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4283 __glibcxx_requires_valid_range(__first, __last);
4285 for (; __first != __last; ++__first)
4303 template<
typename _ForwardIterator,
typename _Predicate,
typename _Tp>
4304 _GLIBCXX20_CONSTEXPR
4310 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4312 __glibcxx_function_requires(_ConvertibleConcept<_Tp,
4314 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4316 __glibcxx_requires_valid_range(__first, __last);
4318 for (; __first != __last; ++__first)
4335 template<
typename _ForwardIterator,
typename _Generator>
4336 _GLIBCXX20_CONSTEXPR
4343 __glibcxx_function_requires(_GeneratorConcept<
_Generator,
4345 __glibcxx_requires_valid_range(__first, __last);
4347 for (; __first != __last; ++__first)
4368 template<
typename _OutputIterator,
typename _Size,
typename _Generator>
4369 _GLIBCXX20_CONSTEXPR
4374 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4376 __typeof__(
__gen())>)
4403 template<
typename _InputIterator,
typename _OutputIterator>
4404 _GLIBCXX20_CONSTEXPR
4405 inline _OutputIterator
4406 unique_copy(_InputIterator __first, _InputIterator __last,
4407 _OutputIterator __result)
4411 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4413 __glibcxx_function_requires(_EqualityComparableConcept<
4415 __glibcxx_requires_valid_range(__first, __last);
4417 if (__first == __last)
4420 __gnu_cxx::__ops::__iter_equal_to_iter(),
4443 template<
typename _InputIterator,
typename _OutputIterator,
4444 typename _BinaryPredicate>
4445 _GLIBCXX20_CONSTEXPR
4446 inline _OutputIterator
4447 unique_copy(_InputIterator __first, _InputIterator __last,
4448 _OutputIterator __result,
4453 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4455 __glibcxx_requires_valid_range(__first, __last);
4457 if (__first == __last)
4465#if __cplusplus <= 201103L || _GLIBCXX_USE_DEPRECATED
4482 template<
typename _RandomAccessIterator>
4483 _GLIBCXX14_DEPRECATED_SUGGEST(
"std::shuffle")
4488 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4490 __glibcxx_requires_valid_range(__first, __last);
4492 if (__first != __last)
4497 + std::rand() % ((__i - __first) + 1);
4499 std::iter_swap(__i, __j);
4521 template<
typename _RandomAccessIterator,
typename _RandomNumberGenerator>
4522 _GLIBCXX14_DEPRECATED_SUGGEST(
"std::shuffle")
4525#if __cplusplus >= 201103L
4532 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4534 __glibcxx_requires_valid_range(__first, __last);
4536 if (__first == __last)
4542 std::iter_swap(__i, __j);
4563 template<
typename _ForwardIterator,
typename _Predicate>
4564 _GLIBCXX20_CONSTEXPR
4565 inline _ForwardIterator
4570 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
4572 __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,
4574 __glibcxx_requires_valid_range(__first, __last);
4598 template<
typename _RandomAccessIterator>
4599 _GLIBCXX20_CONSTEXPR
4606 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4608 __glibcxx_function_requires(_LessThanComparableConcept<
4610 __glibcxx_requires_valid_range(__first, __middle);
4611 __glibcxx_requires_valid_range(__middle, __last);
4612 __glibcxx_requires_irreflexive(__first, __last);
4615 __gnu_cxx::__ops::__iter_less_iter());
4637 template<
typename _RandomAccessIterator,
typename _Compare>
4638 _GLIBCXX20_CONSTEXPR
4646 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4648 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4651 __glibcxx_requires_valid_range(__first, __middle);
4652 __glibcxx_requires_valid_range(__middle, __last);
4653 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4656 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4674 template<
typename _RandomAccessIterator>
4675 _GLIBCXX20_CONSTEXPR
4681 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4683 __glibcxx_function_requires(_LessThanComparableConcept<
4685 __glibcxx_requires_valid_range(__first,
__nth);
4686 __glibcxx_requires_valid_range(
__nth, __last);
4687 __glibcxx_requires_irreflexive(__first, __last);
4689 if (__first == __last ||
__nth == __last)
4694 __gnu_cxx::__ops::__iter_less_iter());
4714 template<
typename _RandomAccessIterator,
typename _Compare>
4715 _GLIBCXX20_CONSTEXPR
4721 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4723 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4726 __glibcxx_requires_valid_range(__first,
__nth);
4727 __glibcxx_requires_valid_range(
__nth, __last);
4728 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4730 if (__first == __last ||
__nth == __last)
4735 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4752 template<
typename _RandomAccessIterator>
4753 _GLIBCXX20_CONSTEXPR
4758 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4760 __glibcxx_function_requires(_LessThanComparableConcept<
4762 __glibcxx_requires_valid_range(__first, __last);
4763 __glibcxx_requires_irreflexive(__first, __last);
4765 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_less_iter());
4783 template<
typename _RandomAccessIterator,
typename _Compare>
4784 _GLIBCXX20_CONSTEXPR
4790 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4792 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4795 __glibcxx_requires_valid_range(__first, __last);
4796 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
4798 std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
4801 template<
typename _InputIterator1,
typename _InputIterator2,
4802 typename _OutputIterator,
typename _Compare>
4803 _GLIBCXX20_CONSTEXPR
4805 __merge(_InputIterator1 __first1, _InputIterator1 __last1,
4806 _InputIterator2 __first2, _InputIterator2 __last2,
4807 _OutputIterator __result, _Compare __comp)
4809 while (__first1 != __last1 && __first2 != __last2)
4811 if (__comp(__first2, __first1))
4813 *__result = *__first2;
4818 *__result = *__first1;
4823 return std::copy(__first2, __last2,
4824 std::copy(__first1, __last1, __result));
4846 template<
typename _InputIterator1,
typename _InputIterator2,
4847 typename _OutputIterator>
4848 _GLIBCXX20_CONSTEXPR
4849 inline _OutputIterator
4852 _OutputIterator __result)
4857 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4859 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4861 __glibcxx_function_requires(_LessThanOpConcept<
4871 __gnu_cxx::__ops::__iter_less_iter());
4897 template<
typename _InputIterator1,
typename _InputIterator2,
4898 typename _OutputIterator,
typename _Compare>
4899 _GLIBCXX20_CONSTEXPR
4900 inline _OutputIterator
4903 _OutputIterator __result, _Compare __comp)
4908 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4910 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
4912 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
4922 __gnu_cxx::__ops::__iter_comp_iter(__comp));
4925 template<
typename _RandomAccessIterator,
typename _Compare>
4927 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
4930 typedef typename iterator_traits<_RandomAccessIterator>::value_type
4932 typedef typename iterator_traits<_RandomAccessIterator>::difference_type
4935 if (__first == __last)
4939 typedef _Temporary_buffer<_RandomAccessIterator, _ValueType> _TmpBuf;
4942 _TmpBuf __buf(__first, (__last - __first + 1) / 2);
4944 if (__builtin_expect(__buf.requested_size() == __buf.size(),
true))
4945 std::__stable_sort_adaptive(__first,
4946 __first + _DistanceType(__buf.size()),
4947 __last, __buf.begin(), __comp);
4948 else if (__builtin_expect(__buf.begin() == 0,
false))
4951 std::__stable_sort_adaptive_resize(__first, __last, __buf.begin(),
4952 _DistanceType(__buf.size()), __comp);
4975 template<
typename _RandomAccessIterator>
4980 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
4982 __glibcxx_function_requires(_LessThanComparableConcept<
4984 __glibcxx_requires_valid_range(__first, __last);
4985 __glibcxx_requires_irreflexive(__first, __last);
4987 _GLIBCXX_STD_A::__stable_sort(__first, __last,
4988 __gnu_cxx::__ops::__iter_less_iter());
5009 template<
typename _RandomAccessIterator,
typename _Compare>
5015 __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<
5017 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5020 __glibcxx_requires_valid_range(__first, __last);
5021 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5023 _GLIBCXX_STD_A::__stable_sort(__first, __last,
5024 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5027 template<
typename _InputIterator1,
typename _InputIterator2,
5028 typename _OutputIterator,
5030 _GLIBCXX20_CONSTEXPR
5032 __set_union(_InputIterator1 __first1, _InputIterator1 __last1,
5033 _InputIterator2 __first2, _InputIterator2 __last2,
5034 _OutputIterator __result, _Compare __comp)
5036 while (__first1 != __last1 && __first2 != __last2)
5038 if (__comp(__first1, __first2))
5040 *__result = *__first1;
5043 else if (__comp(__first2, __first1))
5045 *__result = *__first2;
5050 *__result = *__first1;
5056 return std::copy(__first2, __last2,
5057 std::copy(__first1, __last1, __result));
5079 template<
typename _InputIterator1,
typename _InputIterator2,
5080 typename _OutputIterator>
5081 _GLIBCXX20_CONSTEXPR
5082 inline _OutputIterator
5085 _OutputIterator __result)
5090 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5092 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5094 __glibcxx_function_requires(_LessThanOpConcept<
5097 __glibcxx_function_requires(_LessThanOpConcept<
5107 __gnu_cxx::__ops::__iter_less_iter());
5130 template<
typename _InputIterator1,
typename _InputIterator2,
5131 typename _OutputIterator,
typename _Compare>
5132 _GLIBCXX20_CONSTEXPR
5133 inline _OutputIterator
5136 _OutputIterator __result, _Compare __comp)
5141 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5143 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5145 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5148 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5158 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5161 template<
typename _InputIterator1,
typename _InputIterator2,
5162 typename _OutputIterator,
5164 _GLIBCXX20_CONSTEXPR
5166 __set_intersection(_InputIterator1 __first1, _InputIterator1 __last1,
5167 _InputIterator2 __first2, _InputIterator2 __last2,
5168 _OutputIterator __result, _Compare __comp)
5170 while (__first1 != __last1 && __first2 != __last2)
5171 if (__comp(__first1, __first2))
5173 else if (__comp(__first2, __first1))
5177 *__result = *__first1;
5203 template<
typename _InputIterator1,
typename _InputIterator2,
5204 typename _OutputIterator>
5205 _GLIBCXX20_CONSTEXPR
5206 inline _OutputIterator
5209 _OutputIterator __result)
5214 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5216 __glibcxx_function_requires(_LessThanOpConcept<
5219 __glibcxx_function_requires(_LessThanOpConcept<
5229 __gnu_cxx::__ops::__iter_less_iter());
5253 template<
typename _InputIterator1,
typename _InputIterator2,
5254 typename _OutputIterator,
typename _Compare>
5255 _GLIBCXX20_CONSTEXPR
5256 inline _OutputIterator
5259 _OutputIterator __result, _Compare __comp)
5264 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5266 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5269 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5279 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5282 template<
typename _InputIterator1,
typename _InputIterator2,
5283 typename _OutputIterator,
5285 _GLIBCXX20_CONSTEXPR
5287 __set_difference(_InputIterator1 __first1, _InputIterator1 __last1,
5288 _InputIterator2 __first2, _InputIterator2 __last2,
5289 _OutputIterator __result, _Compare __comp)
5291 while (__first1 != __last1 && __first2 != __last2)
5292 if (__comp(__first1, __first2))
5294 *__result = *__first1;
5298 else if (__comp(__first2, __first1))
5305 return std::copy(__first1, __last1, __result);
5328 template<
typename _InputIterator1,
typename _InputIterator2,
5329 typename _OutputIterator>
5330 _GLIBCXX20_CONSTEXPR
5331 inline _OutputIterator
5334 _OutputIterator __result)
5339 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5341 __glibcxx_function_requires(_LessThanOpConcept<
5344 __glibcxx_function_requires(_LessThanOpConcept<
5354 __gnu_cxx::__ops::__iter_less_iter());
5380 template<
typename _InputIterator1,
typename _InputIterator2,
5381 typename _OutputIterator,
typename _Compare>
5382 _GLIBCXX20_CONSTEXPR
5383 inline _OutputIterator
5386 _OutputIterator __result, _Compare __comp)
5391 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5393 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5396 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5406 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5409 template<
typename _InputIterator1,
typename _InputIterator2,
5410 typename _OutputIterator,
5412 _GLIBCXX20_CONSTEXPR
5414 __set_symmetric_difference(_InputIterator1 __first1,
5415 _InputIterator1 __last1,
5416 _InputIterator2 __first2,
5417 _InputIterator2 __last2,
5418 _OutputIterator __result,
5421 while (__first1 != __last1 && __first2 != __last2)
5422 if (__comp(__first1, __first2))
5424 *__result = *__first1;
5428 else if (__comp(__first2, __first1))
5430 *__result = *__first2;
5439 return std::copy(__first2, __last2,
5440 std::copy(__first1, __last1, __result));
5461 template<
typename _InputIterator1,
typename _InputIterator2,
5462 typename _OutputIterator>
5463 _GLIBCXX20_CONSTEXPR
5464 inline _OutputIterator
5467 _OutputIterator __result)
5472 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5474 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5476 __glibcxx_function_requires(_LessThanOpConcept<
5479 __glibcxx_function_requires(_LessThanOpConcept<
5489 __gnu_cxx::__ops::__iter_less_iter());
5513 template<
typename _InputIterator1,
typename _InputIterator2,
5514 typename _OutputIterator,
typename _Compare>
5515 _GLIBCXX20_CONSTEXPR
5516 inline _OutputIterator
5519 _OutputIterator __result,
5525 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5527 __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
5529 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5532 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5542 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5545 template<
typename _ForwardIterator,
typename _Compare>
5546 _GLIBCXX14_CONSTEXPR
5548 __min_element(_ForwardIterator __first, _ForwardIterator __last,
5551 if (__first == __last)
5553 _ForwardIterator __result = __first;
5554 while (++__first != __last)
5555 if (__comp(__first, __result))
5567 template<
typename _ForwardIterator>
5568 _GLIBCXX14_CONSTEXPR
5574 __glibcxx_function_requires(_LessThanComparableConcept<
5576 __glibcxx_requires_valid_range(__first, __last);
5577 __glibcxx_requires_irreflexive(__first, __last);
5579 return _GLIBCXX_STD_A::__min_element(__first, __last,
5580 __gnu_cxx::__ops::__iter_less_iter());
5592 template<
typename _ForwardIterator,
typename _Compare>
5593 _GLIBCXX14_CONSTEXPR
5594 inline _ForwardIterator
5600 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5603 __glibcxx_requires_valid_range(__first, __last);
5604 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5606 return _GLIBCXX_STD_A::__min_element(__first, __last,
5607 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5610 template<
typename _ForwardIterator,
typename _Compare>
5611 _GLIBCXX14_CONSTEXPR
5613 __max_element(_ForwardIterator __first, _ForwardIterator __last,
5616 if (__first == __last)
return __first;
5617 _ForwardIterator __result = __first;
5618 while (++__first != __last)
5619 if (__comp(__result, __first))
5631 template<
typename _ForwardIterator>
5632 _GLIBCXX14_CONSTEXPR
5633 inline _ForwardIterator
5638 __glibcxx_function_requires(_LessThanComparableConcept<
5640 __glibcxx_requires_valid_range(__first, __last);
5641 __glibcxx_requires_irreflexive(__first, __last);
5643 return _GLIBCXX_STD_A::__max_element(__first, __last,
5644 __gnu_cxx::__ops::__iter_less_iter());
5656 template<
typename _ForwardIterator,
typename _Compare>
5657 _GLIBCXX14_CONSTEXPR
5658 inline _ForwardIterator
5664 __glibcxx_function_requires(_BinaryPredicateConcept<_Compare,
5667 __glibcxx_requires_valid_range(__first, __last);
5668 __glibcxx_requires_irreflexive_pred(__first, __last, __comp);
5670 return _GLIBCXX_STD_A::__max_element(__first, __last,
5671 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5674#if __cplusplus >= 201103L
5676 template<
typename _Tp>
5677 _GLIBCXX14_CONSTEXPR
5679 min(initializer_list<_Tp> __l)
5681 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
5682 return *_GLIBCXX_STD_A::__min_element(__l.begin(), __l.end(),
5683 __gnu_cxx::__ops::__iter_less_iter());
5686 template<
typename _Tp,
typename _Compare>
5687 _GLIBCXX14_CONSTEXPR
5689 min(initializer_list<_Tp> __l, _Compare __comp)
5691 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
5692 return *_GLIBCXX_STD_A::__min_element(__l.begin(), __l.end(),
5693 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5696 template<
typename _Tp>
5697 _GLIBCXX14_CONSTEXPR
5699 max(initializer_list<_Tp> __l)
5701 __glibcxx_requires_irreflexive(__l.begin(), __l.end());
5702 return *_GLIBCXX_STD_A::__max_element(__l.begin(), __l.end(),
5703 __gnu_cxx::__ops::__iter_less_iter());
5706 template<
typename _Tp,
typename _Compare>
5707 _GLIBCXX14_CONSTEXPR
5709 max(initializer_list<_Tp> __l, _Compare __comp)
5711 __glibcxx_requires_irreflexive_pred(__l.begin(), __l.end(), __comp);
5712 return *_GLIBCXX_STD_A::__max_element(__l.begin(), __l.end(),
5713 __gnu_cxx::__ops::__iter_comp_iter(__comp));
5717#if __cplusplus >= 201402L
5719 template<
typename _InputIterator,
typename _RandomAccessIterator,
5720 typename _Size,
typename _UniformRandomBitGenerator>
5721 _RandomAccessIterator
5727 using __param_type =
typename __distrib_type::param_type;
5746 template<
typename _ForwardIterator,
typename _OutputIterator,
typename _Cat,
5747 typename _Size,
typename _UniformRandomBitGenerator>
5755 using __param_type =
typename __distrib_type::param_type;
5760 if (__first == __last)
5781 if (__p.first < __n)
5783 *
__out++ = *__first;
5789 if (__n == 0)
break;
5792 if (__p.second < __n)
5794 *
__out++ = *__first;
5804 for (; __n != 0; ++__first)
5807 *
__out++ = *__first;
5814#ifdef __glibcxx_sample
5816 template<typename _PopulationIterator, typename _SampleIterator,
5817 typename _Distance,
typename _UniformRandomBitGenerator>
5831 "output range must use a RandomAccessIterator when input range"
5832 " does not meet the ForwardIterator requirements");
5835 "sample size must be an integer type");
5838 return _GLIBCXX_STD_A::
5844_GLIBCXX_END_NAMESPACE_ALGO
5845_GLIBCXX_END_NAMESPACE_VERSION
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
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 _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 _ForwardIterator __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag)
This is a helper function for the rotate algorithm.
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.
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.