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 113*3ba8548cSNikolas Klauser 114*3ba8548cSNikolas Klauser template<class I, class O> 115*3ba8548cSNikolas Klauser using unary_transform_result = in_out_result<I, O>; // since C++20 116*3ba8548cSNikolas Klauser 117*3ba8548cSNikolas Klauser template<class I1, class I2, class O> 118*3ba8548cSNikolas Klauser using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20 119*3ba8548cSNikolas Klauser 120*3ba8548cSNikolas Klauser template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, 121*3ba8548cSNikolas Klauser copy_constructible F, class Proj = identity> 122*3ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> 123*3ba8548cSNikolas Klauser constexpr ranges::unary_transform_result<I, O> 124*3ba8548cSNikolas Klauser transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20 125*3ba8548cSNikolas Klauser 126*3ba8548cSNikolas Klauser template<input_range R, weakly_incrementable O, copy_constructible F, 127*3ba8548cSNikolas Klauser class Proj = identity> 128*3ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> 129*3ba8548cSNikolas Klauser constexpr ranges::unary_transform_result<borrowed_iterator_t<R>, O> 130*3ba8548cSNikolas Klauser transform(R&& r, O result, F op, Proj proj = {}); // since C++20 131*3ba8548cSNikolas Klauser 132*3ba8548cSNikolas Klauser template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, 133*3ba8548cSNikolas Klauser weakly_incrementable O, copy_constructible F, class Proj1 = identity, 134*3ba8548cSNikolas Klauser class Proj2 = identity> 135*3ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, 136*3ba8548cSNikolas Klauser projected<I2, Proj2>>> 137*3ba8548cSNikolas Klauser constexpr ranges::binary_transform_result<I1, I2, O> 138*3ba8548cSNikolas Klauser transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, 139*3ba8548cSNikolas Klauser F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 140*3ba8548cSNikolas Klauser 141*3ba8548cSNikolas Klauser template<input_range R1, input_range R2, weakly_incrementable O, 142*3ba8548cSNikolas Klauser copy_constructible F, class Proj1 = identity, class Proj2 = identity> 143*3ba8548cSNikolas Klauser requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, 144*3ba8548cSNikolas Klauser projected<iterator_t<R2>, Proj2>>> 145*3ba8548cSNikolas Klauser constexpr ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> 146*3ba8548cSNikolas Klauser transform(R1&& r1, R2&& r2, O result, 147*3ba8548cSNikolas Klauser F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 148d3729bb3SNikolas Klauser} 149d3729bb3SNikolas Klauser 150706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1513e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 1523e519524SHoward Hinnant 1533e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 154706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1553e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 158706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1593e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class InputIterator, class Function> 1621b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 1633e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 1643e519524SHoward Hinnant 165d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 1661b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 1671b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 168d5c65ffaSMarshall Clow 1693e519524SHoward Hinnanttemplate <class InputIterator, class T> 17049c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1713e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 17449c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1753e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 1763e519524SHoward Hinnant 1773e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 178b8bc4e15SArthur O'Dwyer constexpr InputIterator // constexpr in C++20 1793e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 1803e519524SHoward Hinnant 1813e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 182b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 1833e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1843e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1853e519524SHoward Hinnant 1863e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 187b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 1883e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1893e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1903e519524SHoward Hinnant 1913e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1928694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1933e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1943e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1978694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1983e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1993e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator> 2028694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2033e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2068694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2073e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class T> 210056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2113e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 2123e519524SHoward Hinnant 2133e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 214056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2153e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2186538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2193e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2203e519524SHoward Hinnant 2210b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2226538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2230b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 2240b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 2250b0bbd2fSMarshall Clow 2263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2276538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2283e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 2293e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2303e519524SHoward Hinnant 2310b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2326538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2330b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 2340b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2350b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2360b0bbd2fSMarshall Clow 2373e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2386538e28dSMarshall Clow constexpr bool // constexpr in C++20 2393e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2403e519524SHoward Hinnant 2410b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2426538e28dSMarshall Clow constexpr bool // constexpr in C++20 2430b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2440b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 2450b0bbd2fSMarshall Clow 2463e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2476538e28dSMarshall Clow constexpr bool // constexpr in C++20 2483e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 2493e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2503e519524SHoward Hinnant 2510b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2526538e28dSMarshall Clow constexpr bool // constexpr in C++20 2530b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2540b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2550b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2560b0bbd2fSMarshall Clow 2573e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 25849c7643cSMarshall Clow constexpr bool // constexpr in C++20 2593e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2603e519524SHoward Hinnant ForwardIterator2 first2); 2613e519524SHoward Hinnant 2620b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 26349c7643cSMarshall Clow constexpr bool // constexpr in C++20 2640b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2650b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 2660b0bbd2fSMarshall Clow 2673e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 26849c7643cSMarshall Clow constexpr bool // constexpr in C++20 2693e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2703e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 2713e519524SHoward Hinnant 2720b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 27349c7643cSMarshall Clow constexpr bool // constexpr in C++20 2740b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2750b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 2760b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2770b0bbd2fSMarshall Clow 2783e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 27912f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2803e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 2813e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2823e519524SHoward Hinnant 2833e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 28412f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2853e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 2863e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2873e519524SHoward Hinnant 2883e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 28912f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2903e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 2913e519524SHoward Hinnant 2923e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 29312f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2943e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 2953e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 2963e519524SHoward Hinnant 2973e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 29813c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 2993e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 3003e519524SHoward Hinnant 3013e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 30213c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3033e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 3043e519524SHoward Hinnant OutputIterator result, Predicate pred); 3053e519524SHoward Hinnant 3063e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 30713c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3083e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 31113c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 3123e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 3133e519524SHoward Hinnant BidirectionalIterator2 result); 3143e519524SHoward Hinnant 3153e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 316b8bc4e15SArthur O'Dwyer constexpr ForwardIterator2 // constexpr in C++20 3173e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 3183e519524SHoward Hinnant 3199d905319SNikolas Klausertemplate<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 3209d905319SNikolas Klauser requires indirectly_swappable<I1, I2> 3219d905319SNikolas Klauser constexpr ranges::swap_ranges_result<I1, I2> 3229d905319SNikolas Klauser ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 3239d905319SNikolas Klauser 3249d905319SNikolas Klausertemplate<input_range R1, input_range R2> 3259d905319SNikolas Klauser requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 3269d905319SNikolas Klauser constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 3279d905319SNikolas Klauser ranges::swap_ranges(R1&& r1, R2&& r2); 3289d905319SNikolas Klauser 3293e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 330b8bc4e15SArthur O'Dwyer constexpr void // constexpr in C++20 3313e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 33499894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3353e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 33899894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3393e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 3403e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 34312c7423fSMarshall Clow constexpr void // constexpr in C++20 3443e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 34712c7423fSMarshall Clow constexpr void // constexpr in C++20 3483e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 35112c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3523e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 3533e519524SHoward Hinnant const T& old_value, const T& new_value); 3543e519524SHoward Hinnant 3553e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 35612c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3573e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 3583e519524SHoward Hinnant 3593e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3604bfb9313SMarshall Clow constexpr void // constexpr in C++20 3613e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 3644bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3653e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 3684bfb9313SMarshall Clow constexpr void // constexpr in C++20 3693e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 3703e519524SHoward Hinnant 3713e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 3724bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3733e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 376e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3773e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 380e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3813e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 384e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 3853e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 388e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 3893e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class ForwardIterator> 392b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 3933e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 396b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 3973e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 400b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4013e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 404b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4053e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class BidirectionalIterator> 408f851db3dSArthur O'Dwyer constexpr void // constexpr in C++20 4093e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 4103e519524SHoward Hinnant 4113e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 412e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4133e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 4143e519524SHoward Hinnant 4153e519524SHoward Hinnanttemplate <class ForwardIterator> 416b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4173e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 4183e519524SHoward Hinnant 4193e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 420b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4213e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 4223e519524SHoward Hinnant 4233e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4243e519524SHoward Hinnant void 4250f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 4283e519524SHoward Hinnant void 42906965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 4300f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 4313e519524SHoward Hinnant 432e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 433e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 434e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 435e7154709SEric Fiselier SampleIterator out, Distance n, 436e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 437e7154709SEric Fiselier 438f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 439f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 440fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 441f9d540b0SHoward Hinnant 4423fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4433fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4443fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 4453fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4463fbd3eafSArthur O'Dwyer 4473fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4483fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4493fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 4503fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4513fbd3eafSArthur O'Dwyer 4523e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 45349c7643cSMarshall Clow constexpr bool // constexpr in C++20 4543e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 4553e519524SHoward Hinnant 4563e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 457f851db3dSArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4583e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4593e519524SHoward Hinnant 4603e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 4613e519524SHoward Hinnant class OutputIterator2, class Predicate> 4621b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 4633e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 4643e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 4653e519524SHoward Hinnant Predicate pred); 4663e519524SHoward Hinnant 4673e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 4683e519524SHoward Hinnant ForwardIterator 4693e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4703e519524SHoward Hinnant 4713e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 472d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4733e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 4743e519524SHoward Hinnant 4753e519524SHoward Hinnanttemplate <class ForwardIterator> 47649c7643cSMarshall Clow constexpr bool // constexpr in C++20 4773e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 4783e519524SHoward Hinnant 4793e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 480b8bc4e15SArthur O'Dwyer constexpr bool // constexpr in C++20 4813e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 4823e519524SHoward Hinnant 4833e519524SHoward Hinnanttemplate<class ForwardIterator> 484056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4853e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 4863e519524SHoward Hinnant 4873e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 488056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4893e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 4903e519524SHoward Hinnant 4913e519524SHoward Hinnanttemplate <class RandomAccessIterator> 492493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 4933e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 4943e519524SHoward Hinnant 4953e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 496493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 4973e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4983e519524SHoward Hinnant 4993e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5003e519524SHoward Hinnant void 5013e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 5023e519524SHoward Hinnant 5033e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5043e519524SHoward Hinnant void 5053e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5063e519524SHoward Hinnant 5073e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5085386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5093e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 5103e519524SHoward Hinnant 5113e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5125386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5133e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 5143e519524SHoward Hinnant 5153e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 5165386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5173e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5183e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 5193e519524SHoward Hinnant 5203e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 5215386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5223e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5233e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 5243e519524SHoward Hinnant 5253e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5265d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5273e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 5283e519524SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5305d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5313e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 534d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5353e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 538d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5393e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5403e519524SHoward Hinnant 5413e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 542d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5433e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 546d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5473e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 550d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5513e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 5523e519524SHoward Hinnant 5533e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 554d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5553e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5563e519524SHoward Hinnant 5573e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 558d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 5593e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 5603e519524SHoward Hinnant 5613e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 5628da1a487SMarshall Clow constexpr bool // constexpr in C++20 5633e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 56614098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5673e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5683e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5693e519524SHoward Hinnant 5703e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 57114098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5723e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5733e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5743e519524SHoward Hinnant 5753e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5763e519524SHoward Hinnant void 5773e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 5783e519524SHoward Hinnant 5793e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5803e519524SHoward Hinnant void 5813e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 5823e519524SHoward Hinnant 5833e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5848da1a487SMarshall Clow constexpr bool // constexpr in C++20 5853e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5863e519524SHoward Hinnant 5873e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5888da1a487SMarshall Clow constexpr bool // constexpr in C++20 5893e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 5903e519524SHoward Hinnant 5913e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 59214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5933e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 5943e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5953e519524SHoward Hinnant 5963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 59714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5983e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 5993e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6003e519524SHoward Hinnant 6013e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 6028da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6033e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6043e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 6078da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6083e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6093e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6103e519524SHoward Hinnant 6113e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 61214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6133e519524SHoward Hinnant set_difference(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 set_difference(InputIterator1 first1, InputIterator1 last1, 6193e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 62214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6233e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6243e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 62714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6283e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6293e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6303e519524SHoward Hinnant 6313e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6325386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6333e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 6343e519524SHoward Hinnant 6353e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6365386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6373e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6383e519524SHoward Hinnant 6393e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6405386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6413e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 6423e519524SHoward Hinnant 6433e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6445386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6453e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6463e519524SHoward Hinnant 6473e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6485386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6493e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 6503e519524SHoward Hinnant 6513e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6525386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6533e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6543e519524SHoward Hinnant 6553e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6565386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6573e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 6583e519524SHoward Hinnant 6593e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6605386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6613e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6623e519524SHoward Hinnant 6633e519524SHoward Hinnanttemplate <class RandomAccessIterator> 66449c7643cSMarshall Clow constexpr bool // constexpr in C++20 6653e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 66849c7643cSMarshall Clow constexpr bool // constexpr in C++20 6693e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6703e519524SHoward Hinnant 6713e519524SHoward Hinnanttemplate <class RandomAccessIterator> 67249c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6733e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 67649c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6773e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6783e519524SHoward Hinnant 6794eb27b79SHoward Hinnanttemplate <class ForwardIterator> 680b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 681b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last); 6824eb27b79SHoward Hinnant 6834eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 684b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 685b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last, Compare comp); 6864eb27b79SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class T> 688b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 689b8bc4e15SArthur O'Dwyer min(const T& a, const T& b); 6903e519524SHoward Hinnant 6913e519524SHoward Hinnanttemplate <class T, class Compare> 692b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 693b8bc4e15SArthur O'Dwyer min(const T& a, const T& b, Compare comp); 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate<class T> 696b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 697b8bc4e15SArthur O'Dwyer min(initializer_list<T> t); 6983e519524SHoward Hinnant 6993e519524SHoward Hinnanttemplate<class T, class Compare> 700b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 701b8bc4e15SArthur O'Dwyer min(initializer_list<T> t, Compare comp); 7023e519524SHoward Hinnant 703146c14acSMarshall Clowtemplate<class T> 704146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 705146c14acSMarshall Clow 706146c14acSMarshall Clowtemplate<class T, class Compare> 707146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 708146c14acSMarshall Clow 7093e519524SHoward Hinnanttemplate <class ForwardIterator> 710b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 711b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last); 7123e519524SHoward Hinnant 7133e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 714b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 715b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last, Compare comp); 7163e519524SHoward Hinnant 7174eb27b79SHoward Hinnanttemplate <class T> 718b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 719b8bc4e15SArthur O'Dwyer max(const T& a, const T& b); 7204eb27b79SHoward Hinnant 7214eb27b79SHoward Hinnanttemplate <class T, class Compare> 722b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 723b8bc4e15SArthur O'Dwyer max(const T& a, const T& b, Compare comp); 7244eb27b79SHoward Hinnant 7254eb27b79SHoward Hinnanttemplate<class T> 726b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 727b8bc4e15SArthur O'Dwyer max(initializer_list<T> t); 7284eb27b79SHoward Hinnant 7294eb27b79SHoward Hinnanttemplate<class T, class Compare> 730b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 731b8bc4e15SArthur O'Dwyer max(initializer_list<T> t, Compare comp); 7324eb27b79SHoward Hinnant 7334eb27b79SHoward Hinnanttemplate<class ForwardIterator> 734b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 735b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last); 7364eb27b79SHoward Hinnant 7374eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 738b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 739b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 7404eb27b79SHoward Hinnant 7414eb27b79SHoward Hinnanttemplate<class T> 742b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 743b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b); 7444eb27b79SHoward Hinnant 7454eb27b79SHoward Hinnanttemplate<class T, class Compare> 746b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 747b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b, Compare comp); 7484eb27b79SHoward Hinnant 7494eb27b79SHoward Hinnanttemplate<class T> 750b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 751b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t); 7524eb27b79SHoward Hinnant 7534eb27b79SHoward Hinnanttemplate<class T, class Compare> 754b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 755b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t, Compare comp); 7564eb27b79SHoward Hinnant 7573e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 7581b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7593e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 7603e519524SHoward Hinnant 7613e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 7621b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7633e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 7643e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 7653e519524SHoward Hinnant 7663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 767f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7683e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 7693e519524SHoward Hinnant 7703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 771f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7723e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 7733e519524SHoward Hinnant 7743e519524SHoward Hinnanttemplate <class BidirectionalIterator> 775f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7763e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 7773e519524SHoward Hinnant 7783e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 779f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7803e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 7813e519524SHoward Hinnant} // std 7823e519524SHoward Hinnant 7833e519524SHoward Hinnant*/ 7843e519524SHoward Hinnant 785385cc25aSLouis Dionne#include <__assert> // all public C++ headers provide the assertion handler 786ea2206d7SArthur O'Dwyer#include <__bits> 7873e519524SHoward Hinnant#include <__config> 788134723edSLouis Dionne#include <__debug> 789a1d07d57SHoward Hinnant#include <cstddef> 790bfbd73f8SArthur O'Dwyer#include <cstring> 791bfbd73f8SArthur O'Dwyer#include <functional> 792bfbd73f8SArthur O'Dwyer#include <initializer_list> 793bfbd73f8SArthur O'Dwyer#include <iterator> 794bfbd73f8SArthur O'Dwyer#include <memory> 795bfbd73f8SArthur O'Dwyer#include <type_traits> 796f56972e2SMarshall Clow#include <version> 7975d1a701dSHoward Hinnant 798134723edSLouis Dionne#include <__algorithm/adjacent_find.h> 799134723edSLouis Dionne#include <__algorithm/all_of.h> 800134723edSLouis Dionne#include <__algorithm/any_of.h> 801134723edSLouis Dionne#include <__algorithm/binary_search.h> 802134723edSLouis Dionne#include <__algorithm/clamp.h> 803134723edSLouis Dionne#include <__algorithm/comp.h> 804134723edSLouis Dionne#include <__algorithm/comp_ref_type.h> 805134723edSLouis Dionne#include <__algorithm/copy.h> 806134723edSLouis Dionne#include <__algorithm/copy_backward.h> 807134723edSLouis Dionne#include <__algorithm/copy_if.h> 808134723edSLouis Dionne#include <__algorithm/copy_n.h> 809134723edSLouis Dionne#include <__algorithm/count.h> 810134723edSLouis Dionne#include <__algorithm/count_if.h> 811134723edSLouis Dionne#include <__algorithm/equal.h> 812134723edSLouis Dionne#include <__algorithm/equal_range.h> 813134723edSLouis Dionne#include <__algorithm/fill.h> 8144d81a46fSArthur O'Dwyer#include <__algorithm/fill_n.h> 815134723edSLouis Dionne#include <__algorithm/find.h> 816134723edSLouis Dionne#include <__algorithm/find_end.h> 817134723edSLouis Dionne#include <__algorithm/find_first_of.h> 818134723edSLouis Dionne#include <__algorithm/find_if.h> 819134723edSLouis Dionne#include <__algorithm/find_if_not.h> 820134723edSLouis Dionne#include <__algorithm/for_each.h> 821134723edSLouis Dionne#include <__algorithm/for_each_n.h> 822134723edSLouis Dionne#include <__algorithm/generate.h> 8234d81a46fSArthur O'Dwyer#include <__algorithm/generate_n.h> 824134723edSLouis Dionne#include <__algorithm/half_positive.h> 82568f4131cSNikolas Klauser#include <__algorithm/in_found_result.h> 8261e77b396SNikolas Klauser#include <__algorithm/in_fun_result.h> 827f3514af4SNikolas Klauser#include <__algorithm/in_in_out_result.h> 828d3729bb3SNikolas Klauser#include <__algorithm/in_in_result.h> 829610979b3SNikolas Klauser#include <__algorithm/in_out_out_result.h> 8308d23b742SKonstantin Varlamov#include <__algorithm/in_out_result.h> 831134723edSLouis Dionne#include <__algorithm/includes.h> 832134723edSLouis Dionne#include <__algorithm/inplace_merge.h> 833134723edSLouis Dionne#include <__algorithm/is_heap.h> 834134723edSLouis Dionne#include <__algorithm/is_heap_until.h> 835134723edSLouis Dionne#include <__algorithm/is_partitioned.h> 836134723edSLouis Dionne#include <__algorithm/is_permutation.h> 837134723edSLouis Dionne#include <__algorithm/is_sorted.h> 838134723edSLouis Dionne#include <__algorithm/is_sorted_until.h> 8396adbc83eSChristopher Di Bella#include <__algorithm/iter_swap.h> 840134723edSLouis Dionne#include <__algorithm/lexicographical_compare.h> 841134723edSLouis Dionne#include <__algorithm/lower_bound.h> 842134723edSLouis Dionne#include <__algorithm/make_heap.h> 843134723edSLouis Dionne#include <__algorithm/max.h> 844134723edSLouis Dionne#include <__algorithm/max_element.h> 845134723edSLouis Dionne#include <__algorithm/merge.h> 846134723edSLouis Dionne#include <__algorithm/min.h> 847134723edSLouis Dionne#include <__algorithm/min_element.h> 848807766beSNikolas Klauser#include <__algorithm/min_max_result.h> 849134723edSLouis Dionne#include <__algorithm/minmax.h> 850134723edSLouis Dionne#include <__algorithm/minmax_element.h> 851134723edSLouis Dionne#include <__algorithm/mismatch.h> 852134723edSLouis Dionne#include <__algorithm/move.h> 853134723edSLouis Dionne#include <__algorithm/move_backward.h> 854134723edSLouis Dionne#include <__algorithm/next_permutation.h> 855134723edSLouis Dionne#include <__algorithm/none_of.h> 856134723edSLouis Dionne#include <__algorithm/nth_element.h> 857134723edSLouis Dionne#include <__algorithm/partial_sort.h> 858134723edSLouis Dionne#include <__algorithm/partial_sort_copy.h> 859134723edSLouis Dionne#include <__algorithm/partition.h> 860134723edSLouis Dionne#include <__algorithm/partition_copy.h> 861134723edSLouis Dionne#include <__algorithm/partition_point.h> 862134723edSLouis Dionne#include <__algorithm/pop_heap.h> 863134723edSLouis Dionne#include <__algorithm/prev_permutation.h> 864134723edSLouis Dionne#include <__algorithm/push_heap.h> 865ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find.h> 866ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if.h> 867ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if_not.h> 868e476df56SNikolas Klauser#include <__algorithm/ranges_max.h> 869205557c9SNikolas Klauser#include <__algorithm/ranges_max_element.h> 870f83d833eSNikolas Klauser#include <__algorithm/ranges_min.h> 8713b470d1cSNikolas Klauser#include <__algorithm/ranges_min_element.h> 872c2cd15a6SNikolas Klauser#include <__algorithm/ranges_mismatch.h> 8739d905319SNikolas Klauser#include <__algorithm/ranges_swap_ranges.h> 874*3ba8548cSNikolas Klauser#include <__algorithm/ranges_transform.h> 875134723edSLouis Dionne#include <__algorithm/remove.h> 876134723edSLouis Dionne#include <__algorithm/remove_copy.h> 877134723edSLouis Dionne#include <__algorithm/remove_copy_if.h> 878134723edSLouis Dionne#include <__algorithm/remove_if.h> 879134723edSLouis Dionne#include <__algorithm/replace.h> 880134723edSLouis Dionne#include <__algorithm/replace_copy.h> 881134723edSLouis Dionne#include <__algorithm/replace_copy_if.h> 882134723edSLouis Dionne#include <__algorithm/replace_if.h> 883134723edSLouis Dionne#include <__algorithm/reverse.h> 884134723edSLouis Dionne#include <__algorithm/reverse_copy.h> 885134723edSLouis Dionne#include <__algorithm/rotate.h> 886134723edSLouis Dionne#include <__algorithm/rotate_copy.h> 887134723edSLouis Dionne#include <__algorithm/sample.h> 888134723edSLouis Dionne#include <__algorithm/search.h> 889134723edSLouis Dionne#include <__algorithm/search_n.h> 890134723edSLouis Dionne#include <__algorithm/set_difference.h> 891134723edSLouis Dionne#include <__algorithm/set_intersection.h> 892134723edSLouis Dionne#include <__algorithm/set_symmetric_difference.h> 893134723edSLouis Dionne#include <__algorithm/set_union.h> 894134723edSLouis Dionne#include <__algorithm/shift_left.h> 895134723edSLouis Dionne#include <__algorithm/shift_right.h> 896134723edSLouis Dionne#include <__algorithm/shuffle.h> 897134723edSLouis Dionne#include <__algorithm/sift_down.h> 898134723edSLouis Dionne#include <__algorithm/sort.h> 899134723edSLouis Dionne#include <__algorithm/sort_heap.h> 900134723edSLouis Dionne#include <__algorithm/stable_partition.h> 901134723edSLouis Dionne#include <__algorithm/stable_sort.h> 9026adbc83eSChristopher Di Bella#include <__algorithm/swap_ranges.h> 903134723edSLouis Dionne#include <__algorithm/transform.h> 904134723edSLouis Dionne#include <__algorithm/unique.h> 9054d81a46fSArthur O'Dwyer#include <__algorithm/unique_copy.h> 906134723edSLouis Dionne#include <__algorithm/unwrap_iter.h> 907134723edSLouis Dionne#include <__algorithm/upper_bound.h> 908c1bd9197SEric Fiselier 909073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 9103e519524SHoward Hinnant# pragma GCC system_header 911073458b1SHoward Hinnant#endif 9123e519524SHoward Hinnant 9130a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 91495689243SLouis Dionne# include <__pstl_algorithm> 9150a06eb91SLouis Dionne#endif 9160a06eb91SLouis Dionne 9173e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 918