// C++N4910 Committee Draft, Standard for Programming Language C++
// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/n4910.pdf
const char * n4910 = "27.8 Sorting and related operations [alg.sorting] C++N4910:2022 (662) p1223.cpp";
// Debian clang version 14.0.5-++20220610033153+c12386ae247c-
// g++ (GCC) 12.1.0 Copyright (C) 2022 Free Software Foundation, Inc.
// Edited by Dr. OGAWA Kiyoshi. Compile procedure and results record.
// C++N4910:2022 Standard Working Draft on ISO/IEC 14882(0) sample code compile list
// https://qiita.com/kaizen_nagoya/items/fc957ddddd402004bb91

#include "N4910.h"
using namespace std;

#define R int
// 27.8.1 General [alg.sorting.general]
// The operations in 27.8 defined directly in namespace std have two versions: one that takes a function object of type Compare and one that uses an operator<.
// Compare is a function object type (22.10) that meets the requirements for a template parameter named BinaryPredicate (27.2). The return value of the function call operation applied to an object of type Compare, when contextually converted to bool (7.3), yields true if the first argument of the call is less than the second, and false otherwise. Compare comp is used throughout for algorithms assuming an ordering relation.
// For all algorithms that take Compare, there is a version that uses operator< instead. That is, comp(*i, *j) != false defaults to *i < *j != false. For algorithms other than those described in 27.8.4, comp shall induce a strict weak ordering on the values.
// The term strict refers to the requirement of an irreflexive relation (!comp(x, x) for all x), and the term weak to requirements that are not as strong as those for a total ordering, but stronger than those for a partial ordering. If we define equiv(a, b) as !comp(a, b) && !comp(b, a), then the requirements are that comp and equiv both be transitive relations:
// — equiv(a, b) && equiv(b, c) implies equiv(a, c) [Note 1: Under these conditions, it can be shown that
//— comp(a, b) && comp(b, c) implies comp(a, c)
// — equiv is an equivalence relation,
// — comp induces a well-defined relation on the equivalence classes determined by equiv, and — the induced relation is a strict total ordering.
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: For the overloads in namespace std, RandomAccessIterator meets the Cpp17Value- Swappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Sorts the elements in the range [first, last) with respect to comp and proj. Returns: last for the overloads in namespace ranges.
Complexity: Let N be last - first. O(N log N) comparisons and projections.
// A sequence is sorted with respect to a comp and proj for a comparator and projection comp and proj if for every iterator i pointing to the sequence and every non-negative integer n such that i + n is a valid iterator pointing to an element of the sequence,
 bool(invoke(comp, invoke(proj, *(i + n)), invoke(proj, *i)))
