31#define _RANGES_ALGO_H 1
33#if __cplusplus > 201703L
35#if __cplusplus > 202002L
43namespace std _GLIBCXX_VISIBILITY(default)
45_GLIBCXX_BEGIN_NAMESPACE_VERSION
50 template<
typename _Comp,
typename _Proj>
52 __make_comp_proj(_Comp& __comp, _Proj& __proj)
54 return [&] (
auto&& __lhs,
auto&& __rhs) ->
bool {
55 using _TL =
decltype(__lhs);
56 using _TR =
decltype(__rhs);
63 template<
typename _Pred,
typename _Proj>
65 __make_pred_proj(_Pred& __pred, _Proj& __proj)
67 return [&] <
typename _Tp> (_Tp&& __arg) ->
bool {
76 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
77 typename _Proj =
identity,
78 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
80 operator()(_Iter __first, _Sent __last,
81 _Pred __pred, _Proj __proj = {})
const
83 for (; __first != __last; ++__first)
89 template<input_range _Range,
typename _Proj = identity,
90 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
93 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
95 return (*
this)(ranges::begin(__r), ranges::end(__r),
100 inline constexpr __all_of_fn all_of{};
104 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
105 typename _Proj =
identity,
106 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
108 operator()(_Iter __first, _Sent __last,
109 _Pred __pred, _Proj __proj = {})
const
111 for (; __first != __last; ++__first)
117 template<input_range _Range,
typename _Proj = identity,
118 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
121 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
123 return (*
this)(ranges::begin(__r), ranges::end(__r),
128 inline constexpr __any_of_fn any_of{};
132 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
133 typename _Proj =
identity,
134 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
136 operator()(_Iter __first, _Sent __last,
137 _Pred __pred, _Proj __proj = {})
const
139 for (; __first != __last; ++__first)
145 template<input_range _Range,
typename _Proj = identity,
146 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
149 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
151 return (*
this)(ranges::begin(__r), ranges::end(__r),
156 inline constexpr __none_of_fn none_of{};
158 template<
typename _Iter,
typename _Fp>
161 [[no_unique_address]] _Iter in;
162 [[no_unique_address]] _Fp fun;
164 template<
typename _Iter2,
typename _F2p>
165 requires convertible_to<const _Iter&, _Iter2>
166 && convertible_to<const _Fp&, _F2p>
168 operator in_fun_result<_Iter2, _F2p>() const &
169 {
return {in, fun}; }
171 template<
typename _Iter2,
typename _F2p>
172 requires convertible_to<_Iter, _Iter2> && convertible_to<_Fp, _F2p>
174 operator in_fun_result<_Iter2, _F2p>() &&
178 template<
typename _Iter,
typename _Fp>
179 using for_each_result = in_fun_result<_Iter, _Fp>;
183 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
184 typename _Proj =
identity,
185 indirectly_unary_invocable<projected<_Iter, _Proj>> _Fun>
186 constexpr for_each_result<_Iter, _Fun>
187 operator()(_Iter __first, _Sent __last, _Fun __f, _Proj __proj = {})
const
189 for (; __first != __last; ++__first)
194 template<input_range _Range,
typename _Proj = identity,
195 indirectly_unary_invocable<projected<iterator_t<_Range>, _Proj>>
197 constexpr for_each_result<borrowed_iterator_t<_Range>, _Fun>
198 operator()(_Range&& __r, _Fun __f, _Proj __proj = {})
const
200 return (*
this)(ranges::begin(__r), ranges::end(__r),
205 inline constexpr __for_each_fn for_each{};
207 template<
typename _Iter,
typename _Fp>
208 using for_each_n_result = in_fun_result<_Iter, _Fp>;
210 struct __for_each_n_fn
212 template<input_iterator _Iter,
typename _Proj = identity,
213 indirectly_unary_invocable<projected<_Iter, _Proj>> _Fun>
214 constexpr for_each_n_result<_Iter, _Fun>
215 operator()(_Iter __first, iter_difference_t<_Iter> __n,
216 _Fun __f, _Proj __proj = {})
const
218 if constexpr (random_access_iterator<_Iter>)
222 auto __last = __first + __n;
238 inline constexpr __for_each_n_fn for_each_n{};
242 struct __find_first_of_fn
244 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
245 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
246 typename _Pred = ranges::equal_to,
247 typename _Proj1 =
identity,
typename _Proj2 =
identity>
248 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
250 operator()(_Iter1 __first1, _Sent1 __last1,
251 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
252 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
254 for (; __first1 != __last1; ++__first1)
255 for (
auto __iter = __first2; __iter != __last2; ++__iter)
263 template<input_range _Range1, forward_range _Range2,
264 typename _Pred = ranges::equal_to,
265 typename _Proj1 = identity,
typename _Proj2 = identity>
266 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
267 _Pred, _Proj1, _Proj2>
268 constexpr borrowed_iterator_t<_Range1>
269 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
270 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
272 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
273 ranges::begin(__r2), ranges::end(__r2),
279 inline constexpr __find_first_of_fn find_first_of{};
283 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
284 typename _Proj =
identity,
285 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
286 requires indirect_binary_predicate<ranges::equal_to,
287 projected<_Iter, _Proj>,
289 constexpr iter_difference_t<_Iter>
290 operator()(_Iter __first, _Sent __last,
291 const _Tp& __value, _Proj __proj = {})
const
293 iter_difference_t<_Iter> __n = 0;
294 for (; __first != __last; ++__first)
300 template<input_range _Range,
typename _Proj = identity,
302 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
303 requires indirect_binary_predicate<ranges::equal_to,
304 projected<iterator_t<_Range>, _Proj>,
306 constexpr range_difference_t<_Range>
307 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
309 return (*
this)(ranges::begin(__r), ranges::end(__r),
314 inline constexpr __count_fn count{};
318 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
319 typename _Proj =
identity,
320 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
321 constexpr iter_difference_t<_Iter>
322 operator()(_Iter __first, _Sent __last,
323 _Pred __pred, _Proj __proj = {})
const
325 iter_difference_t<_Iter> __n = 0;
326 for (; __first != __last; ++__first)
332 template<input_range _Range,
333 typename _Proj = identity,
334 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
336 constexpr range_difference_t<_Range>
337 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
339 return (*
this)(ranges::begin(__r), ranges::end(__r),
344 inline constexpr __count_if_fn count_if{};
350 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
351 typename _Pred = ranges::equal_to,
typename _Proj =
identity,
352 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
353 requires indirectly_comparable<_Iter, const _Tp*, _Pred, _Proj>
354 constexpr subrange<_Iter>
355 operator()(_Iter __first, _Sent __last, iter_difference_t<_Iter> __count,
356 const _Tp& __value, _Pred __pred = {}, _Proj __proj = {})
const
359 return {__first, __first};
361 auto __value_comp = [&] <
typename _Rp> (_Rp&& __arg) ->
bool {
362 return std::__invoke(__pred, std::forward<_Rp>(__arg), __value);
366 __first = ranges::find_if(
std::move(__first), __last,
369 if (__first == __last)
370 return {__first, __first};
373 auto __end = __first;
374 return {__first, ++__end};
378 if constexpr (sized_sentinel_for<_Sent, _Iter>
379 && random_access_iterator<_Iter>)
381 auto __tail_size = __last - __first;
382 auto __remainder = __count;
384 while (__remainder <= __tail_size)
386 __first += __remainder;
387 __tail_size -= __remainder;
388 auto __backtrack = __first;
391 if (--__remainder == 0)
392 return {__first - __count, __first};
394 __remainder = __count + 1 - (__first - __backtrack);
396 auto __i = __first + __tail_size;
401 __first = ranges::find_if(__first, __last, __value_comp, __proj);
402 while (__first != __last)
407 while (__i != __last && __n != 1
414 return {__first, __i};
417 __first = ranges::find_if(++__i, __last, __value_comp, __proj);
419 return {__first, __first};
423 template<forward_range _Range,
424 typename _Pred = ranges::equal_to,
typename _Proj = identity,
426 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
427 requires indirectly_comparable<iterator_t<_Range>,
const _Tp*,
429 constexpr borrowed_subrange_t<_Range>
430 operator()(_Range&& __r, range_difference_t<_Range> __count,
431 const _Tp& __value, _Pred __pred = {}, _Proj __proj = {})
const
433 return (*
this)(ranges::begin(__r), ranges::end(__r),
439 inline constexpr __search_n_fn search_n{};
443 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
444 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
445 typename _Pred = ranges::equal_to,
446 typename _Proj1 =
identity,
typename _Proj2 =
identity>
447 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
448 constexpr subrange<_Iter1>
449 operator()(_Iter1 __first1, _Sent1 __last1,
450 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
451 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
453 if constexpr (bidirectional_iterator<_Iter1>
454 && bidirectional_iterator<_Iter2>)
456 auto __i1 = ranges::next(__first1, __last1);
457 auto __i2 = ranges::next(__first2, __last2);
459 = ranges::search(reverse_iterator<_Iter1>{__i1},
460 reverse_iterator<_Iter1>{__first1},
461 reverse_iterator<_Iter2>{__i2},
462 reverse_iterator<_Iter2>{__first2},
465 auto __result_first = ranges::end(__rresult).base();
466 auto __result_last = ranges::begin(__rresult).base();
467 if (__result_last == __first1)
470 return {__result_first, __result_last};
474 auto __i = ranges::next(__first1, __last1);
475 if (__first2 == __last2)
478 auto __result_begin = __i;
479 auto __result_end = __i;
482 auto __new_range = ranges::search(__first1, __last1,
484 __pred, __proj1, __proj2);
485 auto __new_result_begin = ranges::begin(__new_range);
486 auto __new_result_end = ranges::end(__new_range);
487 if (__new_result_begin == __last1)
488 return {__result_begin, __result_end};
491 __result_begin = __new_result_begin;
492 __result_end = __new_result_end;
493 __first1 = __result_begin;
500 template<forward_range _Range1, forward_range _Range2,
501 typename _Pred = ranges::equal_to,
502 typename _Proj1 = identity,
typename _Proj2 = identity>
503 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
504 _Pred, _Proj1, _Proj2>
505 constexpr borrowed_subrange_t<_Range1>
506 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
507 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
509 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
510 ranges::begin(__r2), ranges::end(__r2),
516 inline constexpr __find_end_fn find_end{};
520 struct __is_permutation_fn
522 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
523 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
524 typename _Proj1 =
identity,
typename _Proj2 =
identity,
525 indirect_equivalence_relation<projected<_Iter1, _Proj1>,
526 projected<_Iter2, _Proj2>> _Pred
529 operator()(_Iter1 __first1, _Sent1 __last1,
530 _Iter2 __first2, _Sent2 __last2, _Pred __pred = {},
531 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
533 constexpr bool __sized_iters
534 = (sized_sentinel_for<_Sent1, _Iter1>
535 && sized_sentinel_for<_Sent2, _Iter2>);
536 if constexpr (__sized_iters)
538 auto __d1 = ranges::distance(__first1, __last1);
539 auto __d2 = ranges::distance(__first2, __last2);
546 for (; __first1 != __last1 && __first2 != __last2;
547 ++__first1, (void)++__first2)
553 if constexpr (__sized_iters)
555 if (__first1 == __last1)
560 auto __d1 = ranges::distance(__first1, __last1);
561 auto __d2 = ranges::distance(__first2, __last2);
562 if (__d1 == 0 && __d2 == 0)
568 for (
auto __scan = __first1; __scan != __last1; ++__scan)
570 auto&& __scan_deref = *__scan;
573 auto __comp_scan = [&] <
typename _Tp> (_Tp&& __arg) ->
bool {
576 std::forward<_Tp>(__arg));
578 if (__scan != ranges::find_if(__first1, __scan,
579 __comp_scan, __proj1))
582 auto __matches = ranges::count_if(__first2, __last2,
583 __comp_scan, __proj2);
585 || ranges::count_if(__scan, __last1,
586 __comp_scan, __proj1) != __matches)
592 template<forward_range _Range1, forward_range _Range2,
593 typename _Proj1 = identity,
typename _Proj2 = identity,
594 indirect_equivalence_relation<
595 projected<iterator_t<_Range1>, _Proj1>,
596 projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
598 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
599 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
603 if constexpr (sized_range<_Range1>)
604 if constexpr (sized_range<_Range2>)
605 if (ranges::distance(__r1) != ranges::distance(__r2))
608 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
609 ranges::begin(__r2), ranges::end(__r2),
615 inline constexpr __is_permutation_fn is_permutation{};
617 template<
typename _Iter,
typename _Out>
618 using copy_if_result = in_out_result<_Iter, _Out>;
622 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
623 weakly_incrementable _Out,
typename _Proj =
identity,
624 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
625 requires indirectly_copyable<_Iter, _Out>
626 constexpr copy_if_result<_Iter, _Out>
627 operator()(_Iter __first, _Sent __last, _Out __result,
628 _Pred __pred, _Proj __proj = {})
const
630 for (; __first != __last; ++__first)
633 *__result = *__first;
639 template<input_range _Range, weakly_incrementable _Out,
640 typename _Proj = identity,
641 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
643 requires indirectly_copyable<iterator_t<_Range>, _Out>
644 constexpr copy_if_result<borrowed_iterator_t<_Range>, _Out>
645 operator()(_Range&& __r, _Out __result,
646 _Pred __pred, _Proj __proj = {})
const
648 return (*
this)(ranges::begin(__r), ranges::end(__r),
654 inline constexpr __copy_if_fn copy_if{};
656 template<
typename _Iter1,
typename _Iter2>
657 using swap_ranges_result = in_in_result<_Iter1, _Iter2>;
659 struct __swap_ranges_fn
661 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
662 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2>
663 requires indirectly_swappable<_Iter1, _Iter2>
664 constexpr swap_ranges_result<_Iter1, _Iter2>
665 operator()(_Iter1 __first1, _Sent1 __last1,
666 _Iter2 __first2, _Sent2 __last2)
const
668 for (; __first1 != __last1 && __first2 != __last2;
669 ++__first1, (void)++__first2)
670 ranges::iter_swap(__first1, __first2);
674 template<input_range _Range1, input_range _Range2>
675 requires indirectly_swappable<iterator_t<_Range1>, iterator_t<_Range2>>
676 constexpr swap_ranges_result<borrowed_iterator_t<_Range1>,
677 borrowed_iterator_t<_Range2>>
678 operator()(_Range1&& __r1, _Range2&& __r2)
const
680 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
681 ranges::begin(__r2), ranges::end(__r2));
685 inline constexpr __swap_ranges_fn swap_ranges{};
687 template<
typename _Iter,
typename _Out>
688 using unary_transform_result = in_out_result<_Iter, _Out>;
690 template<
typename _Iter1,
typename _Iter2,
typename _Out>
691 struct in_in_out_result
693 [[no_unique_address]] _Iter1 in1;
694 [[no_unique_address]] _Iter2 in2;
695 [[no_unique_address]] _Out out;
697 template<
typename _IIter1,
typename _IIter2,
typename _OOut>
698 requires convertible_to<const _Iter1&, _IIter1>
699 && convertible_to<const _Iter2&, _IIter2>
700 && convertible_to<const _Out&, _OOut>
702 operator in_in_out_result<_IIter1, _IIter2, _OOut>() const &
703 {
return {in1, in2, out}; }
705 template<
typename _IIter1,
typename _IIter2,
typename _OOut>
706 requires convertible_to<_Iter1, _IIter1>
707 && convertible_to<_Iter2, _IIter2>
708 && convertible_to<_Out, _OOut>
710 operator in_in_out_result<_IIter1, _IIter2, _OOut>() &&
714 template<
typename _Iter1,
typename _Iter2,
typename _Out>
715 using binary_transform_result = in_in_out_result<_Iter1, _Iter2, _Out>;
717 struct __transform_fn
719 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
720 weakly_incrementable _Out,
721 copy_constructible _Fp,
typename _Proj =
identity>
722 requires indirectly_writable<_Out,
723 indirect_result_t<_Fp&,
724 projected<_Iter, _Proj>>>
725 constexpr unary_transform_result<_Iter, _Out>
726 operator()(_Iter __first1, _Sent __last1, _Out __result,
727 _Fp __op, _Proj __proj = {})
const
729 for (; __first1 != __last1; ++__first1, (void)++__result)
734 template<input_range _Range, weakly_incrementable _Out,
735 copy_constructible _Fp,
typename _Proj = identity>
736 requires indirectly_writable<_Out,
737 indirect_result_t<_Fp&,
738 projected<iterator_t<_Range>, _Proj>>>
739 constexpr unary_transform_result<borrowed_iterator_t<_Range>, _Out>
740 operator()(_Range&& __r, _Out __result, _Fp __op, _Proj __proj = {})
const
742 return (*
this)(ranges::begin(__r), ranges::end(__r),
747 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
748 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
749 weakly_incrementable _Out, copy_constructible _Fp,
750 typename _Proj1 =
identity,
typename _Proj2 =
identity>
751 requires indirectly_writable<_Out,
752 indirect_result_t<_Fp&,
753 projected<_Iter1, _Proj1>,
754 projected<_Iter2, _Proj2>>>
755 constexpr binary_transform_result<_Iter1, _Iter2, _Out>
756 operator()(_Iter1 __first1, _Sent1 __last1,
757 _Iter2 __first2, _Sent2 __last2,
758 _Out __result, _Fp __binary_op,
759 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
761 for (; __first1 != __last1 && __first2 != __last2;
762 ++__first1, (void)++__first2, ++__result)
769 template<input_range _Range1, input_range _Range2,
770 weakly_incrementable _Out, copy_constructible _Fp,
771 typename _Proj1 = identity,
typename _Proj2 = identity>
772 requires indirectly_writable<_Out,
773 indirect_result_t<_Fp&,
774 projected<iterator_t<_Range1>, _Proj1>,
775 projected<iterator_t<_Range2>, _Proj2>>>
776 constexpr binary_transform_result<borrowed_iterator_t<_Range1>,
777 borrowed_iterator_t<_Range2>, _Out>
778 operator()(_Range1&& __r1, _Range2&& __r2, _Out __result, _Fp __binary_op,
779 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
781 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
782 ranges::begin(__r2), ranges::end(__r2),
788 inline constexpr __transform_fn transform{};
792 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
793 typename _Proj =
identity,
794 typename _Tp1 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
795 typename _Tp2 _GLIBCXX26_DEF_VAL_T(_Tp1)>
796 requires indirectly_writable<_Iter, const _Tp2&>
797 && indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>,
800 operator()(_Iter __first, _Sent __last,
801 const _Tp1& __old_value,
const _Tp2& __new_value,
802 _Proj __proj = {})
const
804 for (; __first != __last; ++__first)
806 *__first = __new_value;
810 template<input_range _Range,
typename _Proj = identity,
812 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
813 typename _Tp2 _GLIBCXX26_DEF_VAL_T(_Tp1)>
814 requires indirectly_writable<iterator_t<_Range>,
const _Tp2&>
815 && indirect_binary_predicate<ranges::equal_to,
816 projected<iterator_t<_Range>, _Proj>,
818 constexpr borrowed_iterator_t<_Range>
819 operator()(_Range&& __r,
820 const _Tp1& __old_value,
const _Tp2& __new_value,
821 _Proj __proj = {})
const
823 return (*
this)(ranges::begin(__r), ranges::end(__r),
824 __old_value, __new_value,
std::move(__proj));
828 inline constexpr __replace_fn replace{};
830 struct __replace_if_fn
832 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
833 typename _Proj =
identity,
834 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
835 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
836 requires indirectly_writable<_Iter, const _Tp&>
838 operator()(_Iter __first, _Sent __last,
839 _Pred __pred,
const _Tp& __new_value, _Proj __proj = {})
const
841 for (; __first != __last; ++__first)
843 *__first = __new_value;
847 template<input_range _Range,
typename _Proj = identity,
849 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
850 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
852 requires indirectly_writable<iterator_t<_Range>,
const _Tp&>
853 constexpr borrowed_iterator_t<_Range>
854 operator()(_Range&& __r,
855 _Pred __pred,
const _Tp& __new_value, _Proj __proj = {})
const
857 return (*
this)(ranges::begin(__r), ranges::end(__r),
862 inline constexpr __replace_if_fn replace_if{};
864 template<
typename _Iter,
typename _Out>
865 using replace_copy_result = in_out_result<_Iter, _Out>;
867 struct __replace_copy_fn
869 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
870 typename _Out,
typename _Proj =
identity,
871 typename _Tp1 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
872 typename _Tp2 _GLIBCXX26_DEF_VAL_T(iter_value_t<_Out>)>
873 requires indirectly_copyable<_Iter, _Out>
874 && indirect_binary_predicate<ranges::equal_to,
875 projected<_Iter, _Proj>,
const _Tp1*>
876 && output_iterator<_Out, const _Tp2&>
877 constexpr replace_copy_result<_Iter, _Out>
878 operator()(_Iter __first, _Sent __last, _Out __result,
879 const _Tp1& __old_value,
const _Tp2& __new_value,
880 _Proj __proj = {})
const
882 for (; __first != __last; ++__first, (void)++__result)
884 *__result = __new_value;
886 *__result = *__first;
890 template<input_range _Range,
typename _Out,
891 typename _Proj = identity,
893 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
894 typename _Tp2 _GLIBCXX26_DEF_VAL_T(iter_value_t<_Out>)>
895 requires indirectly_copyable<iterator_t<_Range>, _Out>
896 && indirect_binary_predicate<ranges::equal_to,
897 projected<iterator_t<_Range>, _Proj>,
899 && output_iterator<_Out, const _Tp2&>
900 constexpr replace_copy_result<borrowed_iterator_t<_Range>, _Out>
901 operator()(_Range&& __r, _Out __result,
902 const _Tp1& __old_value,
const _Tp2& __new_value,
903 _Proj __proj = {})
const
905 return (*
this)(ranges::begin(__r), ranges::end(__r),
911 inline constexpr __replace_copy_fn replace_copy{};
913 template<
typename _Iter,
typename _Out>
914 using replace_copy_if_result = in_out_result<_Iter, _Out>;
916 struct __replace_copy_if_fn
918 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
920 typename _Tp _GLIBCXX26_DEF_VAL_T(iter_value_t<_Out>),
921 typename _Proj =
identity,
922 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
923 requires indirectly_copyable<_Iter, _Out>
924 && output_iterator<_Out, const _Tp&>
925 constexpr replace_copy_if_result<_Iter, _Out>
926 operator()(_Iter __first, _Sent __last, _Out __result,
927 _Pred __pred,
const _Tp& __new_value, _Proj __proj = {})
const
929 for (; __first != __last; ++__first, (void)++__result)
931 *__result = __new_value;
933 *__result = *__first;
937 template<input_range _Range,
939 typename _Tp _GLIBCXX26_DEF_VAL_T(iter_value_t<_Out>),
940 typename _Proj = identity,
941 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
943 requires indirectly_copyable<iterator_t<_Range>, _Out>
944 && output_iterator<_Out, const _Tp&>
945 constexpr replace_copy_if_result<borrowed_iterator_t<_Range>, _Out>
946 operator()(_Range&& __r, _Out __result,
947 _Pred __pred,
const _Tp& __new_value, _Proj __proj = {})
const
949 return (*
this)(ranges::begin(__r), ranges::end(__r),
955 inline constexpr __replace_copy_if_fn replace_copy_if{};
957 struct __generate_n_fn
959 template<input_or_output_iterator _Out, copy_constructible _Fp>
960 requires invocable<_Fp&>
961 && indirectly_writable<_Out, invoke_result_t<_Fp&>>
963 operator()(_Out __first, iter_difference_t<_Out> __n, _Fp __gen)
const
965 for (; __n > 0; --__n, (void)++__first)
971 inline constexpr __generate_n_fn generate_n{};
975 template<input_or_output_iterator _Out, sentinel_for<_Out> _Sent,
976 copy_constructible _Fp>
977 requires invocable<_Fp&>
978 && indirectly_writable<_Out, invoke_result_t<_Fp&>>
980 operator()(_Out __first, _Sent __last, _Fp __gen)
const
982 for (; __first != __last; ++__first)
987 template<
typename _Range, copy_constructible _Fp>
988 requires invocable<_Fp&> && output_range<_Range, invoke_result_t<_Fp&>>
989 constexpr borrowed_iterator_t<_Range>
990 operator()(_Range&& __r, _Fp __gen)
const
992 return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__gen));
996 inline constexpr __generate_fn generate{};
998 struct __remove_if_fn
1000 template<permutable _Iter, sentinel_for<_Iter> _Sent,
1001 typename _Proj =
identity,
1002 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
1003 constexpr subrange<_Iter>
1004 operator()(_Iter __first, _Sent __last,
1005 _Pred __pred, _Proj __proj = {})
const
1007 __first = ranges::find_if(__first, __last, __pred, __proj);
1008 if (__first == __last)
1009 return {__first, __first};
1011 auto __result = __first;
1013 for (; __first != __last; ++__first)
1020 return {__result, __first};
1023 template<forward_range _Range,
typename _Proj = identity,
1024 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
1026 requires permutable<iterator_t<_Range>>
1027 constexpr borrowed_subrange_t<_Range>
1028 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
1030 return (*
this)(ranges::begin(__r), ranges::end(__r),
1035 inline constexpr __remove_if_fn remove_if{};
1039 template<permutable _Iter, sentinel_for<_Iter> _Sent,
1040 typename _Proj =
identity,
1041 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
1042 requires indirect_binary_predicate<ranges::equal_to,
1043 projected<_Iter, _Proj>,
1045 constexpr subrange<_Iter>
1046 operator()(_Iter __first, _Sent __last,
1047 const _Tp& __value, _Proj __proj = {})
const
1049 auto __pred = [&] (
auto&& __arg) ->
bool {
1050 return std::forward<decltype(__arg)>(__arg) == __value;
1052 return ranges::remove_if(__first, __last,
1056 template<forward_range _Range,
typename _Proj = identity,
1058 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
1059 requires permutable<iterator_t<_Range>>
1060 && indirect_binary_predicate<ranges::equal_to,
1061 projected<iterator_t<_Range>, _Proj>,
1063 constexpr borrowed_subrange_t<_Range>
1064 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
1066 return (*
this)(ranges::begin(__r), ranges::end(__r),
1071 inline constexpr __remove_fn remove{};
1073 template<
typename _Iter,
typename _Out>
1074 using remove_copy_if_result = in_out_result<_Iter, _Out>;
1076 struct __remove_copy_if_fn
1078 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
1079 weakly_incrementable _Out,
typename _Proj =
identity,
1080 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
1081 requires indirectly_copyable<_Iter, _Out>
1082 constexpr remove_copy_if_result<_Iter, _Out>
1083 operator()(_Iter __first, _Sent __last, _Out __result,
1084 _Pred __pred, _Proj __proj = {})
const
1086 for (; __first != __last; ++__first)
1089 *__result = *__first;
1095 template<input_range _Range, weakly_incrementable _Out,
1096 typename _Proj = identity,
1097 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
1099 requires indirectly_copyable<iterator_t<_Range>, _Out>
1100 constexpr remove_copy_if_result<borrowed_iterator_t<_Range>, _Out>
1101 operator()(_Range&& __r, _Out __result,
1102 _Pred __pred, _Proj __proj = {})
const
1104 return (*
this)(ranges::begin(__r), ranges::end(__r),
1110 inline constexpr __remove_copy_if_fn remove_copy_if{};
1112 template<
typename _Iter,
typename _Out>
1113 using remove_copy_result = in_out_result<_Iter, _Out>;
1115 struct __remove_copy_fn
1117 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
1118 weakly_incrementable _Out,
typename _Proj =
identity,
1119 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
1120 requires indirectly_copyable<_Iter, _Out>
1121 && indirect_binary_predicate<ranges::equal_to,
1122 projected<_Iter, _Proj>,
1124 constexpr remove_copy_result<_Iter, _Out>
1125 operator()(_Iter __first, _Sent __last, _Out __result,
1126 const _Tp& __value, _Proj __proj = {})
const
1128 for (; __first != __last; ++__first)
1131 *__result = *__first;
1137 template<input_range _Range, weakly_incrementable _Out,
1138 typename _Proj = identity,
1140 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
1141 requires indirectly_copyable<iterator_t<_Range>, _Out>
1142 && indirect_binary_predicate<ranges::equal_to,
1143 projected<iterator_t<_Range>, _Proj>,
1145 constexpr remove_copy_result<borrowed_iterator_t<_Range>, _Out>
1146 operator()(_Range&& __r, _Out __result,
1147 const _Tp& __value, _Proj __proj = {})
const
1149 return (*
this)(ranges::begin(__r), ranges::end(__r),
1154 inline constexpr __remove_copy_fn remove_copy{};
1158 template<permutable _Iter, sentinel_for<_Iter> _Sent,
1159 typename _Proj =
identity,
1160 indirect_equivalence_relation<
1161 projected<_Iter, _Proj>> _Comp = ranges::equal_to>
1162 constexpr subrange<_Iter>
1163 operator()(_Iter __first, _Sent __last,
1164 _Comp __comp = {}, _Proj __proj = {})
const
1166 __first = ranges::adjacent_find(__first, __last, __comp, __proj);
1167 if (__first == __last)
1168 return {__first, __first};
1170 auto __dest = __first;
1172 while (++__first != __last)
1177 return {++__dest, __first};
1180 template<forward_range _Range,
typename _Proj = identity,
1181 indirect_equivalence_relation<
1182 projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
1183 requires permutable<iterator_t<_Range>>
1184 constexpr borrowed_subrange_t<_Range>
1185 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1187 return (*
this)(ranges::begin(__r), ranges::end(__r),
1192 inline constexpr __unique_fn unique{};
1196 template<
typename _Out,
typename _Tp>
1197 concept __can_reread_output = input_iterator<_Out>
1198 && same_as<_Tp, iter_value_t<_Out>>;
1201 template<
typename _Iter,
typename _Out>
1202 using unique_copy_result = in_out_result<_Iter, _Out>;
1204 struct __unique_copy_fn
1206 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
1207 weakly_incrementable _Out,
typename _Proj =
identity,
1208 indirect_equivalence_relation<
1209 projected<_Iter, _Proj>> _Comp = ranges::equal_to>
1210 requires indirectly_copyable<_Iter, _Out>
1211 && (forward_iterator<_Iter>
1212 || __detail::__can_reread_output<_Out, iter_value_t<_Iter>>
1213 || indirectly_copyable_storable<_Iter, _Out>)
1214 constexpr unique_copy_result<_Iter, _Out>
1215 operator()(_Iter __first, _Sent __last, _Out __result,
1216 _Comp __comp = {}, _Proj __proj = {})
const
1218 if (__first == __last)
1222 if constexpr (forward_iterator<_Iter>)
1224 auto __next = __first;
1225 *__result = *__next;
1226 while (++__next != __last)
1232 *++__result = *__first;
1236 else if constexpr (__detail::__can_reread_output<_Out, iter_value_t<_Iter>>)
1238 *__result = *__first;
1239 while (++__first != __last)
1243 *++__result = *__first;
1248 auto __value = *__first;
1249 *__result = __value;
1250 while (++__first != __last)
1257 *++__result = __value;
1264 template<input_range _Range,
1265 weakly_incrementable _Out,
typename _Proj = identity,
1266 indirect_equivalence_relation<
1267 projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
1268 requires indirectly_copyable<iterator_t<_Range>, _Out>
1269 && (forward_iterator<iterator_t<_Range>>
1270 || __detail::__can_reread_output<_Out, range_value_t<_Range>>
1271 || indirectly_copyable_storable<iterator_t<_Range>, _Out>)
1272 constexpr unique_copy_result<borrowed_iterator_t<_Range>, _Out>
1273 operator()(_Range&& __r, _Out __result,
1274 _Comp __comp = {}, _Proj __proj = {})
const
1276 return (*
this)(ranges::begin(__r), ranges::end(__r),
1282 inline constexpr __unique_copy_fn unique_copy{};
1286 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent>
1287 requires permutable<_Iter>
1289 operator()(_Iter __first, _Sent __last)
const
1291 auto __i = ranges::next(__first, __last);
1294 if constexpr (random_access_iterator<_Iter>)
1296 if (__first != __last)
1299 while (__first < __tail)
1301 ranges::iter_swap(__first, __tail);
1311 if (__first == __tail || __first == --__tail)
1315 ranges::iter_swap(__first, __tail);
1322 template<b
idirectional_range _Range>
1323 requires permutable<iterator_t<_Range>>
1324 constexpr borrowed_iterator_t<_Range>
1325 operator()(_Range&& __r)
const
1327 return (*
this)(ranges::begin(__r), ranges::end(__r));
1331 inline constexpr __reverse_fn reverse{};
1333 template<
typename _Iter,
typename _Out>
1334 using reverse_copy_result = in_out_result<_Iter, _Out>;
1336 struct __reverse_copy_fn
1338 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
1339 weakly_incrementable _Out>
1340 requires indirectly_copyable<_Iter, _Out>
1341 constexpr reverse_copy_result<_Iter, _Out>
1342 operator()(_Iter __first, _Sent __last, _Out __result)
const
1344 auto __i = ranges::next(__first, __last);
1346 while (__first != __tail)
1349 *__result = *__tail;
1355 template<b
idirectional_range _Range, weakly_incrementable _Out>
1356 requires indirectly_copyable<iterator_t<_Range>, _Out>
1357 constexpr reverse_copy_result<borrowed_iterator_t<_Range>, _Out>
1358 operator()(_Range&& __r, _Out __result)
const
1360 return (*
this)(ranges::begin(__r), ranges::end(__r),
1365 inline constexpr __reverse_copy_fn reverse_copy{};
1369 template<permutable _Iter, sentinel_for<_Iter> _Sent>
1370 constexpr subrange<_Iter>
1371 operator()(_Iter __first, _Iter __middle, _Sent __last)
const
1373 auto __lasti = ranges::next(__first, __last);
1374 if (__first == __middle)
1375 return {__lasti, __lasti};
1376 if (__last == __middle)
1379 if constexpr (random_access_iterator<_Iter>)
1381 auto __n = __lasti - __first;
1382 auto __k = __middle - __first;
1384 if (__k == __n - __k)
1386 ranges::swap_ranges(__first, __middle, __middle, __middle + __k);
1391 auto __ret = __first + (__lasti - __middle);
1395 if (__k < __n - __k)
1399 if constexpr (__is_pod(iter_value_t<_Iter>))
1403 ranges::move(__p + 1, __p + __n, __p);
1407 auto __q = __p + __k;
1408 for (
decltype(__n) __i = 0; __i < __n - __k; ++ __i)
1410 ranges::iter_swap(__p, __q);
1417 ranges::swap(__n, __k);
1425 if constexpr (__is_pod(iter_value_t<_Iter>))
1429 ranges::move_backward(__p, __p + __n - 1, __p + __n);
1433 auto __q = __p + __n;
1435 for (
decltype(__n) __i = 0; __i < __n - __k; ++ __i)
1439 ranges::iter_swap(__p, __q);
1444 std::swap(__n, __k);
1448 else if constexpr (bidirectional_iterator<_Iter>)
1450 auto __tail = __lasti;
1452 ranges::reverse(__first, __middle);
1453 ranges::reverse(__middle, __tail);
1455 while (__first != __middle && __middle != __tail)
1457 ranges::iter_swap(__first, --__tail);
1461 if (__first == __middle)
1463 ranges::reverse(__middle, __tail);
1468 ranges::reverse(__first, __middle);
1474 auto __first2 = __middle;
1477 ranges::iter_swap(__first, __first2);
1480 if (__first == __middle)
1481 __middle = __first2;
1482 }
while (__first2 != __last);
1484 auto __ret = __first;
1486 __first2 = __middle;
1488 while (__first2 != __last)
1490 ranges::iter_swap(__first, __first2);
1493 if (__first == __middle)
1494 __middle = __first2;
1495 else if (__first2 == __last)
1496 __first2 = __middle;
1502 template<forward_range _Range>
1503 requires permutable<iterator_t<_Range>>
1504 constexpr borrowed_subrange_t<_Range>
1505 operator()(_Range&& __r, iterator_t<_Range> __middle)
const
1507 return (*
this)(ranges::begin(__r),
std::move(__middle),
1512 inline constexpr __rotate_fn rotate{};
1514 template<
typename _Iter,
typename _Out>
1515 using rotate_copy_result = in_out_result<_Iter, _Out>;
1517 struct __rotate_copy_fn
1519 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
1520 weakly_incrementable _Out>
1521 requires indirectly_copyable<_Iter, _Out>
1522 constexpr rotate_copy_result<_Iter, _Out>
1523 operator()(_Iter __first, _Iter __middle, _Sent __last,
1524 _Out __result)
const
1526 auto __copy1 = ranges::copy(__middle,
1529 auto __copy2 = ranges::copy(
std::move(__first),
1535 template<forward_range _Range, weakly_incrementable _Out>
1536 requires indirectly_copyable<iterator_t<_Range>, _Out>
1537 constexpr rotate_copy_result<borrowed_iterator_t<_Range>, _Out>
1538 operator()(_Range&& __r, iterator_t<_Range> __middle, _Out __result)
const
1540 return (*
this)(ranges::begin(__r),
std::move(__middle),
1545 inline constexpr __rotate_copy_fn rotate_copy{};
1549 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
1550 weakly_incrementable _Out,
typename _Gen>
1551 requires (forward_iterator<_Iter> || random_access_iterator<_Out>)
1552 && indirectly_copyable<_Iter, _Out>
1553 && uniform_random_bit_generator<remove_reference_t<_Gen>>
1555 operator()(_Iter __first, _Sent __last, _Out __out,
1556 iter_difference_t<_Iter> __n, _Gen&& __g)
const
1558 if constexpr (forward_iterator<_Iter>)
1562 auto __lasti = ranges::next(__first, __last);
1563 return _GLIBCXX_STD_A::
1565 __n, std::forward<_Gen>(__g));
1569 using __distrib_type
1570 = uniform_int_distribution<iter_difference_t<_Iter>>;
1571 using __param_type =
typename __distrib_type::param_type;
1572 __distrib_type __d{};
1573 iter_difference_t<_Iter> __sample_sz = 0;
1574 while (__first != __last && __sample_sz != __n)
1576 __out[__sample_sz++] = *__first;
1579 for (
auto __pop_sz = __sample_sz; __first != __last;
1580 ++__first, (void) ++__pop_sz)
1582 const auto __k = __d(__g, __param_type{0, __pop_sz});
1584 __out[__k] = *__first;
1586 return __out + __sample_sz;
1590 template<input_range _Range, weakly_incrementable _Out,
typename _Gen>
1591 requires (forward_range<_Range> || random_access_iterator<_Out>)
1592 && indirectly_copyable<iterator_t<_Range>, _Out>
1593 && uniform_random_bit_generator<remove_reference_t<_Gen>>
1595 operator()(_Range&& __r, _Out __out,
1596 range_difference_t<_Range> __n, _Gen&& __g)
const
1598 return (*
this)(ranges::begin(__r), ranges::end(__r),
1600 std::forward<_Gen>(__g));
1604 inline constexpr __sample_fn sample{};
1608 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1610 requires permutable<_Iter>
1611 && uniform_random_bit_generator<remove_reference_t<_Gen>>
1613 operator()(_Iter __first, _Sent __last, _Gen&& __g)
const
1615 auto __lasti = ranges::next(__first, __last);
1616 std::shuffle(
std::move(__first), __lasti, std::forward<_Gen>(__g));
1620 template<random_access_range _Range,
typename _Gen>
1621 requires permutable<iterator_t<_Range>>
1622 && uniform_random_bit_generator<remove_reference_t<_Gen>>
1623 borrowed_iterator_t<_Range>
1624 operator()(_Range&& __r, _Gen&& __g)
const
1626 return (*
this)(ranges::begin(__r), ranges::end(__r),
1627 std::forward<_Gen>(__g));
1631 inline constexpr __shuffle_fn shuffle{};
1633 struct __push_heap_fn
1635 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1636 typename _Comp = ranges::less,
typename _Proj =
identity>
1637 requires sortable<_Iter, _Comp, _Proj>
1639 operator()(_Iter __first, _Sent __last,
1640 _Comp __comp = {}, _Proj __proj = {})
const
1642 auto __lasti = ranges::next(__first, __last);
1643 std::push_heap(__first, __lasti,
1644 __detail::__make_comp_proj(__comp, __proj));
1648 template<random_access_range _Range,
1649 typename _Comp = ranges::less,
typename _Proj = identity>
1650 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1651 constexpr borrowed_iterator_t<_Range>
1652 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1654 return (*
this)(ranges::begin(__r), ranges::end(__r),
1659 inline constexpr __push_heap_fn push_heap{};
1661 struct __pop_heap_fn
1663 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1664 typename _Comp = ranges::less,
typename _Proj =
identity>
1665 requires sortable<_Iter, _Comp, _Proj>
1667 operator()(_Iter __first, _Sent __last,
1668 _Comp __comp = {}, _Proj __proj = {})
const
1670 auto __lasti = ranges::next(__first, __last);
1671 std::pop_heap(__first, __lasti,
1672 __detail::__make_comp_proj(__comp, __proj));
1676 template<random_access_range _Range,
1677 typename _Comp = ranges::less,
typename _Proj = identity>
1678 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1679 constexpr borrowed_iterator_t<_Range>
1680 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1682 return (*
this)(ranges::begin(__r), ranges::end(__r),
1687 inline constexpr __pop_heap_fn pop_heap{};
1689 struct __make_heap_fn
1691 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1692 typename _Comp = ranges::less,
typename _Proj =
identity>
1693 requires sortable<_Iter, _Comp, _Proj>
1695 operator()(_Iter __first, _Sent __last,
1696 _Comp __comp = {}, _Proj __proj = {})
const
1698 auto __lasti = ranges::next(__first, __last);
1699 std::make_heap(__first, __lasti,
1700 __detail::__make_comp_proj(__comp, __proj));
1704 template<random_access_range _Range,
1705 typename _Comp = ranges::less,
typename _Proj = identity>
1706 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1707 constexpr borrowed_iterator_t<_Range>
1708 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1710 return (*
this)(ranges::begin(__r), ranges::end(__r),
1715 inline constexpr __make_heap_fn make_heap{};
1717 struct __sort_heap_fn
1719 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1720 typename _Comp = ranges::less,
typename _Proj =
identity>
1721 requires sortable<_Iter, _Comp, _Proj>
1723 operator()(_Iter __first, _Sent __last,
1724 _Comp __comp = {}, _Proj __proj = {})
const
1726 auto __lasti = ranges::next(__first, __last);
1727 std::sort_heap(__first, __lasti,
1728 __detail::__make_comp_proj(__comp, __proj));
1732 template<random_access_range _Range,
1733 typename _Comp = ranges::less,
typename _Proj = identity>
1734 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1735 constexpr borrowed_iterator_t<_Range>
1736 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1738 return (*
this)(ranges::begin(__r), ranges::end(__r),
1743 inline constexpr __sort_heap_fn sort_heap{};
1745 struct __is_heap_until_fn
1747 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1748 typename _Proj =
identity,
1749 indirect_strict_weak_order<projected<_Iter, _Proj>>
1750 _Comp = ranges::less>
1752 operator()(_Iter __first, _Sent __last,
1753 _Comp __comp = {}, _Proj __proj = {})
const
1755 iter_difference_t<_Iter> __n = ranges::distance(__first, __last);
1756 iter_difference_t<_Iter> __parent = 0, __child = 1;
1757 for (; __child < __n; ++__child)
1761 return __first + __child;
1762 else if ((__child & 1) == 0)
1765 return __first + __n;
1768 template<random_access_range _Range,
1769 typename _Proj = identity,
1770 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
1771 _Comp = ranges::less>
1772 constexpr borrowed_iterator_t<_Range>
1773 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1775 return (*
this)(ranges::begin(__r), ranges::end(__r),
1780 inline constexpr __is_heap_until_fn is_heap_until{};
1784 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1785 typename _Proj =
identity,
1786 indirect_strict_weak_order<projected<_Iter, _Proj>>
1787 _Comp = ranges::less>
1789 operator()(_Iter __first, _Sent __last,
1790 _Comp __comp = {}, _Proj __proj = {})
const
1793 == ranges::is_heap_until(__first, __last,
1798 template<random_access_range _Range,
1799 typename _Proj = identity,
1800 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
1801 _Comp = ranges::less>
1803 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1805 return (*
this)(ranges::begin(__r), ranges::end(__r),
1810 inline constexpr __is_heap_fn is_heap{};
1814 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1815 typename _Comp = ranges::less,
typename _Proj =
identity>
1816 requires sortable<_Iter, _Comp, _Proj>
1818 operator()(_Iter __first, _Sent __last,
1819 _Comp __comp = {}, _Proj __proj = {})
const
1821 auto __lasti = ranges::next(__first, __last);
1822 _GLIBCXX_STD_A::sort(
std::move(__first), __lasti,
1823 __detail::__make_comp_proj(__comp, __proj));
1827 template<random_access_range _Range,
1828 typename _Comp = ranges::less,
typename _Proj = identity>
1829 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1830 constexpr borrowed_iterator_t<_Range>
1831 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1833 return (*
this)(ranges::begin(__r), ranges::end(__r),
1838 inline constexpr __sort_fn sort{};
1840 struct __stable_sort_fn
1842 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1843 typename _Comp = ranges::less,
typename _Proj =
identity>
1844 requires sortable<_Iter, _Comp, _Proj>
1846 operator()(_Iter __first, _Sent __last,
1847 _Comp __comp = {}, _Proj __proj = {})
const
1849 auto __lasti = ranges::next(__first, __last);
1850 std::stable_sort(
std::move(__first), __lasti,
1851 __detail::__make_comp_proj(__comp, __proj));
1855 template<random_access_range _Range,
1856 typename _Comp = ranges::less,
typename _Proj = identity>
1857 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1858 borrowed_iterator_t<_Range>
1859 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
1861 return (*
this)(ranges::begin(__r), ranges::end(__r),
1866 inline constexpr __stable_sort_fn stable_sort{};
1868 struct __partial_sort_fn
1870 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
1871 typename _Comp = ranges::less,
typename _Proj =
identity>
1872 requires sortable<_Iter, _Comp, _Proj>
1874 operator()(_Iter __first, _Iter __middle, _Sent __last,
1875 _Comp __comp = {}, _Proj __proj = {})
const
1877 if (__first == __middle)
1878 return ranges::next(__first, __last);
1880 ranges::make_heap(__first, __middle, __comp, __proj);
1881 auto __i = __middle;
1882 for (; __i != __last; ++__i)
1887 ranges::pop_heap(__first, __middle, __comp, __proj);
1888 ranges::iter_swap(__middle-1, __i);
1889 ranges::push_heap(__first, __middle, __comp, __proj);
1891 ranges::sort_heap(__first, __middle, __comp, __proj);
1896 template<random_access_range _Range,
1897 typename _Comp = ranges::less,
typename _Proj = identity>
1898 requires sortable<iterator_t<_Range>, _Comp, _Proj>
1899 constexpr borrowed_iterator_t<_Range>
1900 operator()(_Range&& __r, iterator_t<_Range> __middle,
1901 _Comp __comp = {}, _Proj __proj = {})
const
1903 return (*
this)(ranges::begin(__r),
std::move(__middle),
1909 inline constexpr __partial_sort_fn partial_sort{};
1911 template<
typename _Iter,
typename _Out>
1912 using partial_sort_copy_result = in_out_result<_Iter, _Out>;
1914 struct __partial_sort_copy_fn
1916 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
1917 random_access_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
1918 typename _Comp = ranges::less,
1919 typename _Proj1 =
identity,
typename _Proj2 =
identity>
1920 requires indirectly_copyable<_Iter1, _Iter2>
1921 && sortable<_Iter2, _Comp, _Proj2>
1922 && indirect_strict_weak_order<_Comp,
1923 projected<_Iter1, _Proj1>,
1924 projected<_Iter2, _Proj2>>
1925 constexpr partial_sort_copy_result<_Iter1, _Iter2>
1926 operator()(_Iter1 __first, _Sent1 __last,
1927 _Iter2 __result_first, _Sent2 __result_last,
1929 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
1931 if (__result_first == __result_last)
1934 auto __lasti = ranges::next(
std::move(__first),
1939 auto __result_real_last = __result_first;
1940 while (__first != __last && __result_real_last != __result_last)
1942 *__result_real_last = *__first;
1943 ++__result_real_last;
1947 ranges::make_heap(__result_first, __result_real_last, __comp, __proj2);
1948 for (; __first != __last; ++__first)
1953 ranges::pop_heap(__result_first, __result_real_last,
1955 *(__result_real_last-1) = *__first;
1956 ranges::push_heap(__result_first, __result_real_last,
1959 ranges::sort_heap(__result_first, __result_real_last, __comp, __proj2);
1964 template<input_range _Range1, random_access_range _Range2,
1965 typename _Comp = ranges::less,
1966 typename _Proj1 = identity,
typename _Proj2 = identity>
1967 requires indirectly_copyable<iterator_t<_Range1>, iterator_t<_Range2>>
1968 && sortable<iterator_t<_Range2>, _Comp, _Proj2>
1969 && indirect_strict_weak_order<_Comp,
1970 projected<iterator_t<_Range1>, _Proj1>,
1971 projected<iterator_t<_Range2>, _Proj2>>
1972 constexpr partial_sort_copy_result<borrowed_iterator_t<_Range1>,
1973 borrowed_iterator_t<_Range2>>
1974 operator()(_Range1&& __r, _Range2&& __out, _Comp __comp = {},
1975 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
1977 return (*
this)(ranges::begin(__r), ranges::end(__r),
1978 ranges::begin(__out), ranges::end(__out),
1984 inline constexpr __partial_sort_copy_fn partial_sort_copy{};
1986 struct __is_sorted_until_fn
1988 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
1989 typename _Proj =
identity,
1990 indirect_strict_weak_order<projected<_Iter, _Proj>>
1991 _Comp = ranges::less>
1993 operator()(_Iter __first, _Sent __last,
1994 _Comp __comp = {}, _Proj __proj = {})
const
1996 if (__first == __last)
1999 auto __next = __first;
2000 for (++__next; __next != __last; __first = __next, (void)++__next)
2008 template<forward_range _Range,
typename _Proj = identity,
2009 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
2010 _Comp = ranges::less>
2011 constexpr borrowed_iterator_t<_Range>
2012 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
2014 return (*
this)(ranges::begin(__r), ranges::end(__r),
2019 inline constexpr __is_sorted_until_fn is_sorted_until{};
2021 struct __is_sorted_fn
2023 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2024 typename _Proj =
identity,
2025 indirect_strict_weak_order<projected<_Iter, _Proj>>
2026 _Comp = ranges::less>
2028 operator()(_Iter __first, _Sent __last,
2029 _Comp __comp = {}, _Proj __proj = {})
const
2031 if (__first == __last)
2034 auto __next = __first;
2035 for (++__next; __next != __last; __first = __next, (void)++__next)
2043 template<forward_range _Range,
typename _Proj = identity,
2044 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
2045 _Comp = ranges::less>
2047 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
2049 return (*
this)(ranges::begin(__r), ranges::end(__r),
2054 inline constexpr __is_sorted_fn is_sorted{};
2056 struct __nth_element_fn
2058 template<random_access_iterator _Iter, sentinel_for<_Iter> _Sent,
2059 typename _Comp = ranges::less,
typename _Proj =
identity>
2060 requires sortable<_Iter, _Comp, _Proj>
2062 operator()(_Iter __first, _Iter __nth, _Sent __last,
2063 _Comp __comp = {}, _Proj __proj = {})
const
2065 auto __lasti = ranges::next(__first, __last);
2068 __detail::__make_comp_proj(__comp, __proj));
2072 template<random_access_range _Range,
2073 typename _Comp = ranges::less,
typename _Proj = identity>
2074 requires sortable<iterator_t<_Range>, _Comp, _Proj>
2075 constexpr borrowed_iterator_t<_Range>
2076 operator()(_Range&& __r, iterator_t<_Range> __nth,
2077 _Comp __comp = {}, _Proj __proj = {})
const
2079 return (*
this)(ranges::begin(__r),
std::move(__nth),
2084 inline constexpr __nth_element_fn nth_element{};
2086 struct __lower_bound_fn
2088 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2089 typename _Proj =
identity,
2090 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
2091 indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>>
2092 _Comp = ranges::less>
2094 operator()(_Iter __first, _Sent __last,
2095 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2097 auto __len = ranges::distance(__first, __last);
2101 auto __half = __len / 2;
2102 auto __middle = __first;
2103 ranges::advance(__middle, __half);
2108 __len = __len - __half - 1;
2116 template<forward_range _Range,
2117 typename _Proj = identity,
2119 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
2120 indirect_strict_weak_order<
const _Tp*,
2121 projected<iterator_t<_Range>, _Proj>>
2122 _Comp = ranges::less>
2123 constexpr borrowed_iterator_t<_Range>
2124 operator()(_Range&& __r,
2125 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2127 return (*
this)(ranges::begin(__r), ranges::end(__r),
2132 inline constexpr __lower_bound_fn lower_bound{};
2134 struct __upper_bound_fn
2136 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2137 typename _Proj =
identity,
2138 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
2139 indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>>
2140 _Comp = ranges::less>
2142 operator()(_Iter __first, _Sent __last,
2143 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2145 auto __len = ranges::distance(__first, __last);
2149 auto __half = __len / 2;
2150 auto __middle = __first;
2151 ranges::advance(__middle, __half);
2158 __len = __len - __half - 1;
2164 template<forward_range _Range,
2165 typename _Proj = identity,
2167 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
2168 indirect_strict_weak_order<
const _Tp*,
2169 projected<iterator_t<_Range>, _Proj>>
2170 _Comp = ranges::less>
2171 constexpr borrowed_iterator_t<_Range>
2172 operator()(_Range&& __r,
2173 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2175 return (*
this)(ranges::begin(__r), ranges::end(__r),
2180 inline constexpr __upper_bound_fn upper_bound{};
2182 struct __equal_range_fn
2184 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2185 typename _Proj =
identity,
2186 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
2187 indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>>
2188 _Comp = ranges::less>
2189 constexpr subrange<_Iter>
2190 operator()(_Iter __first, _Sent __last,
2191 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2193 auto __len = ranges::distance(__first, __last);
2197 auto __half = __len / 2;
2198 auto __middle = __first;
2199 ranges::advance(__middle, __half);
2206 __len = __len - __half - 1;
2215 = ranges::lower_bound(__first, __middle,
2216 __value, __comp, __proj);
2217 ranges::advance(__first, __len);
2219 = ranges::upper_bound(++__middle, __first,
2220 __value, __comp, __proj);
2221 return {__left, __right};
2224 return {__first, __first};
2227 template<forward_range _Range,
2228 typename _Proj = identity,
2230 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
2231 indirect_strict_weak_order<
const _Tp*,
2232 projected<iterator_t<_Range>, _Proj>>
2233 _Comp = ranges::less>
2234 constexpr borrowed_subrange_t<_Range>
2235 operator()(_Range&& __r,
const _Tp& __value,
2236 _Comp __comp = {}, _Proj __proj = {})
const
2238 return (*
this)(ranges::begin(__r), ranges::end(__r),
2243 inline constexpr __equal_range_fn equal_range{};
2245 struct __binary_search_fn
2247 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2248 typename _Proj =
identity,
2249 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj),
2250 indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>>
2251 _Comp = ranges::less>
2253 operator()(_Iter __first, _Sent __last,
2254 const _Tp& __value, _Comp __comp = {}, _Proj __proj = {})
const
2256 auto __i = ranges::lower_bound(__first, __last, __value, __comp, __proj);
2263 template<forward_range _Range,
2264 typename _Proj = identity,
2266 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj),
2267 indirect_strict_weak_order<
const _Tp*,
2268 projected<iterator_t<_Range>, _Proj>>
2269 _Comp = ranges::less>
2271 operator()(_Range&& __r,
const _Tp& __value, _Comp __comp = {},
2272 _Proj __proj = {})
const
2274 return (*
this)(ranges::begin(__r), ranges::end(__r),
2279 inline constexpr __binary_search_fn binary_search{};
2281 struct __is_partitioned_fn
2283 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
2284 typename _Proj =
identity,
2285 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
2287 operator()(_Iter __first, _Sent __last,
2288 _Pred __pred, _Proj __proj = {})
const
2290 __first = ranges::find_if_not(
std::move(__first), __last,
2292 if (__first == __last)
2299 template<input_range _Range,
typename _Proj = identity,
2300 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
2303 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
2305 return (*
this)(ranges::begin(__r), ranges::end(__r),
2310 inline constexpr __is_partitioned_fn is_partitioned{};
2312 struct __partition_fn
2314 template<permutable _Iter, sentinel_for<_Iter> _Sent,
2315 typename _Proj =
identity,
2316 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
2317 constexpr subrange<_Iter>
2318 operator()(_Iter __first, _Sent __last,
2319 _Pred __pred, _Proj __proj = {})
const
2321 if constexpr (bidirectional_iterator<_Iter>)
2323 auto __lasti = ranges::next(__first, __last);
2324 auto __tail = __lasti;
2328 if (__first == __tail)
2337 if (__first == __tail)
2344 ranges::iter_swap(__first, __tail);
2350 if (__first == __last)
2351 return {__first, __first};
2354 if (++__first == __last)
2355 return {__first, __first};
2357 auto __next = __first;
2358 while (++__next != __last)
2361 ranges::iter_swap(__first, __next);
2369 template<forward_range _Range,
typename _Proj = identity,
2370 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
2372 requires permutable<iterator_t<_Range>>
2373 constexpr borrowed_subrange_t<_Range>
2374 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
2376 return (*
this)(ranges::begin(__r), ranges::end(__r),
2381 inline constexpr __partition_fn partition{};
2384 struct __stable_partition_fn
2386 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
2387 typename _Proj =
identity,
2388 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
2389 requires permutable<_Iter>
2391 operator()(_Iter __first, _Sent __last,
2392 _Pred __pred, _Proj __proj = {})
const
2394 auto __lasti = ranges::next(__first, __last);
2396 = std::stable_partition(
std::move(__first), __lasti,
2397 __detail::__make_pred_proj(__pred, __proj));
2401 template<bidirectional_range _Range,
typename _Proj = identity,
2402 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
2404 requires permutable<iterator_t<_Range>>
2405 borrowed_subrange_t<_Range>
2406 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
2408 return (*
this)(ranges::begin(__r), ranges::end(__r),
2413 inline constexpr __stable_partition_fn stable_partition{};
2416 template<
typename _Iter,
typename _Out1,
typename _Out2>
2417 struct in_out_out_result
2419 [[no_unique_address]] _Iter in;
2420 [[no_unique_address]] _Out1 out1;
2421 [[no_unique_address]] _Out2 out2;
2423 template<
typename _IIter,
typename _OOut1,
typename _OOut2>
2424 requires convertible_to<const _Iter&, _IIter>
2425 && convertible_to<const _Out1&, _OOut1>
2426 && convertible_to<const _Out2&, _OOut2>
2428 operator in_out_out_result<_IIter, _OOut1, _OOut2>() const &
2429 {
return {in, out1, out2}; }
2431 template<
typename _IIter,
typename _OOut1,
typename _OOut2>
2432 requires convertible_to<_Iter, _IIter>
2433 && convertible_to<_Out1, _OOut1>
2434 && convertible_to<_Out2, _OOut2>
2436 operator in_out_out_result<_IIter, _OOut1, _OOut2>() &&
2440 template<
typename _Iter,
typename _Out1,
typename _Out2>
2441 using partition_copy_result = in_out_out_result<_Iter, _Out1, _Out2>;
2443 struct __partition_copy_fn
2445 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
2446 weakly_incrementable _Out1, weakly_incrementable _Out2,
2447 typename _Proj =
identity,
2448 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
2449 requires indirectly_copyable<_Iter, _Out1>
2450 && indirectly_copyable<_Iter, _Out2>
2451 constexpr partition_copy_result<_Iter, _Out1, _Out2>
2452 operator()(_Iter __first, _Sent __last,
2453 _Out1 __out_true, _Out2 __out_false,
2454 _Pred __pred, _Proj __proj = {})
const
2456 for (; __first != __last; ++__first)
2459 *__out_true = *__first;
2464 *__out_false = *__first;
2472 template<input_range _Range, weakly_incrementable _Out1,
2473 weakly_incrementable _Out2,
2474 typename _Proj = identity,
2475 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
2477 requires indirectly_copyable<iterator_t<_Range>, _Out1>
2478 && indirectly_copyable<iterator_t<_Range>, _Out2>
2479 constexpr partition_copy_result<borrowed_iterator_t<_Range>, _Out1, _Out2>
2480 operator()(_Range&& __r, _Out1 __out_true, _Out2 __out_false,
2481 _Pred __pred, _Proj __proj = {})
const
2483 return (*
this)(ranges::begin(__r), ranges::end(__r),
2489 inline constexpr __partition_copy_fn partition_copy{};
2491 struct __partition_point_fn
2493 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
2494 typename _Proj =
identity,
2495 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
2497 operator()(_Iter __first, _Sent __last,
2498 _Pred __pred, _Proj __proj = {})
const
2500 auto __len = ranges::distance(__first, __last);
2504 auto __half = __len / 2;
2505 auto __middle = __first;
2506 ranges::advance(__middle, __half);
2511 __len = __len - __half - 1;
2519 template<forward_range _Range,
typename _Proj = identity,
2520 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>>
2522 constexpr borrowed_iterator_t<_Range>
2523 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
2525 return (*
this)(ranges::begin(__r), ranges::end(__r),
2530 inline constexpr __partition_point_fn partition_point{};
2532 template<
typename _Iter1,
typename _Iter2,
typename _Out>
2533 using merge_result = in_in_out_result<_Iter1, _Iter2, _Out>;
2537 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2538 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2539 weakly_incrementable _Out,
typename _Comp = ranges::less,
2540 typename _Proj1 =
identity,
typename _Proj2 =
identity>
2541 requires mergeable<_Iter1, _Iter2, _Out, _Comp, _Proj1, _Proj2>
2542 constexpr merge_result<_Iter1, _Iter2, _Out>
2543 operator()(_Iter1 __first1, _Sent1 __last1,
2544 _Iter2 __first2, _Sent2 __last2, _Out __result,
2546 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2548 while (__first1 != __last1 && __first2 != __last2)
2554 *__result = *__first2;
2559 *__result = *__first1;
2572 template<input_range _Range1, input_range _Range2, weakly_incrementable _Out,
2573 typename _Comp = ranges::less,
2574 typename _Proj1 = identity,
typename _Proj2 = identity>
2575 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _Out,
2576 _Comp, _Proj1, _Proj2>
2577 constexpr merge_result<borrowed_iterator_t<_Range1>,
2578 borrowed_iterator_t<_Range2>,
2580 operator()(_Range1&& __r1, _Range2&& __r2, _Out __result,
2582 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2584 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2585 ranges::begin(__r2), ranges::end(__r2),
2591 inline constexpr __merge_fn merge{};
2593 struct __inplace_merge_fn
2595 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
2596 typename _Comp = ranges::less,
2597 typename _Proj =
identity>
2598 requires sortable<_Iter, _Comp, _Proj>
2600 operator()(_Iter __first, _Iter __middle, _Sent __last,
2601 _Comp __comp = {}, _Proj __proj = {})
const
2603 auto __lasti = ranges::next(__first, __last);
2605 __detail::__make_comp_proj(__comp, __proj));
2609 template<bidirectional_range _Range,
2610 typename _Comp = ranges::less,
typename _Proj = identity>
2611 requires sortable<iterator_t<_Range>, _Comp, _Proj>
2612 borrowed_iterator_t<_Range>
2613 operator()(_Range&& __r, iterator_t<_Range> __middle,
2614 _Comp __comp = {}, _Proj __proj = {})
const
2616 return (*
this)(ranges::begin(__r),
std::move(__middle),
2622 inline constexpr __inplace_merge_fn inplace_merge{};
2624 struct __includes_fn
2626 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2627 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2628 typename _Proj1 =
identity,
typename _Proj2 =
identity,
2629 indirect_strict_weak_order<projected<_Iter1, _Proj1>,
2630 projected<_Iter2, _Proj2>>
2631 _Comp = ranges::less>
2633 operator()(_Iter1 __first1, _Sent1 __last1,
2634 _Iter2 __first2, _Sent2 __last2,
2636 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2638 while (__first1 != __last1 && __first2 != __last2)
2653 return __first2 == __last2;
2656 template<input_range _Range1, input_range _Range2,
2657 typename _Proj1 = identity,
typename _Proj2 = identity,
2658 indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>,
2659 projected<iterator_t<_Range2>, _Proj2>>
2660 _Comp = ranges::less>
2662 operator()(_Range1&& __r1, _Range2&& __r2, _Comp __comp = {},
2663 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2665 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2666 ranges::begin(__r2), ranges::end(__r2),
2672 inline constexpr __includes_fn includes{};
2674 template<
typename _Iter1,
typename _Iter2,
typename _Out>
2675 using set_union_result = in_in_out_result<_Iter1, _Iter2, _Out>;
2677 struct __set_union_fn
2679 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2680 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2681 weakly_incrementable _Out,
typename _Comp = ranges::less,
2682 typename _Proj1 =
identity,
typename _Proj2 =
identity>
2683 requires mergeable<_Iter1, _Iter2, _Out, _Comp, _Proj1, _Proj2>
2684 constexpr set_union_result<_Iter1, _Iter2, _Out>
2685 operator()(_Iter1 __first1, _Sent1 __last1,
2686 _Iter2 __first2, _Sent2 __last2,
2687 _Out __result, _Comp __comp = {},
2688 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2690 while (__first1 != __last1 && __first2 != __last2)
2696 *__result = *__first1;
2703 *__result = *__first2;
2708 *__result = *__first1;
2722 template<input_range _Range1, input_range _Range2, weakly_incrementable _Out,
2723 typename _Comp = ranges::less,
2724 typename _Proj1 = identity,
typename _Proj2 = identity>
2725 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _Out,
2726 _Comp, _Proj1, _Proj2>
2727 constexpr set_union_result<borrowed_iterator_t<_Range1>,
2728 borrowed_iterator_t<_Range2>, _Out>
2729 operator()(_Range1&& __r1, _Range2&& __r2,
2730 _Out __result, _Comp __comp = {},
2731 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2733 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2734 ranges::begin(__r2), ranges::end(__r2),
2740 inline constexpr __set_union_fn set_union{};
2742 template<
typename _Iter1,
typename _Iter2,
typename _Out>
2743 using set_intersection_result = in_in_out_result<_Iter1, _Iter2, _Out>;
2745 struct __set_intersection_fn
2747 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2748 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2749 weakly_incrementable _Out,
typename _Comp = ranges::less,
2750 typename _Proj1 =
identity,
typename _Proj2 =
identity>
2751 requires mergeable<_Iter1, _Iter2, _Out, _Comp, _Proj1, _Proj2>
2752 constexpr set_intersection_result<_Iter1, _Iter2, _Out>
2753 operator()(_Iter1 __first1, _Sent1 __last1,
2754 _Iter2 __first2, _Sent2 __last2, _Out __result,
2756 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2758 while (__first1 != __last1 && __first2 != __last2)
2769 *__result = *__first1;
2780 template<input_range _Range1, input_range _Range2, weakly_incrementable _Out,
2781 typename _Comp = ranges::less,
2782 typename _Proj1 = identity,
typename _Proj2 = identity>
2783 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _Out,
2784 _Comp, _Proj1, _Proj2>
2785 constexpr set_intersection_result<borrowed_iterator_t<_Range1>,
2786 borrowed_iterator_t<_Range2>, _Out>
2787 operator()(_Range1&& __r1, _Range2&& __r2, _Out __result,
2789 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2791 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2792 ranges::begin(__r2), ranges::end(__r2),
2798 inline constexpr __set_intersection_fn set_intersection{};
2800 template<
typename _Iter,
typename _Out>
2801 using set_difference_result = in_out_result<_Iter, _Out>;
2803 struct __set_difference_fn
2805 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2806 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2807 weakly_incrementable _Out,
typename _Comp = ranges::less,
2808 typename _Proj1 =
identity,
typename _Proj2 =
identity>
2809 requires mergeable<_Iter1, _Iter2, _Out, _Comp, _Proj1, _Proj2>
2810 constexpr set_difference_result<_Iter1, _Out>
2811 operator()(_Iter1 __first1, _Sent1 __last1,
2812 _Iter2 __first2, _Sent2 __last2, _Out __result,
2814 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2816 while (__first1 != __last1 && __first2 != __last2)
2821 *__result = *__first1;
2838 template<input_range _Range1, input_range _Range2, weakly_incrementable _Out,
2839 typename _Comp = ranges::less,
2840 typename _Proj1 = identity,
typename _Proj2 = identity>
2841 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _Out,
2842 _Comp, _Proj1, _Proj2>
2843 constexpr set_difference_result<borrowed_iterator_t<_Range1>, _Out>
2844 operator()(_Range1&& __r1, _Range2&& __r2, _Out __result,
2846 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2848 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2849 ranges::begin(__r2), ranges::end(__r2),
2855 inline constexpr __set_difference_fn set_difference{};
2857 template<
typename _Iter1,
typename _Iter2,
typename _Out>
2858 using set_symmetric_difference_result
2859 = in_in_out_result<_Iter1, _Iter2, _Out>;
2861 struct __set_symmetric_difference_fn
2863 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
2864 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
2865 weakly_incrementable _Out,
typename _Comp = ranges::less,
2866 typename _Proj1 =
identity,
typename _Proj2 =
identity>
2867 requires mergeable<_Iter1, _Iter2, _Out, _Comp, _Proj1, _Proj2>
2868 constexpr set_symmetric_difference_result<_Iter1, _Iter2, _Out>
2869 operator()(_Iter1 __first1, _Sent1 __last1,
2870 _Iter2 __first2, _Sent2 __last2,
2871 _Out __result, _Comp __comp = {},
2872 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2874 while (__first1 != __last1 && __first2 != __last2)
2879 *__result = *__first1;
2887 *__result = *__first2;
2904 template<input_range _Range1, input_range _Range2, weakly_incrementable _Out,
2905 typename _Comp = ranges::less,
2906 typename _Proj1 = identity,
typename _Proj2 = identity>
2907 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _Out,
2908 _Comp, _Proj1, _Proj2>
2909 constexpr set_symmetric_difference_result<borrowed_iterator_t<_Range1>,
2910 borrowed_iterator_t<_Range2>,
2912 operator()(_Range1&& __r1, _Range2&& __r2, _Out __result,
2914 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
2916 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
2917 ranges::begin(__r2), ranges::end(__r2),
2923 inline constexpr __set_symmetric_difference_fn set_symmetric_difference{};
2929 template<
typename _Tp,
typename _Proj = identity,
2930 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
2931 _Comp = ranges::less>
2932 constexpr const _Tp&
2933 operator()(
const _Tp& __a,
const _Tp& __b,
2934 _Comp __comp = {}, _Proj __proj = {})
const
2944 template<input_range _Range,
typename _Proj = identity,
2945 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
2946 _Comp = ranges::less>
2947 requires indirectly_copyable_storable<iterator_t<_Range>,
2948 range_value_t<_Range>*>
2949 constexpr range_value_t<_Range>
2950 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
2952 auto __first = ranges::begin(__r);
2953 auto __last = ranges::end(__r);
2954 __glibcxx_assert(__first != __last);
2955 auto __result = *__first;
2956 while (++__first != __last)
2958 auto&& __tmp = *__first;
2962 __result = std::forward<decltype(__tmp)>(__tmp);
2967 template<copyable _Tp,
typename _Proj = identity,
2968 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
2969 _Comp = ranges::less>
2971 operator()(initializer_list<_Tp> __r,
2972 _Comp __comp = {}, _Proj __proj = {})
const
2974 return (*
this)(ranges::subrange(__r),
2979 inline constexpr __max_fn max{};
2983 template<
typename _Tp,
typename _Proj = identity,
2984 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp
2986 constexpr const _Tp&
2987 operator()(
const _Tp& __val,
const _Tp& __lo,
const _Tp& __hi,
2988 _Comp __comp = {}, _Proj __proj = {})
const
3007 inline constexpr __clamp_fn clamp{};
3009 template<
typename _Tp>
3010 struct min_max_result
3012 [[no_unique_address]] _Tp min;
3013 [[no_unique_address]] _Tp max;
3015 template<
typename _Tp2>
3016 requires convertible_to<const _Tp&, _Tp2>
3018 operator min_max_result<_Tp2>() const &
3019 {
return {min, max}; }
3021 template<
typename _Tp2>
3022 requires convertible_to<_Tp, _Tp2>
3024 operator min_max_result<_Tp2>() &&
3028 template<
typename _Tp>
3029 using minmax_result = min_max_result<_Tp>;
3033 template<
typename _Tp,
typename _Proj = identity,
3034 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
3035 _Comp = ranges::less>
3036 constexpr minmax_result<const _Tp&>
3037 operator()(
const _Tp& __a,
const _Tp& __b,
3038 _Comp __comp = {}, _Proj __proj = {})
const
3048 template<input_range _Range,
typename _Proj = identity,
3049 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
3050 _Comp = ranges::less>
3051 requires indirectly_copyable_storable<iterator_t<_Range>, range_value_t<_Range>*>
3052 constexpr minmax_result<range_value_t<_Range>>
3053 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3055 auto __first = ranges::begin(__r);
3056 auto __last = ranges::end(__r);
3057 __glibcxx_assert(__first != __last);
3058 auto __comp_proj = __detail::__make_comp_proj(__comp, __proj);
3059 minmax_result<range_value_t<_Range>> __result = {*__first, __result.min};
3060 if (++__first == __last)
3066 auto&& __val = *__first;
3067 if (__comp_proj(__val, __result.min))
3068 __result.min = std::forward<decltype(__val)>(__val);
3070 __result.max = std::forward<decltype(__val)>(__val);
3072 while (++__first != __last)
3077 range_value_t<_Range> __val1 = *__first;
3078 if (++__first == __last)
3083 if (__comp_proj(__val1, __result.min))
3085 else if (!__comp_proj(__val1, __result.max))
3089 auto&& __val2 = *__first;
3090 if (!__comp_proj(__val2, __val1))
3092 if (__comp_proj(__val1, __result.min))
3094 if (!__comp_proj(__val2, __result.max))
3095 __result.max = std::forward<decltype(__val2)>(__val2);
3099 if (__comp_proj(__val2, __result.min))
3100 __result.min = std::forward<decltype(__val2)>(__val2);
3101 if (!__comp_proj(__val1, __result.max))
3108 template<copyable _Tp,
typename _Proj = identity,
3109 indirect_strict_weak_order<projected<const _Tp*, _Proj>>
3110 _Comp = ranges::less>
3111 constexpr minmax_result<_Tp>
3112 operator()(initializer_list<_Tp> __r,
3113 _Comp __comp = {}, _Proj __proj = {})
const
3115 return (*
this)(ranges::subrange(__r),
3120 inline constexpr __minmax_fn minmax{};
3122 struct __min_element_fn
3124 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
3125 typename _Proj =
identity,
3126 indirect_strict_weak_order<projected<_Iter, _Proj>>
3127 _Comp = ranges::less>
3129 operator()(_Iter __first, _Sent __last,
3130 _Comp __comp = {}, _Proj __proj = {})
const
3132 if (__first == __last)
3136 while (++__i != __last)
3146 template<forward_range _Range,
typename _Proj = identity,
3147 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
3148 _Comp = ranges::less>
3149 constexpr borrowed_iterator_t<_Range>
3150 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3152 return (*
this)(ranges::begin(__r), ranges::end(__r),
3157 inline constexpr __min_element_fn min_element{};
3159 struct __max_element_fn
3161 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
3162 typename _Proj =
identity,
3163 indirect_strict_weak_order<projected<_Iter, _Proj>>
3164 _Comp = ranges::less>
3166 operator()(_Iter __first, _Sent __last,
3167 _Comp __comp = {}, _Proj __proj = {})
const
3169 if (__first == __last)
3173 while (++__i != __last)
3183 template<forward_range _Range,
typename _Proj = identity,
3184 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
3185 _Comp = ranges::less>
3186 constexpr borrowed_iterator_t<_Range>
3187 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3189 return (*
this)(ranges::begin(__r), ranges::end(__r),
3194 inline constexpr __max_element_fn max_element{};
3196 template<
typename _Iter>
3197 using minmax_element_result = min_max_result<_Iter>;
3199 struct __minmax_element_fn
3201 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
3202 typename _Proj =
identity,
3203 indirect_strict_weak_order<projected<_Iter, _Proj>>
3204 _Comp = ranges::less>
3205 constexpr minmax_element_result<_Iter>
3206 operator()(_Iter __first, _Sent __last,
3207 _Comp __comp = {}, _Proj __proj = {})
const
3209 auto __comp_proj = __detail::__make_comp_proj(__comp, __proj);
3210 minmax_element_result<_Iter> __result = {__first, __first};
3211 if (__first == __last || ++__first == __last)
3217 if (__comp_proj(*__first, *__result.min))
3218 __result.min = __first;
3220 __result.max = __first;
3222 while (++__first != __last)
3227 auto __prev = __first;
3228 if (++__first == __last)
3233 if (__comp_proj(*__prev, *__result.min))
3234 __result.min = __prev;
3235 else if (!__comp_proj(*__prev, *__result.max))
3236 __result.max = __prev;
3239 if (!__comp_proj(*__first, *__prev))
3241 if (__comp_proj(*__prev, *__result.min))
3242 __result.min = __prev;
3243 if (!__comp_proj(*__first, *__result.max))
3244 __result.max = __first;
3248 if (__comp_proj(*__first, *__result.min))
3249 __result.min = __first;
3250 if (!__comp_proj(*__prev, *__result.max))
3251 __result.max = __prev;
3257 template<forward_range _Range,
typename _Proj = identity,
3258 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>>
3259 _Comp = ranges::less>
3260 constexpr minmax_element_result<borrowed_iterator_t<_Range>>
3261 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3263 return (*
this)(ranges::begin(__r), ranges::end(__r),
3268 inline constexpr __minmax_element_fn minmax_element{};
3270 struct __lexicographical_compare_fn
3272 template<input_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
3273 input_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
3274 typename _Proj1 =
identity,
typename _Proj2 =
identity,
3275 indirect_strict_weak_order<projected<_Iter1, _Proj1>,
3276 projected<_Iter2, _Proj2>>
3277 _Comp = ranges::less>
3279 operator()(_Iter1 __first1, _Sent1 __last1,
3280 _Iter2 __first2, _Sent2 __last2,
3282 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
3284 if constexpr (__detail::__is_normal_iterator<_Iter1>
3285 && same_as<_Iter1, _Sent1>)
3286 return (*
this)(__first1.base(), __last1.base(),
3290 else if constexpr (__detail::__is_normal_iterator<_Iter2>
3291 && same_as<_Iter2, _Sent2>)
3293 __first2.base(), __last2.base(),
3298 constexpr bool __sized_iters
3299 = (sized_sentinel_for<_Sent1, _Iter1>
3300 && sized_sentinel_for<_Sent2, _Iter2>);
3301 if constexpr (__sized_iters)
3303 using _ValueType1 = iter_value_t<_Iter1>;
3304 using _ValueType2 = iter_value_t<_Iter2>;
3307 constexpr bool __use_memcmp
3308 = (__is_memcmp_ordered_with<_ValueType1, _ValueType2>::__value
3309 && __ptr_to_nonvolatile<_Iter1>
3310 && __ptr_to_nonvolatile<_Iter2>
3311 && (is_same_v<_Comp, ranges::less>
3312 || is_same_v<_Comp, ranges::greater>)
3313 && is_same_v<_Proj1, identity>
3314 && is_same_v<_Proj2, identity>);
3315 if constexpr (__use_memcmp)
3317 const auto __d1 = __last1 - __first1;
3318 const auto __d2 = __last2 - __first2;
3320 if (
const auto __len =
std::min(__d1, __d2))
3323 = std::__memcmp(__first1, __first2, __len);
3324 if constexpr (is_same_v<_Comp, ranges::less>)
3331 else if constexpr (is_same_v<_Comp, ranges::greater>)
3343 for (; __first1 != __last1 && __first2 != __last2;
3344 ++__first1, (void) ++__first2)
3355 return __first1 == __last1 && __first2 != __last2;
3359 template<input_range _Range1, input_range _Range2,
3360 typename _Proj1 = identity,
typename _Proj2 = identity,
3361 indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>,
3362 projected<iterator_t<_Range2>, _Proj2>>
3363 _Comp = ranges::less>
3365 operator()(_Range1&& __r1, _Range2&& __r2, _Comp __comp = {},
3366 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
3368 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
3369 ranges::begin(__r2), ranges::end(__r2),
3375 template<
typename _Iter,
typename _Ref = iter_reference_t<_Iter>>
3376 static constexpr bool __ptr_to_nonvolatile
3377 = is_pointer_v<_Iter> && !is_volatile_v<remove_reference_t<_Ref>>;
3380 inline constexpr __lexicographical_compare_fn lexicographical_compare;
3382 template<
typename _Iter>
3383 struct in_found_result
3385 [[no_unique_address]] _Iter in;
3388 template<
typename _Iter2>
3389 requires convertible_to<const _Iter&, _Iter2>
3391 operator in_found_result<_Iter2>() const &
3392 {
return {in, found}; }
3394 template<
typename _Iter2>
3395 requires convertible_to<_Iter, _Iter2>
3397 operator in_found_result<_Iter2>() &&
3401 template<
typename _Iter>
3402 using next_permutation_result = in_found_result<_Iter>;
3404 struct __next_permutation_fn
3406 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
3407 typename _Comp = ranges::less,
typename _Proj =
identity>
3408 requires sortable<_Iter, _Comp, _Proj>
3409 constexpr next_permutation_result<_Iter>
3410 operator()(_Iter __first, _Sent __last,
3411 _Comp __comp = {}, _Proj __proj = {})
const
3413 if (__first == __last)
3421 auto __lasti = ranges::next(__first, __last);
3438 ranges::iter_swap(__i, __j);
3439 ranges::reverse(__ii, __last);
3444 ranges::reverse(__first, __last);
3450 template<bidirectional_range _Range,
typename _Comp = ranges::less,
3451 typename _Proj = identity>
3452 requires sortable<iterator_t<_Range>, _Comp, _Proj>
3453 constexpr next_permutation_result<borrowed_iterator_t<_Range>>
3454 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3456 return (*
this)(ranges::begin(__r), ranges::end(__r),
3461 inline constexpr __next_permutation_fn next_permutation{};
3463 template<
typename _Iter>
3464 using prev_permutation_result = in_found_result<_Iter>;
3466 struct __prev_permutation_fn
3468 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
3469 typename _Comp = ranges::less,
typename _Proj =
identity>
3470 requires sortable<_Iter, _Comp, _Proj>
3471 constexpr prev_permutation_result<_Iter>
3472 operator()(_Iter __first, _Sent __last,
3473 _Comp __comp = {}, _Proj __proj = {})
const
3475 if (__first == __last)
3483 auto __lasti = ranges::next(__first, __last);
3500 ranges::iter_swap(__i, __j);
3501 ranges::reverse(__ii, __last);
3506 ranges::reverse(__first, __last);
3512 template<bidirectional_range _Range,
typename _Comp = ranges::less,
3513 typename _Proj = identity>
3514 requires sortable<iterator_t<_Range>, _Comp, _Proj>
3515 constexpr prev_permutation_result<borrowed_iterator_t<_Range>>
3516 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {})
const
3518 return (*
this)(ranges::begin(__r), ranges::end(__r),
3523 inline constexpr __prev_permutation_fn prev_permutation{};
3525#if __glibcxx_ranges_contains >= 202207L
3526 struct __contains_fn
3528 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
3529 typename _Proj =
identity,
3530 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
3531 requires indirect_binary_predicate<ranges::equal_to,
3532 projected<_Iter, _Proj>,
const _Tp*>
3534 operator()(_Iter __first, _Sent __last,
const _Tp& __value, _Proj __proj = {})
const
3535 {
return ranges::find(
std::move(__first), __last, __value,
std::move(__proj)) != __last; }
3537 template<input_range _Range,
3538 typename _Proj = identity,
3540 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
3541 requires indirect_binary_predicate<ranges::equal_to,
3542 projected<iterator_t<_Range>, _Proj>,
const _Tp*>
3544 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
3545 {
return (*
this)(ranges::begin(__r), ranges::end(__r), __value,
std::move(__proj)); }
3548 inline constexpr __contains_fn contains{};
3550 struct __contains_subrange_fn
3552 template<forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
3553 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
3554 typename _Pred = ranges::equal_to,
3555 typename _Proj1 =
identity,
typename _Proj2 =
identity>
3556 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
3558 operator()(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2,
3559 _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
3561 return __first2 == __last2
3562 || !ranges::search(__first1, __last1, __first2, __last2,
3566 template<forward_range _Range1, forward_range _Range2,
3567 typename _Pred = ranges::equal_to,
3568 typename _Proj1 = identity,
typename _Proj2 = identity>
3569 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>,
3570 _Pred, _Proj1, _Proj2>
3572 operator()(_Range1&& __r1, _Range2&& __r2, _Pred __pred = {},
3573 _Proj1 __proj1 = {}, _Proj2 __proj2 = {})
const
3575 return (*
this)(ranges::begin(__r1), ranges::end(__r1),
3576 ranges::begin(__r2), ranges::end(__r2),
3581 inline constexpr __contains_subrange_fn contains_subrange{};
3585#if __glibcxx_ranges_find_last >= 202207L
3587 struct __find_last_fn
3589 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
3590 typename _Proj =
identity,
3591 typename _Tp _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(_Iter, _Proj)>
3592 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>,
const _Tp*>
3593 constexpr subrange<_Iter>
3594 operator()(_Iter __first, _Sent __last,
const _Tp& __value, _Proj __proj = {})
const
3596 if constexpr (same_as<_Iter, _Sent> && bidirectional_iterator<_Iter>)
3598 _Iter __found = ranges::find(reverse_iterator<_Iter>{__last},
3599 reverse_iterator<_Iter>{__first},
3601 if (__found == __first)
3602 return {__last, __last};
3604 return {ranges::prev(__found), __last};
3608 _Iter __found = ranges::find(__first, __last, __value, __proj);
3609 if (__found == __last)
3610 return {__found, __found};
3614 __first = ranges::find(ranges::next(__first), __last, __value, __proj);
3615 if (__first == __last)
3616 return {__found, __first};
3622 template<forward_range _Range,
typename _Proj = identity,
3624 _GLIBCXX26_RANGE_ALGO_DEF_VAL_T(iterator_t<_Range>, _Proj)>
3625 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>,
const _Tp*>
3626 constexpr borrowed_subrange_t<_Range>
3627 operator()(_Range&& __r,
const _Tp& __value, _Proj __proj = {})
const
3628 {
return (*
this)(ranges::begin(__r), ranges::end(__r), __value,
std::move(__proj)); }
3631 inline constexpr __find_last_fn find_last{};
3633 struct __find_last_if_fn
3635 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
typename _Proj =
identity,
3636 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
3637 constexpr subrange<_Iter>
3638 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {})
const
3640 if constexpr (same_as<_Iter, _Sent> && bidirectional_iterator<_Iter>)
3642 _Iter __found = ranges::find_if(reverse_iterator<_Iter>{__last},
3643 reverse_iterator<_Iter>{__first},
3645 if (__found == __first)
3646 return {__last, __last};
3648 return {ranges::prev(__found), __last};
3652 _Iter __found = ranges::find_if(__first, __last, __pred, __proj);
3653 if (__found == __last)
3654 return {__found, __found};
3658 __first = ranges::find_if(ranges::next(__first), __last, __pred, __proj);
3659 if (__first == __last)
3660 return {__found, __first};
3666 template<forward_range _Range,
typename _Proj = identity,
3667 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
3668 constexpr borrowed_subrange_t<_Range>
3669 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
3670 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__pred),
std::move(__proj)); }
3673 inline constexpr __find_last_if_fn find_last_if{};
3675 struct __find_last_if_not_fn
3677 template<forward_iterator _Iter, sentinel_for<_Iter> _Sent,
typename _Proj =
identity,
3678 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
3679 constexpr subrange<_Iter>
3680 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {})
const
3682 if constexpr (same_as<_Iter, _Sent> && bidirectional_iterator<_Iter>)
3684 _Iter __found = ranges::find_if_not(reverse_iterator<_Iter>{__last},
3685 reverse_iterator<_Iter>{__first},
3687 if (__found == __first)
3688 return {__last, __last};
3690 return {ranges::prev(__found), __last};
3694 _Iter __found = ranges::find_if_not(__first, __last, __pred, __proj);
3695 if (__found == __last)
3696 return {__found, __found};
3700 __first = ranges::find_if_not(ranges::next(__first), __last, __pred, __proj);
3701 if (__first == __last)
3702 return {__found, __first};
3708 template<forward_range _Range,
typename _Proj = identity,
3709 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
3710 constexpr borrowed_subrange_t<_Range>
3711 operator()(_Range&& __r, _Pred __pred, _Proj __proj = {})
const
3712 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__pred),
std::move(__proj)); }
3715 inline constexpr __find_last_if_not_fn find_last_if_not{};
3719#if __glibcxx_ranges_fold >= 202207L
3721 template<
typename _Iter,
typename _Tp>
3722 struct in_value_result
3724 [[no_unique_address]] _Iter in;
3725 [[no_unique_address]] _Tp value;
3727 template<
typename _Iter2,
typename _Tp2>
3728 requires convertible_to<const _Iter&, _Iter2>
3729 && convertible_to<const _Tp&, _Tp2>
3731 operator in_value_result<_Iter2, _Tp2>() const &
3732 {
return {in, value}; }
3734 template<
typename _Iter2,
typename _Tp2>
3735 requires convertible_to<_Iter, _Iter2>
3736 && convertible_to<_Tp, _Tp2>
3738 operator in_value_result<_Iter2, _Tp2>() &&
3744 template<
typename _Fp>
3750 template<
typename _Tp,
typename _Up>
3751 requires invocable<_Fp&, _Up, _Tp>
3752 invoke_result_t<_Fp&, _Up, _Tp>
3753 operator()(_Tp&&, _Up&&);
3756 template<
typename _Fp,
typename _Tp,
typename _Iter,
typename _Up>
3757 concept __indirectly_binary_left_foldable_impl = movable<_Tp> && movable<_Up>
3758 && convertible_to<_Tp, _Up>
3759 && invocable<_Fp&, _Up, iter_reference_t<_Iter>>
3760 && assignable_from<_Up&, invoke_result_t<_Fp&, _Up, iter_reference_t<_Iter>>>;
3762 template<
typename _Fp,
typename _Tp,
typename _Iter>
3763 concept __indirectly_binary_left_foldable = copy_constructible<_Fp>
3764 && indirectly_readable<_Iter>
3765 && invocable<_Fp&, _Tp, iter_reference_t<_Iter>>
3766 && convertible_to<invoke_result_t<_Fp&, _Tp, iter_reference_t<_Iter>>,
3767 decay_t<invoke_result_t<_Fp&, _Tp, iter_reference_t<_Iter>>>>
3768 && __indirectly_binary_left_foldable_impl
3769 <_Fp, _Tp, _Iter, decay_t<invoke_result_t<_Fp&, _Tp, iter_reference_t<_Iter>>>>;
3771 template <
typename _Fp,
typename _Tp,
typename _Iter>
3772 concept __indirectly_binary_right_foldable
3773 = __indirectly_binary_left_foldable<__flipped<_Fp>, _Tp, _Iter>;
3776 template<
typename _Iter,
typename _Tp>
3777 using fold_left_with_iter_result = in_value_result<_Iter, _Tp>;
3779 struct __fold_left_with_iter_fn
3781 template<
typename _Ret_iter,
3782 typename _Iter,
typename _Sent,
typename _Tp,
typename _Fp>
3783 static constexpr auto
3784 _S_impl(_Iter __first, _Sent __last, _Tp __init, _Fp __f)
3786 using _Up = decay_t<invoke_result_t<_Fp&, _Tp, iter_reference_t<_Iter>>>;
3787 using _Ret = fold_left_with_iter_result<_Ret_iter, _Up>;
3789 if (__first == __last)
3793 for (++__first; __first != __last; ++__first)
3798 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
3799 typename _Tp _GLIBCXX26_DEF_VAL_T(iter_value_t<_Iter>),
3800 __detail::__indirectly_binary_left_foldable<_Tp, _Iter> _Fp>
3802 operator()(_Iter __first, _Sent __last, _Tp __init, _Fp __f)
const
3804 using _Ret_iter = _Iter;
3805 return _S_impl<_Ret_iter>(
std::move(__first), __last,
3809 template<input_range _Range,
3810 typename _Tp _GLIBCXX26_DEF_VAL_T(range_value_t<_Range>),
3811 __detail::__indirectly_binary_left_foldable<_Tp, iterator_t<_Range>> _Fp>
3813 operator()(_Range&& __r, _Tp __init, _Fp __f)
const
3815 using _Ret_iter = borrowed_iterator_t<_Range>;
3816 return _S_impl<_Ret_iter>(ranges::begin(__r), ranges::end(__r),
3821 inline constexpr __fold_left_with_iter_fn fold_left_with_iter{};
3823 struct __fold_left_fn
3825 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
3826 typename _Tp _GLIBCXX26_DEF_VAL_T(iter_value_t<_Iter>),
3827 __detail::__indirectly_binary_left_foldable<_Tp, _Iter> _Fp>
3829 operator()(_Iter __first, _Sent __last, _Tp __init, _Fp __f)
const
3831 return ranges::fold_left_with_iter(
std::move(__first), __last,
3835 template<input_range _Range,
3836 typename _Tp _GLIBCXX26_DEF_VAL_T(range_value_t<_Range>),
3837 __detail::__indirectly_binary_left_foldable<_Tp, iterator_t<_Range>> _Fp>
3839 operator()(_Range&& __r, _Tp __init, _Fp __f)
const
3840 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__init),
std::move(__f)); }
3843 inline constexpr __fold_left_fn fold_left{};
3845 template<
typename _Iter,
typename _Tp>
3846 using fold_left_first_with_iter_result = in_value_result<_Iter, _Tp>;
3848 struct __fold_left_first_with_iter_fn
3850 template<
typename _Ret_iter,
typename _Iter,
typename _Sent,
typename _Fp>
3851 static constexpr auto
3852 _S_impl(_Iter __first, _Sent __last, _Fp __f)
3854 using _Up =
decltype(ranges::fold_left(
std::move(__first), __last,
3855 iter_value_t<_Iter>(*__first), __f));
3856 using _Ret = fold_left_first_with_iter_result<_Ret_iter, optional<_Up>>;
3858 if (__first == __last)
3859 return _Ret{
std::move(__first), optional<_Up>()};
3861 optional<_Up> __init(in_place, *__first);
3862 for (++__first; __first != __last; ++__first)
3867 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
3868 __detail::__indirectly_binary_left_foldable<iter_value_t<_Iter>, _Iter> _Fp>
3869 requires constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>>
3871 operator()(_Iter __first, _Sent __last, _Fp __f)
const
3873 using _Ret_iter = _Iter;
3877 template<input_range _Range,
3878 __detail::__indirectly_binary_left_foldable<range_value_t<_Range>, iterator_t<_Range>> _Fp>
3879 requires constructible_from<range_value_t<_Range>, range_reference_t<_Range>>
3881 operator()(_Range&& __r, _Fp __f)
const
3883 using _Ret_iter = borrowed_iterator_t<_Range>;
3884 return _S_impl<_Ret_iter>(ranges::begin(__r), ranges::end(__r),
std::move(__f));
3888 inline constexpr __fold_left_first_with_iter_fn fold_left_first_with_iter{};
3890 struct __fold_left_first_fn
3892 template<input_iterator _Iter, sentinel_for<_Iter> _Sent,
3893 __detail::__indirectly_binary_left_foldable<iter_value_t<_Iter>, _Iter> _Fp>
3894 requires constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>>
3896 operator()(_Iter __first, _Sent __last, _Fp __f)
const
3898 return ranges::fold_left_first_with_iter(
std::move(__first), __last,
3902 template<input_range _Range,
3903 __detail::__indirectly_binary_left_foldable<range_value_t<_Range>, iterator_t<_Range>> _Fp>
3904 requires constructible_from<range_value_t<_Range>, range_reference_t<_Range>>
3906 operator()(_Range&& __r, _Fp __f)
const
3907 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__f)); }
3910 inline constexpr __fold_left_first_fn fold_left_first{};
3912 struct __fold_right_fn
3914 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
3915 typename _Tp _GLIBCXX26_DEF_VAL_T(iter_value_t<_Iter>),
3916 __detail::__indirectly_binary_right_foldable<_Tp, _Iter> _Fp>
3918 operator()(_Iter __first, _Sent __last, _Tp __init, _Fp __f)
const
3920 using _Up = decay_t<invoke_result_t<_Fp&, iter_reference_t<_Iter>, _Tp>>;
3922 if (__first == __last)
3925 _Iter __tail = ranges::next(__first, __last);
3927 while (__first != __tail)
3932 template<bidirectional_range _Range,
3933 typename _Tp _GLIBCXX26_DEF_VAL_T(range_value_t<_Range>),
3934 __detail::__indirectly_binary_right_foldable<_Tp, iterator_t<_Range>> _Fp>
3936 operator()(_Range&& __r, _Tp __init, _Fp __f)
const
3937 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__init),
std::move(__f)); }
3940 inline constexpr __fold_right_fn fold_right{};
3942 struct __fold_right_last_fn
3944 template<b
idirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
3945 __detail::__indirectly_binary_right_foldable<iter_value_t<_Iter>, _Iter> _Fp>
3946 requires constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>>
3948 operator()(_Iter __first, _Sent __last, _Fp __f)
const
3950 using _Up =
decltype(ranges::fold_right(__first, __last,
3951 iter_value_t<_Iter>(*__first), __f));
3953 if (__first == __last)
3954 return optional<_Up>();
3956 _Iter __tail = ranges::prev(ranges::next(__first,
std::move(__last)));
3957 return optional<_Up>(in_place,
3958 ranges::fold_right(
std::move(__first), __tail,
3959 iter_value_t<_Iter>(*__tail),
3963 template<bidirectional_range _Range,
3964 __detail::__indirectly_binary_right_foldable<range_value_t<_Range>, iterator_t<_Range>> _Fp>
3965 requires constructible_from<range_value_t<_Range>, range_reference_t<_Range>>
3967 operator()(_Range&& __r, _Fp __f)
const
3968 {
return (*
this)(ranges::begin(__r), ranges::end(__r),
std::move(__f)); }
3971 inline constexpr __fold_right_last_fn fold_right_last{};
3975 template<
typename _ForwardIterator>
3976 constexpr _ForwardIterator
3977 shift_left(_ForwardIterator __first, _ForwardIterator __last,
3978 typename iterator_traits<_ForwardIterator>::difference_type __n)
3980 __glibcxx_assert(__n >= 0);
3984 auto __mid = ranges::next(__first, __n, __last);
3985 if (__mid == __last)
3990 template<
typename _ForwardIterator>
3991 constexpr _ForwardIterator
3992 shift_right(_ForwardIterator __first, _ForwardIterator __last,
3993 typename iterator_traits<_ForwardIterator>::difference_type __n)
3995 __glibcxx_assert(__n >= 0);
4000 =
typename iterator_traits<_ForwardIterator>::iterator_category;
4001 if constexpr (derived_from<_Cat, bidirectional_iterator_tag>)
4003 auto __mid = ranges::next(__last, -__n, __first);
4004 if (__mid == __first)
4012 auto __result = ranges::next(__first, __n, __last);
4013 if (__result == __last)
4016 auto __dest_head = __first, __dest_tail = __result;
4017 while (__dest_head != __result)
4019 if (__dest_tail == __last)
4043 auto __cursor = __first;
4044 while (__cursor != __result)
4046 if (__dest_tail == __last)
4051 __dest_head =
std::move(__cursor, __result,
4057 std::iter_swap(__cursor, __dest_head);
4066_GLIBCXX_END_NAMESPACE_VERSION
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr __invoke_result< _Callable, _Args... >::type __invoke(_Callable &&__fn, _Args &&... __args) noexcept(__is_nothrow_invocable< _Callable, _Args... >::value)
Invoke a callable object.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
constexpr _BI2 move_backward(_BI1 __first, _BI1 __last, _BI2 __result)
Moves the range [first,last) into result.
constexpr const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
ISO C++ entities toplevel namespace is std.