13e519524SHoward Hinnant// -*- C++ -*- 2eb8650a7SLouis Dionne//===----------------------------------------------------------------------===// 33e519524SHoward Hinnant// 457b08b09SChandler Carruth// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 557b08b09SChandler Carruth// See https://llvm.org/LICENSE.txt for license information. 657b08b09SChandler Carruth// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 73e519524SHoward Hinnant// 83e519524SHoward Hinnant//===----------------------------------------------------------------------===// 93e519524SHoward Hinnant 103e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 113e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 123e519524SHoward Hinnant 133e519524SHoward Hinnant/* 143e519524SHoward Hinnant algorithm synopsis 153e519524SHoward Hinnant 163e519524SHoward Hinnant#include <initializer_list> 173e519524SHoward Hinnant 183e519524SHoward Hinnantnamespace std 193e519524SHoward Hinnant{ 203e519524SHoward Hinnant 21d3729bb3SNikolas Klausernamespace ranges { 221e77b396SNikolas Klauser template <class I, class F> 231e77b396SNikolas Klauser struct in_fun_result; // since C++20 241e77b396SNikolas Klauser 25d3729bb3SNikolas Klauser template <class I1, class I2> 26d3729bb3SNikolas Klauser struct in_in_result; // since C++20 27f3514af4SNikolas Klauser 28f3514af4SNikolas Klauser template <class I1, class I2, class O> 29f3514af4SNikolas Klauser struct in_in_out_result; // since C++20 30610979b3SNikolas Klauser 31610979b3SNikolas Klauser template <class I, class O1, class O2> 32610979b3SNikolas Klauser struct in_out_out_result; // since C++20 331e77b396SNikolas Klauser 34807766beSNikolas Klauser template <class I1, class I2> 35807766beSNikolas Klauser struct min_max_result; // since C++20 36807766beSNikolas Klauser 3768f4131cSNikolas Klauser template <class I> 3868f4131cSNikolas Klauser struct in_found_result; // since C++20 3968f4131cSNikolas Klauser 403b470d1cSNikolas Klauser template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 413b470d1cSNikolas Klauser indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20 423b470d1cSNikolas Klauser constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); 433b470d1cSNikolas Klauser 443b470d1cSNikolas Klauser template<forward_range R, class Proj = identity, 453b470d1cSNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20 463b470d1cSNikolas Klauser constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); 47c2cd15a6SNikolas Klauser 48c2cd15a6SNikolas Klauser template <input_iterator I1, sentinel_for<_I1> S1, input_iterator I2, sentinel_for<_I2> S2, 49c2cd15a6SNikolas Klauser class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 50c2cd15a6SNikolas Klauser requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> 51c2cd15a6SNikolas Klauser constexpr mismatch_result<_I1, _I2> 52c2cd15a6SNikolas Klauser mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 53c2cd15a6SNikolas Klauser 54c2cd15a6SNikolas Klauser template <input_range R1, input_range R2, 55c2cd15a6SNikolas Klauser class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> 56c2cd15a6SNikolas Klauser requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> 57c2cd15a6SNikolas Klauser constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 58c2cd15a6SNikolas Klauser mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20 59ee0f8c40SNikolas Klauser 60ee0f8c40SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 61ee0f8c40SNikolas Klauser constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20 62ee0f8c40SNikolas Klauser 63ee0f8c40SNikolas Klauser template<input_range R, class T, class Proj = identity> 64ee0f8c40SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 65ee0f8c40SNikolas Klauser constexpr borrowed_iterator_t<R> 66ee0f8c40SNikolas Klauser find(R&& r, const T& value, Proj proj = {}); // since C++20 67ee0f8c40SNikolas Klauser 68ee0f8c40SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class Proj = identity, 69ee0f8c40SNikolas Klauser indirect_unary_predicate<projected<I, Proj>> Pred> 70ee0f8c40SNikolas Klauser constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 71ee0f8c40SNikolas Klauser 72ee0f8c40SNikolas Klauser template<input_range R, class Proj = identity, 73ee0f8c40SNikolas Klauser indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 74ee0f8c40SNikolas Klauser constexpr borrowed_iterator_t<R> 75ee0f8c40SNikolas Klauser find_if(R&& r, Pred pred, Proj proj = {}); // since C++20 76ee0f8c40SNikolas Klauser 77ee0f8c40SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class Proj = identity, 78ee0f8c40SNikolas Klauser indirect_unary_predicate<projected<I, Proj>> Pred> 79ee0f8c40SNikolas Klauser constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20 80ee0f8c40SNikolas Klauser 81ee0f8c40SNikolas Klauser template<input_range R, class Proj = identity, 82ee0f8c40SNikolas Klauser indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 83ee0f8c40SNikolas Klauser constexpr borrowed_iterator_t<R> 84ee0f8c40SNikolas Klauser find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20 85f83d833eSNikolas Klauser 86f83d833eSNikolas Klauser template<class T, class Proj = identity, 87f83d833eSNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 88f83d833eSNikolas Klauser constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 89f83d833eSNikolas Klauser 90f83d833eSNikolas Klauser template<copyable T, class Proj = identity, 91f83d833eSNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 92f83d833eSNikolas Klauser constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 93f83d833eSNikolas Klauser 94f83d833eSNikolas Klauser template<input_range R, class Proj = identity, 95f83d833eSNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 96f83d833eSNikolas Klauser requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 97f83d833eSNikolas Klauser constexpr range_value_t<R> 98f83d833eSNikolas Klauser min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 99e476df56SNikolas Klauser 100e476df56SNikolas Klauser template<class T, class Proj = identity, 101e476df56SNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 102e476df56SNikolas Klauser constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 103e476df56SNikolas Klauser 104e476df56SNikolas Klauser template<copyable T, class Proj = identity, 105e476df56SNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 106e476df56SNikolas Klauser constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 107e476df56SNikolas Klauser 108e476df56SNikolas Klauser template<input_range R, class Proj = identity, 109e476df56SNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 110e476df56SNikolas Klauser requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 111e476df56SNikolas Klauser constexpr range_value_t<R> 112e476df56SNikolas Klauser max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 1133ba8548cSNikolas Klauser 1143ba8548cSNikolas Klauser template<class I, class O> 1153ba8548cSNikolas Klauser using unary_transform_result = in_out_result<I, O>; // since C++20 1163ba8548cSNikolas Klauser 1173ba8548cSNikolas Klauser template<class I1, class I2, class O> 1183ba8548cSNikolas Klauser using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20 1193ba8548cSNikolas Klauser 1203ba8548cSNikolas Klauser template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 1213ba8548cSNikolas Klauser copy_constructible F, class Proj = identity> 1223ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> 1233ba8548cSNikolas Klauser constexpr ranges::unary_transform_result<I, O> 1243ba8548cSNikolas Klauser transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20 1253ba8548cSNikolas Klauser 1263ba8548cSNikolas Klauser template<input_range R, weakly_incrementable O, copy_constructible F, 1273ba8548cSNikolas Klauser class Proj = identity> 1283ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> 1293ba8548cSNikolas Klauser constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O> 1303ba8548cSNikolas Klauser transform(R&& r, O result, F op, Proj proj = {}); // since C++20 1313ba8548cSNikolas Klauser 1323ba8548cSNikolas Klauser template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 1333ba8548cSNikolas Klauser weakly_incrementable O, copy_constructible F, class Proj1 = identity, 1343ba8548cSNikolas Klauser class Proj2 = identity> 1353ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, 1363ba8548cSNikolas Klauser projected<I2, Proj2>>> 1373ba8548cSNikolas Klauser constexpr ranges::binary_transform_result<I1, I2, O> 1383ba8548cSNikolas Klauser transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, 1393ba8548cSNikolas Klauser F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 1403ba8548cSNikolas Klauser 1413ba8548cSNikolas Klauser template<input_range R1, input_range R2, weakly_incrementable O, 1423ba8548cSNikolas Klauser copy_constructible F, class Proj1 = identity, class Proj2 = identity> 1433ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, 1443ba8548cSNikolas Klauser projected<iterator_t<R2>, Proj2>>> 1453ba8548cSNikolas Klauser constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 1463ba8548cSNikolas Klauser transform(R1&& r1, R2&& r2, O result, 1473ba8548cSNikolas Klauser F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 1481306b102SNikolas Klauser 1491306b102SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity> 1501306b102SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 1511306b102SNikolas Klauser constexpr iter_difference_t<I> 1521306b102SNikolas Klauser count(I first, S last, const T& value, Proj proj = {}); // since C++20 1531306b102SNikolas Klauser 1541306b102SNikolas Klauser template<input_range R, class T, class Proj = identity> 1551306b102SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 1561306b102SNikolas Klauser constexpr range_difference_t<R> 1571306b102SNikolas Klauser count(R&& r, const T& value, Proj proj = {}); // since C++20 1581306b102SNikolas Klauser 1591306b102SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class Proj = identity, 1601306b102SNikolas Klauser indirect_unary_predicate<projected<I, Proj>> Pred> 1611306b102SNikolas Klauser constexpr iter_difference_t<I> 1621306b102SNikolas Klauser count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 1631306b102SNikolas Klauser 1641306b102SNikolas Klauser template<input_range R, class Proj = identity, 1651306b102SNikolas Klauser indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 1661306b102SNikolas Klauser constexpr range_difference_t<R> 1671306b102SNikolas Klauser count_if(R&& r, Pred pred, Proj proj = {}); // since C++20 168*58d9ab70SNikolas Klauser 169*58d9ab70SNikolas Klauser template<class T, class Proj = identity, 170*58d9ab70SNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 171*58d9ab70SNikolas Klauser constexpr ranges::minmax_result<const T&> 172*58d9ab70SNikolas Klauser minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 173*58d9ab70SNikolas Klauser 174*58d9ab70SNikolas Klauser template<copyable T, class Proj = identity, 175*58d9ab70SNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 176*58d9ab70SNikolas Klauser constexpr ranges::minmax_result<T> 177*58d9ab70SNikolas Klauser minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 178*58d9ab70SNikolas Klauser 179*58d9ab70SNikolas Klauser template<input_range R, class Proj = identity, 180*58d9ab70SNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 181*58d9ab70SNikolas Klauser requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 182*58d9ab70SNikolas Klauser constexpr ranges::minmax_result<range_value_t<R>> 183*58d9ab70SNikolas Klauser minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 184*58d9ab70SNikolas Klauser 185*58d9ab70SNikolas Klauser template<forward_iterator I, sentinel_for<I> S, class Proj = identity, 186*58d9ab70SNikolas Klauser indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 187*58d9ab70SNikolas Klauser constexpr ranges::minmax_element_result<I> 188*58d9ab70SNikolas Klauser minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20 189*58d9ab70SNikolas Klauser 190*58d9ab70SNikolas Klauser template<forward_range R, class Proj = identity, 191*58d9ab70SNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 192*58d9ab70SNikolas Klauser constexpr ranges::minmax_element_result<borrowed_iterator_t<R>> 193*58d9ab70SNikolas Klauser minmax_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 194d3729bb3SNikolas Klauser} 195d3729bb3SNikolas Klauser 196706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1973e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 1983e519524SHoward Hinnant 1993e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 200706ffef7SMarshall Clow constexpr bool // constexpr in C++20 2013e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 2023e519524SHoward Hinnant 2033e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 204706ffef7SMarshall Clow constexpr bool // constexpr in C++20 2053e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 2063e519524SHoward Hinnant 2073e519524SHoward Hinnanttemplate <class InputIterator, class Function> 2081b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 2093e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 2103e519524SHoward Hinnant 211d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 2121b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 2131b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 214d5c65ffaSMarshall Clow 2153e519524SHoward Hinnanttemplate <class InputIterator, class T> 21649c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 2173e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 2183e519524SHoward Hinnant 2193e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 22049c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 2213e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 2223e519524SHoward Hinnant 2233e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 224b8bc4e15SArthur O'Dwyer constexpr InputIterator // constexpr in C++20 2253e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 2263e519524SHoward Hinnant 2273e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 228b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 2293e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 2303e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2313e519524SHoward Hinnant 2323e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 233b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 2343e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 2353e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 2388694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2393e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 2403e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 2438694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2443e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 2453e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2463e519524SHoward Hinnant 2473e519524SHoward Hinnanttemplate <class ForwardIterator> 2488694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2493e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 2503e519524SHoward Hinnant 2513e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2528694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2533e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2543e519524SHoward Hinnant 2553e519524SHoward Hinnanttemplate <class InputIterator, class T> 256056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2573e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 2583e519524SHoward Hinnant 2593e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 260056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2613e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 2623e519524SHoward Hinnant 2633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2646538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2653e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2663e519524SHoward Hinnant 2670b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2686538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2690b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 2700b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 2710b0bbd2fSMarshall Clow 2723e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2736538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2743e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 2753e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2763e519524SHoward Hinnant 2770b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2786538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2790b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 2800b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2810b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2820b0bbd2fSMarshall Clow 2833e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2846538e28dSMarshall Clow constexpr bool // constexpr in C++20 2853e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2863e519524SHoward Hinnant 2870b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2886538e28dSMarshall Clow constexpr bool // constexpr in C++20 2890b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2900b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 2910b0bbd2fSMarshall Clow 2923e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2936538e28dSMarshall Clow constexpr bool // constexpr in C++20 2943e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 2953e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2963e519524SHoward Hinnant 2970b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2986538e28dSMarshall Clow constexpr bool // constexpr in C++20 2990b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 3000b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 3010b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 3020b0bbd2fSMarshall Clow 3033e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 30449c7643cSMarshall Clow constexpr bool // constexpr in C++20 3053e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 3063e519524SHoward Hinnant ForwardIterator2 first2); 3073e519524SHoward Hinnant 3080b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 30949c7643cSMarshall Clow constexpr bool // constexpr in C++20 3100b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 3110b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 3120b0bbd2fSMarshall Clow 3133e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 31449c7643cSMarshall Clow constexpr bool // constexpr in C++20 3153e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 3163e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 3173e519524SHoward Hinnant 3180b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 31949c7643cSMarshall Clow constexpr bool // constexpr in C++20 3200b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 3210b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 3220b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 3230b0bbd2fSMarshall Clow 3243e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 32512f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 3263e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 3273e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 33012f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 3313e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 3323e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 33512f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3363e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 33912f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3403e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 3413e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 3423e519524SHoward Hinnant 3433e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 34413c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3453e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 3463e519524SHoward Hinnant 3473e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 34813c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3493e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 3503e519524SHoward Hinnant OutputIterator result, Predicate pred); 3513e519524SHoward Hinnant 3523e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 35313c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3543e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 3553e519524SHoward Hinnant 3563e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 35713c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 3583e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 3593e519524SHoward Hinnant BidirectionalIterator2 result); 3603e519524SHoward Hinnant 3613e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 362b8bc4e15SArthur O'Dwyer constexpr ForwardIterator2 // constexpr in C++20 3633e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 3643e519524SHoward Hinnant 3659d905319SNikolas Klausertemplate<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 3669d905319SNikolas Klauser requires indirectly_swappable<I1, I2> 3679d905319SNikolas Klauser constexpr ranges::swap_ranges_result<I1, I2> 3689d905319SNikolas Klauser ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 3699d905319SNikolas Klauser 3709d905319SNikolas Klausertemplate<input_range R1, input_range R2> 3719d905319SNikolas Klauser requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 3729d905319SNikolas Klauser constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 3739d905319SNikolas Klauser ranges::swap_ranges(R1&& r1, R2&& r2); 3749d905319SNikolas Klauser 3753e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 376b8bc4e15SArthur O'Dwyer constexpr void // constexpr in C++20 3773e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 38099894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3813e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 38499894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3853e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 3863e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 38912c7423fSMarshall Clow constexpr void // constexpr in C++20 3903e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 39312c7423fSMarshall Clow constexpr void // constexpr in C++20 3943e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 39712c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3983e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 3993e519524SHoward Hinnant const T& old_value, const T& new_value); 4003e519524SHoward Hinnant 4013e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 40212c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 4033e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4064bfb9313SMarshall Clow constexpr void // constexpr in C++20 4073e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 4083e519524SHoward Hinnant 4093e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 4104bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 4113e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 4144bfb9313SMarshall Clow constexpr void // constexpr in C++20 4153e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 4184bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 4193e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 4203e519524SHoward Hinnant 4213e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 422e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4233e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 4243e519524SHoward Hinnant 4253e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 426e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4273e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 4283e519524SHoward Hinnant 4293e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 430e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4313e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 4323e519524SHoward Hinnant 4333e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 434e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4353e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 4363e519524SHoward Hinnant 4373e519524SHoward Hinnanttemplate <class ForwardIterator> 438b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4393e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 4403e519524SHoward Hinnant 4413e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 442b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4433e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 4443e519524SHoward Hinnant 4453e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 446b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4473e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 450b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4513e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class BidirectionalIterator> 454f851db3dSArthur O'Dwyer constexpr void // constexpr in C++20 4553e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 4563e519524SHoward Hinnant 4573e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 458e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4593e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 4603e519524SHoward Hinnant 4613e519524SHoward Hinnanttemplate <class ForwardIterator> 462b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4633e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 4643e519524SHoward Hinnant 4653e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 466b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4673e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4703e519524SHoward Hinnant void 4710f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 4743e519524SHoward Hinnant void 47506965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 4760f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 4773e519524SHoward Hinnant 478e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 479e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 480e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 481e7154709SEric Fiselier SampleIterator out, Distance n, 482e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 483e7154709SEric Fiselier 484f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 485f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 486fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 487f9d540b0SHoward Hinnant 4883fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4893fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4903fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 4913fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4923fbd3eafSArthur O'Dwyer 4933fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4943fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4953fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 4963fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4973fbd3eafSArthur O'Dwyer 4983e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 49949c7643cSMarshall Clow constexpr bool // constexpr in C++20 5003e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 5013e519524SHoward Hinnant 5023e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 503f851db3dSArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 5043e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 5053e519524SHoward Hinnant 5063e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 5073e519524SHoward Hinnant class OutputIterator2, class Predicate> 5081b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 5093e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 5103e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 5113e519524SHoward Hinnant Predicate pred); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 5143e519524SHoward Hinnant ForwardIterator 5153e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 518d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5193e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 5203e519524SHoward Hinnant 5213e519524SHoward Hinnanttemplate <class ForwardIterator> 52249c7643cSMarshall Clow constexpr bool // constexpr in C++20 5233e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 5243e519524SHoward Hinnant 5253e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 526b8bc4e15SArthur O'Dwyer constexpr bool // constexpr in C++20 5273e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 5283e519524SHoward Hinnant 5293e519524SHoward Hinnanttemplate<class ForwardIterator> 530056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 5313e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 534056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 5353e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate <class RandomAccessIterator> 538493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 5393e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 542493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 5433e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5463e519524SHoward Hinnant void 5473e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5503e519524SHoward Hinnant void 5513e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5523e519524SHoward Hinnant 5533e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5545386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5553e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 5563e519524SHoward Hinnant 5573e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5585386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5593e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 5603e519524SHoward Hinnant 5613e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 5625386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5633e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5643e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 5653e519524SHoward Hinnant 5663e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 5675386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5683e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5693e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 5703e519524SHoward Hinnant 5713e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5725d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5733e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 5743e519524SHoward Hinnant 5753e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5765d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5773e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 5783e519524SHoward Hinnant 5793e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 580d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5813e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 5823e519524SHoward Hinnant 5833e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 584d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5853e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5863e519524SHoward Hinnant 5873e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 588d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5893e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 5903e519524SHoward Hinnant 5913e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 592d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5933e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5943e519524SHoward Hinnant 5953e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 596d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5973e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 5983e519524SHoward Hinnant 5993e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 600d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 6013e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 6023e519524SHoward Hinnant 6033e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 604d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 6053e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 6088da1a487SMarshall Clow constexpr bool // constexpr in C++20 6093e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 6103e519524SHoward Hinnant 6113e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 61214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6133e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 6143e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6153e519524SHoward Hinnant 6163e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 61714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6183e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 6193e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6223e519524SHoward Hinnant void 6233e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 6243e519524SHoward Hinnant 6253e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6263e519524SHoward Hinnant void 6273e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 6283e519524SHoward Hinnant 6293e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6308da1a487SMarshall Clow constexpr bool // constexpr in C++20 6313e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6323e519524SHoward Hinnant 6333e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6348da1a487SMarshall Clow constexpr bool // constexpr in C++20 6353e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 6363e519524SHoward Hinnant 6373e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 63814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6393e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 6403e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6413e519524SHoward Hinnant 6423e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 64314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6443e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 6453e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6463e519524SHoward Hinnant 6473e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 6488da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6493e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6503e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6513e519524SHoward Hinnant 6523e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 6538da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6543e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6553e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6563e519524SHoward Hinnant 6573e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 65814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6593e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 6603e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6613e519524SHoward Hinnant 6623e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 66314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6643e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 6653e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 66814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6693e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6703e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6713e519524SHoward Hinnant 6723e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 67314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6743e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6753e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6763e519524SHoward Hinnant 6773e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6785386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6793e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6825386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6833e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6843e519524SHoward Hinnant 6853e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6865386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6873e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 6883e519524SHoward Hinnant 6893e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6905386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6913e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6923e519524SHoward Hinnant 6933e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6945386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6953e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 6963e519524SHoward Hinnant 6973e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6985386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6993e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 7003e519524SHoward Hinnant 7013e519524SHoward Hinnanttemplate <class RandomAccessIterator> 7025386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 7033e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 7043e519524SHoward Hinnant 7053e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 7065386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 7073e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 7083e519524SHoward Hinnant 7093e519524SHoward Hinnanttemplate <class RandomAccessIterator> 71049c7643cSMarshall Clow constexpr bool // constexpr in C++20 7113e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 7123e519524SHoward Hinnant 7133e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 71449c7643cSMarshall Clow constexpr bool // constexpr in C++20 7153e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 7163e519524SHoward Hinnant 7173e519524SHoward Hinnanttemplate <class RandomAccessIterator> 71849c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 7193e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 7203e519524SHoward Hinnant 7213e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 72249c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 7233e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 7243e519524SHoward Hinnant 7254eb27b79SHoward Hinnanttemplate <class ForwardIterator> 726b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 727b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last); 7284eb27b79SHoward Hinnant 7294eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 730b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 731b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last, Compare comp); 7324eb27b79SHoward Hinnant 7333e519524SHoward Hinnanttemplate <class T> 734b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 735b8bc4e15SArthur O'Dwyer min(const T& a, const T& b); 7363e519524SHoward Hinnant 7373e519524SHoward Hinnanttemplate <class T, class Compare> 738b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 739b8bc4e15SArthur O'Dwyer min(const T& a, const T& b, Compare comp); 7403e519524SHoward Hinnant 7413e519524SHoward Hinnanttemplate<class T> 742b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 743b8bc4e15SArthur O'Dwyer min(initializer_list<T> t); 7443e519524SHoward Hinnant 7453e519524SHoward Hinnanttemplate<class T, class Compare> 746b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 747b8bc4e15SArthur O'Dwyer min(initializer_list<T> t, Compare comp); 7483e519524SHoward Hinnant 749146c14acSMarshall Clowtemplate<class T> 750146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 751146c14acSMarshall Clow 752146c14acSMarshall Clowtemplate<class T, class Compare> 753146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 754146c14acSMarshall Clow 7553e519524SHoward Hinnanttemplate <class ForwardIterator> 756b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 757b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last); 7583e519524SHoward Hinnant 7593e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 760b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 761b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last, Compare comp); 7623e519524SHoward Hinnant 7634eb27b79SHoward Hinnanttemplate <class T> 764b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 765b8bc4e15SArthur O'Dwyer max(const T& a, const T& b); 7664eb27b79SHoward Hinnant 7674eb27b79SHoward Hinnanttemplate <class T, class Compare> 768b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 769b8bc4e15SArthur O'Dwyer max(const T& a, const T& b, Compare comp); 7704eb27b79SHoward Hinnant 7714eb27b79SHoward Hinnanttemplate<class T> 772b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 773b8bc4e15SArthur O'Dwyer max(initializer_list<T> t); 7744eb27b79SHoward Hinnant 7754eb27b79SHoward Hinnanttemplate<class T, class Compare> 776b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 777b8bc4e15SArthur O'Dwyer max(initializer_list<T> t, Compare comp); 7784eb27b79SHoward Hinnant 7794eb27b79SHoward Hinnanttemplate<class ForwardIterator> 780b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 781b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last); 7824eb27b79SHoward Hinnant 7834eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 784b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 785b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 7864eb27b79SHoward Hinnant 7874eb27b79SHoward Hinnanttemplate<class T> 788b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 789b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b); 7904eb27b79SHoward Hinnant 7914eb27b79SHoward Hinnanttemplate<class T, class Compare> 792b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 793b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b, Compare comp); 7944eb27b79SHoward Hinnant 7954eb27b79SHoward Hinnanttemplate<class T> 796b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 797b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t); 7984eb27b79SHoward Hinnant 7994eb27b79SHoward Hinnanttemplate<class T, class Compare> 800b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 801b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t, Compare comp); 8024eb27b79SHoward Hinnant 8033e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 8041b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 8053e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 8063e519524SHoward Hinnant 8073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 8081b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 8093e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 8103e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 8113e519524SHoward Hinnant 8123e519524SHoward Hinnanttemplate <class BidirectionalIterator> 813f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 8143e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 8153e519524SHoward Hinnant 8163e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 817f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 8183e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 8193e519524SHoward Hinnant 8203e519524SHoward Hinnanttemplate <class BidirectionalIterator> 821f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 8223e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 8233e519524SHoward Hinnant 8243e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 825f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 8263e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 8273e519524SHoward Hinnant} // std 8283e519524SHoward Hinnant 8293e519524SHoward Hinnant*/ 8303e519524SHoward Hinnant 831385cc25aSLouis Dionne#include <__assert> // all public C++ headers provide the assertion handler 832ea2206d7SArthur O'Dwyer#include <__bits> 8333e519524SHoward Hinnant#include <__config> 834134723edSLouis Dionne#include <__debug> 835a1d07d57SHoward Hinnant#include <cstddef> 836bfbd73f8SArthur O'Dwyer#include <cstring> 837bfbd73f8SArthur O'Dwyer#include <functional> 838bfbd73f8SArthur O'Dwyer#include <initializer_list> 839bfbd73f8SArthur O'Dwyer#include <iterator> 840bfbd73f8SArthur O'Dwyer#include <memory> 841bfbd73f8SArthur O'Dwyer#include <type_traits> 842f56972e2SMarshall Clow#include <version> 8435d1a701dSHoward Hinnant 844134723edSLouis Dionne#include <__algorithm/adjacent_find.h> 845134723edSLouis Dionne#include <__algorithm/all_of.h> 846134723edSLouis Dionne#include <__algorithm/any_of.h> 847134723edSLouis Dionne#include <__algorithm/binary_search.h> 848134723edSLouis Dionne#include <__algorithm/clamp.h> 849134723edSLouis Dionne#include <__algorithm/comp.h> 850134723edSLouis Dionne#include <__algorithm/comp_ref_type.h> 851134723edSLouis Dionne#include <__algorithm/copy.h> 852134723edSLouis Dionne#include <__algorithm/copy_backward.h> 853134723edSLouis Dionne#include <__algorithm/copy_if.h> 854134723edSLouis Dionne#include <__algorithm/copy_n.h> 855134723edSLouis Dionne#include <__algorithm/count.h> 856134723edSLouis Dionne#include <__algorithm/count_if.h> 857134723edSLouis Dionne#include <__algorithm/equal.h> 858134723edSLouis Dionne#include <__algorithm/equal_range.h> 859134723edSLouis Dionne#include <__algorithm/fill.h> 8604d81a46fSArthur O'Dwyer#include <__algorithm/fill_n.h> 861134723edSLouis Dionne#include <__algorithm/find.h> 862134723edSLouis Dionne#include <__algorithm/find_end.h> 863134723edSLouis Dionne#include <__algorithm/find_first_of.h> 864134723edSLouis Dionne#include <__algorithm/find_if.h> 865134723edSLouis Dionne#include <__algorithm/find_if_not.h> 866134723edSLouis Dionne#include <__algorithm/for_each.h> 867134723edSLouis Dionne#include <__algorithm/for_each_n.h> 868134723edSLouis Dionne#include <__algorithm/generate.h> 8694d81a46fSArthur O'Dwyer#include <__algorithm/generate_n.h> 870134723edSLouis Dionne#include <__algorithm/half_positive.h> 87168f4131cSNikolas Klauser#include <__algorithm/in_found_result.h> 8721e77b396SNikolas Klauser#include <__algorithm/in_fun_result.h> 873f3514af4SNikolas Klauser#include <__algorithm/in_in_out_result.h> 874d3729bb3SNikolas Klauser#include <__algorithm/in_in_result.h> 875610979b3SNikolas Klauser#include <__algorithm/in_out_out_result.h> 8768d23b742SKonstantin Varlamov#include <__algorithm/in_out_result.h> 877134723edSLouis Dionne#include <__algorithm/includes.h> 878134723edSLouis Dionne#include <__algorithm/inplace_merge.h> 879134723edSLouis Dionne#include <__algorithm/is_heap.h> 880134723edSLouis Dionne#include <__algorithm/is_heap_until.h> 881134723edSLouis Dionne#include <__algorithm/is_partitioned.h> 882134723edSLouis Dionne#include <__algorithm/is_permutation.h> 883134723edSLouis Dionne#include <__algorithm/is_sorted.h> 884134723edSLouis Dionne#include <__algorithm/is_sorted_until.h> 8856adbc83eSChristopher Di Bella#include <__algorithm/iter_swap.h> 886134723edSLouis Dionne#include <__algorithm/lexicographical_compare.h> 887134723edSLouis Dionne#include <__algorithm/lower_bound.h> 888134723edSLouis Dionne#include <__algorithm/make_heap.h> 889134723edSLouis Dionne#include <__algorithm/max.h> 890134723edSLouis Dionne#include <__algorithm/max_element.h> 891134723edSLouis Dionne#include <__algorithm/merge.h> 892134723edSLouis Dionne#include <__algorithm/min.h> 893134723edSLouis Dionne#include <__algorithm/min_element.h> 894807766beSNikolas Klauser#include <__algorithm/min_max_result.h> 895134723edSLouis Dionne#include <__algorithm/minmax.h> 896134723edSLouis Dionne#include <__algorithm/minmax_element.h> 897134723edSLouis Dionne#include <__algorithm/mismatch.h> 898134723edSLouis Dionne#include <__algorithm/move.h> 899134723edSLouis Dionne#include <__algorithm/move_backward.h> 900134723edSLouis Dionne#include <__algorithm/next_permutation.h> 901134723edSLouis Dionne#include <__algorithm/none_of.h> 902134723edSLouis Dionne#include <__algorithm/nth_element.h> 903134723edSLouis Dionne#include <__algorithm/partial_sort.h> 904134723edSLouis Dionne#include <__algorithm/partial_sort_copy.h> 905134723edSLouis Dionne#include <__algorithm/partition.h> 906134723edSLouis Dionne#include <__algorithm/partition_copy.h> 907134723edSLouis Dionne#include <__algorithm/partition_point.h> 908134723edSLouis Dionne#include <__algorithm/pop_heap.h> 909134723edSLouis Dionne#include <__algorithm/prev_permutation.h> 910134723edSLouis Dionne#include <__algorithm/push_heap.h> 9111306b102SNikolas Klauser#include <__algorithm/ranges_count.h> 9121306b102SNikolas Klauser#include <__algorithm/ranges_count_if.h> 913ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find.h> 914ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if.h> 915ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if_not.h> 916e476df56SNikolas Klauser#include <__algorithm/ranges_max.h> 917205557c9SNikolas Klauser#include <__algorithm/ranges_max_element.h> 918f83d833eSNikolas Klauser#include <__algorithm/ranges_min.h> 9193b470d1cSNikolas Klauser#include <__algorithm/ranges_min_element.h> 920*58d9ab70SNikolas Klauser#include <__algorithm/ranges_minmax.h> 921*58d9ab70SNikolas Klauser#include <__algorithm/ranges_minmax_element.h> 922c2cd15a6SNikolas Klauser#include <__algorithm/ranges_mismatch.h> 9239d905319SNikolas Klauser#include <__algorithm/ranges_swap_ranges.h> 9243ba8548cSNikolas Klauser#include <__algorithm/ranges_transform.h> 925134723edSLouis Dionne#include <__algorithm/remove.h> 926134723edSLouis Dionne#include <__algorithm/remove_copy.h> 927134723edSLouis Dionne#include <__algorithm/remove_copy_if.h> 928134723edSLouis Dionne#include <__algorithm/remove_if.h> 929134723edSLouis Dionne#include <__algorithm/replace.h> 930134723edSLouis Dionne#include <__algorithm/replace_copy.h> 931134723edSLouis Dionne#include <__algorithm/replace_copy_if.h> 932134723edSLouis Dionne#include <__algorithm/replace_if.h> 933134723edSLouis Dionne#include <__algorithm/reverse.h> 934134723edSLouis Dionne#include <__algorithm/reverse_copy.h> 935134723edSLouis Dionne#include <__algorithm/rotate.h> 936134723edSLouis Dionne#include <__algorithm/rotate_copy.h> 937134723edSLouis Dionne#include <__algorithm/sample.h> 938134723edSLouis Dionne#include <__algorithm/search.h> 939134723edSLouis Dionne#include <__algorithm/search_n.h> 940134723edSLouis Dionne#include <__algorithm/set_difference.h> 941134723edSLouis Dionne#include <__algorithm/set_intersection.h> 942134723edSLouis Dionne#include <__algorithm/set_symmetric_difference.h> 943134723edSLouis Dionne#include <__algorithm/set_union.h> 944134723edSLouis Dionne#include <__algorithm/shift_left.h> 945134723edSLouis Dionne#include <__algorithm/shift_right.h> 946134723edSLouis Dionne#include <__algorithm/shuffle.h> 947134723edSLouis Dionne#include <__algorithm/sift_down.h> 948134723edSLouis Dionne#include <__algorithm/sort.h> 949134723edSLouis Dionne#include <__algorithm/sort_heap.h> 950134723edSLouis Dionne#include <__algorithm/stable_partition.h> 951134723edSLouis Dionne#include <__algorithm/stable_sort.h> 9526adbc83eSChristopher Di Bella#include <__algorithm/swap_ranges.h> 953134723edSLouis Dionne#include <__algorithm/transform.h> 954134723edSLouis Dionne#include <__algorithm/unique.h> 9554d81a46fSArthur O'Dwyer#include <__algorithm/unique_copy.h> 956134723edSLouis Dionne#include <__algorithm/unwrap_iter.h> 957134723edSLouis Dionne#include <__algorithm/upper_bound.h> 958c1bd9197SEric Fiselier 959073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 9603e519524SHoward Hinnant# pragma GCC system_header 961073458b1SHoward Hinnant#endif 9623e519524SHoward Hinnant 9630a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 96495689243SLouis Dionne# include <__pstl_algorithm> 9650a06eb91SLouis Dionne#endif 9660a06eb91SLouis Dionne 9673e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 968