is false.
// A sequence [start, finish) is partitioned with respect to an expression f(e) if there exists an integer n such
thatforall0 <= i < (finish - start),f(*(start + i))istrueifandonlyifi < n.
// In the descriptions of the functions that deal with ordering relationships we frequently use a notion of equivalence to describe concepts such as stability. The equivalence to which we refer is not necessarily an operator==, but an equivalence relation induced by the strict weak ordering. That is, two elements a and b are considered equivalent if and only if !(a < b) && !(b < a).
// 27.8.2.1 sort
template<class RandomAccessIterator>
constexpr void sort(RandomAccessIterator first, RandomAccessIterator last);
template<class ExecutionPolicy, class RandomAccessIterator>
void sort(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void sort(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
void sort(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::sort(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
[alg.sort] [sort]
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::sort(R&& r, Comp comp = {}, Proj proj = {});
// 27.8.2.2 stable_sort [stable.sort]
template<class RandomAccessIterator>
void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
template<class ExecutionPolicy, class RandomAccessIterator>
void stable_sort(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
void stable_sort(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
void stable_sort(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
borrowed_iterator_t<R>
ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: For the overloads in namespace std, RandomAccessIterator meets the Cpp17Value- Swappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Sorts the elements in the range [first, last) with respect to comp and proj.
// Returns: last for the overloads in namespace ranges.
// Complexity: Let N be last - first. If enough extra memory is available, N log(N) comparisons. Otherwise, at most N log2(N) comparisons. In either case, twice as many projections as the number of comparisons.
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: [first, middle) and [middle, last) are valid ranges. For the overloads in namespace std, RandomAccessIterator meets the Cpp17ValueSwappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Remarks: Stable (16.4.6.8).
// 7.8.2.3 partial_sort [partial.sort]
template<class RandomAccessIterator>
constexpr void partial_sort(RandomAccessIterator first,
 RandomAccessIterator middle,
 RandomAccessIterator last);
template<class ExecutionPolicy, class RandomAccessIterator>
void partial_sort(ExecutionPolicy&& exec,
 RandomAccessIterator first,
 RandomAccessIterator middle,
 RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void partial_sort(RandomAccessIterator first,
 RandomAccessIterator middle,
 RandomAccessIterator last,
 Compare comp);
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
void partial_sort(ExecutionPolicy&& exec,
 RandomAccessIterator first,
 RandomAccessIterator middle,
 RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {});
// Effects: Places the first middle - first elements from the range [first, last) as sorted with respect to comp and proj into the range [first, middle). The rest of the elements in the range [middle, last) are placed in an unspecified order.
// Returns: last for the overload in namespace ranges.
// Complexity: Approximately (last - first) * log(middle - first) comparisons, and twice as many projections.
class Proj1 = identity, class Proj2 = identity>
 requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
 sortable<iterator_t<R2>, Comp, Proj2> &&
 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
 projected<iterator_t<R2>, Proj2>>
 constexpr ranges::partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>>
 ranges::partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {},
Proj1 proj1 = {}, Proj2 proj2 = {});
// Let N be min(last - first, result_last - result_first). Let comp be less{}, and proj1 and proj2 be identity{} for the overloads with no parameters by those names.
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {});
// Effects: Equivalent to:
return ranges::partial_sort(ranges::begin(r), middle, ranges::end(r), comp, proj);
// 27.8.2.4 partial_sort_copy [partial.sort.copy]
template<class InputIterator, class RandomAccessIterator>
constexpr RandomAccessIterator
partial_sort_copy(InputIterator first, InputIterator last,
 RandomAccessIterator result_first,
 RandomAccessIterator result_last);
template<class ExecutionPolicy, class ForwardIterator, class RandomAccessIterator>
RandomAccessIterator
partial_sort_copy(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 RandomAccessIterator result_first,
 RandomAccessIterator result_last);
template<class InputIterator, class RandomAccessIterator,
 class Compare>
constexpr RandomAccessIterator
partial_sort_copy(InputIterator first, InputIterator last,
 RandomAccessIterator result_first,
 RandomAccessIterator result_last,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator, class RandomAccessIterator,
 class Compare>
RandomAccessIterator
partial_sort_copy(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 RandomAccessIterator result_first,
 RandomAccessIterator result_last,
 Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, random_access_iterator I2, sentinel_for<I2> S2,
 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> &&
indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
 constexpr ranges::partial_sort_copy_result<I1, I2>
 ranges::partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, random_access_range R2, class Comp = ranges::less,
// Mandates: For the overloads in namespace std, the expression *first is writable (25.3.1) to result_- first.
// Preconditions: For the overloads in namespace std, RandomAccessIterator meets the Cpp17Value- Swappable requirements (16.4.4.3), the type of *result_first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// For iterators a1 and b1 in [first, last), and iterators x2 and y2 in [result_first, result_last), after evaluating the assignment *y2 = *b1, let E be the value of
 bool(invoke(comp, invoke(proj1, *a1), invoke(proj2, *y2))).
// Then, after evaluating the assignment *x2 = *a1, E is equal to bool(invoke(comp, invoke(proj2, *x2), invoke(proj2, *y2))).
// [Note 1: Writing a value from the input range into the output range does not affect how it is ordered by comp and proj1 or proj2. —end note]
// Effects: Places the first N elements as sorted with respect to comp and proj2 into the range [result_- first,result_first + N).
// Returns:
// — result_first + N for the overloads in namespace std.
// — {last, result_first + N} for the overloads in namespace ranges.
// Complexity: Approximately (last - first) * log N comparisons, and twice as many projections.
// 27.8.2.5 is_sorted template<class ForwardIterator>
 [is.sorted]
 constexpr bool is_sorted(ForwardIterator first, ForwardIterator last);
Effects:
Equivalent to:
return is_sorted_until(first, last) == last;
template<class ExecutionPolicy, class ForwardIterator>
bool is_sorted(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last);
// Effects: Equivalent to:
return is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last) == last;
template<class ForwardIterator, class Compare>
constexpr bool is_sorted(ForwardIterator first, ForwardIterator last,
 Compare comp);
// Effects: Equivalent to: return is_sorted_until(first, last, comp) == last;
template<class ExecutionPolicy, class ForwardIterator, class Compare>
bool is_sorted(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 Compare comp);
// Effects: Equivalent to:
return is_sorted_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last;
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {});
template<forward_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {});
// Effects: Equivalent to: return ranges::is_sorted_until(first, last, comp, proj) == last;
template<class ForwardIterator>
constexpr ForwardIterator
is_sorted_until(ForwardIterator first, ForwardIterator last);
template<class ExecutionPolicy, class ForwardIterator>
ForwardIterator
is_sorted_until(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last);
template<class ForwardIterator, class Compare>
constexpr ForwardIterator
is_sorted_until(ForwardIterator first, ForwardIterator last,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator, class Compare>
ForwardIterator
is_sorted_until(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 Compare comp);
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {});
template<forward_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
constexpr borrowed_iterator_t<R>
ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names. Returns: The last iterator i in [first, last] for which the range [first, i) is sorted with respect to comp and proj. Complexity: Linear.
requires sortable<I, Comp, Proj>
constexpr I
ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: [first,nth) and [nth,last) are valid ranges. For the overloads in namespace std, RandomAccessIterator meets the Cpp17ValueSwappable requirements (16.4.4.3), and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) require-
ments.
// Effects: After nth_element the element in the position pointed to by nth is the element that would be in that position if the whole range were sorted with respect to comp and proj, unless nth == last. Also for every iterator i in the range [first, nth) and every iterator j in the range [nth, last) it holds that: bool(invoke(comp, invoke(proj, *j), invoke(proj, *i))) is false.
// 27.8.3 Nth element [alg.nth.element]
template<class RandomAccessIterator>
constexpr void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last);
template<class ExecutionPolicy, class RandomAccessIterator>
void nth_element(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void nth_element(RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last, Compare comp);
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
void nth_element(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last, Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
// Returns: last for the overload in namespace ranges.
ranges::less>
constexpr borrowed_iterator_t<R>
ranges::lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names. Preconditions: The elements e of [first, last) are partitioned with respect to the expression
bool(invoke(comp, invoke(proj, e), value)).
// Returns: The furthermost iterator i in the range [first,last] such that for every iterator j in the range [first, i), bool(invoke(comp, invoke(proj, *j), value)) is true. // Complexity: At most log2(last - first) + O(1) comparisons and projections.
// Complexity: For the overloads with no ExecutionPolicy, linear on average. For the overloads with an ExecutionPolicy, O(N) applications of the predicate, and O(N logN) swaps, where N = last - first.
// All of the algorithms in 27.8.4 are versions of binary search and assume that the sequence being searched is partitioned with respect to an expression formed by binding the search key to an argument of the comparison function. They work on non-random access iterators minimizing the number of comparisons, which will be logarithmic for all types of iterators. They are especially appropriate for random access iterators, because these algorithms do a logarithmic number of steps through the data structure. For non-random access iterators they execute a linear number of steps.
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {});
// Effects: Equivalent to:
return ranges::nth_element(ranges::begin(r), nth, ranges::end(r), comp, proj);
// 27.8.4 Binary search [alg.binary.search]
// 27.8.4.1 General [alg.binary.search.general]
// 27.8.4.2 lower_bound [lower.bound]
template<class ForwardIterator, class T>
constexpr ForwardIterator
lower_bound(ForwardIterator first, ForwardIterator last,
 const T& value);
template<class ForwardIterator, class T, class Compare>
constexpr ForwardIterator
lower_bound(ForwardIterator first, ForwardIterator last,
 const T& value, Compare comp);
template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::lower_bound(I first, S last, const T& value, Comp comp = {},
 Proj proj = {});
template<forward_range R, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
// 27.8.4.3 upper_bound [upper.bound]
 template<class ForwardIterator, class T>
 constexpr ForwardIterator
 upper_bound(ForwardIterator first, ForwardIterator last,
 const T& value);
template<class ForwardIterator, class T, class Compare>
constexpr ForwardIterator
upper_bound(ForwardIterator first, ForwardIterator last,
 const T& value, Compare comp);
ranges::less>
constexpr borrowed_subrange_t<R>
ranges::equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names.
// Preconditions: The elements e of [first,last) are partitioned with respect to the expressions bool(invoke(comp, invoke(proj, e), value)) and !bool(invoke(comp, value, invoke(proj, e))). Also, for all elements e of [first, last), bool(comp(e, value)) implies !bool(comp(value, e)) for the overloads in namespace std.
// Returns: — For the overloads in namespace std:
{ lower_bound(first, last, value, comp),
 upper_bound(first, last, value, comp)
}
// — For the overloads in namespace ranges: {ranges::lower_bound(first, last, value, comp, proj),
ranges::upper_bound(first, last, value, comp, proj)
}
// Complexity: At most 2 ∗ log2(last - first) + O(1) comparisons and projections.
template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
template<forward_range R, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
 ranges::less>
constexpr borrowed_iterator_t<R>
ranges::upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names. Preconditions: The elements e of [first, last) are partitioned with respect to the expression
!bool(invoke(comp, value, invoke(proj, e))).
// Returns: The furthermost iterator i in the range [first,last] such that for every iterator j in the range [first, i), !bool(invoke(comp, value, invoke(proj, *j))) is true. Complexity: At most log2(last - first) + O(1) comparisons and projections.
// 27.8.4.4 equal_range [equal.range]
template<class ForwardIterator, class T>
constexpr pair<ForwardIterator, ForwardIterator>
equal_range(ForwardIterator first,
 ForwardIterator last, const T& value);
template<class ForwardIterator, class T, class Compare>
constexpr pair<ForwardIterator, ForwardIterator>
equal_range(ForwardIterator first,
 ForwardIterator last, const T& value,
 Compare comp);
template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
constexpr subrange<I>
ranges::equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
template<forward_range R, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
// 27.8.4.5 binary_search [binary.search]
 template<class ForwardIterator, class T>
 constexpr bool
 binary_search(ForwardIterator first, ForwardIterator last,
 const T& value);
template<class ForwardIterator, class T, class Compare>
constexpr bool
binary_search(ForwardIterator first, ForwardIterator last,
 const T& value, Compare comp);
template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>
constexpr bool ranges::binary_search(I first, S last, const T& value, Comp comp = {},
 Proj proj = {});
template<forward_range R, class T, class Proj = identity,
 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
 ranges::less>
constexpr bool ranges::binary_search(R&& r, const T& value, Comp comp = {},
 Proj proj = {});
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names.
// Preconditions: The elements e of [first,last) are partitioned with respect to the expressions bool(invoke(comp, invoke(proj, e), value)) and !bool(invoke(comp, value, invoke(proj, e))). Also, for all elements e of [first, last), bool(comp(e, value)) implies !bool(comp(value, e)) for the overloads in namespace std.
// Returns: true if and only if for some iterator i in the range [first,last), !bool(invoke(comp, invoke(proj, *i), value)) && !bool(invoke(comp, value, invoke(proj, *i))) is true.
indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
 constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {});
// Let proj be identity{} for the overloads with no parameter named proj.
// Returns: true if and only if the elements e of [first,last) are partitioned with respect to the expression bool(invoke(pred, invoke(proj, e))).
// Complexity: Linear. At most last - first applications of pred and proj.
// Complexity: At most log2(last - first) + O(1) comparisons and projections.
// 27.8.5 Partitions [alg.partitions]
template<class InputIterator, class Predicate>
constexpr bool is_partitioned(InputIterator first, InputIterator last, Predicate pred);
template<class ExecutionPolicy, class ForwardIterator, class Predicate>
bool is_partitioned(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last, Predicate pred);
template<input_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_unary_predicate<projected<I, Proj>> Pred>
constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {});
template<input_range R, class Proj = identity,
 template<class ForwardIterator, class Predicate>
 constexpr ForwardIterator
 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
template<class ExecutionPolicy, class ForwardIterator, class Predicate>
ForwardIterator
partition(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last, Predicate pred);
template<permutable I, sentinel_for<I> S, class Proj = identity,
 indirect_unary_predicate<projected<I, Proj>> Pred>
constexpr subrange<I>
ranges::partition(I first, S last, Pred pred, Proj proj = {});
template<forward_range R, class Proj = identity,
 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
requires permutable<iterator_t<R>>
constexpr borrowed_subrange_t<R>
ranges::partition(R&& r, Pred pred, Proj proj = {});
// Let proj be identity{} for the overloads with no parameter named proj and let E(x) be bool(invoke( pred, invoke(proj, x))).
// Preconditions: For the overloads in namespace std, ForwardIterator meets the Cpp17ValueSwappable requirements (16.4.4.3).
// Effects: Places all the elements e in [first,last) that satisfy E(e) before all the elements that do not. Returns: Let i be an iterator such that E(*j) is true for every iterator j in [first,i) and false for every iterator j in [i, last).
// Returns: — i for the overloads in namespace std.
// — {i, last} for the overloads in namespace ranges.
// Complexity: Let N = last - first:
// — For the overload with no ExecutionPolicy, exactly N applications of the predicate and projection. At most N/2 swaps if the type of first meets the Cpp17BidirectionalIterator requirements for the overloads in namespace std or models bidirectional_iterator for the overloads in namespace ranges, and at most N swaps otherwise.
// — For the overload with an ExecutionPolicy, O(N logN) swaps and O(N) applications of the predicate.
indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
 requires permutable<iterator_t<R>>
 borrowed_subrange_t<R> ranges::stable_partition(R&& r, Pred pred, Proj proj = {});
Let proj be identity{} for the overloads with no parameter named proj and let E(x) be bool(invoke( pred, invoke(proj, x))).
// Preconditions: For the overloads in namespace std, BidirectionalIterator meets the Cpp17Value- Swappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Places all the elements e in [first,last) that satisfy E(e) before all the elements that do not. The relative order of the elements in both groups is preserved.
// Returns: Let i be an iterator such that for every iterator j in [first,i), E(*j) is true, and for every iterator j in the range [i,last), E(*j) is false. Returns:
// — i for the overloads in namespace std.
// — {i, last} for the overloads in namespace ranges. Complexity: Let N = last - first:
// — For the overloads with no ExecutionPolicy, at most N log N swaps, but only O (N ) swaps if there is enough extra memory. Exactly N applications of the predicate and projection.
// — For the overload with an ExecutionPolicy, O(N logN) swaps and O(N) applications of the predicate.
 template<class BidirectionalIterator, class Predicate>
 BidirectionalIterator
 stable_partition(BidirectionalIterator first, BidirectionalIterator last, Predicate pred);
template<class ExecutionPolicy, class BidirectionalIterator, class Predicate>
BidirectionalIterator
stable_partition(ExecutionPolicy&& exec,
 BidirectionalIterator first, BidirectionalIterator last, Predicate pred);
template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_unary_predicate<projected<I, Proj>> Pred>
requires permutable<I>
subrange<I> ranges::stable_partition(I first, S last, Pred pred, Proj proj = {});
template<bidirectional_range R, class Proj = identity,
 template<class InputIterator, class OutputIterator1, class OutputIterator2, class Predicate>
 constexpr pair<OutputIterator1, OutputIterator2>
 partition_copy(InputIterator first, InputIterator last,
 OutputIterator1 out_true, OutputIterator2 out_false, Predicate pred);
template<class ExecutionPolicy, class ForwardIterator, class ForwardIterator1,
 class ForwardIterator2, class Predicate>
pair<ForwardIterator1, ForwardIterator2>
partition_copy(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 ForwardIterator1 out_true, ForwardIterator2 out_false, Predicate pred);
template<input_iterator I, sentinel_for<I> S, weakly_incrementable O1, weakly_incrementable O2,
 class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
constexpr ranges::partition_copy_result<I, O1, O2>
ranges::partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
 Proj proj = {});
