10b57cec5SDimitry Andric// -*- C++ -*- 2349cc55cSDimitry Andric//===----------------------------------------------------------------------===// 30b57cec5SDimitry Andric// 40b57cec5SDimitry Andric// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 50b57cec5SDimitry Andric// See https://llvm.org/LICENSE.txt for license information. 60b57cec5SDimitry Andric// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 70b57cec5SDimitry Andric// 80b57cec5SDimitry Andric//===----------------------------------------------------------------------===// 90b57cec5SDimitry Andric 100b57cec5SDimitry Andric#ifndef _LIBCPP_ALGORITHM 110b57cec5SDimitry Andric#define _LIBCPP_ALGORITHM 120b57cec5SDimitry Andric 130b57cec5SDimitry Andric/* 140b57cec5SDimitry Andric algorithm synopsis 150b57cec5SDimitry Andric 160b57cec5SDimitry Andric#include <initializer_list> 170b57cec5SDimitry Andric 180b57cec5SDimitry Andricnamespace std 190b57cec5SDimitry Andric{ 200b57cec5SDimitry Andric 2104eeddc0SDimitry Andricnamespace ranges { 2281ad6265SDimitry Andric 2381ad6265SDimitry Andric // [algorithms.results], algorithm result types 2481ad6265SDimitry Andric template <class I, class F> 2581ad6265SDimitry Andric struct in_fun_result; // since C++20 2681ad6265SDimitry Andric 2704eeddc0SDimitry Andric template <class I1, class I2> 2804eeddc0SDimitry Andric struct in_in_result; // since C++20 291fd87a68SDimitry Andric 3081ad6265SDimitry Andric template <class I, class O> 3181ad6265SDimitry Andric struct in_out_result; // since C++20 3281ad6265SDimitry Andric 331fd87a68SDimitry Andric template <class I1, class I2, class O> 341fd87a68SDimitry Andric struct in_in_out_result; // since C++20 3581ad6265SDimitry Andric 3681ad6265SDimitry Andric template <class I, class O1, class O2> 3781ad6265SDimitry Andric struct in_out_out_result; // since C++20 3881ad6265SDimitry Andric 3981ad6265SDimitry Andric template <class I1, class I2> 4081ad6265SDimitry Andric struct min_max_result; // since C++20 4181ad6265SDimitry Andric 4281ad6265SDimitry Andric template <class I> 4381ad6265SDimitry Andric struct in_found_result; // since C++20 4481ad6265SDimitry Andric 4581ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 4681ad6265SDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20 4781ad6265SDimitry Andric constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); 4881ad6265SDimitry Andric 4981ad6265SDimitry Andric template<forward_range R, class Proj = identity, 5081ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20 5181ad6265SDimitry Andric constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); 5281ad6265SDimitry Andric 5381ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 5481ad6265SDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 5581ad6265SDimitry Andric constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 5681ad6265SDimitry Andric 5781ad6265SDimitry Andric template<forward_range R, class Proj = identity, 5881ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 5981ad6265SDimitry Andric constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 6081ad6265SDimitry Andric 6181ad6265SDimitry Andric template<class I1, class I2> 6281ad6265SDimitry Andric using mismatch_result = in_in_result<I1, I2>; 6381ad6265SDimitry Andric 6481ad6265SDimitry Andric template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2, 6581ad6265SDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 6681ad6265SDimitry Andric requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 6781ad6265SDimitry Andric constexpr mismatch_result<_I1, _I2> 6881ad6265SDimitry Andric mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 6981ad6265SDimitry Andric 7081ad6265SDimitry Andric template <input_range R1, input_range R2, 7181ad6265SDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 7281ad6265SDimitry Andric requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 7381ad6265SDimitry Andric constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 7481ad6265SDimitry Andric mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 7581ad6265SDimitry Andric 7681ad6265SDimitry Andric requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 7781ad6265SDimitry Andric constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20 7881ad6265SDimitry Andric 7981ad6265SDimitry Andric template<input_range R, class T, class Proj = identity> 8081ad6265SDimitry Andric requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 8181ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 8281ad6265SDimitry Andric find(R&& r, const T& value, Proj proj = {}); // since C++20 8381ad6265SDimitry Andric 8481ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 8581ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 8681ad6265SDimitry Andric constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 8781ad6265SDimitry Andric 8881ad6265SDimitry Andric template<input_range R, class Proj = identity, 8981ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 9081ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 9181ad6265SDimitry Andric find_if(R&& r, Pred pred, Proj proj = {}); // since C++20 9281ad6265SDimitry Andric 9381ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 9481ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 9581ad6265SDimitry Andric constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20 9681ad6265SDimitry Andric 9781ad6265SDimitry Andric template<input_range R, class Proj = identity, 9881ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 9981ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 10081ad6265SDimitry Andric find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20 10181ad6265SDimitry Andric 10281ad6265SDimitry Andric template<class T, class Proj = identity, 10381ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 10481ad6265SDimitry Andric constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 10581ad6265SDimitry Andric 10681ad6265SDimitry Andric template<copyable T, class Proj = identity, 10781ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 10881ad6265SDimitry Andric constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 10981ad6265SDimitry Andric 11081ad6265SDimitry Andric template<input_range R, class Proj = identity, 11181ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 11281ad6265SDimitry Andric requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 11381ad6265SDimitry Andric constexpr range_value_t<R> 11481ad6265SDimitry Andric min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 11581ad6265SDimitry Andric 11681ad6265SDimitry Andric template<class T, class Proj = identity, 11781ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 11881ad6265SDimitry Andric constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 11981ad6265SDimitry Andric 12081ad6265SDimitry Andric template<copyable T, class Proj = identity, 12181ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 12281ad6265SDimitry Andric constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 12381ad6265SDimitry Andric 12481ad6265SDimitry Andric template<input_range R, class Proj = identity, 12581ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 12681ad6265SDimitry Andric requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 12781ad6265SDimitry Andric constexpr range_value_t<R> 12881ad6265SDimitry Andric max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 12981ad6265SDimitry Andric 13081ad6265SDimitry Andric template<class I, class O> 13181ad6265SDimitry Andric using unary_transform_result = in_out_result<I, O>; // since C++20 13281ad6265SDimitry Andric 13381ad6265SDimitry Andric template<class I1, class I2, class O> 13481ad6265SDimitry Andric using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20 13581ad6265SDimitry Andric 13681ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 13781ad6265SDimitry Andric copy_constructible F, class Proj = identity> 13881ad6265SDimitry Andric requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> 13981ad6265SDimitry Andric constexpr ranges::unary_transform_result<I, O> 14081ad6265SDimitry Andric transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20 14181ad6265SDimitry Andric 14281ad6265SDimitry Andric template<input_range R, weakly_incrementable O, copy_constructible F, 14381ad6265SDimitry Andric class Proj = identity> 14481ad6265SDimitry Andric requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> 14581ad6265SDimitry Andric constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O> 14681ad6265SDimitry Andric transform(R&& r, O result, F op, Proj proj = {}); // since C++20 14781ad6265SDimitry Andric 14881ad6265SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 14981ad6265SDimitry Andric weakly_incrementable O, copy_constructible F, class Proj1 = identity, 15081ad6265SDimitry Andric class Proj2 = identity> 15181ad6265SDimitry Andric requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, 15281ad6265SDimitry Andric projected<I2, Proj2>>> 15381ad6265SDimitry Andric constexpr ranges::binary_transform_result<I1, I2, O> 15481ad6265SDimitry Andric transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, 15581ad6265SDimitry Andric F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 15681ad6265SDimitry Andric 15781ad6265SDimitry Andric template<input_range R1, input_range R2, weakly_incrementable O, 15881ad6265SDimitry Andric copy_constructible F, class Proj1 = identity, class Proj2 = identity> 15981ad6265SDimitry Andric requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, 16081ad6265SDimitry Andric projected<iterator_t<R2>, Proj2>>> 16181ad6265SDimitry Andric constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 16281ad6265SDimitry Andric transform(R1&& r1, R2&& r2, O result, 16381ad6265SDimitry Andric F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 16481ad6265SDimitry Andric 16581ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity> 16681ad6265SDimitry Andric requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 16781ad6265SDimitry Andric constexpr iter_difference_t<I> 16881ad6265SDimitry Andric count(I first, S last, const T& value, Proj proj = {}); // since C++20 16981ad6265SDimitry Andric 17081ad6265SDimitry Andric template<input_range R, class T, class Proj = identity> 17181ad6265SDimitry Andric requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 17281ad6265SDimitry Andric constexpr range_difference_t<R> 17381ad6265SDimitry Andric count(R&& r, const T& value, Proj proj = {}); // since C++20 17481ad6265SDimitry Andric 17581ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 17681ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 17781ad6265SDimitry Andric constexpr iter_difference_t<I> 17881ad6265SDimitry Andric count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 17981ad6265SDimitry Andric 18081ad6265SDimitry Andric template<input_range R, class Proj = identity, 18181ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 18281ad6265SDimitry Andric constexpr range_difference_t<R> 18381ad6265SDimitry Andric count_if(R&& r, Pred pred, Proj proj = {}); // since C++20 18481ad6265SDimitry Andric 18581ad6265SDimitry Andric template<class T> 18681ad6265SDimitry Andric using minmax_result = min_max_result<T>; 18781ad6265SDimitry Andric 18881ad6265SDimitry Andric template<class T, class Proj = identity, 18981ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 19081ad6265SDimitry Andric constexpr ranges::minmax_result<const T&> 19181ad6265SDimitry Andric minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 19281ad6265SDimitry Andric 19381ad6265SDimitry Andric template<copyable T, class Proj = identity, 19481ad6265SDimitry Andric indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 19581ad6265SDimitry Andric constexpr ranges::minmax_result<T> 19681ad6265SDimitry Andric minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 19781ad6265SDimitry Andric 19881ad6265SDimitry Andric template<input_range R, class Proj = identity, 19981ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 20081ad6265SDimitry Andric requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 20181ad6265SDimitry Andric constexpr ranges::minmax_result<range_value_t<R>> 20281ad6265SDimitry Andric minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 20381ad6265SDimitry Andric 20481ad6265SDimitry Andric template<class I> 20581ad6265SDimitry Andric using minmax_element_result = min_max_result<I>; 20681ad6265SDimitry Andric 20781ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 20881ad6265SDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 20981ad6265SDimitry Andric constexpr ranges::minmax_element_result<I> 21081ad6265SDimitry Andric minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 21181ad6265SDimitry Andric 21281ad6265SDimitry Andric template<forward_range R, class Proj = identity, 21381ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 21481ad6265SDimitry Andric constexpr ranges::minmax_element_result<borrowed_iterator_t<R>> 21581ad6265SDimitry Andric minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 21681ad6265SDimitry Andric 21781ad6265SDimitry Andric template<class I, class O> 21881ad6265SDimitry Andric using copy_result = in_out_result<I, O>; // since C++20 21981ad6265SDimitry Andric 22081ad6265SDimitry Andric template<class I, class O> 22181ad6265SDimitry Andric using copy_n_result = in_out_result<I, O>; // since C++20 22281ad6265SDimitry Andric 22381ad6265SDimitry Andric template<class I, class O> 22481ad6265SDimitry Andric using copy_if_result = in_out_result<I, O>; // since C++20 22581ad6265SDimitry Andric 22681ad6265SDimitry Andric template<class I1, class I2> 22781ad6265SDimitry Andric using copy_backward_result = in_out_result<I1, I2>; // since C++20 22881ad6265SDimitry Andric 22981ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> 23081ad6265SDimitry Andric requires indirectly_copyable<I, O> 23181ad6265SDimitry Andric constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20 23281ad6265SDimitry Andric 23381ad6265SDimitry Andric template<input_range R, weakly_incrementable O> 23481ad6265SDimitry Andric requires indirectly_copyable<iterator_t<R>, O> 23581ad6265SDimitry Andric constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20 23681ad6265SDimitry Andric 23781ad6265SDimitry Andric template<input_iterator I, weakly_incrementable O> 23881ad6265SDimitry Andric requires indirectly_copyable<I, O> 23981ad6265SDimitry Andric constexpr ranges::copy_n_result<I, O> 24081ad6265SDimitry Andric ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20 24181ad6265SDimitry Andric 24281ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, 24381ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 24481ad6265SDimitry Andric requires indirectly_copyable<I, O> 24581ad6265SDimitry Andric constexpr ranges::copy_if_result<I, O> 24681ad6265SDimitry Andric ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20 24781ad6265SDimitry Andric 24881ad6265SDimitry Andric template<input_range R, weakly_incrementable O, class Proj = identity, 24981ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 25081ad6265SDimitry Andric requires indirectly_copyable<iterator_t<R>, O> 25181ad6265SDimitry Andric constexpr ranges::copy_if_result<borrowed_iterator_t<R>, O> 25281ad6265SDimitry Andric ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20 25381ad6265SDimitry Andric 25481ad6265SDimitry Andric template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> 25581ad6265SDimitry Andric requires indirectly_copyable<I1, I2> 25681ad6265SDimitry Andric constexpr ranges::copy_backward_result<I1, I2> 25781ad6265SDimitry Andric ranges::copy_backward(I1 first, S1 last, I2 result); // since C++20 25881ad6265SDimitry Andric 25981ad6265SDimitry Andric template<bidirectional_range R, bidirectional_iterator I> 26081ad6265SDimitry Andric requires indirectly_copyable<iterator_t<R>, I> 26181ad6265SDimitry Andric constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I> 26281ad6265SDimitry Andric ranges::copy_backward(R&& r, I result); // since C++20 26381ad6265SDimitry Andric 26481ad6265SDimitry Andric template<class I, class F> 26581ad6265SDimitry Andric using for_each_result = in_fun_result<I, F>; // since C++20 26681ad6265SDimitry Andric 26781ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 26881ad6265SDimitry Andric indirectly_unary_invocable<projected<I, Proj>> Fun> 26981ad6265SDimitry Andric constexpr ranges::for_each_result<I, Fun> 27081ad6265SDimitry Andric ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20 27181ad6265SDimitry Andric 27281ad6265SDimitry Andric template<input_range R, class Proj = identity, 27381ad6265SDimitry Andric indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun> 27481ad6265SDimitry Andric constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun> 27581ad6265SDimitry Andric ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20 27681ad6265SDimitry Andric 27781ad6265SDimitry Andric template<input_iterator I, class Proj = identity, 27881ad6265SDimitry Andric indirectly_unary_invocable<projected<I, Proj>> Fun> 27981ad6265SDimitry Andric constexpr ranges::for_each_n_result<I, Fun> 28081ad6265SDimitry Andric ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20 28181ad6265SDimitry Andric 28281ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 28381ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 28481ad6265SDimitry Andric constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20 28581ad6265SDimitry Andric 28681ad6265SDimitry Andric template<input_range R, class Proj = identity, 28781ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 28881ad6265SDimitry Andric constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20 28981ad6265SDimitry Andric 290753f127fSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 291753f127fSDimitry Andric class Proj = identity> 292753f127fSDimitry Andric requires sortable<I, Comp, Proj> 293753f127fSDimitry Andric constexpr I 294753f127fSDimitry Andric ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 295753f127fSDimitry Andric 296753f127fSDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 297753f127fSDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 298753f127fSDimitry Andric constexpr borrowed_iterator_t<R> 299753f127fSDimitry Andric ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 300753f127fSDimitry Andric 301753f127fSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 302753f127fSDimitry Andric class Proj = identity> 303753f127fSDimitry Andric requires sortable<I, Comp, Proj> 304753f127fSDimitry Andric constexpr I 305753f127fSDimitry Andric ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 306753f127fSDimitry Andric 307753f127fSDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 308753f127fSDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 309753f127fSDimitry Andric constexpr borrowed_iterator_t<R> 310753f127fSDimitry Andric ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 311753f127fSDimitry Andric 312753f127fSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 313753f127fSDimitry Andric class Proj = identity> 314753f127fSDimitry Andric requires sortable<I, Comp, Proj> 315753f127fSDimitry Andric constexpr I 316753f127fSDimitry Andric ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 317753f127fSDimitry Andric 318753f127fSDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 319753f127fSDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 320753f127fSDimitry Andric constexpr borrowed_iterator_t<R> 321753f127fSDimitry Andric ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 322753f127fSDimitry Andric 323753f127fSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 324753f127fSDimitry Andric class Proj = identity> 325753f127fSDimitry Andric requires sortable<I, Comp, Proj> 326753f127fSDimitry Andric constexpr I 327753f127fSDimitry Andric ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 328753f127fSDimitry Andric 329753f127fSDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 330753f127fSDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 331753f127fSDimitry Andric constexpr borrowed_iterator_t<R> 332753f127fSDimitry Andric ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 333753f127fSDimitry Andric 334*972a253aSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, 335*972a253aSDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 336*972a253aSDimitry Andric constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 337*972a253aSDimitry Andric 338*972a253aSDimitry Andric template<random_access_range R, class Proj = identity, 339*972a253aSDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 340*972a253aSDimitry Andric constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 341*972a253aSDimitry Andric 342*972a253aSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, 343*972a253aSDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 344*972a253aSDimitry Andric constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // Since C++20 345*972a253aSDimitry Andric 346*972a253aSDimitry Andric template<random_access_range R, class Proj = identity, 347*972a253aSDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 348*972a253aSDimitry Andric constexpr borrowed_iterator_t<R> 349*972a253aSDimitry Andric is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // Since C++20 350*972a253aSDimitry Andric 35181ad6265SDimitry Andric template<bidirectional_iterator I, sentinel_for<I> S> 35281ad6265SDimitry Andric requires permutable<I> 35381ad6265SDimitry Andric constexpr I ranges::reverse(I first, S last); // since C++20 35481ad6265SDimitry Andric 35581ad6265SDimitry Andric template<bidirectional_range R> 35681ad6265SDimitry Andric requires permutable<iterator_t<R>> 35781ad6265SDimitry Andric constexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20 35881ad6265SDimitry Andric 35981ad6265SDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 36081ad6265SDimitry Andric class Proj = identity> 36181ad6265SDimitry Andric requires sortable<I, Comp, Proj> 36281ad6265SDimitry Andric constexpr I 36381ad6265SDimitry Andric ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 36481ad6265SDimitry Andric 36581ad6265SDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 36681ad6265SDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 36781ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 36881ad6265SDimitry Andric ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 36981ad6265SDimitry Andric 37081ad6265SDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 37181ad6265SDimitry Andric class Proj = identity> 37281ad6265SDimitry Andric requires sortable<I, Comp, Proj> 37381ad6265SDimitry Andric I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 37481ad6265SDimitry Andric 37581ad6265SDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 37681ad6265SDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 37781ad6265SDimitry Andric borrowed_iterator_t<R> 37881ad6265SDimitry Andric ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 37981ad6265SDimitry Andric 380fcaf7f86SDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 381fcaf7f86SDimitry Andric class Proj = identity> 382fcaf7f86SDimitry Andric requires sortable<I, Comp, Proj> 383fcaf7f86SDimitry Andric constexpr I 384fcaf7f86SDimitry Andric ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20 385fcaf7f86SDimitry Andric 386fcaf7f86SDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 387fcaf7f86SDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 388fcaf7f86SDimitry Andric constexpr borrowed_iterator_t<R> 389fcaf7f86SDimitry Andric ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20 390fcaf7f86SDimitry Andric 39181ad6265SDimitry Andric template<class T, output_iterator<const T&> O, sentinel_for<O> S> 39281ad6265SDimitry Andric constexpr O ranges::fill(O first, S last, const T& value); // since C++20 39381ad6265SDimitry Andric 39481ad6265SDimitry Andric template<class T, output_range<const T&> R> 39581ad6265SDimitry Andric constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20 39681ad6265SDimitry Andric 39781ad6265SDimitry Andric template<class T, output_iterator<const T&> O> 39881ad6265SDimitry Andric constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20 39981ad6265SDimitry Andric 400*972a253aSDimitry Andric template<input_or_output_iterator O, sentinel_for<O> S, copy_constructible F> 401*972a253aSDimitry Andric requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> 402*972a253aSDimitry Andric constexpr O generate(O first, S last, F gen); // Since C++20 403*972a253aSDimitry Andric 404*972a253aSDimitry Andric template<class R, copy_constructible F> 405*972a253aSDimitry Andric requires invocable<F&> && output_range<R, invoke_result_t<F&>> 406*972a253aSDimitry Andric constexpr borrowed_iterator_t<R> generate(R&& r, F gen); // Since C++20 407*972a253aSDimitry Andric 408*972a253aSDimitry Andric template<input_or_output_iterator O, copy_constructible F> 409*972a253aSDimitry Andric requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> 410*972a253aSDimitry Andric constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // Since C++20 411*972a253aSDimitry Andric 41281ad6265SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 41381ad6265SDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 41481ad6265SDimitry Andric requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 41581ad6265SDimitry Andric constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2, 41681ad6265SDimitry Andric Pred pred = {}, 41781ad6265SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 41881ad6265SDimitry Andric 41981ad6265SDimitry Andric template<input_range R1, input_range R2, class Pred = ranges::equal_to, 42081ad6265SDimitry Andric class Proj1 = identity, class Proj2 = identity> 42181ad6265SDimitry Andric requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 42281ad6265SDimitry Andric constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {}, 42381ad6265SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 42481ad6265SDimitry Andric 42581ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 42681ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 42781ad6265SDimitry Andric constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 42881ad6265SDimitry Andric 42981ad6265SDimitry Andric template<input_range R, class Proj = identity, 43081ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 43181ad6265SDimitry Andric constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20 43281ad6265SDimitry Andric 43381ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 43481ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 43581ad6265SDimitry Andric constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 43681ad6265SDimitry Andric 43781ad6265SDimitry Andric template<input_range R, class Proj = identity, 43881ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 43981ad6265SDimitry Andric constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C++20 44081ad6265SDimitry Andric 44181ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class Proj = identity, 44281ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 44381ad6265SDimitry Andric constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20 44481ad6265SDimitry Andric 44581ad6265SDimitry Andric template<input_range R, class Proj = identity, 44681ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 44781ad6265SDimitry Andric constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C++20 44881ad6265SDimitry Andric 44981ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 45081ad6265SDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 45181ad6265SDimitry Andric constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 45281ad6265SDimitry Andric 45381ad6265SDimitry Andric template<forward_range R, class Proj = identity, 45481ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 45581ad6265SDimitry Andric constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 45681ad6265SDimitry Andric 45781ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 45881ad6265SDimitry Andric indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 45981ad6265SDimitry Andric constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 46081ad6265SDimitry Andric 46181ad6265SDimitry Andric template<forward_range R, class Proj = identity, 46281ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 46381ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 46481ad6265SDimitry Andric ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 46581ad6265SDimitry Andric 466753f127fSDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, 467753f127fSDimitry Andric class Proj = identity> 468753f127fSDimitry Andric requires sortable<I, Comp, Proj> 469753f127fSDimitry Andric constexpr I 470753f127fSDimitry Andric ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20 471753f127fSDimitry Andric 472753f127fSDimitry Andric template<random_access_range R, class Comp = ranges::less, class Proj = identity> 473753f127fSDimitry Andric requires sortable<iterator_t<R>, Comp, Proj> 474753f127fSDimitry Andric constexpr borrowed_iterator_t<R> 475753f127fSDimitry Andric ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20 476753f127fSDimitry Andric 47781ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 47881ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 47981ad6265SDimitry Andric constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 48081ad6265SDimitry Andric 48181ad6265SDimitry Andric template<forward_range R, class T, class Proj = identity, 48281ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 48381ad6265SDimitry Andric ranges::less> 48481ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 48581ad6265SDimitry Andric upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 48681ad6265SDimitry Andric 48781ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 48881ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 48981ad6265SDimitry Andric constexpr I lower_bound(I first, S last, const T& value, Comp comp = {}, 49081ad6265SDimitry Andric Proj proj = {}); // since C++20 49181ad6265SDimitry Andric template<forward_range R, class T, class Proj = identity, 49281ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 49381ad6265SDimitry Andric ranges::less> 49481ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 49581ad6265SDimitry Andric lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 49681ad6265SDimitry Andric 49781ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 49881ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 49981ad6265SDimitry Andric constexpr bool binary_search(I first, S last, const T& value, Comp comp = {}, 50081ad6265SDimitry Andric Proj proj = {}); // since C++20 50181ad6265SDimitry Andric 50281ad6265SDimitry Andric template<forward_range R, class T, class Proj = identity, 50381ad6265SDimitry Andric indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 50481ad6265SDimitry Andric ranges::less> 50581ad6265SDimitry Andric constexpr bool binary_search(R&& r, const T& value, Comp comp = {}, 50681ad6265SDimitry Andric Proj proj = {}); // since C++20 507fcaf7f86SDimitry Andric 508fcaf7f86SDimitry Andric template<permutable I, sentinel_for<I> S, class Proj = identity, 509fcaf7f86SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 510fcaf7f86SDimitry Andric constexpr subrange<I> 511fcaf7f86SDimitry Andric partition(I first, S last, Pred pred, Proj proj = {}); // Since C++20 512fcaf7f86SDimitry Andric 513fcaf7f86SDimitry Andric template<forward_range R, class Proj = identity, 514fcaf7f86SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 515fcaf7f86SDimitry Andric requires permutable<iterator_t<R>> 516fcaf7f86SDimitry Andric constexpr borrowed_subrange_t<R> 517fcaf7f86SDimitry Andric partition(R&& r, Pred pred, Proj proj = {}); // Since C++20 518fcaf7f86SDimitry Andric 519fcaf7f86SDimitry Andric template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity, 520fcaf7f86SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 521fcaf7f86SDimitry Andric requires permutable<I> 522fcaf7f86SDimitry Andric subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // Since C++20 523fcaf7f86SDimitry Andric 524fcaf7f86SDimitry Andric template<bidirectional_range R, class Proj = identity, 525fcaf7f86SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 526fcaf7f86SDimitry Andric requires permutable<iterator_t<R>> 527fcaf7f86SDimitry Andric borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // Since C++20 528fcaf7f86SDimitry Andric 52981ad6265SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, 53081ad6265SDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 53181ad6265SDimitry Andric requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 53281ad6265SDimitry Andric constexpr I1 ranges::find_first_of(I1 first1, S1 last1, I2 first2, S2 last2, 53381ad6265SDimitry Andric Pred pred = {}, 53481ad6265SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 53581ad6265SDimitry Andric 53681ad6265SDimitry Andric template<input_range R1, forward_range R2, 53781ad6265SDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 53881ad6265SDimitry Andric requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 53981ad6265SDimitry Andric constexpr borrowed_iterator_t<R1> 54081ad6265SDimitry Andric ranges::find_first_of(R1&& r1, R2&& r2, 54181ad6265SDimitry Andric Pred pred = {}, 54281ad6265SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 54381ad6265SDimitry Andric 54481ad6265SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 54581ad6265SDimitry Andric indirect_binary_predicate<projected<I, Proj>, 54681ad6265SDimitry Andric projected<I, Proj>> Pred = ranges::equal_to> 54781ad6265SDimitry Andric constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C+20 54881ad6265SDimitry Andric 54981ad6265SDimitry Andric template<forward_range R, class Proj = identity, 55081ad6265SDimitry Andric indirect_binary_predicate<projected<iterator_t<R>, Proj>, 55181ad6265SDimitry Andric projected<iterator_t<R>, Proj>> Pred = ranges::equal_to> 55281ad6265SDimitry Andric constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20 55381ad6265SDimitry Andric 55481ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class T1, class T2, class Proj = identity> 55581ad6265SDimitry Andric requires indirectly_writable<I, const T2&> && 55681ad6265SDimitry Andric indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> 55781ad6265SDimitry Andric constexpr I 55881ad6265SDimitry Andric ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20 55981ad6265SDimitry Andric 56081ad6265SDimitry Andric template<input_range R, class T1, class T2, class Proj = identity> 56181ad6265SDimitry Andric requires indirectly_writable<iterator_t<R>, const T2&> && 56281ad6265SDimitry Andric indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*> 56381ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 56481ad6265SDimitry Andric ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20 56581ad6265SDimitry Andric 56681ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity, 56781ad6265SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 56881ad6265SDimitry Andric requires indirectly_writable<I, const T&> 56981ad6265SDimitry Andric constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20 57081ad6265SDimitry Andric 57181ad6265SDimitry Andric template<input_range R, class T, class Proj = identity, 57281ad6265SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 57381ad6265SDimitry Andric requires indirectly_writable<iterator_t<R>, const T&> 57481ad6265SDimitry Andric constexpr borrowed_iterator_t<R> 57581ad6265SDimitry Andric ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20 57681ad6265SDimitry Andric 57781ad6265SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 57881ad6265SDimitry Andric class Proj1 = identity, class Proj2 = identity, 57981ad6265SDimitry Andric indirect_strict_weak_order<projected<I1, Proj1>, 58081ad6265SDimitry Andric projected<I2, Proj2>> Comp = ranges::less> 58181ad6265SDimitry Andric constexpr bool 58281ad6265SDimitry Andric ranges::lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2, 58381ad6265SDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 58481ad6265SDimitry Andric 58581ad6265SDimitry Andric template<input_range R1, input_range R2, class Proj1 = identity, 58681ad6265SDimitry Andric class Proj2 = identity, 58781ad6265SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>, 58881ad6265SDimitry Andric projected<iterator_t<R2>, Proj2>> Comp = ranges::less> 58981ad6265SDimitry Andric constexpr bool 59081ad6265SDimitry Andric ranges::lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {}, 59181ad6265SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 59281ad6265SDimitry Andric 59381ad6265SDimitry Andric template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> 59481ad6265SDimitry Andric requires indirectly_movable<I1, I2> 59581ad6265SDimitry Andric constexpr ranges::move_backward_result<I1, I2> 59681ad6265SDimitry Andric ranges::move_backward(I1 first, S1 last, I2 result); // since C++20 59781ad6265SDimitry Andric 59881ad6265SDimitry Andric template<bidirectional_range R, bidirectional_iterator I> 59981ad6265SDimitry Andric requires indirectly_movable<iterator_t<R>, I> 60081ad6265SDimitry Andric constexpr ranges::move_backward_result<borrowed_iterator_t<R>, I> 60181ad6265SDimitry Andric ranges::move_backward(R&& r, I result); // since C++20 60281ad6265SDimitry Andric 60381ad6265SDimitry Andric template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> 60481ad6265SDimitry Andric requires indirectly_movable<I, O> 60581ad6265SDimitry Andric constexpr ranges::move_result<I, O> 60681ad6265SDimitry Andric ranges::move(I first, S last, O result); // since C++20 60781ad6265SDimitry Andric 60881ad6265SDimitry Andric template<input_range R, weakly_incrementable O> 60981ad6265SDimitry Andric requires indirectly_movable<iterator_t<R>, O> 61081ad6265SDimitry Andric constexpr ranges::move_result<borrowed_iterator_t<R>, O> 61181ad6265SDimitry Andric ranges::move(R&& r, O result); // since C++20 61281ad6265SDimitry Andric 613fcaf7f86SDimitry Andric template<class I, class O1, class O2> 614fcaf7f86SDimitry Andric using partition_copy_result = in_out_out_result<I, O1, O2>; // since C++20 615fcaf7f86SDimitry Andric 616fcaf7f86SDimitry Andric template<input_iterator I, sentinel_for<I> S, 617fcaf7f86SDimitry Andric weakly_incrementable O1, weakly_incrementable O2, 618fcaf7f86SDimitry Andric class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> 619fcaf7f86SDimitry Andric requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2> 620fcaf7f86SDimitry Andric constexpr partition_copy_result<I, O1, O2> 621fcaf7f86SDimitry Andric partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred, 622fcaf7f86SDimitry Andric Proj proj = {}); // Since C++20 623fcaf7f86SDimitry Andric 624fcaf7f86SDimitry Andric template<input_range R, weakly_incrementable O1, weakly_incrementable O2, 625fcaf7f86SDimitry Andric class Proj = identity, 626fcaf7f86SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 627fcaf7f86SDimitry Andric requires indirectly_copyable<iterator_t<R>, O1> && 628fcaf7f86SDimitry Andric indirectly_copyable<iterator_t<R>, O2> 629fcaf7f86SDimitry Andric constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2> 630fcaf7f86SDimitry Andric partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // Since C++20 631fcaf7f86SDimitry Andric 632fcaf7f86SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 633fcaf7f86SDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 634fcaf7f86SDimitry Andric constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); // Since C++20 635fcaf7f86SDimitry Andric 636fcaf7f86SDimitry Andric template<forward_range R, class Proj = identity, 637fcaf7f86SDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 638fcaf7f86SDimitry Andric constexpr borrowed_iterator_t<R> 639fcaf7f86SDimitry Andric partition_point(R&& r, Pred pred, Proj proj = {}); // Since C++20 640fcaf7f86SDimitry Andric 641753f127fSDimitry Andric template<class I1, class I2, class O> 642753f127fSDimitry Andric using merge_result = in_in_out_result<I1, I2, O>; // since C++20 643753f127fSDimitry Andric 644753f127fSDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 645753f127fSDimitry Andric weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, 646753f127fSDimitry Andric class Proj2 = identity> 647753f127fSDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 648753f127fSDimitry Andric constexpr merge_result<I1, I2, O> 649753f127fSDimitry Andric merge(I1 first1, S1 last1, I2 first2, S2 last2, O result, 650753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 651753f127fSDimitry Andric 652753f127fSDimitry Andric template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, 653753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 654753f127fSDimitry Andric requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 655753f127fSDimitry Andric constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 656753f127fSDimitry Andric merge(R1&& r1, R2&& r2, O result, 657753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 658753f127fSDimitry Andric 659753f127fSDimitry Andric template<permutable I, sentinel_for<I> S, class T, class Proj = identity> 660753f127fSDimitry Andric requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 661753f127fSDimitry Andric constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20 662753f127fSDimitry Andric 663753f127fSDimitry Andric template<forward_range R, class T, class Proj = identity> 664753f127fSDimitry Andric requires permutable<iterator_t<R>> && 665753f127fSDimitry Andric indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 666753f127fSDimitry Andric constexpr borrowed_subrange_t<R> 667753f127fSDimitry Andric ranges::remove(R&& r, const T& value, Proj proj = {}); // since C++20 668753f127fSDimitry Andric 669753f127fSDimitry Andric template<permutable I, sentinel_for<I> S, class Proj = identity, 670753f127fSDimitry Andric indirect_unary_predicate<projected<I, Proj>> Pred> 671753f127fSDimitry Andric constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 672753f127fSDimitry Andric 673753f127fSDimitry Andric template<forward_range R, class Proj = identity, 674753f127fSDimitry Andric indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 675753f127fSDimitry Andric requires permutable<iterator_t<R>> 676753f127fSDimitry Andric constexpr borrowed_subrange_t<R> 677753f127fSDimitry Andric ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // since C++20 678753f127fSDimitry Andric 679753f127fSDimitry Andric template<class I, class O> 680753f127fSDimitry Andric using set_difference_result = in_out_result<I, O>; // since C++20 681753f127fSDimitry Andric 682753f127fSDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 683753f127fSDimitry Andric weakly_incrementable O, class Comp = ranges::less, 684753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 685753f127fSDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 686753f127fSDimitry Andric constexpr set_difference_result<I1, O> 687753f127fSDimitry Andric set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, 688753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 689753f127fSDimitry Andric 690753f127fSDimitry Andric template<input_range R1, input_range R2, weakly_incrementable O, 691753f127fSDimitry Andric class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 692753f127fSDimitry Andric requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 693753f127fSDimitry Andric constexpr set_difference_result<borrowed_iterator_t<R1>, O> 694753f127fSDimitry Andric set_difference(R1&& r1, R2&& r2, O result, 695753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 696753f127fSDimitry Andric 697753f127fSDimitry Andric template<class I1, class I2, class O> 698753f127fSDimitry Andric using set_intersection_result = in_in_out_result<I1, I2, O>; // since C++20 699753f127fSDimitry Andric 700753f127fSDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 701753f127fSDimitry Andric weakly_incrementable O, class Comp = ranges::less, 702753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 703753f127fSDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 704753f127fSDimitry Andric constexpr set_intersection_result<I1, I2, O> 705753f127fSDimitry Andric set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result, 706753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 707753f127fSDimitry Andric 708753f127fSDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 709753f127fSDimitry Andric weakly_incrementable O, class Comp = ranges::less, 710753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 711753f127fSDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 712753f127fSDimitry Andric constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 713753f127fSDimitry Andric set_intersection(R1&& r1, R2&& r2, O result, 714753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 715753f127fSDimitry Andric 716753f127fSDimitry Andric template <class _InIter, class _OutIter> 717753f127fSDimitry Andric using reverse_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 718753f127fSDimitry Andric 719753f127fSDimitry Andric template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O> 720753f127fSDimitry Andric requires indirectly_copyable<I, O> 721753f127fSDimitry Andric constexpr ranges::reverse_copy_result<I, O> 722753f127fSDimitry Andric ranges::reverse_copy(I first, S last, O result); // since C++20 723753f127fSDimitry Andric 724753f127fSDimitry Andric template<bidirectional_range R, weakly_incrementable O> 725753f127fSDimitry Andric requires indirectly_copyable<iterator_t<R>, O> 726753f127fSDimitry Andric constexpr ranges::reverse_copy_result<borrowed_iterator_t<R>, O> 727753f127fSDimitry Andric ranges::reverse_copy(R&& r, O result); // since C++20 728753f127fSDimitry Andric 729753f127fSDimitry Andric template <class _InIter, class _OutIter> 730753f127fSDimitry Andric using rotate_copy_result = in_out_result<_InIter, _OutIter>; // since C++20 731753f127fSDimitry Andric 732753f127fSDimitry Andric template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O> 733753f127fSDimitry Andric requires indirectly_copyable<I, O> 734753f127fSDimitry Andric constexpr ranges::rotate_copy_result<I, O> 735753f127fSDimitry Andric ranges::rotate_copy(I first, I middle, S last, O result); // since C++20 736753f127fSDimitry Andric 737753f127fSDimitry Andric template<forward_range R, weakly_incrementable O> 738753f127fSDimitry Andric requires indirectly_copyable<iterator_t<R>, O> 739753f127fSDimitry Andric constexpr ranges::rotate_copy_result<borrowed_iterator_t<R>, O> 740753f127fSDimitry Andric ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // since C++20 741753f127fSDimitry Andric 742fcaf7f86SDimitry Andric template<random_access_iterator I, sentinel_for<I> S, class Gen> 743fcaf7f86SDimitry Andric requires permutable<I> && 744fcaf7f86SDimitry Andric uniform_random_bit_generator<remove_reference_t<Gen>> 745fcaf7f86SDimitry Andric I shuffle(I first, S last, Gen&& g); // Since C++20 746fcaf7f86SDimitry Andric 747fcaf7f86SDimitry Andric template<random_access_range R, class Gen> 748fcaf7f86SDimitry Andric requires permutable<iterator_t<R>> && 749fcaf7f86SDimitry Andric uniform_random_bit_generator<remove_reference_t<Gen>> 750fcaf7f86SDimitry Andric borrowed_iterator_t<R> shuffle(R&& r, Gen&& g); // Since C++20 751fcaf7f86SDimitry Andric 752753f127fSDimitry Andric template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, 753753f127fSDimitry Andric sentinel_for<I2> S2, class Pred = ranges::equal_to, 754753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 755753f127fSDimitry Andric requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 756753f127fSDimitry Andric constexpr subrange<I1> 757753f127fSDimitry Andric ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 758753f127fSDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 759753f127fSDimitry Andric 760753f127fSDimitry Andric template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, 761753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 762753f127fSDimitry Andric requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 763753f127fSDimitry Andric constexpr borrowed_subrange_t<R1> 764753f127fSDimitry Andric ranges::search(R1&& r1, R2&& r2, Pred pred = {}, 765753f127fSDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 766753f127fSDimitry Andric 767753f127fSDimitry Andric template<forward_iterator I, sentinel_for<I> S, class T, 768753f127fSDimitry Andric class Pred = ranges::equal_to, class Proj = identity> 769753f127fSDimitry Andric requires indirectly_comparable<I, const T*, Pred, Proj> 770753f127fSDimitry Andric constexpr subrange<I> 771753f127fSDimitry Andric ranges::search_n(I first, S last, iter_difference_t<I> count, 772753f127fSDimitry Andric const T& value, Pred pred = {}, Proj proj = {}); // since C++20 773753f127fSDimitry Andric 774753f127fSDimitry Andric template<forward_range R, class T, class Pred = ranges::equal_to, 775753f127fSDimitry Andric class Proj = identity> 776753f127fSDimitry Andric requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj> 777753f127fSDimitry Andric constexpr borrowed_subrange_t<R> 778753f127fSDimitry Andric ranges::search_n(R&& r, range_difference_t<R> count, 779753f127fSDimitry Andric const T& value, Pred pred = {}, Proj proj = {}); // since C++20 780753f127fSDimitry Andric 781753f127fSDimitry Andric template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, 782753f127fSDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 783753f127fSDimitry Andric requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 784753f127fSDimitry Andric constexpr subrange<I1> 785753f127fSDimitry Andric ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, 786753f127fSDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 787753f127fSDimitry Andric 788753f127fSDimitry Andric template<forward_range R1, forward_range R2, 789753f127fSDimitry Andric class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 790753f127fSDimitry Andric requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 791753f127fSDimitry Andric constexpr borrowed_subrange_t<R1> 792753f127fSDimitry Andric ranges::find_end(R1&& r1, R2&& r2, Pred pred = {}, 793753f127fSDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 794753f127fSDimitry Andric 795753f127fSDimitry Andric template<class I1, class I2, class O> 796753f127fSDimitry Andric using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20 797753f127fSDimitry Andric 798753f127fSDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 799753f127fSDimitry Andric weakly_incrementable O, class Comp = ranges::less, 800753f127fSDimitry Andric class Proj1 = identity, class Proj2 = identity> 801753f127fSDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 802753f127fSDimitry Andric constexpr set_symmetric_difference_result<I1, I2, O> 803753f127fSDimitry Andric set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, 804753f127fSDimitry Andric Comp comp = {}, Proj1 proj1 = {}, 805753f127fSDimitry Andric Proj2 proj2 = {}); // since C++20 806753f127fSDimitry Andric 807753f127fSDimitry Andric template<input_range R1, input_range R2, weakly_incrementable O, 808753f127fSDimitry Andric class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 809753f127fSDimitry Andric requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 810753f127fSDimitry Andric constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>, 811753f127fSDimitry Andric borrowed_iterator_t<R2>, O> 812753f127fSDimitry Andric set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, 813753f127fSDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 81481ad6265SDimitry Andric 815fcaf7f86SDimitry Andric template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity, 816fcaf7f86SDimitry Andric indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> 817fcaf7f86SDimitry Andric constexpr subrange<I> 818fcaf7f86SDimitry Andric equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 819fcaf7f86SDimitry Andric 820fcaf7f86SDimitry Andric template<forward_range R, class T, class Proj = identity, 821fcaf7f86SDimitry Andric indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp = 822fcaf7f86SDimitry Andric ranges::less> 823fcaf7f86SDimitry Andric constexpr borrowed_subrange_t<R> 824fcaf7f86SDimitry Andric equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20 825fcaf7f86SDimitry Andric 826fcaf7f86SDimitry Andric template<class I1, class I2, class O> 827fcaf7f86SDimitry Andric using set_union_result = in_in_out_result<I1, I2, O>; // since C++20 828fcaf7f86SDimitry Andric 829fcaf7f86SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 830fcaf7f86SDimitry Andric weakly_incrementable O, class Comp = ranges::less, 831fcaf7f86SDimitry Andric class Proj1 = identity, class Proj2 = identity> 832fcaf7f86SDimitry Andric requires mergeable<I1, I2, O, Comp, Proj1, Proj2> 833fcaf7f86SDimitry Andric constexpr set_union_result<I1, I2, O> 834fcaf7f86SDimitry Andric set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, 835fcaf7f86SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 836fcaf7f86SDimitry Andric 837fcaf7f86SDimitry Andric template<input_range R1, input_range R2, weakly_incrementable O, 838fcaf7f86SDimitry Andric class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> 839fcaf7f86SDimitry Andric requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> 840fcaf7f86SDimitry Andric constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 841fcaf7f86SDimitry Andric set_union(R1&& r1, R2&& r2, O result, Comp comp = {}, 842fcaf7f86SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 843fcaf7f86SDimitry Andric 844fcaf7f86SDimitry Andric template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 845fcaf7f86SDimitry Andric class Proj1 = identity, class Proj2 = identity, 846fcaf7f86SDimitry Andric indirect_strict_weak_order<projected<I1, Proj1>, projected<I2, Proj2>> Comp = 847fcaf7f86SDimitry Andric ranges::less> 848fcaf7f86SDimitry Andric constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, 849fcaf7f86SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 850fcaf7f86SDimitry Andric 851fcaf7f86SDimitry Andric template<input_range R1, input_range R2, class Proj1 = identity, 852fcaf7f86SDimitry Andric class Proj2 = identity, 853fcaf7f86SDimitry Andric indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>, 854fcaf7f86SDimitry Andric projected<iterator_t<R2>, Proj2>> Comp = ranges::less> 855fcaf7f86SDimitry Andric constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {}, 856fcaf7f86SDimitry Andric Proj1 proj1 = {}, Proj2 proj2 = {}); // Since C++20 85704eeddc0SDimitry Andric} 85804eeddc0SDimitry Andric 8590b57cec5SDimitry Andric constexpr bool // constexpr in C++20 8600b57cec5SDimitry Andric all_of(InputIterator first, InputIterator last, Predicate pred); 8610b57cec5SDimitry Andric 8620b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 8630b57cec5SDimitry Andric constexpr bool // constexpr in C++20 8640b57cec5SDimitry Andric any_of(InputIterator first, InputIterator last, Predicate pred); 8650b57cec5SDimitry Andric 8660b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 8670b57cec5SDimitry Andric constexpr bool // constexpr in C++20 8680b57cec5SDimitry Andric none_of(InputIterator first, InputIterator last, Predicate pred); 8690b57cec5SDimitry Andric 8700b57cec5SDimitry Andrictemplate <class InputIterator, class Function> 8710b57cec5SDimitry Andric constexpr Function // constexpr in C++20 8720b57cec5SDimitry Andric for_each(InputIterator first, InputIterator last, Function f); 8730b57cec5SDimitry Andric 8740b57cec5SDimitry Andrictemplate<class InputIterator, class Size, class Function> 8750b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 8760b57cec5SDimitry Andric for_each_n(InputIterator first, Size n, Function f); // C++17 8770b57cec5SDimitry Andric 8780b57cec5SDimitry Andrictemplate <class InputIterator, class T> 8790b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 8800b57cec5SDimitry Andric find(InputIterator first, InputIterator last, const T& value); 8810b57cec5SDimitry Andric 8820b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 8830b57cec5SDimitry Andric constexpr InputIterator // constexpr in C++20 8840b57cec5SDimitry Andric find_if(InputIterator first, InputIterator last, Predicate pred); 8850b57cec5SDimitry Andric 8860b57cec5SDimitry Andrictemplate<class InputIterator, class Predicate> 887e8d8bef9SDimitry Andric constexpr InputIterator // constexpr in C++20 8880b57cec5SDimitry Andric find_if_not(InputIterator first, InputIterator last, Predicate pred); 8890b57cec5SDimitry Andric 8900b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 891e8d8bef9SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 8920b57cec5SDimitry Andric find_end(ForwardIterator1 first1, ForwardIterator1 last1, 8930b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 8940b57cec5SDimitry Andric 8950b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 896e8d8bef9SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 8970b57cec5SDimitry Andric find_end(ForwardIterator1 first1, ForwardIterator1 last1, 8980b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 8990b57cec5SDimitry Andric 9000b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 9010b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 9020b57cec5SDimitry Andric find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 9030b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 9040b57cec5SDimitry Andric 9050b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 9060b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 9070b57cec5SDimitry Andric find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 9080b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 9090b57cec5SDimitry Andric 9100b57cec5SDimitry Andrictemplate <class ForwardIterator> 9110b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 9120b57cec5SDimitry Andric adjacent_find(ForwardIterator first, ForwardIterator last); 9130b57cec5SDimitry Andric 9140b57cec5SDimitry Andrictemplate <class ForwardIterator, class BinaryPredicate> 9150b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 9160b57cec5SDimitry Andric adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 9170b57cec5SDimitry Andric 9180b57cec5SDimitry Andrictemplate <class InputIterator, class T> 9190b57cec5SDimitry Andric constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 9200b57cec5SDimitry Andric count(InputIterator first, InputIterator last, const T& value); 9210b57cec5SDimitry Andric 9220b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 9230b57cec5SDimitry Andric constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 9240b57cec5SDimitry Andric count_if(InputIterator first, InputIterator last, Predicate pred); 9250b57cec5SDimitry Andric 9260b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 9270b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 9280b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 9290b57cec5SDimitry Andric 9300b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 9310b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 9320b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 9330b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2); // **C++14** 9340b57cec5SDimitry Andric 9350b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 9360b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 9370b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 9380b57cec5SDimitry Andric InputIterator2 first2, BinaryPredicate pred); 9390b57cec5SDimitry Andric 9400b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 9410b57cec5SDimitry Andric constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 9420b57cec5SDimitry Andric mismatch(InputIterator1 first1, InputIterator1 last1, 9430b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, 9440b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 9450b57cec5SDimitry Andric 9460b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 9470b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9480b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 9490b57cec5SDimitry Andric 9500b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 9510b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9520b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 9530b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2); // **C++14** 9540b57cec5SDimitry Andric 9550b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 9560b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9570b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 9580b57cec5SDimitry Andric InputIterator2 first2, BinaryPredicate pred); 9590b57cec5SDimitry Andric 9600b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 9610b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9620b57cec5SDimitry Andric equal(InputIterator1 first1, InputIterator1 last1, 9630b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, 9640b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 9650b57cec5SDimitry Andric 9660b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2> 9670b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9680b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 9690b57cec5SDimitry Andric ForwardIterator2 first2); 9700b57cec5SDimitry Andric 9710b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2> 9720b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9730b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 9740b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 9750b57cec5SDimitry Andric 9760b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 9770b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9780b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 9790b57cec5SDimitry Andric ForwardIterator2 first2, BinaryPredicate pred); 9800b57cec5SDimitry Andric 9810b57cec5SDimitry Andrictemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 9820b57cec5SDimitry Andric constexpr bool // constexpr in C++20 9830b57cec5SDimitry Andric is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 9840b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, 9850b57cec5SDimitry Andric BinaryPredicate pred); // **C++14** 9860b57cec5SDimitry Andric 9870b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 9880b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 9890b57cec5SDimitry Andric search(ForwardIterator1 first1, ForwardIterator1 last1, 9900b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2); 9910b57cec5SDimitry Andric 9920b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 9930b57cec5SDimitry Andric constexpr ForwardIterator1 // constexpr in C++20 9940b57cec5SDimitry Andric search(ForwardIterator1 first1, ForwardIterator1 last1, 9950b57cec5SDimitry Andric ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 9960b57cec5SDimitry Andric 9970b57cec5SDimitry Andrictemplate <class ForwardIterator, class Size, class T> 9980b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 9990b57cec5SDimitry Andric search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 10000b57cec5SDimitry Andric 10010b57cec5SDimitry Andrictemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 10020b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 10030b57cec5SDimitry Andric search_n(ForwardIterator first, ForwardIterator last, 10040b57cec5SDimitry Andric Size count, const T& value, BinaryPredicate pred); 10050b57cec5SDimitry Andric 10060b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator> 1007480093f4SDimitry Andric constexpr OutputIterator // constexpr in C++20 10080b57cec5SDimitry Andric copy(InputIterator first, InputIterator last, OutputIterator result); 10090b57cec5SDimitry Andric 10100b57cec5SDimitry Andrictemplate<class InputIterator, class OutputIterator, class Predicate> 1011480093f4SDimitry Andric constexpr OutputIterator // constexpr in C++20 10120b57cec5SDimitry Andric copy_if(InputIterator first, InputIterator last, 10130b57cec5SDimitry Andric OutputIterator result, Predicate pred); 10140b57cec5SDimitry Andric 10150b57cec5SDimitry Andrictemplate<class InputIterator, class Size, class OutputIterator> 1016480093f4SDimitry Andric constexpr OutputIterator // constexpr in C++20 10170b57cec5SDimitry Andric copy_n(InputIterator first, Size n, OutputIterator result); 10180b57cec5SDimitry Andric 10190b57cec5SDimitry Andrictemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1020480093f4SDimitry Andric constexpr BidirectionalIterator2 // constexpr in C++20 10210b57cec5SDimitry Andric copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 10220b57cec5SDimitry Andric BidirectionalIterator2 result); 10230b57cec5SDimitry Andric 102481ad6265SDimitry Andric// [alg.move], move 102581ad6265SDimitry Andrictemplate<class InputIterator, class OutputIterator> 102681ad6265SDimitry Andric constexpr OutputIterator move(InputIterator first, InputIterator last, 102781ad6265SDimitry Andric OutputIterator result); 102881ad6265SDimitry Andric 102981ad6265SDimitry Andrictemplate<class BidirectionalIterator1, class BidirectionalIterator2> 103081ad6265SDimitry Andric constexpr BidirectionalIterator2 103181ad6265SDimitry Andric move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 103281ad6265SDimitry Andric BidirectionalIterator2 result); 103381ad6265SDimitry Andric 10340b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 1035e8d8bef9SDimitry Andric constexpr ForwardIterator2 // constexpr in C++20 10360b57cec5SDimitry Andric swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 10370b57cec5SDimitry Andric 103881ad6265SDimitry Andricnamespace ranges { 103981ad6265SDimitry Andric template<class I1, class I2> 104081ad6265SDimitry Andric using swap_ranges_result = in_in_result<I1, I2>; 104181ad6265SDimitry Andric 104281ad6265SDimitry Andrictemplate<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 104381ad6265SDimitry Andric requires indirectly_swappable<I1, I2> 104481ad6265SDimitry Andric constexpr ranges::swap_ranges_result<I1, I2> 104581ad6265SDimitry Andric swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 104681ad6265SDimitry Andric 104781ad6265SDimitry Andrictemplate<input_range R1, input_range R2> 104881ad6265SDimitry Andric requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 104981ad6265SDimitry Andric constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 105081ad6265SDimitry Andric swap_ranges(R1&& r1, R2&& r2); 105181ad6265SDimitry Andric} 105281ad6265SDimitry Andric 10530b57cec5SDimitry Andrictemplate <class ForwardIterator1, class ForwardIterator2> 1054e8d8bef9SDimitry Andric constexpr void // constexpr in C++20 10550b57cec5SDimitry Andric iter_swap(ForwardIterator1 a, ForwardIterator2 b); 10560b57cec5SDimitry Andric 10570b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class UnaryOperation> 10580b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10590b57cec5SDimitry Andric transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 10600b57cec5SDimitry Andric 10610b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 10620b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10630b57cec5SDimitry Andric transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 10640b57cec5SDimitry Andric OutputIterator result, BinaryOperation binary_op); 10650b57cec5SDimitry Andric 10660b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 10670b57cec5SDimitry Andric constexpr void // constexpr in C++20 10680b57cec5SDimitry Andric replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 10690b57cec5SDimitry Andric 10700b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate, class T> 10710b57cec5SDimitry Andric constexpr void // constexpr in C++20 10720b57cec5SDimitry Andric replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 10730b57cec5SDimitry Andric 10740b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class T> 10750b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10760b57cec5SDimitry Andric replace_copy(InputIterator first, InputIterator last, OutputIterator result, 10770b57cec5SDimitry Andric const T& old_value, const T& new_value); 10780b57cec5SDimitry Andric 10790b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class Predicate, class T> 10800b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10810b57cec5SDimitry Andric replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 10820b57cec5SDimitry Andric 10830b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 10840b57cec5SDimitry Andric constexpr void // constexpr in C++20 10850b57cec5SDimitry Andric fill(ForwardIterator first, ForwardIterator last, const T& value); 10860b57cec5SDimitry Andric 10870b57cec5SDimitry Andrictemplate <class OutputIterator, class Size, class T> 10880b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10890b57cec5SDimitry Andric fill_n(OutputIterator first, Size n, const T& value); 10900b57cec5SDimitry Andric 10910b57cec5SDimitry Andrictemplate <class ForwardIterator, class Generator> 10920b57cec5SDimitry Andric constexpr void // constexpr in C++20 10930b57cec5SDimitry Andric generate(ForwardIterator first, ForwardIterator last, Generator gen); 10940b57cec5SDimitry Andric 10950b57cec5SDimitry Andrictemplate <class OutputIterator, class Size, class Generator> 10960b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 10970b57cec5SDimitry Andric generate_n(OutputIterator first, Size n, Generator gen); 10980b57cec5SDimitry Andric 10990b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 11000b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11010b57cec5SDimitry Andric remove(ForwardIterator first, ForwardIterator last, const T& value); 11020b57cec5SDimitry Andric 11030b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 11040b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11050b57cec5SDimitry Andric remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 11060b57cec5SDimitry Andric 11070b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class T> 11080b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 11090b57cec5SDimitry Andric remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 11100b57cec5SDimitry Andric 11110b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class Predicate> 11120b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 11130b57cec5SDimitry Andric remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 11140b57cec5SDimitry Andric 11150b57cec5SDimitry Andrictemplate <class ForwardIterator> 1116e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11170b57cec5SDimitry Andric unique(ForwardIterator first, ForwardIterator last); 11180b57cec5SDimitry Andric 11190b57cec5SDimitry Andrictemplate <class ForwardIterator, class BinaryPredicate> 1120e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11210b57cec5SDimitry Andric unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 11220b57cec5SDimitry Andric 11230b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator> 1124e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 11250b57cec5SDimitry Andric unique_copy(InputIterator first, InputIterator last, OutputIterator result); 11260b57cec5SDimitry Andric 11270b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 1128e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 11290b57cec5SDimitry Andric unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 11300b57cec5SDimitry Andric 11310b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 1132e8d8bef9SDimitry Andric constexpr void // constexpr in C++20 11330b57cec5SDimitry Andric reverse(BidirectionalIterator first, BidirectionalIterator last); 11340b57cec5SDimitry Andric 11350b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class OutputIterator> 11360b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 11370b57cec5SDimitry Andric reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 11380b57cec5SDimitry Andric 11390b57cec5SDimitry Andrictemplate <class ForwardIterator> 1140e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11410b57cec5SDimitry Andric rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 11420b57cec5SDimitry Andric 11430b57cec5SDimitry Andrictemplate <class ForwardIterator, class OutputIterator> 1144e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 11450b57cec5SDimitry Andric rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 11460b57cec5SDimitry Andric 11470b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 11480b57cec5SDimitry Andric void 11490b57cec5SDimitry Andric random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 11500b57cec5SDimitry Andric 11510b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class RandomNumberGenerator> 11520b57cec5SDimitry Andric void 11530b57cec5SDimitry Andric random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 11540b57cec5SDimitry Andric RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 11550b57cec5SDimitry Andric 11560b57cec5SDimitry Andrictemplate<class PopulationIterator, class SampleIterator, 11570b57cec5SDimitry Andric class Distance, class UniformRandomBitGenerator> 11580b57cec5SDimitry Andric SampleIterator sample(PopulationIterator first, PopulationIterator last, 11590b57cec5SDimitry Andric SampleIterator out, Distance n, 11600b57cec5SDimitry Andric UniformRandomBitGenerator&& g); // C++17 11610b57cec5SDimitry Andric 11620b57cec5SDimitry Andrictemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 11630b57cec5SDimitry Andric void shuffle(RandomAccessIterator first, RandomAccessIterator last, 11640b57cec5SDimitry Andric UniformRandomNumberGenerator&& g); 11650b57cec5SDimitry Andric 1166e8d8bef9SDimitry Andrictemplate<class ForwardIterator> 1167e8d8bef9SDimitry Andric constexpr ForwardIterator 1168e8d8bef9SDimitry Andric shift_left(ForwardIterator first, ForwardIterator last, 1169e8d8bef9SDimitry Andric typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1170e8d8bef9SDimitry Andric 1171e8d8bef9SDimitry Andrictemplate<class ForwardIterator> 1172e8d8bef9SDimitry Andric constexpr ForwardIterator 1173e8d8bef9SDimitry Andric shift_right(ForwardIterator first, ForwardIterator last, 1174e8d8bef9SDimitry Andric typename iterator_traits<ForwardIterator>::difference_type n); // C++20 1175e8d8bef9SDimitry Andric 11760b57cec5SDimitry Andrictemplate <class InputIterator, class Predicate> 11770b57cec5SDimitry Andric constexpr bool // constexpr in C++20 11780b57cec5SDimitry Andric is_partitioned(InputIterator first, InputIterator last, Predicate pred); 11790b57cec5SDimitry Andric 11800b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 1181e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11820b57cec5SDimitry Andric partition(ForwardIterator first, ForwardIterator last, Predicate pred); 11830b57cec5SDimitry Andric 11840b57cec5SDimitry Andrictemplate <class InputIterator, class OutputIterator1, 11850b57cec5SDimitry Andric class OutputIterator2, class Predicate> 11860b57cec5SDimitry Andric constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 11870b57cec5SDimitry Andric partition_copy(InputIterator first, InputIterator last, 11880b57cec5SDimitry Andric OutputIterator1 out_true, OutputIterator2 out_false, 11890b57cec5SDimitry Andric Predicate pred); 11900b57cec5SDimitry Andric 11910b57cec5SDimitry Andrictemplate <class ForwardIterator, class Predicate> 11920b57cec5SDimitry Andric ForwardIterator 11930b57cec5SDimitry Andric stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 11940b57cec5SDimitry Andric 11950b57cec5SDimitry Andrictemplate<class ForwardIterator, class Predicate> 11960b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 11970b57cec5SDimitry Andric partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 11980b57cec5SDimitry Andric 11990b57cec5SDimitry Andrictemplate <class ForwardIterator> 12000b57cec5SDimitry Andric constexpr bool // constexpr in C++20 12010b57cec5SDimitry Andric is_sorted(ForwardIterator first, ForwardIterator last); 12020b57cec5SDimitry Andric 12030b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 1204e8d8bef9SDimitry Andric constexpr bool // constexpr in C++20 12050b57cec5SDimitry Andric is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 12060b57cec5SDimitry Andric 12070b57cec5SDimitry Andrictemplate<class ForwardIterator> 12080b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12090b57cec5SDimitry Andric is_sorted_until(ForwardIterator first, ForwardIterator last); 12100b57cec5SDimitry Andric 12110b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 12120b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12130b57cec5SDimitry Andric is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 12140b57cec5SDimitry Andric 12150b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1216fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12170b57cec5SDimitry Andric sort(RandomAccessIterator first, RandomAccessIterator last); 12180b57cec5SDimitry Andric 12190b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1220fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12210b57cec5SDimitry Andric sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 12220b57cec5SDimitry Andric 12230b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 12240b57cec5SDimitry Andric void 12250b57cec5SDimitry Andric stable_sort(RandomAccessIterator first, RandomAccessIterator last); 12260b57cec5SDimitry Andric 12270b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 12280b57cec5SDimitry Andric void 12290b57cec5SDimitry Andric stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 12300b57cec5SDimitry Andric 12310b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1232fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12330b57cec5SDimitry Andric partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 12340b57cec5SDimitry Andric 12350b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1236fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12370b57cec5SDimitry Andric partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 12380b57cec5SDimitry Andric 12390b57cec5SDimitry Andrictemplate <class InputIterator, class RandomAccessIterator> 1240fe6060f1SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 12410b57cec5SDimitry Andric partial_sort_copy(InputIterator first, InputIterator last, 12420b57cec5SDimitry Andric RandomAccessIterator result_first, RandomAccessIterator result_last); 12430b57cec5SDimitry Andric 12440b57cec5SDimitry Andrictemplate <class InputIterator, class RandomAccessIterator, class Compare> 1245fe6060f1SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 12460b57cec5SDimitry Andric partial_sort_copy(InputIterator first, InputIterator last, 12470b57cec5SDimitry Andric RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 12480b57cec5SDimitry Andric 12490b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1250fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12510b57cec5SDimitry Andric nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 12520b57cec5SDimitry Andric 12530b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1254fe6060f1SDimitry Andric constexpr void // constexpr in C++20 12550b57cec5SDimitry Andric nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 12560b57cec5SDimitry Andric 12570b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 12580b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12590b57cec5SDimitry Andric lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 12600b57cec5SDimitry Andric 12610b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 12620b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12630b57cec5SDimitry Andric lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 12640b57cec5SDimitry Andric 12650b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 12660b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12670b57cec5SDimitry Andric upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 12680b57cec5SDimitry Andric 12690b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 12700b57cec5SDimitry Andric constexpr ForwardIterator // constexpr in C++20 12710b57cec5SDimitry Andric upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 12720b57cec5SDimitry Andric 12730b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 12740b57cec5SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 12750b57cec5SDimitry Andric equal_range(ForwardIterator first, ForwardIterator last, const T& value); 12760b57cec5SDimitry Andric 12770b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 12780b57cec5SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 12790b57cec5SDimitry Andric equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 12800b57cec5SDimitry Andric 12810b57cec5SDimitry Andrictemplate <class ForwardIterator, class T> 12820b57cec5SDimitry Andric constexpr bool // constexpr in C++20 12830b57cec5SDimitry Andric binary_search(ForwardIterator first, ForwardIterator last, const T& value); 12840b57cec5SDimitry Andric 12850b57cec5SDimitry Andrictemplate <class ForwardIterator, class T, class Compare> 12860b57cec5SDimitry Andric constexpr bool // constexpr in C++20 12870b57cec5SDimitry Andric binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 12880b57cec5SDimitry Andric 12890b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 1290e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 12910b57cec5SDimitry Andric merge(InputIterator1 first1, InputIterator1 last1, 12920b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 12930b57cec5SDimitry Andric 12940b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1295e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 12960b57cec5SDimitry Andric merge(InputIterator1 first1, InputIterator1 last1, 12970b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 12980b57cec5SDimitry Andric 12990b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 13000b57cec5SDimitry Andric void 13010b57cec5SDimitry Andric inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 13020b57cec5SDimitry Andric 13030b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 13040b57cec5SDimitry Andric void 13050b57cec5SDimitry Andric inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 13060b57cec5SDimitry Andric 13070b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 13080b57cec5SDimitry Andric constexpr bool // constexpr in C++20 13090b57cec5SDimitry Andric includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 13100b57cec5SDimitry Andric 13110b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class Compare> 13120b57cec5SDimitry Andric constexpr bool // constexpr in C++20 13130b57cec5SDimitry Andric includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 13140b57cec5SDimitry Andric 13150b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 1316e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13170b57cec5SDimitry Andric set_union(InputIterator1 first1, InputIterator1 last1, 13180b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 13190b57cec5SDimitry Andric 13200b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1321e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13220b57cec5SDimitry Andric set_union(InputIterator1 first1, InputIterator1 last1, 13230b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 13240b57cec5SDimitry Andric 13250b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 13260b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 13270b57cec5SDimitry Andric set_intersection(InputIterator1 first1, InputIterator1 last1, 13280b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 13290b57cec5SDimitry Andric 13300b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 13310b57cec5SDimitry Andric constexpr OutputIterator // constexpr in C++20 13320b57cec5SDimitry Andric set_intersection(InputIterator1 first1, InputIterator1 last1, 13330b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 13340b57cec5SDimitry Andric 13350b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 1336e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13370b57cec5SDimitry Andric set_difference(InputIterator1 first1, InputIterator1 last1, 13380b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 13390b57cec5SDimitry Andric 13400b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1341e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13420b57cec5SDimitry Andric set_difference(InputIterator1 first1, InputIterator1 last1, 13430b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 13440b57cec5SDimitry Andric 13450b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator> 1346e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13470b57cec5SDimitry Andric set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 13480b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result); 13490b57cec5SDimitry Andric 13500b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 1351e8d8bef9SDimitry Andric constexpr OutputIterator // constexpr in C++20 13520b57cec5SDimitry Andric set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 13530b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 13540b57cec5SDimitry Andric 13550b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1356fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13570b57cec5SDimitry Andric push_heap(RandomAccessIterator first, RandomAccessIterator last); 13580b57cec5SDimitry Andric 13590b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1360fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13610b57cec5SDimitry Andric push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 13620b57cec5SDimitry Andric 13630b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1364fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13650b57cec5SDimitry Andric pop_heap(RandomAccessIterator first, RandomAccessIterator last); 13660b57cec5SDimitry Andric 13670b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1368fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13690b57cec5SDimitry Andric pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 13700b57cec5SDimitry Andric 13710b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1372fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13730b57cec5SDimitry Andric make_heap(RandomAccessIterator first, RandomAccessIterator last); 13740b57cec5SDimitry Andric 13750b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1376fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13770b57cec5SDimitry Andric make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 13780b57cec5SDimitry Andric 13790b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 1380fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13810b57cec5SDimitry Andric sort_heap(RandomAccessIterator first, RandomAccessIterator last); 13820b57cec5SDimitry Andric 13830b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 1384fe6060f1SDimitry Andric constexpr void // constexpr in C++20 13850b57cec5SDimitry Andric sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 13860b57cec5SDimitry Andric 13870b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 13880b57cec5SDimitry Andric constexpr bool // constexpr in C++20 13890b57cec5SDimitry Andric is_heap(RandomAccessIterator first, RandomAccessiterator last); 13900b57cec5SDimitry Andric 13910b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 13920b57cec5SDimitry Andric constexpr bool // constexpr in C++20 13930b57cec5SDimitry Andric is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 13940b57cec5SDimitry Andric 13950b57cec5SDimitry Andrictemplate <class RandomAccessIterator> 13960b57cec5SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 13970b57cec5SDimitry Andric is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 13980b57cec5SDimitry Andric 13990b57cec5SDimitry Andrictemplate <class RandomAccessIterator, class Compare> 14000b57cec5SDimitry Andric constexpr RandomAccessIterator // constexpr in C++20 14010b57cec5SDimitry Andric is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 14020b57cec5SDimitry Andric 14030b57cec5SDimitry Andrictemplate <class ForwardIterator> 1404e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++14 1405e8d8bef9SDimitry Andric min_element(ForwardIterator first, ForwardIterator last); 14060b57cec5SDimitry Andric 14070b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 1408e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++14 1409e8d8bef9SDimitry Andric min_element(ForwardIterator first, ForwardIterator last, Compare comp); 14100b57cec5SDimitry Andric 14110b57cec5SDimitry Andrictemplate <class T> 1412e8d8bef9SDimitry Andric constexpr const T& // constexpr in C++14 1413e8d8bef9SDimitry Andric min(const T& a, const T& b); 14140b57cec5SDimitry Andric 14150b57cec5SDimitry Andrictemplate <class T, class Compare> 1416e8d8bef9SDimitry Andric constexpr const T& // constexpr in C++14 1417e8d8bef9SDimitry Andric min(const T& a, const T& b, Compare comp); 14180b57cec5SDimitry Andric 14190b57cec5SDimitry Andrictemplate<class T> 1420e8d8bef9SDimitry Andric constexpr T // constexpr in C++14 1421e8d8bef9SDimitry Andric min(initializer_list<T> t); 14220b57cec5SDimitry Andric 14230b57cec5SDimitry Andrictemplate<class T, class Compare> 1424e8d8bef9SDimitry Andric constexpr T // constexpr in C++14 1425e8d8bef9SDimitry Andric min(initializer_list<T> t, Compare comp); 14260b57cec5SDimitry Andric 14270b57cec5SDimitry Andrictemplate<class T> 14280b57cec5SDimitry Andric constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 14290b57cec5SDimitry Andric 14300b57cec5SDimitry Andrictemplate<class T, class Compare> 14310b57cec5SDimitry Andric constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 14320b57cec5SDimitry Andric 14330b57cec5SDimitry Andrictemplate <class ForwardIterator> 1434e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++14 1435e8d8bef9SDimitry Andric max_element(ForwardIterator first, ForwardIterator last); 14360b57cec5SDimitry Andric 14370b57cec5SDimitry Andrictemplate <class ForwardIterator, class Compare> 1438e8d8bef9SDimitry Andric constexpr ForwardIterator // constexpr in C++14 1439e8d8bef9SDimitry Andric max_element(ForwardIterator first, ForwardIterator last, Compare comp); 14400b57cec5SDimitry Andric 14410b57cec5SDimitry Andrictemplate <class T> 1442e8d8bef9SDimitry Andric constexpr const T& // constexpr in C++14 1443e8d8bef9SDimitry Andric max(const T& a, const T& b); 14440b57cec5SDimitry Andric 14450b57cec5SDimitry Andrictemplate <class T, class Compare> 1446e8d8bef9SDimitry Andric constexpr const T& // constexpr in C++14 1447e8d8bef9SDimitry Andric max(const T& a, const T& b, Compare comp); 14480b57cec5SDimitry Andric 14490b57cec5SDimitry Andrictemplate<class T> 1450e8d8bef9SDimitry Andric constexpr T // constexpr in C++14 1451e8d8bef9SDimitry Andric max(initializer_list<T> t); 14520b57cec5SDimitry Andric 14530b57cec5SDimitry Andrictemplate<class T, class Compare> 1454e8d8bef9SDimitry Andric constexpr T // constexpr in C++14 1455e8d8bef9SDimitry Andric max(initializer_list<T> t, Compare comp); 14560b57cec5SDimitry Andric 14570b57cec5SDimitry Andrictemplate<class ForwardIterator> 1458e8d8bef9SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1459e8d8bef9SDimitry Andric minmax_element(ForwardIterator first, ForwardIterator last); 14600b57cec5SDimitry Andric 14610b57cec5SDimitry Andrictemplate<class ForwardIterator, class Compare> 1462e8d8bef9SDimitry Andric constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 1463e8d8bef9SDimitry Andric minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 14640b57cec5SDimitry Andric 14650b57cec5SDimitry Andrictemplate<class T> 1466e8d8bef9SDimitry Andric constexpr pair<const T&, const T&> // constexpr in C++14 1467e8d8bef9SDimitry Andric minmax(const T& a, const T& b); 14680b57cec5SDimitry Andric 14690b57cec5SDimitry Andrictemplate<class T, class Compare> 1470e8d8bef9SDimitry Andric constexpr pair<const T&, const T&> // constexpr in C++14 1471e8d8bef9SDimitry Andric minmax(const T& a, const T& b, Compare comp); 14720b57cec5SDimitry Andric 14730b57cec5SDimitry Andrictemplate<class T> 1474e8d8bef9SDimitry Andric constexpr pair<T, T> // constexpr in C++14 1475e8d8bef9SDimitry Andric minmax(initializer_list<T> t); 14760b57cec5SDimitry Andric 14770b57cec5SDimitry Andrictemplate<class T, class Compare> 1478e8d8bef9SDimitry Andric constexpr pair<T, T> // constexpr in C++14 1479e8d8bef9SDimitry Andric minmax(initializer_list<T> t, Compare comp); 14800b57cec5SDimitry Andric 14810b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2> 14820b57cec5SDimitry Andric constexpr bool // constexpr in C++20 14830b57cec5SDimitry Andric lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 14840b57cec5SDimitry Andric 14850b57cec5SDimitry Andrictemplate <class InputIterator1, class InputIterator2, class Compare> 14860b57cec5SDimitry Andric constexpr bool // constexpr in C++20 14870b57cec5SDimitry Andric lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 14880b57cec5SDimitry Andric InputIterator2 first2, InputIterator2 last2, Compare comp); 14890b57cec5SDimitry Andric 14900b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 1491e8d8bef9SDimitry Andric constexpr bool // constexpr in C++20 14920b57cec5SDimitry Andric next_permutation(BidirectionalIterator first, BidirectionalIterator last); 14930b57cec5SDimitry Andric 14940b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 1495e8d8bef9SDimitry Andric constexpr bool // constexpr in C++20 14960b57cec5SDimitry Andric next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 14970b57cec5SDimitry Andric 14980b57cec5SDimitry Andrictemplate <class BidirectionalIterator> 1499e8d8bef9SDimitry Andric constexpr bool // constexpr in C++20 15000b57cec5SDimitry Andric prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 15010b57cec5SDimitry Andric 15020b57cec5SDimitry Andrictemplate <class BidirectionalIterator, class Compare> 1503e8d8bef9SDimitry Andric constexpr bool // constexpr in C++20 15040b57cec5SDimitry Andric prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 15050b57cec5SDimitry Andric} // std 15060b57cec5SDimitry Andric 15070b57cec5SDimitry Andric*/ 15080b57cec5SDimitry Andric 150981ad6265SDimitry Andric#include <__assert> // all public C++ headers provide the assertion handler 151081ad6265SDimitry Andric#include <__bits> 15110b57cec5SDimitry Andric#include <__config> 1512fe6060f1SDimitry Andric#include <__debug> 1513fe6060f1SDimitry Andric#include <cstddef> 15140b57cec5SDimitry Andric#include <cstring> 1515fe6060f1SDimitry Andric#include <memory> 1516fe6060f1SDimitry Andric#include <type_traits> 15170b57cec5SDimitry Andric#include <version> 15180b57cec5SDimitry Andric 1519fe6060f1SDimitry Andric#include <__algorithm/adjacent_find.h> 1520fe6060f1SDimitry Andric#include <__algorithm/all_of.h> 1521fe6060f1SDimitry Andric#include <__algorithm/any_of.h> 1522fe6060f1SDimitry Andric#include <__algorithm/binary_search.h> 1523fe6060f1SDimitry Andric#include <__algorithm/clamp.h> 1524fe6060f1SDimitry Andric#include <__algorithm/comp.h> 1525fe6060f1SDimitry Andric#include <__algorithm/comp_ref_type.h> 1526fe6060f1SDimitry Andric#include <__algorithm/copy.h> 1527fe6060f1SDimitry Andric#include <__algorithm/copy_backward.h> 1528fe6060f1SDimitry Andric#include <__algorithm/copy_if.h> 1529fe6060f1SDimitry Andric#include <__algorithm/copy_n.h> 1530fe6060f1SDimitry Andric#include <__algorithm/count.h> 1531fe6060f1SDimitry Andric#include <__algorithm/count_if.h> 1532fe6060f1SDimitry Andric#include <__algorithm/equal.h> 1533fe6060f1SDimitry Andric#include <__algorithm/equal_range.h> 1534fe6060f1SDimitry Andric#include <__algorithm/fill.h> 153504eeddc0SDimitry Andric#include <__algorithm/fill_n.h> 1536fe6060f1SDimitry Andric#include <__algorithm/find.h> 1537fe6060f1SDimitry Andric#include <__algorithm/find_end.h> 1538fe6060f1SDimitry Andric#include <__algorithm/find_first_of.h> 1539fe6060f1SDimitry Andric#include <__algorithm/find_if.h> 1540fe6060f1SDimitry Andric#include <__algorithm/find_if_not.h> 1541fe6060f1SDimitry Andric#include <__algorithm/for_each.h> 1542fe6060f1SDimitry Andric#include <__algorithm/for_each_n.h> 1543fe6060f1SDimitry Andric#include <__algorithm/generate.h> 154404eeddc0SDimitry Andric#include <__algorithm/generate_n.h> 1545fe6060f1SDimitry Andric#include <__algorithm/half_positive.h> 154681ad6265SDimitry Andric#include <__algorithm/in_found_result.h> 154781ad6265SDimitry Andric#include <__algorithm/in_fun_result.h> 15481fd87a68SDimitry Andric#include <__algorithm/in_in_out_result.h> 154904eeddc0SDimitry Andric#include <__algorithm/in_in_result.h> 155081ad6265SDimitry Andric#include <__algorithm/in_out_out_result.h> 155104eeddc0SDimitry Andric#include <__algorithm/in_out_result.h> 1552fe6060f1SDimitry Andric#include <__algorithm/includes.h> 1553fe6060f1SDimitry Andric#include <__algorithm/inplace_merge.h> 1554fe6060f1SDimitry Andric#include <__algorithm/is_heap.h> 1555fe6060f1SDimitry Andric#include <__algorithm/is_heap_until.h> 1556fe6060f1SDimitry Andric#include <__algorithm/is_partitioned.h> 1557fe6060f1SDimitry Andric#include <__algorithm/is_permutation.h> 1558fe6060f1SDimitry Andric#include <__algorithm/is_sorted.h> 1559fe6060f1SDimitry Andric#include <__algorithm/is_sorted_until.h> 1560fe6060f1SDimitry Andric#include <__algorithm/iter_swap.h> 1561fe6060f1SDimitry Andric#include <__algorithm/lexicographical_compare.h> 1562fe6060f1SDimitry Andric#include <__algorithm/lower_bound.h> 1563fe6060f1SDimitry Andric#include <__algorithm/make_heap.h> 1564fe6060f1SDimitry Andric#include <__algorithm/max.h> 1565fe6060f1SDimitry Andric#include <__algorithm/max_element.h> 1566fe6060f1SDimitry Andric#include <__algorithm/merge.h> 1567fe6060f1SDimitry Andric#include <__algorithm/min.h> 1568fe6060f1SDimitry Andric#include <__algorithm/min_element.h> 156981ad6265SDimitry Andric#include <__algorithm/min_max_result.h> 1570fe6060f1SDimitry Andric#include <__algorithm/minmax.h> 1571fe6060f1SDimitry Andric#include <__algorithm/minmax_element.h> 1572fe6060f1SDimitry Andric#include <__algorithm/mismatch.h> 1573fe6060f1SDimitry Andric#include <__algorithm/move.h> 1574fe6060f1SDimitry Andric#include <__algorithm/move_backward.h> 1575fe6060f1SDimitry Andric#include <__algorithm/next_permutation.h> 1576fe6060f1SDimitry Andric#include <__algorithm/none_of.h> 1577fe6060f1SDimitry Andric#include <__algorithm/nth_element.h> 1578fe6060f1SDimitry Andric#include <__algorithm/partial_sort.h> 1579fe6060f1SDimitry Andric#include <__algorithm/partial_sort_copy.h> 1580fe6060f1SDimitry Andric#include <__algorithm/partition.h> 1581fe6060f1SDimitry Andric#include <__algorithm/partition_copy.h> 1582fe6060f1SDimitry Andric#include <__algorithm/partition_point.h> 1583fe6060f1SDimitry Andric#include <__algorithm/pop_heap.h> 1584fe6060f1SDimitry Andric#include <__algorithm/prev_permutation.h> 1585fe6060f1SDimitry Andric#include <__algorithm/push_heap.h> 158681ad6265SDimitry Andric#include <__algorithm/ranges_adjacent_find.h> 158781ad6265SDimitry Andric#include <__algorithm/ranges_all_of.h> 158881ad6265SDimitry Andric#include <__algorithm/ranges_any_of.h> 158981ad6265SDimitry Andric#include <__algorithm/ranges_binary_search.h> 159081ad6265SDimitry Andric#include <__algorithm/ranges_copy.h> 159181ad6265SDimitry Andric#include <__algorithm/ranges_copy_backward.h> 159281ad6265SDimitry Andric#include <__algorithm/ranges_copy_if.h> 159381ad6265SDimitry Andric#include <__algorithm/ranges_copy_n.h> 159481ad6265SDimitry Andric#include <__algorithm/ranges_count.h> 159581ad6265SDimitry Andric#include <__algorithm/ranges_count_if.h> 159681ad6265SDimitry Andric#include <__algorithm/ranges_equal.h> 1597fcaf7f86SDimitry Andric#include <__algorithm/ranges_equal_range.h> 159881ad6265SDimitry Andric#include <__algorithm/ranges_fill.h> 159981ad6265SDimitry Andric#include <__algorithm/ranges_fill_n.h> 160081ad6265SDimitry Andric#include <__algorithm/ranges_find.h> 1601753f127fSDimitry Andric#include <__algorithm/ranges_find_end.h> 160281ad6265SDimitry Andric#include <__algorithm/ranges_find_first_of.h> 160381ad6265SDimitry Andric#include <__algorithm/ranges_find_if.h> 160481ad6265SDimitry Andric#include <__algorithm/ranges_find_if_not.h> 160581ad6265SDimitry Andric#include <__algorithm/ranges_for_each.h> 160681ad6265SDimitry Andric#include <__algorithm/ranges_for_each_n.h> 1607*972a253aSDimitry Andric#include <__algorithm/ranges_generate.h> 1608*972a253aSDimitry Andric#include <__algorithm/ranges_generate_n.h> 1609fcaf7f86SDimitry Andric#include <__algorithm/ranges_includes.h> 1610*972a253aSDimitry Andric#include <__algorithm/ranges_is_heap.h> 1611*972a253aSDimitry Andric#include <__algorithm/ranges_is_heap_until.h> 161281ad6265SDimitry Andric#include <__algorithm/ranges_is_partitioned.h> 161381ad6265SDimitry Andric#include <__algorithm/ranges_is_sorted.h> 161481ad6265SDimitry Andric#include <__algorithm/ranges_is_sorted_until.h> 161581ad6265SDimitry Andric#include <__algorithm/ranges_lexicographical_compare.h> 161681ad6265SDimitry Andric#include <__algorithm/ranges_lower_bound.h> 1617753f127fSDimitry Andric#include <__algorithm/ranges_make_heap.h> 161881ad6265SDimitry Andric#include <__algorithm/ranges_max.h> 161981ad6265SDimitry Andric#include <__algorithm/ranges_max_element.h> 1620753f127fSDimitry Andric#include <__algorithm/ranges_merge.h> 162181ad6265SDimitry Andric#include <__algorithm/ranges_min.h> 162281ad6265SDimitry Andric#include <__algorithm/ranges_min_element.h> 162381ad6265SDimitry Andric#include <__algorithm/ranges_minmax.h> 162481ad6265SDimitry Andric#include <__algorithm/ranges_minmax_element.h> 162581ad6265SDimitry Andric#include <__algorithm/ranges_mismatch.h> 162681ad6265SDimitry Andric#include <__algorithm/ranges_move.h> 162781ad6265SDimitry Andric#include <__algorithm/ranges_move_backward.h> 162881ad6265SDimitry Andric#include <__algorithm/ranges_none_of.h> 1629753f127fSDimitry Andric#include <__algorithm/ranges_nth_element.h> 1630fcaf7f86SDimitry Andric#include <__algorithm/ranges_partial_sort.h> 1631fcaf7f86SDimitry Andric#include <__algorithm/ranges_partition.h> 1632fcaf7f86SDimitry Andric#include <__algorithm/ranges_partition_copy.h> 1633fcaf7f86SDimitry Andric#include <__algorithm/ranges_partition_point.h> 1634753f127fSDimitry Andric#include <__algorithm/ranges_pop_heap.h> 1635753f127fSDimitry Andric#include <__algorithm/ranges_push_heap.h> 1636753f127fSDimitry Andric#include <__algorithm/ranges_remove.h> 1637753f127fSDimitry Andric#include <__algorithm/ranges_remove_if.h> 163881ad6265SDimitry Andric#include <__algorithm/ranges_replace.h> 163981ad6265SDimitry Andric#include <__algorithm/ranges_replace_if.h> 164081ad6265SDimitry Andric#include <__algorithm/ranges_reverse.h> 1641753f127fSDimitry Andric#include <__algorithm/ranges_reverse_copy.h> 1642753f127fSDimitry Andric#include <__algorithm/ranges_rotate_copy.h> 1643753f127fSDimitry Andric#include <__algorithm/ranges_search.h> 1644753f127fSDimitry Andric#include <__algorithm/ranges_search_n.h> 1645753f127fSDimitry Andric#include <__algorithm/ranges_set_difference.h> 1646753f127fSDimitry Andric#include <__algorithm/ranges_set_intersection.h> 1647753f127fSDimitry Andric#include <__algorithm/ranges_set_symmetric_difference.h> 1648fcaf7f86SDimitry Andric#include <__algorithm/ranges_set_union.h> 1649fcaf7f86SDimitry Andric#include <__algorithm/ranges_shuffle.h> 165081ad6265SDimitry Andric#include <__algorithm/ranges_sort.h> 1651753f127fSDimitry Andric#include <__algorithm/ranges_sort_heap.h> 1652fcaf7f86SDimitry Andric#include <__algorithm/ranges_stable_partition.h> 165381ad6265SDimitry Andric#include <__algorithm/ranges_stable_sort.h> 165481ad6265SDimitry Andric#include <__algorithm/ranges_swap_ranges.h> 165581ad6265SDimitry Andric#include <__algorithm/ranges_transform.h> 165681ad6265SDimitry Andric#include <__algorithm/ranges_upper_bound.h> 1657fe6060f1SDimitry Andric#include <__algorithm/remove.h> 1658fe6060f1SDimitry Andric#include <__algorithm/remove_copy.h> 1659fe6060f1SDimitry Andric#include <__algorithm/remove_copy_if.h> 1660fe6060f1SDimitry Andric#include <__algorithm/remove_if.h> 1661fe6060f1SDimitry Andric#include <__algorithm/replace.h> 1662fe6060f1SDimitry Andric#include <__algorithm/replace_copy.h> 1663fe6060f1SDimitry Andric#include <__algorithm/replace_copy_if.h> 1664fe6060f1SDimitry Andric#include <__algorithm/replace_if.h> 1665fe6060f1SDimitry Andric#include <__algorithm/reverse.h> 1666fe6060f1SDimitry Andric#include <__algorithm/reverse_copy.h> 1667fe6060f1SDimitry Andric#include <__algorithm/rotate.h> 1668fe6060f1SDimitry Andric#include <__algorithm/rotate_copy.h> 1669fe6060f1SDimitry Andric#include <__algorithm/sample.h> 1670fe6060f1SDimitry Andric#include <__algorithm/search.h> 1671fe6060f1SDimitry Andric#include <__algorithm/search_n.h> 1672fe6060f1SDimitry Andric#include <__algorithm/set_difference.h> 1673fe6060f1SDimitry Andric#include <__algorithm/set_intersection.h> 1674fe6060f1SDimitry Andric#include <__algorithm/set_symmetric_difference.h> 1675fe6060f1SDimitry Andric#include <__algorithm/set_union.h> 1676fe6060f1SDimitry Andric#include <__algorithm/shift_left.h> 1677fe6060f1SDimitry Andric#include <__algorithm/shift_right.h> 1678fe6060f1SDimitry Andric#include <__algorithm/shuffle.h> 1679fe6060f1SDimitry Andric#include <__algorithm/sift_down.h> 1680fe6060f1SDimitry Andric#include <__algorithm/sort.h> 1681fe6060f1SDimitry Andric#include <__algorithm/sort_heap.h> 1682fe6060f1SDimitry Andric#include <__algorithm/stable_partition.h> 1683fe6060f1SDimitry Andric#include <__algorithm/stable_sort.h> 1684fe6060f1SDimitry Andric#include <__algorithm/swap_ranges.h> 1685fe6060f1SDimitry Andric#include <__algorithm/transform.h> 1686fe6060f1SDimitry Andric#include <__algorithm/unique.h> 168704eeddc0SDimitry Andric#include <__algorithm/unique_copy.h> 1688fe6060f1SDimitry Andric#include <__algorithm/unwrap_iter.h> 1689fe6060f1SDimitry Andric#include <__algorithm/upper_bound.h> 16900b57cec5SDimitry Andric 169181ad6265SDimitry Andric#ifndef _LIBCPP_REMOVE_TRANSITIVE_INCLUDES 169281ad6265SDimitry Andric# include <chrono> 169381ad6265SDimitry Andric# include <iterator> 169481ad6265SDimitry Andric# include <utility> 169581ad6265SDimitry Andric#endif 169681ad6265SDimitry Andric 169781ad6265SDimitry Andric// standard-mandated includes 169881ad6265SDimitry Andric#include <initializer_list> 169981ad6265SDimitry Andric 17000b57cec5SDimitry Andric#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 17010b57cec5SDimitry Andric# pragma GCC system_header 17020b57cec5SDimitry Andric#endif 17030b57cec5SDimitry Andric 1704e40139ffSDimitry Andric#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 1705e40139ffSDimitry Andric# include <__pstl_algorithm> 1706e40139ffSDimitry Andric#endif 1707e40139ffSDimitry Andric 17080b57cec5SDimitry Andric#endif // _LIBCPP_ALGORITHM 1709