26 Algorithms library [algorithms]

26.4 Header synopsis [algorithm.syn]

// mostly freestanding#include <initializer_list> // see [initializer.list.syn]namespace std {namespace ranges {// [algorithms.results], algorithm result typestemplate<class I, class F>struct in_fun_result; template<class I1, class I2>struct in_in_result; template<class I, class O>struct in_out_result; template<class I1, class I2, class O>struct in_in_out_result; template<class I, class O1, class O2>struct in_out_out_result; templatestruct min_max_result; templatestruct in_found_result; template<class I, class T>struct in_value_result; template<class O, class T>struct out_value_result; }// [alg.nonmodifying], non-modifying sequence operations// [alg.all.of], all oftemplate<class InputIterator, class Predicate>constexpr bool all_of(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate>bool all_of(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr bool all_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr bool all_of(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>bool all_of(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>bool all_of(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.any.of], any oftemplate<class InputIterator, class Predicate>constexpr bool any_of(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate>bool any_of(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr bool any_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr bool any_of(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>bool any_of(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>bool any_of(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.none.of], none oftemplate<class InputIterator, class Predicate>constexpr bool none_of(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate>bool none_of(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr bool none_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr bool none_of(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>bool none_of(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>bool none_of(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.contains], containsnamespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr bool contains(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requiresindirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr bool contains(R&& r, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>bool contains(Ep&& exec, I first, S last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requiresindirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>bool contains(Ep&& exec, R&& r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<forward_iterator I1, sentinel_for S1, forward_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr bool contains_subrange(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr bool contains_subrange(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>bool contains_subrange(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>bool contains_subrange(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.foreach], for eachtemplate<class InputIterator, class Function>constexpr Function for_each(InputIterator first, InputIterator last, Function f); template<class ExecutionPolicy, class ForwardIterator, class Function>void for_each(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Function f); namespace ranges {template<class I, class F>using for_each_result = in_fun_result<I, F>; template<input_iterator I, sentinel_for S, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun>constexpr for_each_result<I, Fun> for_each(I first, S last, Fun f, Proj proj = {}); template<input_range R, class Proj = identity, indirectly_unary_invocable<projected<iterator_t, Proj>> Fun>constexpr for_each_result<borrowed_iterator_t, Fun> for_each(R&& r, Fun f, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun> I for_each(Ep&& exec, I first, S last, Fun f, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirectly_unary_invocable<projected<iterator_t, Proj>> Fun> borrowed_iterator_t for_each(Ep&& exec, R&& r, Fun f, Proj proj = {}); // freestanding-deleted}template<class InputIterator, class Size, class Function>constexpr InputIterator for_each_n(InputIterator first, Size n, Function f); template<class ExecutionPolicy, class ForwardIterator, class Size, class Function> ForwardIterator for_each_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, Size n, Function f); namespace ranges {template<class I, class F>using for_each_n_result = in_fun_result<I, F>; template<input_iterator I, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun>constexpr for_each_n_result<I, Fun> for_each_n(I first, iter_difference_t n, Fun f, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun> I for_each_n(Ep&& exec, I first, iter_difference_t n, Fun f, Proj proj = {}); // freestanding-deleted}// [alg.find], findtemplate<class InputIterator, class T = iterator_traits::value_type>constexpr InputIterator find(InputIterator first, InputIterator last, const T& value); template<class ExecutionPolicy, class ForwardIterator, class T = iterator_traits::value_type> ForwardIterator find(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, const T& value); template<class InputIterator, class Predicate>constexpr InputIterator find_if(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate> ForwardIterator find_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); template<class InputIterator, class Predicate>constexpr InputIterator find_if_not(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate> ForwardIterator find_if_not(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr I find(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr borrowed_iterator_t find(R&& r, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> I find(Ep&& exec, I first, S last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*> borrowed_iterator_t find(Ep&& exec, R&& r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr borrowed_iterator_t find_if(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> I find_if(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred> borrowed_iterator_t find_if(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr borrowed_iterator_t find_if_not(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> I find_if_not(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred> borrowed_iterator_t find_if_not(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.find.last], find lastnamespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr subrange find_last(I first, S last, const T& value, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requiresindirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr borrowed_subrange_t find_last(R&& r, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> subrange find_last(Ep&& exec, I first, S last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requiresindirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*> borrowed_subrange_t find_last(Ep&& exec, R&& r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<forward_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr subrange find_last_if(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr borrowed_subrange_t find_last_if(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> subrange find_last_if(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred> borrowed_subrange_t find_last_if(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<forward_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr subrange find_last_if_not(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr borrowed_subrange_t find_last_if_not(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> subrange find_last_if_not(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred> borrowed_subrange_t find_last_if_not(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.find.end], find endtemplate<class ForwardIterator1, class ForwardIterator2>constexpr ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>constexpr ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator1 find_end(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 find_end(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<forward_iterator I1, sentinel_for S1, forward_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr subrange find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr borrowed_subrange_t find_end(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> subrange find_end(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2> borrowed_subrange_t find_end(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.find.first.of], find firsttemplate<class InputIterator, class ForwardIterator>constexpr InputIterator find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2); template<class InputIterator, class ForwardIterator, class BinaryPredicate>constexpr InputIterator find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator1 find_first_of(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 find_first_of(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<input_iterator I1, sentinel_for S1, forward_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr I1 find_first_of(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr borrowed_iterator_t find_first_of(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> I1 find_first_of(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2> borrowed_iterator_t find_first_of(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.adjacent.find], adjacent findtemplateconstexpr ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last); template<class ForwardIterator, class BinaryPredicate>constexpr ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator adjacent_find(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class BinaryPredicate> ForwardIterator adjacent_find(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, BinaryPredicate pred); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_binary_predicate<projected<I, Proj>, projected<I, Proj>> Pred = ranges::equal_to>constexpr I adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_binary_predicate<projected<iterator_t, Proj>, projected<iterator_t, Proj>> Pred = ranges::equal_to>constexpr borrowed_iterator_t adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_binary_predicate<projected<I, Proj>, projected<I, Proj>> Pred = ranges::equal_to> I adjacent_find(Ep&& exec, I first, S last, Pred pred = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_binary_predicate<projected<iterator_t, Proj>, projected<iterator_t, Proj>> Pred = ranges::equal_to> borrowed_iterator_t adjacent_find(Ep&& exec, R&& r, Pred pred = {}, Proj proj = {}); // freestanding-deleted}// [alg.count], counttemplate<class InputIterator, class T = iterator_traits::value_type>constexpr typename iterator_traits::difference_type count(InputIterator first, InputIterator last, const T& value); template<class ExecutionPolicy, class ForwardIterator, class T = iterator_traits::value_type>typename iterator_traits::difference_type count(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, const T& value); template<class InputIterator, class Predicate>constexpr typename iterator_traits::difference_type count_if(InputIterator first, InputIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate>typename iterator_traits::difference_type count_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr iter_difference_t count(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr range_difference_t count(R&& r, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> iter_difference_t count(Ep&& exec, I first, S last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*> range_difference_t count(Ep&& exec, R&& r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr iter_difference_t count_if(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr range_difference_t count_if(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> iter_difference_t count_if(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred> range_difference_t count_if(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.mismatch], mismatchtemplate<class InputIterator1, class InputIterator2>constexpr pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); template<class InputIterator1, class InputIterator2, class BinaryPredicate>constexpr pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred); template<class InputIterator1, class InputIterator2>constexpr pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); template<class InputIterator1, class InputIterator2, class BinaryPredicate>constexpr pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> pair<ForwardIterator1, ForwardIterator2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> pair<ForwardIterator1, ForwardIterator2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> pair<ForwardIterator1, ForwardIterator2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> pair<ForwardIterator1, ForwardIterator2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<class I1, class I2>using mismatch_result = in_in_result<I1, I2>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr mismatch_result<I1, I2> mismatch(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr mismatch_result<borrowed_iterator_t, borrowed_iterator_t> mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> mismatch_result<I1, I2> mismatch(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2> mismatch_result<borrowed_iterator_t, borrowed_iterator_t> mismatch(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.equal], equaltemplate<class InputIterator1, class InputIterator2>constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); template<class InputIterator1, class InputIterator2, class BinaryPredicate>constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred); template<class InputIterator1, class InputIterator2>constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); template<class InputIterator1, class InputIterator2, class BinaryPredicate>constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2>bool equal(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>bool equal(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2>bool equal(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>bool equal(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr bool equal(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr bool equal(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>bool equal(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>bool equal(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.is.permutation], is permutationtemplate<class ForwardIterator1, class ForwardIterator2>constexpr bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>constexpr bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, BinaryPredicate pred); template<class ForwardIterator1, class ForwardIterator2>constexpr bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>constexpr bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<forward_iterator I1, sentinel_for S1, forward_iterator I2, sentinel_for S2, class Proj1 = identity, class Proj2 = identity, indirect_equivalence_relation<projected<I1, Proj1>, projected<I2, Proj2>> Pred = ranges::equal_to>constexpr bool is_permutation(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Proj1 = identity, class Proj2 = identity, indirect_equivalence_relation<projected<iterator_t, Proj1>, projected<iterator_t, Proj2>> Pred = ranges::equal_to>constexpr bool is_permutation(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); }// [alg.search], searchtemplate<class ForwardIterator1, class ForwardIterator2>constexpr ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>constexpr ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator1 search(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 search(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); namespace ranges {template<forward_iterator I1, sentinel_for S1, forward_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr subrange search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr borrowed_subrange_t search(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> subrange search(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2> borrowed_subrange_t search(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}template<class ForwardIterator, class Size, class T = iterator_traits::value_type>constexpr ForwardIterator search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); template<class ForwardIterator, class Size, class T = iterator_traits::value_type, class BinaryPredicate>constexpr ForwardIterator search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator, class Size, class T = iterator_traits::value_type> ForwardIterator search_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Size count, const T& value); template<class ExecutionPolicy, class ForwardIterator, class Size, class T = iterator_traits::value_type, class BinaryPredicate> ForwardIterator search_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Size count, const T& value, BinaryPredicate pred); namespace ranges {template<forward_iterator I, sentinel_for S, class Pred = ranges::equal_to, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirectly_comparable<I, const T*, Pred, Proj>constexpr subrange search_n(I first, S last, iter_difference_t count, const T& value, Pred pred = {}, Proj proj = {}); template<forward_range R, class Pred = ranges::equal_to, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirectly_comparable<iterator_t, const T*, Pred, Proj>constexpr borrowed_subrange_t search_n(R&& r, range_difference_t count, const T& value, Pred pred = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Pred = ranges::equal_to, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirectly_comparable<I, const T*, Pred, Proj> subrange search_n(Ep&& exec, I first, S last, iter_difference_t count, const T& value, Pred pred = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Pred = ranges::equal_to, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirectly_comparable<iterator_t, const T*, Pred, Proj> borrowed_subrange_t search_n(Ep&& exec, R&& r, range_difference_t count, const T& value, Pred pred = {}, Proj proj = {}); // freestanding-deleted}template<class ForwardIterator, class Searcher>constexpr ForwardIterator search(ForwardIterator first, ForwardIterator last, const Searcher& searcher); namespace ranges {// [alg.starts.with], starts withtemplate<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr bool starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr bool starts_with(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>bool starts_with(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>bool starts_with(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted// [alg.ends.with], ends withtemplate<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires (forward_iterator || sized_sentinel_for<S1, I1>) &&(forward_iterator || sized_sentinel_for<S2, I2>) &&indirectly_comparable<I1, I2, Pred, Proj1, Proj2>constexpr bool ends_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires (forward_range || sized_range) &&(forward_range || sized_range) &&indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>constexpr bool ends_with(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>bool ends_with(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>requires indirectly_comparable<iterator_t, iterator_t, Pred, Proj1, Proj2>bool ends_with(Ep&& exec, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted// [alg.fold], foldtemplateclass flipped { // exposition only F f; // exposition onlypublic:template<class T, class U> requires invocable<F&, U, T> invoke_result_t<F&, U, T> operator()(T&&, U&&); }; template<class F, class T, class I, class U>concept indirectly-binary-left-foldable-impl = // exposition onlymovable && movable &&convertible_to<T, U> && invocable<F&, U, iter_reference_t> &&assignable_from<U&, invoke_result_t<F&, U, iter_reference_t>>; template<class F, class T, class I>concept indirectly-binary-left-foldable = // exposition onlycopy_constructible && indirectly_readable &&invocable<F&, T, iter_reference_t> &&convertible_to<invoke_result_t<F&, T, iter_reference_t>, decay_t<invoke_result_t<F&, T, iter_reference_t>>> &&indirectly-binary-left-foldable-impl<F, T, I, decay_t<invoke_result_t<F&, T, iter_reference_t>>>; template<class F, class T, class I>concept indirectly-binary-right-foldable = // exposition onlyindirectly-binary-left-foldable<flipped, T, I>; template<input_iterator I, sentinel_for S, class T = iter_value_t, indirectly-binary-left-foldable<T, I> F>constexpr auto fold_left(I first, S last, T init, F f); template<input_range R, class T = range_value_t, indirectly-binary-left-foldable<T, iterator_t> F>constexpr auto fold_left(R&& r, T init, F f); template<input_iterator I, sentinel_for S, indirectly-binary-left-foldable<iter_value_t, I> F>requires constructible_from<iter_value_t, iter_reference_t>constexpr auto fold_left_first(I first, S last, F f); template<input_range R, indirectly-binary-left-foldable<range_value_t, iterator_t> F>requires constructible_from<range_value_t, range_reference_t>constexpr auto fold_left_first(R&& r, F f); template<bidirectional_iterator I, sentinel_for S, class T = iter_value_t, indirectly-binary-right-foldable<T, I> F>constexpr auto fold_right(I first, S last, T init, F f); template<bidirectional_range R, class T = range_value_t, indirectly-binary-right-foldable<T, iterator_t> F>constexpr auto fold_right(R&& r, T init, F f); template<bidirectional_iterator I, sentinel_for S, indirectly-binary-right-foldable<iter_value_t, I> F>requires constructible_from<iter_value_t, iter_reference_t>constexpr auto fold_right_last(I first, S last, F f); template<bidirectional_range R, indirectly-binary-right-foldable<range_value_t, iterator_t> F>requires constructible_from<range_value_t, range_reference_t>constexpr auto fold_right_last(R&& r, F f); template<class I, class T>using fold_left_with_iter_result = in_value_result<I, T>; template<class I, class T>using fold_left_first_with_iter_result = in_value_result<I, T>; template<input_iterator I, sentinel_for S, class T = iter_value_t, indirectly-binary-left-foldable<T, I> F>constexpr see below fold_left_with_iter(I first, S last, T init, F f); template<input_range R, class T = range_value_t, indirectly-binary-left-foldable<T, iterator_t> F>constexpr see below fold_left_with_iter(R&& r, T init, F f); template<input_iterator I, sentinel_for S, indirectly-binary-left-foldable<iter_value_t, I> F>requires constructible_from<iter_value_t, iter_reference_t>constexpr see below fold_left_first_with_iter(I first, S last, F f); template<input_range R, indirectly-binary-left-foldable<range_value_t, iterator_t> F>requires constructible_from<range_value_t, range_reference_t>constexpr see below fold_left_first_with_iter(R&& r, F f); }// [alg.modifying.operations], mutating sequence operations// [alg.copy], copytemplate<class InputIterator, class OutputIterator>constexpr OutputIterator copy(InputIterator first, InputIterator last, OutputIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator2 copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result); namespace ranges {template<class I, class O>using copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O>requires indirectly_copyable<I, O>constexpr copy_result<I, O> copy(I first, S last, O result); template<input_range R, weakly_incrementable O>requires indirectly_copyable<iterator_t, O>constexpr copy_result<borrowed_iterator_t, O> copy(R&& r, O result); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS>requires indirectly_copyable<I, O> copy_result<I, O> copy(Ep&& exec, I first, S last, O result, OutS result_last); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR>requires indirectly_copyable<iterator_t, iterator_t> copy_result<borrowed_iterator_t, borrowed_iterator_t> copy(Ep&& exec, R&& r, OutR&& result_r); // freestanding-deleted}template<class InputIterator, class Size, class OutputIterator>constexpr OutputIterator copy_n(InputIterator first, Size n, OutputIterator result); template<class ExecutionPolicy, class ForwardIterator1, class Size, class ForwardIterator2> ForwardIterator2 copy_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, Size n, ForwardIterator2 result); namespace ranges {template<class I, class O>using copy_n_result = in_out_result<I, O>; template<input_iterator I, weakly_incrementable O>requires indirectly_copyable<I, O>constexpr copy_n_result<I, O> copy_n(I first, iter_difference_t n, O result); template<execution-policy Ep, random_access_iterator I, random_access_iterator O, sized_sentinel_for OutS>requires indirectly_copyable<I, O> copy_n_result<I, O> copy_n(Ep&& exec, I first, iter_difference_t n, O result, OutS result_last); // freestanding-deleted}template<class InputIterator, class OutputIterator, class Predicate>constexpr OutputIterator copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Predicate> ForwardIterator2 copy_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, Predicate pred); namespace ranges {template<class I, class O>using copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O>constexpr copy_if_result<I, O> copy_if(I first, S last, O result, Pred pred, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, O>constexpr copy_if_result<borrowed_iterator_t, O> copy_if(R&& r, O result, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O> copy_if_result<I, O> copy_if(Ep&& exec, I first, S last, O result, OutS result_last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, iterator_t> copy_if_result<borrowed_iterator_t, borrowed_iterator_t> copy_if(Ep&& exec, R&& r, OutR&& result_r, Pred pred, Proj proj = {}); // freestanding-deleted}template<class BidirectionalIterator1, class BidirectionalIterator2>constexpr BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 result); namespace ranges {template<class I1, class I2>using copy_backward_result = in_out_result<I1, I2>; template<bidirectional_iterator I1, sentinel_for S1, bidirectional_iterator I2>requires indirectly_copyable<I1, I2>constexpr copy_backward_result<I1, I2> copy_backward(I1 first, S1 last, I2 result); template<bidirectional_range R, bidirectional_iterator I>requires indirectly_copyable<iterator_t, I>constexpr copy_backward_result<borrowed_iterator_t, I> copy_backward(R&& r, I result); }// [alg.move], movetemplate<class InputIterator, class OutputIterator>constexpr OutputIterator move(InputIterator first, InputIterator last, OutputIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator2 move(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result); namespace ranges {template<class I, class O>using move_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O>requires indirectly_movable<I, O>constexpr move_result<I, O> move(I first, S last, O result); template<input_range R, weakly_incrementable O>requires indirectly_movable<iterator_t, O>constexpr move_result<borrowed_iterator_t, O> move(R&& r, O result); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS>requires indirectly_movable<I, O> move_result<I, O> move(Ep&& exec, I first, S last, O result, OutS result_last); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR>requires indirectly_movable<iterator_t, iterator_t> move_result<borrowed_iterator_t, borrowed_iterator_t> move(Ep&& exec, R&& r, OutR&& result_r); // freestanding-deleted}template<class BidirectionalIterator1, class BidirectionalIterator2>constexpr BidirectionalIterator2 move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, BidirectionalIterator2 result); namespace ranges {template<class I1, class I2>using move_backward_result = in_out_result<I1, I2>; template<bidirectional_iterator I1, sentinel_for S1, bidirectional_iterator I2>requires indirectly_movable<I1, I2>constexpr move_backward_result<I1, I2> move_backward(I1 first, S1 last, I2 result); template<bidirectional_range R, bidirectional_iterator I>requires indirectly_movable<iterator_t, I>constexpr move_backward_result<borrowed_iterator_t, I> move_backward(R&& r, I result); }// [alg.swap], swaptemplate<class ForwardIterator1, class ForwardIterator2>constexpr ForwardIterator2 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator2 swap_ranges(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); namespace ranges {template<class I1, class I2>using swap_ranges_result = in_in_result<I1, I2>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2>requires indirectly_swappable<I1, I2>constexpr swap_ranges_result<I1, I2> swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); template<input_range R1, input_range R2>requires indirectly_swappable<iterator_t, iterator_t>constexpr swap_ranges_result<borrowed_iterator_t, borrowed_iterator_t> swap_ranges(R1&& r1, R2&& r2); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2>requires indirectly_swappable<I1, I2> swap_ranges_result<I1, I2> swap_ranges(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2>requires indirectly_swappable<iterator_t, iterator_t> swap_ranges_result<borrowed_iterator_t, borrowed_iterator_t> swap_ranges(Ep&& exec, R1&& r1, R2&& r2); // freestanding-deleted}template<class ForwardIterator1, class ForwardIterator2>constexpr void iter_swap(ForwardIterator1 a, ForwardIterator2 b); // [alg.transform], transformtemplate<class InputIterator, class OutputIterator, class UnaryOperation>constexpr OutputIterator transform(InputIterator first1, InputIterator last1, OutputIterator result, UnaryOperation op); template<class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation>constexpr OutputIterator transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator result, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class UnaryOperation> ForwardIterator2 transform(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 result, UnaryOperation op); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class BinaryOperation> ForwardIterator transform(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator result, BinaryOperation binary_op); namespace ranges {template<class I, class O>using unary_transform_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O, copy_constructible F, class Proj = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>>constexpr unary_transform_result<I, O> transform(I first1, S last1, O result, F op, Proj proj = {}); template<input_range R, weakly_incrementable O, copy_constructible F, class Proj = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t, Proj>>>constexpr unary_transform_result<borrowed_iterator_t, O> transform(R&& r, O result, F op, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, copy_constructible F, class Proj = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> unary_transform_result<I, O> transform(Ep&& exec, I first1, S last1, O result, OutS result_last, F op, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, copy_constructible F, class Proj = identity>requires indirectly_writable<iterator_t, indirect_result_t<F&, projected<iterator_t, Proj>>> unary_transform_result<borrowed_iterator_t, borrowed_iterator_t> transform(Ep&& exec, R&& r, OutR&& result_r, F op, Proj proj = {}); // freestanding-deletedtemplate<class I1, class I2, class O>using binary_transform_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, copy_constructible F, class Proj1 = identity, class Proj2 = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, projected<I2, Proj2>>>constexpr binary_transform_result<I1, I2, O> transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, copy_constructible F, class Proj1 = identity, class Proj2 = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t, Proj1>, projected<iterator_t, Proj2>>>constexpr binary_transform_result<borrowed_iterator_t, borrowed_iterator_t, O> transform(R1&& r1, R2&& r2, O result, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, copy_constructible F, class Proj1 = identity, class Proj2 = identity>requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, projected<I2, Proj2>>> binary_transform_result<I1, I2, O> transform(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, copy_constructible F, class Proj1 = identity, class Proj2 = identity>requires indirectly_writable<iterator_t, indirect_result_t<F&, projected<iterator_t, Proj1>, projected<iterator_t, Proj2>>> binary_transform_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> transform(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.replace], replacetemplate<class ForwardIterator, class T>constexpr void replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); template<class ExecutionPolicy, class ForwardIterator, class T = iterator_traits::value_type>void replace(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); template<class ForwardIterator, class Predicate, class T = iterator_traits::value_type>constexpr void replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); template<class ExecutionPolicy, class ForwardIterator, class Predicate, class T = iterator_traits::value_type>void replace_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = T1>requires indirectly_writable<I, const T2&> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*>constexpr I replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); template<input_range R, class Proj = identity, class T1 = projected_value_t<iterator_t, Proj>, class T2 = T1>requires indirectly_writable<iterator_t, const T2&> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T1*>constexpr borrowed_iterator_t replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = T1>requires indirectly_writable<I, const T2&> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> I replace(Ep&& exec, I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T1 = projected_value_t<iterator_t, Proj>, class T2 = T1>requires indirectly_writable<iterator_t, const T2&> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T1*> borrowed_iterator_t replace(Ep&& exec, R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // freestanding-deletedtemplate<input_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_writable<I, const T&>constexpr I replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_writable<iterator_t, const T&>constexpr borrowed_iterator_t replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_writable<I, const T&> I replace_if(Ep&& exec, I first, S last, Pred pred, const T& new_value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_writable<iterator_t, const T&> borrowed_iterator_t replace_if(Ep&& exec, R&& r, Pred pred, const T& new_value, Proj proj = {}); // freestanding-deleted}template<class InputIterator, class OutputIterator, class T>constexpr OutputIterator replace_copy(InputIterator first, InputIterator last, OutputIterator result, const T& old_value, const T& new_value); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class T> ForwardIterator2 replace_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, const T& old_value, const T& new_value); template<class InputIterator, class OutputIterator, class Predicate, class T = iterator_traits::value_type>constexpr OutputIterator replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Predicate, class T = iterator_traits::value_type> ForwardIterator2 replace_copy_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, Predicate pred, const T& new_value); namespace ranges {template<class I, class O>using replace_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, class O, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = iter_value_t>requires indirectly_copyable<I, O> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> &&output_iterator<O, const T2&>constexpr replace_copy_result<I, O> replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value, Proj proj = {}); template<input_range R, class O, class Proj = identity, class T1 = projected_value_t<iterator_t, Proj>, class T2 = iter_value_t>requires indirectly_copyable<iterator_t, O> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T1*> &&output_iterator<O, const T2&>constexpr replace_copy_result<borrowed_iterator_t, O> replace_copy(R&& r, O result, const T1& old_value, const T2& new_value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = iter_value_t>requires indirectly_copyable<I, O> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> &&indirectly_writable<O, const T2&> replace_copy_result<I, O> replace_copy(Ep&& exec, I first, S last, O result, OutS result_last, const T1& old_value, const T2& new_value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class Proj = identity, class T1 = projected_value_t<iterator_t, Proj>, class T2 = range_value_t>requires indirectly_copyable<iterator_t, iterator_t> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T1*> &&indirectly_writable<iterator_t, const T2&> replace_copy_result<borrowed_iterator_t, borrowed_iterator_t> replace_copy(Ep&& exec, R&& r, OutR&& result_r, const T1& old_value, const T2& new_value, Proj proj = {}); // freestanding-deletedtemplate<class I, class O>using replace_copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, class O, class T = iter_value_tclass Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O> && output_iterator<O, const T&>constexpr replace_copy_if_result<I, O> replace_copy_if(I first, S last, O result, Pred pred, const T& new_value, Proj proj = {}); template<input_range R, class O, class T = iter_value_t, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, O> && output_iterator<O, const T&>constexpr replace_copy_if_result<borrowed_iterator_t, O> replace_copy_if(R&& r, O result, Pred pred, const T& new_value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class T = iter_value_t, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O> && indirectly_writable<O, const T&> replace_copy_if_result<I, O> replace_copy_if(Ep&& exec, I first, S last, O result, OutS result_last, Pred pred, const T& new_value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class T = range_value_t, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, iterator_t> &&indirectly_writable<iterator_t, const T&> replace_copy_if_result<borrowed_iterator_t, borrowed_iterator_t> replace_copy_if(Ep&& exec, R&& r, OutR&& result_r, Pred pred, const T& new_value, Proj proj = {}); // freestanding-deleted}// [alg.fill], filltemplate<class ForwardIterator, class T = iterator_traits::value_type>constexpr void fill(ForwardIterator first, ForwardIterator last, const T& value); template<class ExecutionPolicy, class ForwardIterator, class T = iterator_traits::value_type>void fill(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, const T& value); template<class OutputIterator, class Size, class T = iterator_traits::value_type>constexpr OutputIterator fill_n(OutputIterator first, Size n, const T& value)template<class ExecutionPolicy, class ForwardIterator, class Size, class T = iterator_traits::value_type> ForwardIterator fill_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, Size n, const T& value); namespace ranges {template<class O, sentinel_for S, class T = iter_value_t>requires output_iterator<O, const T&>constexpr O fill(O first, S last, const T& value); template<class R, class T = range_value_t>requires output_range<R, const T&>constexpr borrowed_iterator_t fill(R&& r, const T& value); template<class O, class T = iter_value_t>requires output_iterator<O, const T&>constexpr O fill_n(O first, iter_difference_t n, const T& value); template<execution-policy Ep, random_access_iterator O, sized_sentinel_for S, class T = iter_value_t>requires indirectly_writable<O, const T&> O fill(Ep&& exec, O first, S last, const T& value); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class T = range_value_t>requires indirectly_writable<iterator_t, const T&> borrowed_iterator_t fill(Ep&& exec, R&& r, const T& value); // freestanding-deletedtemplate<execution-policy Ep, random_access_iterator O, class T = iter_value_t>requires indirectly_writable<O, const T&> O fill_n(Ep&& exec, O first, iter_difference_t n, const T& value); // freestanding-deleted}// [alg.generate], generatetemplate<class ForwardIterator, class Generator>constexpr void generate(ForwardIterator first, ForwardIterator last, Generator gen); template<class ExecutionPolicy, class ForwardIterator, class Generator>void generate(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Generator gen); template<class OutputIterator, class Size, class Generator>constexpr OutputIterator generate_n(OutputIterator first, Size n, Generator gen); template<class ExecutionPolicy, class ForwardIterator, class Size, class Generator> ForwardIterator generate_n(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, Size n, Generator gen); namespace ranges {template<input_or_output_iterator O, sentinel_for S, copy_constructible F>requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>constexpr O generate(O first, S last, F gen); template<class R, copy_constructible F>requires invocable<F&> && output_range<R, invoke_result_t<F&>>constexpr borrowed_iterator_t generate(R&& r, F gen); template<input_or_output_iterator O, copy_constructible F>requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>>constexpr O generate_n(O first, iter_difference_t n, F gen); template<execution-policy Ep, random_access_iterator O, sized_sentinel_for S, copy_constructible F>requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> O generate(Ep&& exec, O first, S last, F gen); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, copy_constructible F>requires invocable<F&> && indirectly_writable<iterator_t, invoke_result_t<F&>> borrowed_iterator_t generate(Ep&& exec, R&& r, F gen); // freestanding-deletedtemplate<execution-policy Ep, random_access_iterator O, copy_constructible F>requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> O generate_n(Ep&& exec, O first, iter_difference_t n, F gen); // freestanding-deleted}// [alg.remove], removetemplate<class ForwardIterator, class T = iterator_traits::value_type>constexpr ForwardIterator remove(ForwardIterator first, ForwardIterator last, const T& value); template<class ExecutionPolicy, class ForwardIterator, class T = iterator_traits::value_type> ForwardIterator remove(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class Predicate>constexpr ForwardIterator remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); template<class ExecutionPolicy, class ForwardIterator, class Predicate> ForwardIterator remove_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<permutable I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr subrange remove(I first, S last, const T& value, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires permutable<iterator_t> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr borrowed_subrange_t remove(R&& r, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> subrange remove(Ep&& exec, I first, S last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires permutable<iterator_t> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*> borrowed_subrange_t remove(Ep&& exec, R&& r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<permutable I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr subrange remove_if(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t>constexpr borrowed_subrange_t remove_if(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> subrange remove_if(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t> borrowed_subrange_t remove_if(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}template<class InputIterator, class OutputIterator, class T = iterator_traits::value_type>constexpr OutputIterator remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class T = iterator_traits::value_type> ForwardIterator2 remove_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, const T& value); template<class InputIterator, class OutputIterator, class Predicate>constexpr OutputIterator remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Predicate> ForwardIterator2 remove_copy_if(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, Predicate pred); namespace ranges {template<class I, class O>using remove_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirectly_copyable<I, O> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*>constexpr remove_copy_result<I, O> remove_copy(I first, S last, O result, const T& value, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirectly_copyable<iterator_t, O> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*>constexpr remove_copy_result<borrowed_iterator_t, O> remove_copy(R&& r, O result, const T& value, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class Proj = identity, class T = projected_value_t<I, Proj>>requires indirectly_copyable<I, O> &&indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> remove_copy_result<I, O> remove_copy(Ep&& exec, I first, S last, O result, OutS result_last, const T& value, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class Proj = identity, class T = projected_value_t<iterator_t, Proj>>requires indirectly_copyable<iterator_t, iterator_t> &&indirect_binary_predicate<ranges::equal_to, projected<iterator_t, Proj>, const T*> remove_copy_result<borrowed_iterator_t, borrowed_iterator_t> remove_copy(Ep&& exec, R&& r, OutR&& result_r, const T& value, Proj proj = {}); // freestanding-deletedtemplate<class I, class O>using remove_copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O>constexpr remove_copy_if_result<I, O> remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, O>constexpr remove_copy_if_result<borrowed_iterator_t, O> remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O> remove_copy_if_result<I, O> remove_copy_if(Ep&& exec, I first, S last, O result, OutS result_last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, iterator_t> remove_copy_if_result<borrowed_iterator_t, borrowed_iterator_t> remove_copy_if(Ep&& exec, R&& r, OutR&& result_r, Pred pred, Proj proj = {}); // freestanding-deleted}// [alg.unique], uniquetemplateconstexpr ForwardIterator unique(ForwardIterator first, ForwardIterator last); template<class ForwardIterator, class BinaryPredicate>constexpr ForwardIterator unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator unique(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class BinaryPredicate> ForwardIterator unique(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, BinaryPredicate pred); namespace ranges {template<permutable I, sentinel_for S, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>constexpr subrange unique(I first, S last, C comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_equivalence_relation<projected<iterator_t, Proj>> C = ranges::equal_to>requires permutable<iterator_t>constexpr borrowed_subrange_t unique(R&& r, C comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>requires permutable subrange unique(Ep&& exec, I first, S last, C comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_equivalence_relation<projected<iterator_t, Proj>> C = ranges::equal_to>requires permutable<iterator_t> borrowed_subrange_t unique(Ep&& exec, R&& r, C comp = {}, Proj proj = {}); // freestanding-deleted}template<class InputIterator, class OutputIterator>constexpr OutputIterator unique_copy(InputIterator first, InputIterator last, OutputIterator result); template<class InputIterator, class OutputIterator, class BinaryPredicate>constexpr OutputIterator unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator2 unique_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator2 unique_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 last, ForwardIterator2 result, BinaryPredicate pred); namespace ranges {template<class I, class O>using unique_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for S, weakly_incrementable O, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>requires indirectly_copyable<I, O> &&(forward_iterator ||(input_iterator && same_as<iter_value_t, iter_value_t>) ||indirectly_copyable_storable<I, O>)constexpr unique_copy_result<I, O> unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_equivalence_relation<projected<iterator_t, Proj>> C = ranges::equal_to>requires indirectly_copyable<iterator_t, O> &&(forward_iterator<iterator_t> ||(input_iterator && same_as<range_value_t, iter_value_t>) ||indirectly_copyable_storable<iterator_t, O>)constexpr unique_copy_result<borrowed_iterator_t, O> unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to>requires indirectly_copyable<I, O> unique_copy_result<I, O> unique_copy(Ep&& exec, I first, S last, O result, OutS result_last, C comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR, class Proj = identity, indirect_equivalence_relation<projected<iterator_t, Proj>> C = ranges::equal_to>requires indirectly_copyable<iterator_t, iterator_t> unique_copy_result<borrowed_iterator_t, borrowed_iterator_t> unique_copy(Ep&& exec, R&& r, OutR&& result_r, C comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.reverse], reversetemplateconstexpr void reverse(BidirectionalIterator first, BidirectionalIterator last); template<class ExecutionPolicy, class BidirectionalIterator>void reverse(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] BidirectionalIterator first, BidirectionalIterator last); namespace ranges {template<bidirectional_iterator I, sentinel_for S>requires permutableconstexpr I reverse(I first, S last); template<bidirectional_range R>requires permutable<iterator_t>constexpr borrowed_iterator_t reverse(R&& r); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S>requires permutable I reverse(Ep&& exec, I first, S last); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R>requires permutable<iterator_t> borrowed_iterator_t reverse(Ep&& exec, R&& r); // freestanding-deleted}template<class BidirectionalIterator, class OutputIterator>constexpr OutputIterator reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); template<class ExecutionPolicy, class BidirectionalIterator, class ForwardIterator> ForwardIterator reverse_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] BidirectionalIterator first, BidirectionalIterator last, ForwardIterator result); namespace ranges {template<class I, class O>using reverse_copy_result = in_out_result<I, O>; template<class I, class O>using reverse_copy_truncated_result = in_in_out_result<I, I, O>; template<bidirectional_iterator I, sentinel_for S, weakly_incrementable O>requires indirectly_copyable<I, O>constexpr reverse_copy_result<I, O> reverse_copy(I first, S last, O result); template<bidirectional_range R, weakly_incrementable O>requires indirectly_copyable<iterator_t, O>constexpr reverse_copy_result<borrowed_iterator_t, O> reverse_copy(R&& r, O result); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS>requires indirectly_copyable<I, O> reverse_copy_truncated_result<I, O> reverse_copy(Ep&& exec, I first, S last, O result, OutS result_last); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR>requires indirectly_copyable<iterator_t, iterator_t> reverse_copy_truncated_result<borrowed_iterator_t, borrowed_iterator_t> reverse_copy(Ep&& exec, R&& r, OutR&& result_r); // freestanding-deleted}// [alg.rotate], rotatetemplateconstexpr ForwardIterator rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator rotate(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator middle, ForwardIterator last); namespace ranges {template<permutable I, sentinel_for S>constexpr subrange rotate(I first, I middle, S last); template<forward_range R>requires permutable<iterator_t>constexpr borrowed_subrange_t rotate(R&& r, iterator_t middle); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S>requires permutable subrange rotate(Ep&& exec, I first, I middle, S last); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R>requires permutable<iterator_t> borrowed_subrange_t rotate(Ep&& exec, R&& r, iterator_t middle); // freestanding-deleted}template<class ForwardIterator, class OutputIterator>constexpr OutputIterator rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2> ForwardIterator2 rotate_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first, ForwardIterator1 middle, ForwardIterator1 last, ForwardIterator2 result); namespace ranges {template<class I, class O>using rotate_copy_result = in_out_result<I, O>; template<class I, class O>using rotate_copy_truncated_result = in_in_out_result<I, I, O>; template<forward_iterator I, sentinel_for S, weakly_incrementable O>requires indirectly_copyable<I, O>constexpr rotate_copy_result<I, O> rotate_copy(I first, I middle, S last, O result); template<forward_range R, weakly_incrementable O>requires indirectly_copyable<iterator_t, O>constexpr rotate_copy_result<borrowed_iterator_t, O> rotate_copy(R&& r, iterator_t middle, O result); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O, sized_sentinel_for OutS>requires indirectly_copyable<I, O> rotate_copy_truncated_result<I, O> rotate_copy(Ep&& exec, I first, I middle, S last, O result, // freestanding-deleted OutS result_last); template<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR>requires indirectly_copyable<iterator_t, iterator_t> rotate_copy_truncated_result<borrowed_iterator_t, borrowed_iterator_t> rotate_copy(Ep&& exec, R&& r, iterator_t middle, // freestanding-deleted OutR&& result_r); }// [alg.random.sample], sampletemplate<class PopulationIterator, class SampleIterator, class Distance, class UniformRandomBitGenerator> SampleIterator sample(PopulationIterator first, PopulationIterator last, SampleIterator out, Distance n, UniformRandomBitGenerator&& g); namespace ranges {template<input_iterator I, sentinel_for S, weakly_incrementable O, class Gen>requires (forward_iterator || random_access_iterator) &&indirectly_copyable<I, O> &&uniform_random_bit_generator<remove_reference_t> O sample(I first, S last, O out, iter_difference_t n, Gen&& g); template<input_range R, weakly_incrementable O, class Gen>requires (forward_range || random_access_iterator) &&indirectly_copyable<iterator_t, O> &&uniform_random_bit_generator<remove_reference_t> O sample(R&& r, O out, range_difference_t n, Gen&& g); }// [alg.random.shuffle], shuffletemplate<class RandomAccessIterator, class UniformRandomBitGenerator>void shuffle(RandomAccessIterator first, RandomAccessIterator last, UniformRandomBitGenerator&& g); namespace ranges {template<random_access_iterator I, sentinel_for S, class Gen>requires permutable &&uniform_random_bit_generator<remove_reference_t> I shuffle(I first, S last, Gen&& g); template<random_access_range R, class Gen>requires permutable<iterator_t> &&uniform_random_bit_generator<remove_reference_t> borrowed_iterator_t shuffle(R&& r, Gen&& g); }// [alg.shift], shifttemplateconstexpr ForwardIterator shift_left(ForwardIterator first, ForwardIterator last, typename iterator_traits::difference_type n); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator shift_left(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, typename iterator_traits::difference_type n); namespace ranges {template<permutable I, sentinel_for S>constexpr subrange shift_left(I first, S last, iter_difference_t n); template<forward_range R>requires permutable<iterator_t>constexpr borrowed_subrange_t shift_left(R&& r, range_difference_t n); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S>requires permutable subrange shift_left(Ep&& exec, I first, S last, iter_difference_t n); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R>requires permutable<iterator_t> borrowed_subrange_t shift_left(Ep&& exec, R&& r, range_difference_t n); // freestanding-deleted}templateconstexpr ForwardIterator shift_right(ForwardIterator first, ForwardIterator last, typename iterator_traits::difference_type n); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator shift_right(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, typename iterator_traits::difference_type n); namespace ranges {template<permutable I, sentinel_for S>constexpr subrange shift_right(I first, S last, iter_difference_t n); template<forward_range R>requires permutable<iterator_t>constexpr borrowed_subrange_t shift_right(R&& r, range_difference_t n); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S>requires permutable subrange shift_right(Ep&& exec, I first, S last, iter_difference_t n); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R>requires permutable<iterator_t> borrowed_subrange_t shift_right(Ep&& exec, R&& r, range_difference_t n); // freestanding-deleted}// [alg.sorting], sorting and related operations// [alg.sort], sortingtemplateconstexpr void sort(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); template<class ExecutionPolicy, class RandomAccessIterator>void sort(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare>void sort(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I 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, Comp, Proj>constexpr borrowed_iterator_t sort(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj> I sort(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj> borrowed_iterator_t sort(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last); // hostedtemplate<class RandomAccessIterator, class Compare>constexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last, // hosted Compare comp); template<class ExecutionPolicy, class RandomAccessIterator>void stable_sort(ExecutionPolicy&& exec, // hosted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare>void stable_sort(ExecutionPolicy&& exec, // hosted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // hostedtemplate<random_access_range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj>constexpr borrowed_iterator_t stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // hostedtemplate<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj> I stable_sort(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj> borrowed_iterator_t stable_sort(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr void partial_sort(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>void partial_sort(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare>void partial_sort(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj>constexpr borrowed_iterator_t partial_sort(R&& r, iterator_t middle, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj> I partial_sort(Ep&& exec, I first, I middle, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj> borrowed_iterator_t partial_sort(Ep&& exec, R&& r, iterator_t middle, Comp comp = {}, Proj proj = {}); // freestanding-deleted}template<class InputIterator, class RandomAccessIterator>constexpr RandomAccessIterator partial_sort_copy(InputIterator first, InputIterator 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> RandomAccessIterator partial_sort_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last); template<class ExecutionPolicy, class ForwardIterator, class RandomAccessIterator, class Compare> RandomAccessIterator partial_sort_copy(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); namespace ranges {template<class I, class O>using partial_sort_copy_result = in_out_result<I, O>; template<input_iterator I1, sentinel_for S1, random_access_iterator I2, sentinel_for 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 partial_sort_copy_result<I1, I2> 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, class Proj1 = identity, class Proj2 = identity>requires indirectly_copyable<iterator_t, iterator_t> &&sortable<iterator_t, Comp, Proj2> &&indirect_strict_weak_order<Comp, projected<iterator_t, Proj1>, projected<iterator_t, Proj2>>constexpr partial_sort_copy_result<borrowed_iterator_t, borrowed_iterator_t> partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for 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>> partial_sort_copy_result<I1, I2> partial_sort_copy(Ep&& exec, I1 first, S1 last, I2 result_first, S2 result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires indirectly_copyable<iterator_t, iterator_t> &&sortable<iterator_t, Comp, Proj2> &&indirect_strict_weak_order<Comp, projected<iterator_t, Proj1>, projected<iterator_t, Proj2>> partial_sort_copy_result<borrowed_iterator_t, borrowed_iterator_t> partial_sort_copy(Ep&& exec, R1&& r, R2&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}templateconstexpr bool is_sorted(ForwardIterator first, ForwardIterator last); template<class ForwardIterator, class Compare>constexpr bool is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); template<class ExecutionPolicy, class ForwardIterator>bool is_sorted(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class Compare>bool is_sorted(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr bool is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>constexpr bool is_sorted(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>bool is_sorted(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>bool is_sorted(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr ForwardIterator is_sorted_until(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> ForwardIterator is_sorted_until(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class Compare> ForwardIterator is_sorted_until(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr I 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, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> I is_sorted_until(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less> borrowed_iterator_t is_sorted_until(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.nth.element], Nth elementtemplateconstexpr void nth_element(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>void nth_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare>void nth_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj>constexpr borrowed_iterator_t nth_element(R&& r, iterator_t nth, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj> I nth_element(Ep&& exec, I first, I nth, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj> borrowed_iterator_t nth_element(Ep&& exec, R&& r, iterator_t nth, Comp comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.binary.search], binary searchtemplate<class ForwardIterator, class T = iterator_traits::value_type>constexpr ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class T = iterator_traits::value_type, class Compare>constexpr ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>constexpr I lower_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>, indirect_strict_weak_order<const T*, projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); }template<class ForwardIterator, class T = iterator_traits::value_type>constexpr ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class T = iterator_traits::value_type, class Compare>constexpr ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>, indirect_strict_weak_order<const T*, projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); }template<class ForwardIterator, class T = iterator_traits::value_type>constexpr pair<ForwardIterator, ForwardIterator> equal_range(ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class T = iterator_traits::value_type, class Compare>constexpr pair<ForwardIterator, ForwardIterator> equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>constexpr subrange equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>, indirect_strict_weak_order<const T*, projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_subrange_t equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); }template<class ForwardIterator, class T = iterator_traits::value_type>constexpr bool binary_search(ForwardIterator first, ForwardIterator last, const T& value); template<class ForwardIterator, class T = iterator_traits::value_type, class Compare>constexpr bool binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less>constexpr bool binary_search(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t, Proj>, indirect_strict_weak_order<const T*, projected<iterator_t, Proj>> Comp = ranges::less>constexpr bool binary_search(R&& r, const T& value, Comp comp = {}, Proj proj = {}); }// [alg.partitions], partitionstemplate<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, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<input_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr bool is_partitioned(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr bool is_partitioned(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>bool is_partitioned(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>bool is_partitioned(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}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, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<permutable I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr subrange partition(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t>constexpr borrowed_subrange_t partition(R&& r, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> subrange partition(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t> borrowed_subrange_t partition(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}template<class BidirectionalIterator, class Predicate>constexpr BidirectionalIterator stable_partition(BidirectionalIterator first, // hosted BidirectionalIterator last, Predicate pred); template<class ExecutionPolicy, class BidirectionalIterator, class Predicate> BidirectionalIterator stable_partition(ExecutionPolicy&& exec, // hosted, BidirectionalIterator first, // see [algorithms.parallel.overloads] BidirectionalIterator last, Predicate pred); namespace ranges {template<bidirectional_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires permutableconstexpr subrange stable_partition(I first, S last, Pred pred, // hosted Proj proj = {}); template<bidirectional_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t>constexpr borrowed_subrange_t stable_partition(R&& r, Pred pred, // hosted Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires permutable subrange stable_partition(Ep&& exec, I first, S last, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires permutable<iterator_t> borrowed_subrange_t stable_partition(Ep&& exec, R&& r, Pred pred, Proj proj = {}); // freestanding-deleted}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, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, ForwardIterator1 out_true, ForwardIterator2 out_false, Predicate pred); namespace ranges {template<class I, class O1, class O2>using partition_copy_result = in_out_out_result<I, O1, O2>; template<input_iterator I, sentinel_for 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 partition_copy_result<I, O1, O2> 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, Proj>> Pred>requires indirectly_copyable<iterator_t, O1> &&indirectly_copyable<iterator_t, O2>constexpr partition_copy_result<borrowed_iterator_t, O1, O2> partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, random_access_iterator O1, sized_sentinel_for OutS1, random_access_iterator O2, sized_sentinel_for OutS2, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2> partition_copy_result<I, O1, O2> partition_copy(Ep&& exec, I first, S last, O1 out_true, OutS1 last_true, O2 out_false, OutS2 last_false, Pred pred, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, sized-random-access-range OutR1, sized-random-access-range OutR2, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>requires indirectly_copyable<iterator_t, iterator_t> &&indirectly_copyable<iterator_t, iterator_t> partition_copy_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> partition_copy(Ep&& exec, R&& r, OutR1&& out_true_r, OutR2&& out_false_r, Pred pred, Proj proj = {}); // freestanding-deleted}template<class ForwardIterator, class Predicate>constexpr ForwardIterator partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t, Proj>> Pred>constexpr borrowed_iterator_t partition_point(R&& r, Pred pred, Proj proj = {}); }// [alg.merge], mergetemplate<class InputIterator1, class InputIterator2, class OutputIterator>constexpr OutputIterator merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator 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> ForwardIterator merge(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class Compare> ForwardIterator merge(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result, Compare comp); namespace ranges {template<class I1, class I2, class O>using merge_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2>constexpr merge_result<I1, I2, O> 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, iterator_t, O, Comp, Proj1, Proj2>constexpr merge_result<borrowed_iterator_t, borrowed_iterator_t, O> merge(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2> merge_result<I1, I2, O> merge(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<iterator_t, iterator_t, iterator_t, Comp, Proj1, Proj2> merge_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> merge(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}templateconstexpr void inplace_merge(BidirectionalIterator first, // hosted BidirectionalIterator middle, BidirectionalIterator last); template<class BidirectionalIterator, class Compare>constexpr void inplace_merge(BidirectionalIterator first, // hosted BidirectionalIterator middle, BidirectionalIterator last, Compare comp); template<class ExecutionPolicy, class BidirectionalIterator>void inplace_merge(ExecutionPolicy&& exec, // hosted, see [algorithms.parallel.overloads] BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); template<class ExecutionPolicy, class BidirectionalIterator, class Compare>void inplace_merge(ExecutionPolicy&& exec, // hosted, see [algorithms.parallel.overloads] BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); namespace ranges {template<bidirectional_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // hostedtemplate<bidirectional_range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj>constexpr borrowed_iterator_t inplace_merge(R&& r, iterator_t middle, Comp comp = {}, Proj proj = {}); // hostedtemplate<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj> I inplace_merge(Ep&& exec, I first, I middle, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj> borrowed_iterator_t inplace_merge(Ep&& exec, R&& r, iterator_t middle, Comp comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.set.operations], set operationstemplate<class InputIterator1, class InputIterator2>constexpr bool includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 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>bool includes(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Compare>bool includes(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Compare comp); namespace ranges {template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less>constexpr bool 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, Proj1>, projected<iterator_t, Proj2>> Comp = ranges::less>constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less>bool includes(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<iterator_t, Proj1>, projected<iterator_t, Proj2>> Comp = ranges::less>bool includes(Ep&& exec, R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}template<class InputIterator1, class InputIterator2, class OutputIterator>constexpr OutputIterator set_union(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator 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> ForwardIterator set_union(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class Compare> ForwardIterator set_union(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result, Compare comp); namespace ranges {template<class I1, class I2, class O>using set_union_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2>constexpr set_union_result<I1, I2, O> 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, iterator_t, O, Comp, Proj1, Proj2>constexpr set_union_result<borrowed_iterator_t, borrowed_iterator_t, O> set_union(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2> set_union_result<I1, I2, O> set_union(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<iterator_t, iterator_t, iterator_t, Comp, Proj1, Proj2> set_union_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> set_union(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}template<class InputIterator1, class InputIterator2, class OutputIterator>constexpr OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator 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> ForwardIterator set_intersection(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class Compare> ForwardIterator set_intersection(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result, Compare comp); namespace ranges {template<class I1, class I2, class O>using set_intersection_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2>constexpr set_intersection_result<I1, I2, O> 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>requires mergeable<iterator_t, iterator_t, O, Comp, Proj1, Proj2>constexpr set_intersection_result<borrowed_iterator_t, borrowed_iterator_t, O> set_intersection(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2> set_intersection_result<I1, I2, O> set_intersection(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<iterator_t, iterator_t, iterator_t, Comp, Proj1, Proj2> set_intersection_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> set_intersection(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}template<class InputIterator1, class InputIterator2, class OutputIterator>constexpr OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator 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> ForwardIterator set_difference(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class Compare> ForwardIterator set_difference(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result, Compare comp); namespace ranges {template<class I, class O>using set_difference_result = in_out_result<I, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2>constexpr set_difference_result<I1, O> 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, iterator_t, O, Comp, Proj1, Proj2>constexpr set_difference_result<borrowed_iterator_t, O> set_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2> set_difference_result<I1, O> set_difference(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<iterator_t, iterator_t, iterator_t, Comp, Proj1, Proj2> set_difference_result<borrowed_iterator_t, borrowed_iterator_t> set_difference(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}template<class InputIterator1, class InputIterator2, class OutputIterator>constexpr OutputIterator set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator 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> ForwardIterator set_symmetric_difference(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class ForwardIterator, class Compare> ForwardIterator set_symmetric_difference(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, ForwardIterator result, Compare comp); namespace ranges {template<class I1, class I2, class O>using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2>constexpr set_symmetric_difference_result<I1, I2, O> 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, iterator_t, O, Comp, Proj1, Proj2>constexpr set_symmetric_difference_result<borrowed_iterator_t, borrowed_iterator_t, O> set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, random_access_iterator O, sized_sentinel_for OutS, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<I1, I2, O, Comp, Proj1, Proj2> set_symmetric_difference_result<I1, I2, O> set_symmetric_difference(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, sized-random-access-range OutR, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>requires mergeable<iterator_t, iterator_t, iterator_t, Comp, Proj1, Proj2> set_symmetric_difference_result<borrowed_iterator_t, borrowed_iterator_t, borrowed_iterator_t> set_symmetric_difference(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.heap.operations], heap operationstemplateconstexpr void push_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I 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, Comp, Proj>constexpr borrowed_iterator_t push_heap(R&& r, Comp comp = {}, Proj proj = {}); }templateconstexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I 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, Comp, Proj>constexpr borrowed_iterator_t pop_heap(R&& r, Comp comp = {}, Proj proj = {}); }templateconstexpr void make_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I 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, Comp, Proj>constexpr borrowed_iterator_t make_heap(R&& r, Comp comp = {}, Proj proj = {}); }templateconstexpr void sort_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr I 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, Comp, Proj>constexpr borrowed_iterator_t sort_heap(R&& r, Comp comp = {}, Proj proj = {}); }templateconstexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last); template<class RandomAccessIterator, class Compare>constexpr bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); template<class ExecutionPolicy, class RandomAccessIterator>bool is_heap(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare>bool is_heap(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr bool 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, Proj>> Comp = ranges::less>constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>bool is_heap(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>bool is_heap(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr RandomAccessIterator is_heap_until(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> RandomAccessIterator is_heap_until(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last); template<class ExecutionPolicy, class RandomAccessIterator, class Compare> RandomAccessIterator is_heap_until(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] RandomAccessIterator first, RandomAccessIterator last, Compare comp); namespace ranges {template<random_access_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> I is_heap_until(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less> borrowed_iterator_t is_heap_until(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.min.max], minimum and maximumtemplate 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); templateconstexpr T min(initializer_list t); template<class T, class Compare>constexpr T min(initializer_list t, Compare comp); namespace ranges {template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr T min(initializer_list r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t>constexpr range_value_t min(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t> range_value_t min(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}template 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); templateconstexpr T max(initializer_list t); template<class T, class Compare>constexpr T max(initializer_list t, Compare comp); namespace ranges {template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr T max(initializer_list r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t>constexpr range_value_t max(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t> range_value_t max(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}template 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); templateconstexpr pair<T, T> minmax(initializer_list t); template<class T, class Compare>constexpr pair<T, T> minmax(initializer_list t, Compare comp); namespace ranges {templateusing minmax_result = min_max_result; template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr minmax_result<const T&> minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr minmax_result minmax(initializer_list r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t>constexpr minmax_result<range_value_t> minmax(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>requires indirectly_copyable_storable<iterator_t, range_value_t> minmax_result<range_value_t> minmax(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr ForwardIterator min_element(ForwardIterator first, ForwardIterator last); template<class ForwardIterator, class Compare>constexpr ForwardIterator min_element(ForwardIterator first, ForwardIterator last, Compare comp); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator min_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class Compare> ForwardIterator min_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t min_element(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> I min_element(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less> borrowed_iterator_t min_element(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr ForwardIterator max_element(ForwardIterator first, ForwardIterator last); template<class ForwardIterator, class Compare>constexpr ForwardIterator max_element(ForwardIterator first, ForwardIterator last, Compare comp); template<class ExecutionPolicy, class ForwardIterator> ForwardIterator max_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class Compare> ForwardIterator max_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Compare comp); namespace ranges {template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr I max_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>constexpr borrowed_iterator_t max_element(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> I max_element(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less> borrowed_iterator_t max_element(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}templateconstexpr pair<ForwardIterator, ForwardIterator> minmax_element(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> pair<ForwardIterator, ForwardIterator> minmax_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last); template<class ExecutionPolicy, class ForwardIterator, class Compare> pair<ForwardIterator, ForwardIterator> minmax_element(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator first, ForwardIterator last, Compare comp); namespace ranges {templateusing minmax_element_result = min_max_result; template<forward_iterator I, sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>constexpr minmax_element_result minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less>constexpr minmax_element_result<borrowed_iterator_t> minmax_element(R&& r, Comp comp = {}, Proj proj = {}); template<execution-policy Ep, random_access_iterator I, sized_sentinel_for S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> minmax_element_result minmax_element(Ep&& exec, I first, S last, Comp comp = {}, Proj proj = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R, class Proj = identity, indirect_strict_weak_order<projected<iterator_t, Proj>> Comp = ranges::less> minmax_element_result<borrowed_iterator_t> minmax_element(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {}); // freestanding-deleted}// [alg.clamp], bounded valuetemplateconstexpr 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); namespace ranges {template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>constexpr const T& clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); }// [alg.lex.comparison], lexicographical comparisontemplate<class InputIterator1, class InputIterator2>constexpr bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 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>bool lexicographical_compare(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, class Compare>bool lexicographical_compare(ExecutionPolicy&& exec, // freestanding-deleted, see [algorithms.parallel.overloads] ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Compare comp); namespace ranges {template<input_iterator I1, sentinel_for S1, input_iterator I2, sentinel_for S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less>constexpr bool 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, Proj1>, projected<iterator_t, Proj2>> Comp = ranges::less>constexpr bool lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<execution-policy Ep, random_access_iterator I1, sized_sentinel_for S1, random_access_iterator I2, sized_sentinel_for S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less>bool lexicographical_compare(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deletedtemplate<execution-policy Ep, sized-random-access-range R1, sized-random-access-range R2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order<projected<iterator_t, Proj1>, projected<iterator_t, Proj2>> Comp = ranges::less>bool lexicographical_compare(Ep&& exec, R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // freestanding-deleted}// [alg.three.way], three-way comparison algorithmstemplate<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)); template<class InputIterator1, class InputIterator2>constexpr auto lexicographical_compare_three_way(InputIterator1 b1, InputIterator1 e1, InputIterator2 b2, InputIterator2 e2); // [alg.permutation.generators], permutationstemplateconstexpr bool next_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare>constexpr bool next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); namespace ranges {templateusing next_permutation_result = in_found_result; template<bidirectional_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr next_permutation_result 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, Comp, Proj>constexpr next_permutation_result<borrowed_iterator_t> next_permutation(R&& r, Comp comp = {}, Proj proj = {}); }templateconstexpr bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last); template<class BidirectionalIterator, class Compare>constexpr bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); namespace ranges {templateusing prev_permutation_result = in_found_result; template<bidirectional_iterator I, sentinel_for S, class Comp = ranges::less, class Proj = identity>requires sortable<I, Comp, Proj>constexpr prev_permutation_result prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); template<bidirectional_range R, class Comp = ranges::less, class Proj = identity>requires sortable<iterator_t, Comp, Proj>constexpr prev_permutation_result<borrowed_iterator_t> prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); }}

329 KiB Raw Blame History

26 Algorithms library [algorithms]

26.4 Header synopsis [algorithm.syn]

329 KiB

Raw Blame History