template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
 class Proj = identity,
 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
requires indirectly_copyable<iterator_t<R>, O1> &&
indirectly_copyable<iterator_t<R>, O2>
constexpr ranges::partition_copy_result<borrowed_iterator_t<R>, O1, O2>
ranges::partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {});
// Let proj be identity{} for the overloads with no parameter named proj and let E(x) be bool(invoke( pred, invoke(proj, x))).
// Mandates: For the overloads in namespace std, the expression *first is writable (25.3.1) to out_true and out_false.
// Preconditions: The input range and output ranges do not overlap.
// [Note 1: For the overload with an ExecutionPolicy, there might be a performance cost if first’s value type does not meet the Cpp17CopyConstructible requirements.
// Effects: For each iterator i in [first, last), copies *i to the output range beginning with out_true if E(*i) is true, or to the output range beginning with out_false otherwise.
// Returns: Let o1 be the end of the output range beginning at out_true, and o2 the end of the output range beginning at out_false. Returns
// — {o1, o2} for the overloads in namespace std.
// — {last, o1, o2} for the overloads in namespace ranges.
// Complexity: Exactly last - first applications of pred and proj.
indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
 constexpr borrowed_iterator_t<R>
 ranges::partition_point(R&& r, Pred pred, Proj proj = {});
// Let proj be identity{} for the overloads with no parameter named proj and let E(x) be bool(invoke( pred, invoke(proj, x))).
// Preconditions: The elements e of [first,last) are partitioned with respect to E(e).
// Returns: An iterator mid such that E(*i) is true for all iterators i in [first,mid), and false for all iterators i in [mid, last).
// Complexity: O(log(last - first)) applications of pred and proj.
template<class ForwardIterator, class Predicate>
constexpr ForwardIterator
partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_unary_predicate<projected<I, Proj>> Pred>
constexpr I ranges::partition_point(I first, S last, Pred pred, Proj proj = {});
template<forward_range R, class Proj = identity,
// 27.8.6 Merge [alg.merge]
 template<class InputIterator1, class InputIterator2,
 class OutputIterator>
 constexpr OutputIterator
 merge(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator>
ForwardIterator
merge(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result);
template<class InputIterator1, class InputIterator2,
 class OutputIterator, class Compare>
constexpr OutputIterator
merge(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result, Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator, class Compare>
ForwardIterator
merge(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result, Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity,
 class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr ranges::merge_result<I1, I2, O>
ranges::merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less,
 class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr ranges::merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
ranges::merge(R1&& r1, R2&& r2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
// Let N be (last1 - first1) + (last2 - first2). Let comp be less{}, proj1 be identity{}, and proj2 be identity{}, for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively. The resulting range does not overlap with either of the original ranges.
// Effects: Copies all the elements of the two ranges [first1, last1) and [first2, last2) into the range [result,result_last), where result_last is result + N. If an element a precedes b in an input range, a is copied into the output range before b. If e1 is an element of [first1,last1) and e2 of [first2,last2), e2 is copied into the output range before e1 if and only if bool(invoke(comp, invoke(proj2, e2), invoke(proj1, e1))) is true.
// Returns: — result_last for the overloads in namespace std.
// — {last1, last2, result_last} for the overloads in namespace ranges.
// Complexity :— For the overloads with no ExecutionPolicy, at most N // − 1 comparisons and applications of each projection.
// — For the overloads with an ExecutionPolicy, O(N) comparisons.
// Remarks: Stable (16.4.6.8).
template<class BidirectionalIterator>
void inplace_merge(BidirectionalIterator first,
 BidirectionalIterator middle,
 BidirectionalIterator last);
template<class ExecutionPolicy, class BidirectionalIterator>
void inplace_merge(ExecutionPolicy&& exec,
 BidirectionalIterator first,
 BidirectionalIterator middle,
 BidirectionalIterator last);
template<class BidirectionalIterator, class Compare>
void inplace_merge(BidirectionalIterator first,
 BidirectionalIterator middle,
 BidirectionalIterator last, Compare comp);
template<class ExecutionPolicy, class BidirectionalIterator, class Compare>
void inplace_merge(ExecutionPolicy&& exec,
 BidirectionalIterator first,
 BidirectionalIterator middle,
 BidirectionalIterator last, Compare comp);
template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
I ranges::inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: [first,middle) and [middle,last) are valid ranges sorted with respect to comp and proj. For the overloads in namespace std, BidirectionalIterator meets the Cpp17ValueSwappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Merges two sorted consecutive ranges [first, middle) and [middle, last), putting the result of the merge into the range [first, last). The resulting range is sorted with respect to comp and proj. Returns: last for the overload in namespace ranges.
// Complexity: Let N = last - first:
// — For the overloads with no ExecutionPolicy, and if enough additional memory is available, exactly N − 1 comparisons.
// — Otherwise, O(N logN) comparisons.
// In either case, twice as many projections as comparisons. Remarks: Stable (16.4.6.8).
// Subclause 27.8.7 defines all the basic set operations on sorted structures. They also work with multisets (24.4.7) containing multiple copies of equivalent elements. The semantics of the set operations are generalized to multisets in a standard way by defining set_union to contain the maximum number of occurrences of every element, set_intersection to contain the minimum, and so on.
// 27.8.7.2 includes [includes]
template<class InputIterator1, class InputIterator2>
constexpr bool includes(InputIterator1 first1, InputIterator1 last1,
 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>
 requires sortable<iterator_t<R>, Comp, Proj>
 borrowed_iterator_t<R>
 ranges::inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {});
// Effects: Equivalent to:
 return ranges::inplace_merge(ranges::begin(r), middle, ranges::end(r), comp, proj);
// 27.8.7 Set operations on sorted structures [alg.set.operations]
// 27.8.7.1 General [alg.set.operations.general]
 InputIterator2 first2, InputIterator2 last2);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2>
bool includes(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2);
template<class InputIterator1, class InputIterator2, class Compare>
constexpr bool includes(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Compare>
bool includes(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 class Proj1 = identity, class Proj2 = identity,
 indirect_strict_weak_order<projected<I1, Proj1>,
 projected<I2, Proj2>> Comp = ranges::less>
constexpr bool ranges::includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, class Proj1 = identity,
 class Proj2 = identity,
 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
constexpr bool ranges::includes(R1&& r1, R2&& r2, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
// Let comp be less{}, proj1 be identity{}, and proj2 be identity{}, for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively.
// Returns: true if and only if [first2, last2) is a subsequence of [first1, last1).
// [Note 1: A sequence S is a subsequence of another sequence T if S can be obtained from T by removing some, all, or none of T’s elements and keeping the remaining elements in the same order.
// Complexity: At most 2 * ((last1 - first1) + (last2 - first2)) - 1 comparisons and applica-tions of each projection.
// 27.8.7.3 set_union [set.union]
template<class InputIterator1, class InputIterator2, class OutputIterator>
constexpr OutputIterator
set_union(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator>
ForwardIterator
set_union(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result);
template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
constexpr OutputIterator
set_union(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result, Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator, class Compare>
ForwardIterator
set_union(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result, Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 weakly_incrementable O, class Comp = ranges::less,
 class Proj1 = identity, class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr ranges::set_union_result<I1, I2, O>
ranges::set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, weakly_incrementable O,
 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr ranges::set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
ranges::set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
// Let comp be less{}, and proj1 and proj2 be identity{} for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively. The resulting range does not overlap with either of the original ranges.
// Effects: Constructs a sorted union of the elements from the two ranges; that is, the set of elements that are present in one or both of the ranges.
// Returns: Let result_last be the end of the constructed range. Returns
// — result_last for the overloads in namespace std.
// — {last1, last2, result_last} for the overloads in namespace ranges.
// Complexity: At most 2 * ((last1 - first1) + (last2 - first2)) - 1 comparisons and applica- tions of each projection.
// Remarks: Stable (16.4.6.8). If [first1, last1) contains m elements that are equivalent to each other and [first2, last2) contains n elements that are equivalent to them, then all m elements from the first range are copied to the output range, in order, and then the final max(n − m, 0) elements from the second range are copied to the output range, in order.
// 27.8.7.4 set_intersection [set.intersection]
template<class InputIterator1, class InputIterator2,
 class OutputIterator>
constexpr OutputIterator
set_intersection(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator>
ForwardIterator
set_intersection(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result);
template<class InputIterator1, class InputIterator2,
 class OutputIterator, class Compare>
constexpr OutputIterator
set_intersection(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result, Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator, class Compare>
ForwardIterator
set_intersection(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
 constexpr ranges::set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
 ranges::set_intersection(R1&& r1, R2&& r2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
// Let comp be less{}, and proj1 and proj2 be identity{} for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively. The resulting range does not overlap with either of the original ranges.
// Effects: Constructs a sorted intersection of the elements from the two ranges; that is, the set of elements that are present in both of the ranges.
// Returns: Let result_last be the end of the constructed range. Returns
// — result_last for the overloads in namespace std.
// — {last1, last2, result_last} for the overloads in namespace ranges.
// Complexity: At most 2 * ((last1 - first1) + (last2 - first2)) - 1 comparisons and applica- tions of each projection.
// Remarks: Stable (16.4.6.8). If [first1, last1) contains m elements that are equivalent to each other and [first2, last2) contains n elements that are equivalent to them, the first min(m, n) elements are copied from the first range to the output range, in order.
 ForwardIterator result, Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 weakly_incrementable O, class Comp = ranges::less,
 class Proj1 = identity, class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr ranges::set_intersection_result<I1, I2, O>
ranges::set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, weakly_incrementable O,
 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
// 27.8.7.5 set_difference [set.difference]
template<class InputIterator1, class InputIterator2,
 class OutputIterator>
constexpr OutputIterator
set_difference(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator>
ForwardIterator
set_difference(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result);
template<class InputIterator1, class InputIterator2,
 class OutputIterator, class Compare>
constexpr OutputIterator
set_difference(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result, Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator, class Compare>
ForwardIterator
set_difference(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result, Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 weakly_incrementable O, class Comp = ranges::less,
 class Proj1 = identity, class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr ranges::set_difference_result<I1, O>
ranges::set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, weakly_incrementable O,
 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr ranges::set_difference_result<borrowed_iterator_t<R1>, O>
ranges::set_difference(R1&& r1, R2&& r2, O result,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
// Let comp be less{}, and proj1 and proj2 be identity{} for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively. The resulting range does not overlap with either of the original ranges.
// Effects: Copies the elements of the range [first1, last1) which are not present in the range [first2, last2) to the range beginning at result. The elements in the constructed range are sorted.
// Returns: Let result_last be the end of the constructed range. Returns // — result_last for the overloads in namespace std.
// — {last1, result_last} for the overloads in namespace ranges.
// Complexity: At most 2 * ((last1 - first1) + (last2 - first2)) - 1 comparisons and applica- tions of each projection.
// Remarks: If [first1, last1) contains m elements that are equivalent to each other and [first2, last2) contains n elements that are equivalent to them, the last max(m − n, 0) elements from [first1, last1) is copied to the output range, in order.
// 27.8.7.6 set_symmetric_difference [set.symmetric.difference]
template<class InputIterator1, class InputIterator2,
 class OutputIterator>
constexpr OutputIterator
set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator>
ForwardIterator
set_symmetric_difference(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result);
template<class InputIterator1, class InputIterator2,
 class OutputIterator, class Compare>
constexpr OutputIterator
set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 OutputIterator result, Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class ForwardIterator, class Compare>
ForwardIterator
set_symmetric_difference(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 ForwardIterator result, Compare comp);
// — With N = b - a, for all i, 0 < i < N, bool(invoke(comp, invoke(proj, a[􏰅i−1􏰆]), invoke( proj, a[i]))) is false.
// — *a may be removed by pop_heap, or a new element added by push_heap, in O(logN) time.
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 weakly_incrementable O, class Comp = ranges::less,
 class Proj1 = identity, class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr ranges::set_symmetric_difference_result<I1, I2, O>
ranges::set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result,
 Comp comp = {}, Proj1 proj1 = {},
 Proj2 proj2 = {});
template<input_range R1, input_range R2, weakly_incrementable O,
 class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr ranges::set_symmetric_difference_result<borrowed_iterator_t<R1>,
 borrowed_iterator_t<R2>, O>
ranges::set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
// Let comp be less{}, and proj1 and proj2 be identity{} for the overloads with no parameters by those names.
// Preconditions: The ranges [first1, last1) and [first2, last2) are sorted with respect to comp and proj1 or proj2, respectively. The resulting range does not overlap with either of the original ranges.
// Effects: Copies the elements of the range [first1, last1) that are not present in the range [first2, last2), and the elements of the range [first2, last2) that are not present in the range [first1, last1) to the range beginning at result. The elements in the constructed range are sorted.
// Returns: Let result_last be the end of the constructed range. Returns
// — result_last for the overloads in namespace std.
// — {last1, last2, result_last} for the overloads in namespace ranges.
// Complexity: At most 2 * ((last1 - first1) + (last2 - first2)) - 1 comparisons and applica- tions of each projection.
// Remarks: Stable (16.4.6.8). If [first1, last1) contains m elements that are equivalent to each other and [first2, last2) contains n elements that are equivalent to them, then |m − n| of those elements shall be copied to the output range: the last m − n of these elements from [first1, last1) if m > n, and the last n − m of these elements from [first2, last2) if m < n. In either case, the elements are copied in order.
// A random access range [a, b) is a heap with respect to comp and proj for a comparator and projection comp and proj if its elements are organized such that:
// 27.8.8 Heap operations [alg.heap.operations]
// 27.8.8.1 General [alg.heap.operations.general]
// These properties make heaps useful as priority queues.
// make_heap converts a range into a heap and sort_heap turns a heap into a sorted sequence.
// 27.8.8.2 push_heap [push.heap]
template<class RandomAccessIterator>
constexpr void push_heap(RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void push_heap(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: The range [first, last - 1) is a valid heap with respect to comp and proj. For the overloads in namespace std, the type of *first meets the Cpp17MoveConstructible requirements
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: The range [first,last) is a valid non-empty heap with respect to comp and proj. For the overloads in namespace std, RandomAccessIterator meets the Cpp17ValueSwappable re- quirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Swaps the value in the location first with the value in the location last - 1 and makes
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// (Table 30) and the Cpp17MoveAssignable requirements (Table 32).
// Effects: Places the value in the location last - 1 into the resulting heap [first, last). Returns: last for the overloads in namespace ranges.
// Complexity: At most log(last - first) comparisons and twice as many projections.
// 27.8.8.3 pop_heap [pop.heap]
template<class RandomAccessIterator>
constexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {});
// [first, last - 1) into a heap with respect to comp and proj.
// Returns: last for the overloads in namespace ranges.
// Complexity: At most 2log(last - first) comparisons and twice as many projections.
// 27.8.8.4 make_heap [make.heap]
template<class RandomAccessIterator>
constexpr void make_heap(RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void make_heap(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {});
// Preconditions: For the overloads in namespace std, the type of *first meets the Cpp17Move- Constructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Constructs a heap with respect to comp and proj out of the range [first, last). Returns: last for the overloads in namespace ranges.
// Complexity: At most 3(last - first) comparisons and twice as many projections.
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
// Preconditions: The range [first, last) is a valid heap with respect to comp and proj. For the overloads in namespace std, RandomAccessIterator meets the Cpp17ValueSwappable requirements (16.4.4.3) and the type of *first meets the Cpp17MoveConstructible (Table 30) and Cpp17MoveAssignable (Table 32) requirements.
// Effects: Sorts elements in the heap [first, last) with respect to comp and proj.
// Returns: last for the overloads in namespace ranges.
// Complexity: At most 2N log N comparisons, where N = last - first, and twice as many projections.
// 27.8.8.5 sort_heap [sort.heap]
template<class RandomAccessIterator>
constexpr void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr I
ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Comp = ranges::less, class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr borrowed_iterator_t<R>
ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {});
// 27.8.8.6 is_heap [is.heap]
template<class RandomAccessIterator>
constexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last);
// Effects: Equivalent to: return is_heap_until(first, last) == last;
template<class ExecutionPolicy, class RandomAccessIterator>
bool is_heap(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last);
// Effects: Equivalent to:
return is_heap_until(std::forward<ExecutionPolicy>(exec), first, last) == last;
template<class RandomAccessIterator, class Compare>
constexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
// Effects: Equivalent to: return is_heap_until(first, last, comp) == last;
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
bool is_heap(ExecutionPolicy&& exec, RandomAccessIterator first, RandomAccessIterator last, Compare comp);
// Effects: Equivalent to:
return is_heap_until(std::forward<ExecutionPolicy>(exec), first, last, comp) == last;
template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr bool ranges::is_heap(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
constexpr bool ranges::is_heap(R&& r, Comp comp = {}, Proj proj = {});
// Effects: Equivalent to: return ranges::is_heap_until(first, last, comp, proj) == last;
indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
 constexpr borrowed_iterator_t<R>
 ranges::is_heap_until(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names. Returns: The last iterator i in [first, last] for which the range [first, i) is a heap with respect to
constexpr const T& ranges::min(const T& a, const T& b, Comp comp = {}, Proj proj = {});
// Preconditions: For the first form, T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: The smaller value. Returns the first argument when the arguments are equivalent.
// Complexity: Exactly one comparison and two applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the overloads in namespace std.
template<class RandomAccessIterator>
constexpr RandomAccessIterator
is_heap_until(RandomAccessIterator first, RandomAccessIterator last);
template<class ExecutionPolicy, class RandomAccessIterator>
RandomAccessIterator
is_heap_until(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last);
template<class RandomAccessIterator, class Compare>
constexpr RandomAccessIterator
is_heap_until(RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
RandomAccessIterator
is_heap_until(ExecutionPolicy&& exec,
 RandomAccessIterator first, RandomAccessIterator last,
 Compare comp);
template<random_access_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::is_heap_until(I first, S last, Comp comp = {}, Proj proj = {});
template<random_access_range R, class Proj = identity,
// comp and proj. Complexity: Linear.
// 27.8.9 Minimum and maximum [alg.min.max]
 template<class T>
 constexpr const T& min(const T& a, const T& b);
template<class T, class Compare>
constexpr const T& min(const T& a, const T& b, Compare comp);
template<class T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
template<class T>
constexpr T min(initializer_list<T> r);
template<class T, class Compare>
constexpr T min(initializer_list<T> r, Compare comp);
template<copyable T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
constexpr T ranges::min(initializer_list<T> r, Comp comp = {}, Proj proj = {});
template<input_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
constexpr range_value_t<R>
ranges::min(R&& r, Comp comp = {}, Proj proj = {});
// Preconditions: ranges::distance(r) > 0. For the overloads in namespace std, T meets the Cpp17- CopyConstructible requirements. For the first form, T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: The smallest value in the input range. Returns a copy of the leftmost element when several elements are equivalent to the smallest.
// Complexity: Exactly ranges::distance(r) - 1 comparisons and twice as many applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the overloads in namespace std.
indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
 constexpr range_value_t<R>
 ranges::max(R&& r, Comp comp = {}, Proj proj = {});
// Preconditions: ranges::distance(r) > 0. For the overloads in namespace std, T meets the Cpp17- CopyConstructible requirements. For the first form, T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: The largest value in the input range. Returns a copy of the leftmost element when several elements are equivalent to the largest.
// Complexity: Exactly ranges::distance(r) - 1 comparisons and twice as many applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the overloads in namespace std.
template<class T>
constexpr const T& max(const T& a, const T& b);
template<class T, class Compare>
constexpr const T& max(const T& a, const T& b, Compare comp);
template<class T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
constexpr const T& ranges::max(const T& a, const T& b, Comp comp = {}, Proj proj = {});
// Preconditions: For the first form, T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: The larger value. Returns the first argument when the arguments are equivalent.
// Complexity: Exactly one comparison and two applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the overloads in namespace std.
template<class T>
constexpr T max(initializer_list<T> r);
template<class T, class Compare>
constexpr T max(initializer_list<T> r, Compare comp);
template<copyable T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
constexpr T ranges::max(initializer_list<T> r, Comp comp = {}, Proj proj = {});
template<input_range R, class Proj = identity,
 template<class T>
 constexpr pair<const T&, const T&> minmax(const T& a, const T& b);
template<class T, class Compare>
constexpr pair<const T&, const T&> minmax(const T& a, const T& b, Compare comp);
template<class T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
constexpr ranges::minmax_result<const T&>
ranges::minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {});
// Preconditions: For the first form, T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: {b, a} if b is smaller than a, and {a, b} otherwise.
// Complexity: Exactly one comparison and two applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the overloads in namespace std.
requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
constexpr ranges::minmax_result<range_value_t<R>>
 ranges::minmax(R&& r, Comp comp = {}, Proj proj = {});
// Preconditions: ranges::distance(r) > 0. For the overloads in namespace std, T meets the Cpp17- CopyConstructible requirements. For the first form, type T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: Let X be the return type. Returns X{x, y}, where x is a copy of the leftmost element with the smallest value and y a copy of the rightmost element with the largest value in the input range. Complexity: At most (3/2)ranges::distance(r) applications of the corresponding predicate and twice as many applications of the projection, if any.
// Remarks: An invocation may explicitly specify an argument for the template parameter T of the
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names.
template<class T>
constexpr pair<T, T> minmax(initializer_list<T> t);
template<class T, class Compare>
constexpr pair<T, T> minmax(initializer_list<T> t, Compare comp);
template<copyable T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
constexpr ranges::minmax_result<T>
ranges::minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {});
template<input_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
// overloads in namespace std.
template<class ForwardIterator>
constexpr ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
template<class ExecutionPolicy, class ForwardIterator>
ForwardIterator min_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last);
template<class ForwardIterator, class Compare>
constexpr ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator, class Compare>
ForwardIterator min_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last, Compare comp);
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::min_element(I first, S last, Comp comp = {}, Proj proj = {});
template<forward_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
constexpr borrowed_iterator_t<R>
ranges::min_element(R&& r, Comp comp = {}, Proj proj = {});
// Returns: The first iterator i in the range [first,last) such that for every iterator j in the range [first, last),
bool(invoke(comp, invoke(proj, *j), invoke(proj, *i)))
// is false. Returns last if first == last.
// Complexity: Exactly max(last - first - 1,0) comparisons and twice as many projections.
indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
 constexpr borrowed_iterator_t<R>
 ranges::max_element(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for the overloads with no parameters by those names. Returns: The first iterator i in the range [first,last) such that for every iterator j in the range [first, last),
bool(invoke(comp, invoke(proj, *i), invoke(proj, *j)))
// is false. Returns last if first == last.
// Complexity: Exactly max(last - first - 1,0) comparisons and twice as many projections.
constexpr ranges::minmax_result<borrowed_iterator_t<R>>
 ranges::minmax_element(R&& r, Comp comp = {}, Proj proj = {});
// Returns: {first, first} if [first, last) is empty, otherwise {m, M}, where m is the first iterator in [first, last) such that no iterator in the range refers to a smaller element, and where M is the last
template<class ForwardIterator>
constexpr ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
template<class ExecutionPolicy, class ForwardIterator>
ForwardIterator max_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last);
template<class ForwardIterator, class Compare>
constexpr ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator, class Compare>
ForwardIterator max_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last,
 Compare comp);
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {});
template<forward_range R, class Proj = identity,
 template<class ForwardIterator>
 constexpr pair<ForwardIterator, ForwardIterator>
 minmax_element(ForwardIterator first, ForwardIterator last);
template<class ExecutionPolicy, class ForwardIterator>
pair<ForwardIterator, ForwardIterator>
minmax_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last);
template<class ForwardIterator, class Compare>
constexpr pair<ForwardIterator, ForwardIterator>
minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
template<class ExecutionPolicy, class ForwardIterator, class Compare>
pair<ForwardIterator, ForwardIterator>
minmax_element(ExecutionPolicy&& exec,
 ForwardIterator first, ForwardIterator last, Compare comp);
template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
constexpr ranges::minmax_result<I>
ranges::minmax_element(I first, S last, Comp comp = {}, Proj proj = {});
template<forward_range R, class Proj = identity,
 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
// iterator224 in [first, last) such that no iterator in the range refers to a larger element.
// Complexity: Let N be last - first. At most max(􏰅 3 (N − 1)􏰆, 0) comparisons and twice as many
constexpr const T&
ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {});
// Let comp be less{} for the overloads with no parameter comp, and let proj be identity{} for the overloads with no parameter proj.
// Preconditions: bool(invoke(comp, invoke(proj, hi), invoke(proj, lo))) is false. For the first form, type T meets the Cpp17LessThanComparable requirements (Table 28).
// Returns: lo if bool(invoke(comp, invoke(proj, v), invoke(proj, lo))) is true, hi if bool( invoke(comp, invoke(proj, hi), invoke(proj, v))) is true, otherwise v.
// [Note 1: If NaN is avoided, T can be a floating-point type.
// Complexity: At most two comparisons and three applications of the projection.
// applications of the projection, if any.
// 27.8.10 Bounded value [alg.clamp]
template<class T>
constexpr const T& clamp(const T& v, const T& lo, const T& hi);
template<class T, class Compare>
constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp);
template<class T, class Proj = identity,
 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
// 27.8.11 Lexicographical comparison [alg.lex.comparison]
template<class InputIterator1, class InputIterator2>
constexpr bool
lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2>
bool
lexicographical_compare(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2);
template<class InputIterator1, class InputIterator2, class Compare>
constexpr bool
lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
 InputIterator2 first2, InputIterator2 last2,
 Compare comp);
template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
 class Compare>
bool
lexicographical_compare(ExecutionPolicy&& exec,
 ForwardIterator1 first1, ForwardIterator1 last1,
 ForwardIterator2 first2, ForwardIterator2 last2,
 Compare comp);
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
 class Proj1 = identity, class Proj2 = identity,
 indirect_strict_weak_order<projected<I1, Proj1>,
 projected<I2, Proj2>> Comp = ranges::less>
constexpr bool
ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2,
 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
template<input_range R1, input_range R2, class Proj1 = identity,
 class Proj2 = identity,
 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
constexpr bool
ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {},
 Proj1 proj1 = {}, Proj2 proj2 = {});
// Returns: true if and only if the sequence of elements defined by the range [first1, last1) is lexico- graphically less than the sequence of elements defined by the range [first2, last2).
// Complexity: At most 2min(last1 - first1, last2 - first2) applications of the corresponding comparison and each projection, if any.
// Remarks: If two sequences have the same number of elements and their corresponding elements (if any) are equivalent, then neither sequence is lexicographically less than the other. If one sequence is a proper prefix of the other, then the shorter sequence is lexicographically less than the longer sequence. Otherwise, the lexicographical comparison of the sequences yields the same result as the comparison of the first corresponding pair of elements that are not equivalent.
// [Example 1: ranges::lexicographical_compare(I1, S1, I2, S2, Comp, Proj1, Proj2) can be implemen- ted as:
for ( ; first1 != last1 && first2 != last2 ; ++first1, (void) ++first2) {
 if (invoke(comp, invoke(proj1, *first1), invoke(proj2, *first2))) return true;
 if (invoke(comp, invoke(proj2, *first2), invoke(proj1, *first1))) return false;
}
return first1 == last1 && first2 != last2;
// [Note 1 : An empty sequence is lexicographically less than any non-empty sequence, but not less than any empty sequence.
// 27.8.12 Three-way comparison algorithms [alg.three.way]
template<class InputIterator1, class InputIterator2, class Cmp>
constexpr auto
lexicographical_compare_three_way(InputIterator1 b1, InputIterator1 e1,
 InputIterator2 b2, InputIterator2 e2,
 Cmp comp)
-> decltype(comp(*b1, *b2));
// Let N be min(e1 - b1, e2 - b2). Let E(n) be comp(*(b1 + n), *(b2 + n)).
// Mandates: decltype(comp(*b1, *b2)) is a comparison category type.
// Returns: E(i), where i is the smallest integer in [0,N) such that E(i) != 0 is true, or (e1 - b1) <=> (e2 - b2) if no such integer exists.
// Complexity: At most N applications of comp.
template<class InputIterator1, class InputIterator2>
constexpr auto
lexicographical_compare_three_way(InputIterator1 b1, InputIterator1 e1,
 InputIterator2 b2, InputIterator2 e2);
// Effects: Equivalent to:
return lexicographical_compare_three_way(b1, e1, b2, e2, compare_three_way());
// 27.8.13 Permutation generators [alg.permutation.generators]
template<class BidirectionalIterator>
constexpr bool next_permutation(BidirectionalIterator first,
 BidirectionalIterator last);
template<class BidirectionalIterator, class Compare>
constexpr bool next_permutation(BidirectionalIterator first,
 BidirectionalIterator last, Compare comp);
template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less,
 class Proj = identity>
requires sortable<I, Comp, Proj>
constexpr ranges::next_permutation_result<I>
ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {});
template<bidirectional_range R, class Comp = ranges::less,
 class Proj = identity>
requires sortable<iterator_t<R>, Comp, Proj>
constexpr ranges::next_permutation_result<borrowed_iterator_t<R>>
ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {});
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names. Preconditions: For the overloads in namespace std, BidirectionalIterator meets the Cpp17Value- Swappable requirements (16.4.4.3).
// Effects: Takes a sequence defined by the range [first, last) and transforms it into the next permutation. The next permutation is found by assuming that the set of all permutations is lexicographically sorted with respect to comp and proj. If no such permutation exists, transforms the sequence into the first permutation; that is, the ascendingly-sorted one.
// Returns: Let B be true if a next permutation was found and otherwise false. Returns: — B for the overloads in namespace std.
// — { last, B } for the overloads in namespace ranges.
// Complexity: At most (last - first) / 2 swaps.
// Let comp be less{} and proj be identity{} for overloads with no parameters by those names. Preconditions: For the overloads in namespace std, BidirectionalIterator meets the Cpp17Value- Swappable requirements (16.4.4.3).
// Effects: Takes a sequence defined by the range [first,last) and transforms it into the previous permutation. The previous permutation is found by assuming that the set of all permutations is lexicographically sorted with respect to comp and proj. If no such permutation exists, transforms the sequence into the last permutation; that is, the descendingly-sorted one.
// Returns: Let B be true if a previous permutation was found and otherwise false. Returns: — B for the overloads in namespace std.
// — { last, B } for the overloads in namespace ranges.
// Complexity: At most (last - first) / 2 swaps.
int main() {
 cout << n4910 << endl;
 return EXIT_SUCCESS;
}