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 148*1306b102SNikolas Klauser 149*1306b102SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class T, class Proj = identity> 150*1306b102SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 151*1306b102SNikolas Klauser constexpr iter_difference_t<I> 152*1306b102SNikolas Klauser count(I first, S last, const T& value, Proj proj = {}); // since C++20 153*1306b102SNikolas Klauser 154*1306b102SNikolas Klauser template<input_range R, class T, class Proj = identity> 155*1306b102SNikolas Klauser requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 156*1306b102SNikolas Klauser constexpr range_difference_t<R> 157*1306b102SNikolas Klauser count(R&& r, const T& value, Proj proj = {}); // since C++20 158*1306b102SNikolas Klauser 159*1306b102SNikolas Klauser template<input_iterator I, sentinel_for<I> S, class Proj = identity, 160*1306b102SNikolas Klauser indirect_unary_predicate<projected<I, Proj>> Pred> 161*1306b102SNikolas Klauser constexpr iter_difference_t<I> 162*1306b102SNikolas Klauser count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20 163*1306b102SNikolas Klauser 164*1306b102SNikolas Klauser template<input_range R, class Proj = identity, 165*1306b102SNikolas Klauser indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 166*1306b102SNikolas Klauser constexpr range_difference_t<R> 167*1306b102SNikolas Klauser count_if(R&& r, Pred pred, Proj proj = {}); // since C++20 168d3729bb3SNikolas Klauser} 169d3729bb3SNikolas Klauser 170706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1713e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 174706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1753e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 1763e519524SHoward Hinnant 1773e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 178706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1793e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 1803e519524SHoward Hinnant 1813e519524SHoward Hinnanttemplate <class InputIterator, class Function> 1821b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 1833e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 1843e519524SHoward Hinnant 185d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 1861b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 1871b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 188d5c65ffaSMarshall Clow 1893e519524SHoward Hinnanttemplate <class InputIterator, class T> 19049c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1913e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 1923e519524SHoward Hinnant 1933e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 19449c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1953e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 1963e519524SHoward Hinnant 1973e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 198b8bc4e15SArthur O'Dwyer constexpr InputIterator // constexpr in C++20 1993e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 202b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 2033e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 2043e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2053e519524SHoward Hinnant 2063e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 207b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 2083e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 2093e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2103e519524SHoward Hinnant 2113e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 2128694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2133e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 2143e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2153e519524SHoward Hinnant 2163e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 2178694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2183e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 2193e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator> 2228694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2233e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2268694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 2273e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class InputIterator, class T> 230056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2313e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 234056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 2353e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2386538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2393e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2403e519524SHoward Hinnant 2410b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2426538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2430b0bbd2fSMarshall Clow mismatch(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 pair<InputIterator1, InputIterator2> // constexpr in C++20 2483e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 2493e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2503e519524SHoward Hinnant 2510b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2526538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 2530b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 2540b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2550b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2560b0bbd2fSMarshall Clow 2573e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 2586538e28dSMarshall Clow constexpr bool // constexpr in C++20 2593e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 2603e519524SHoward Hinnant 2610b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 2626538e28dSMarshall Clow constexpr bool // constexpr in C++20 2630b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2640b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 2650b0bbd2fSMarshall Clow 2663e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2676538e28dSMarshall Clow constexpr bool // constexpr in C++20 2683e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 2693e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2703e519524SHoward Hinnant 2710b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2726538e28dSMarshall Clow constexpr bool // constexpr in C++20 2730b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2740b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2750b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2760b0bbd2fSMarshall Clow 2773e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 27849c7643cSMarshall Clow constexpr bool // constexpr in C++20 2793e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2803e519524SHoward Hinnant ForwardIterator2 first2); 2813e519524SHoward Hinnant 2820b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 28349c7643cSMarshall Clow constexpr bool // constexpr in C++20 2840b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2850b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 2860b0bbd2fSMarshall Clow 2873e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 28849c7643cSMarshall Clow constexpr bool // constexpr in C++20 2893e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2903e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 2913e519524SHoward Hinnant 2920b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 29349c7643cSMarshall Clow constexpr bool // constexpr in C++20 2940b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2950b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 2960b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2970b0bbd2fSMarshall Clow 2983e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 29912f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 3003e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 3013e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 3023e519524SHoward Hinnant 3033e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 30412f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 3053e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 3063e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 30912f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3103e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 31312f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3143e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 3153e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 3163e519524SHoward Hinnant 3173e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 31813c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3193e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 3203e519524SHoward Hinnant 3213e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 32213c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3233e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 3243e519524SHoward Hinnant OutputIterator result, Predicate pred); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 32713c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 3283e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 33113c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 3323e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 3333e519524SHoward Hinnant BidirectionalIterator2 result); 3343e519524SHoward Hinnant 3353e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 336b8bc4e15SArthur O'Dwyer constexpr ForwardIterator2 // constexpr in C++20 3373e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 3383e519524SHoward Hinnant 3399d905319SNikolas Klausertemplate<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 3409d905319SNikolas Klauser requires indirectly_swappable<I1, I2> 3419d905319SNikolas Klauser constexpr ranges::swap_ranges_result<I1, I2> 3429d905319SNikolas Klauser ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 3439d905319SNikolas Klauser 3449d905319SNikolas Klausertemplate<input_range R1, input_range R2> 3459d905319SNikolas Klauser requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 3469d905319SNikolas Klauser constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 3479d905319SNikolas Klauser ranges::swap_ranges(R1&& r1, R2&& r2); 3489d905319SNikolas Klauser 3493e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 350b8bc4e15SArthur O'Dwyer constexpr void // constexpr in C++20 3513e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 35499894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3553e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 35899894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 3593e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 3603e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 36312c7423fSMarshall Clow constexpr void // constexpr in C++20 3643e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 3653e519524SHoward Hinnant 3663e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 36712c7423fSMarshall Clow constexpr void // constexpr in C++20 3683e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 3693e519524SHoward Hinnant 3703e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 37112c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3723e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 3733e519524SHoward Hinnant const T& old_value, const T& new_value); 3743e519524SHoward Hinnant 3753e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 37612c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3773e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 3783e519524SHoward Hinnant 3793e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3804bfb9313SMarshall Clow constexpr void // constexpr in C++20 3813e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 3823e519524SHoward Hinnant 3833e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 3844bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3853e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 3884bfb9313SMarshall Clow constexpr void // constexpr in C++20 3893e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 3924bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3933e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 396e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3973e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 400e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4013e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 404e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4053e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 408e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4093e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 4103e519524SHoward Hinnant 4113e519524SHoward Hinnanttemplate <class ForwardIterator> 412b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4133e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 4143e519524SHoward Hinnant 4153e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 416b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4173e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 4183e519524SHoward Hinnant 4193e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 420b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4213e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 4223e519524SHoward Hinnant 4233e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 424b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4253e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class BidirectionalIterator> 428f851db3dSArthur O'Dwyer constexpr void // constexpr in C++20 4293e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 4303e519524SHoward Hinnant 4313e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 432e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 4333e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class ForwardIterator> 436b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4373e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 440b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4413e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4443e519524SHoward Hinnant void 4450f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 4463e519524SHoward Hinnant 4473e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 4483e519524SHoward Hinnant void 44906965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 4500f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 4513e519524SHoward Hinnant 452e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 453e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 454e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 455e7154709SEric Fiselier SampleIterator out, Distance n, 456e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 457e7154709SEric Fiselier 458f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 459f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 460fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 461f9d540b0SHoward Hinnant 4623fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4633fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4643fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 4653fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4663fbd3eafSArthur O'Dwyer 4673fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 4683fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4693fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 4703fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4713fbd3eafSArthur O'Dwyer 4723e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 47349c7643cSMarshall Clow constexpr bool // constexpr in C++20 4743e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 4753e519524SHoward Hinnant 4763e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 477f851db3dSArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4783e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 4813e519524SHoward Hinnant class OutputIterator2, class Predicate> 4821b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 4833e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 4843e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 4853e519524SHoward Hinnant Predicate pred); 4863e519524SHoward Hinnant 4873e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 4883e519524SHoward Hinnant ForwardIterator 4893e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4903e519524SHoward Hinnant 4913e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 492d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4933e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 4943e519524SHoward Hinnant 4953e519524SHoward Hinnanttemplate <class ForwardIterator> 49649c7643cSMarshall Clow constexpr bool // constexpr in C++20 4973e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 4983e519524SHoward Hinnant 4993e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 500b8bc4e15SArthur O'Dwyer constexpr bool // constexpr in C++20 5013e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 5023e519524SHoward Hinnant 5033e519524SHoward Hinnanttemplate<class ForwardIterator> 504056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 5053e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 5063e519524SHoward Hinnant 5073e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 508056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 5093e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 5103e519524SHoward Hinnant 5113e519524SHoward Hinnanttemplate <class RandomAccessIterator> 512493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 5133e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 5143e519524SHoward Hinnant 5153e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 516493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 5173e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5183e519524SHoward Hinnant 5193e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5203e519524SHoward Hinnant void 5213e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 5223e519524SHoward Hinnant 5233e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5243e519524SHoward Hinnant void 5253e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5263e519524SHoward Hinnant 5273e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5285386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5293e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 5303e519524SHoward Hinnant 5313e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5325386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5333e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 5343e519524SHoward Hinnant 5353e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 5365386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5373e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5383e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 5393e519524SHoward Hinnant 5403e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 5415386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 5423e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 5433e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 5443e519524SHoward Hinnant 5453e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5465d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5473e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 5483e519524SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5505d956563SArthur O'Dwyer constexpr void // constexpr in C++20 5513e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 5523e519524SHoward Hinnant 5533e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 554d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5553e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 5563e519524SHoward Hinnant 5573e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 558d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5593e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5603e519524SHoward Hinnant 5613e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 562d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5633e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 566d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 5673e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5683e519524SHoward Hinnant 5693e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 570d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5713e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 5723e519524SHoward Hinnant 5733e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 574d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5753e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5763e519524SHoward Hinnant 5773e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 578d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 5793e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 5803e519524SHoward Hinnant 5813e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 5828da1a487SMarshall Clow constexpr bool // constexpr in C++20 5833e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5843e519524SHoward Hinnant 5853e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 58614098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5873e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5883e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5893e519524SHoward Hinnant 5903e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 59114098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5923e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5933e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5943e519524SHoward Hinnant 5953e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5963e519524SHoward Hinnant void 5973e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 5983e519524SHoward Hinnant 5993e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6003e519524SHoward Hinnant void 6013e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 6023e519524SHoward Hinnant 6033e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6048da1a487SMarshall Clow constexpr bool // constexpr in C++20 6053e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6088da1a487SMarshall Clow constexpr bool // constexpr in C++20 6093e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 6103e519524SHoward Hinnant 6113e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 61214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6133e519524SHoward Hinnant set_union(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_union(InputIterator1 first1, InputIterator1 last1, 6193e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 6228da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6233e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6243e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 6278da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 6283e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 6293e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6303e519524SHoward Hinnant 6313e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 63214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6333e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 6343e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6353e519524SHoward Hinnant 6363e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 63714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6383e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 6393e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6403e519524SHoward Hinnant 6413e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 64214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6433e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6443e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 6453e519524SHoward Hinnant 6463e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 64714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 6483e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 6493e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 6503e519524SHoward Hinnant 6513e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6525386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6533e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 6543e519524SHoward Hinnant 6553e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6565386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6573e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6583e519524SHoward Hinnant 6593e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6605386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6613e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 6623e519524SHoward Hinnant 6633e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6645386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6653e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6685386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6693e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 6703e519524SHoward Hinnant 6713e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6725386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6733e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6765386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6773e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 6783e519524SHoward Hinnant 6793e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6805386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6813e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6823e519524SHoward Hinnant 6833e519524SHoward Hinnanttemplate <class RandomAccessIterator> 68449c7643cSMarshall Clow constexpr bool // constexpr in C++20 6853e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 68849c7643cSMarshall Clow constexpr bool // constexpr in C++20 6893e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6903e519524SHoward Hinnant 6913e519524SHoward Hinnanttemplate <class RandomAccessIterator> 69249c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6933e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 69649c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6973e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6983e519524SHoward Hinnant 6994eb27b79SHoward Hinnanttemplate <class ForwardIterator> 700b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 701b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last); 7024eb27b79SHoward Hinnant 7034eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 704b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 705b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last, Compare comp); 7064eb27b79SHoward Hinnant 7073e519524SHoward Hinnanttemplate <class T> 708b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 709b8bc4e15SArthur O'Dwyer min(const T& a, const T& b); 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class T, class Compare> 712b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 713b8bc4e15SArthur O'Dwyer min(const T& a, const T& b, Compare comp); 7143e519524SHoward Hinnant 7153e519524SHoward Hinnanttemplate<class T> 716b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 717b8bc4e15SArthur O'Dwyer min(initializer_list<T> t); 7183e519524SHoward Hinnant 7193e519524SHoward Hinnanttemplate<class T, class Compare> 720b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 721b8bc4e15SArthur O'Dwyer min(initializer_list<T> t, Compare comp); 7223e519524SHoward Hinnant 723146c14acSMarshall Clowtemplate<class T> 724146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 725146c14acSMarshall Clow 726146c14acSMarshall Clowtemplate<class T, class Compare> 727146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 728146c14acSMarshall Clow 7293e519524SHoward Hinnanttemplate <class ForwardIterator> 730b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 731b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last); 7323e519524SHoward Hinnant 7333e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 734b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 735b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last, Compare comp); 7363e519524SHoward Hinnant 7374eb27b79SHoward Hinnanttemplate <class T> 738b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 739b8bc4e15SArthur O'Dwyer max(const T& a, const T& b); 7404eb27b79SHoward Hinnant 7414eb27b79SHoward Hinnanttemplate <class T, class Compare> 742b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 743b8bc4e15SArthur O'Dwyer max(const T& a, const T& b, Compare comp); 7444eb27b79SHoward Hinnant 7454eb27b79SHoward Hinnanttemplate<class T> 746b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 747b8bc4e15SArthur O'Dwyer max(initializer_list<T> t); 7484eb27b79SHoward Hinnant 7494eb27b79SHoward Hinnanttemplate<class T, class Compare> 750b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 751b8bc4e15SArthur O'Dwyer max(initializer_list<T> t, Compare comp); 7524eb27b79SHoward Hinnant 7534eb27b79SHoward Hinnanttemplate<class ForwardIterator> 754b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 755b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last); 7564eb27b79SHoward Hinnant 7574eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 758b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 759b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 7604eb27b79SHoward Hinnant 7614eb27b79SHoward Hinnanttemplate<class T> 762b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 763b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b); 7644eb27b79SHoward Hinnant 7654eb27b79SHoward Hinnanttemplate<class T, class Compare> 766b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 767b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b, Compare comp); 7684eb27b79SHoward Hinnant 7694eb27b79SHoward Hinnanttemplate<class T> 770b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 771b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t); 7724eb27b79SHoward Hinnant 7734eb27b79SHoward Hinnanttemplate<class T, class Compare> 774b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 775b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t, Compare comp); 7764eb27b79SHoward Hinnant 7773e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 7781b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7793e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 7803e519524SHoward Hinnant 7813e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 7821b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7833e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 7843e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 7853e519524SHoward Hinnant 7863e519524SHoward Hinnanttemplate <class BidirectionalIterator> 787f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7883e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 7893e519524SHoward Hinnant 7903e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 791f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7923e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 7933e519524SHoward Hinnant 7943e519524SHoward Hinnanttemplate <class BidirectionalIterator> 795f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7963e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 7973e519524SHoward Hinnant 7983e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 799f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 8003e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 8013e519524SHoward Hinnant} // std 8023e519524SHoward Hinnant 8033e519524SHoward Hinnant*/ 8043e519524SHoward Hinnant 805385cc25aSLouis Dionne#include <__assert> // all public C++ headers provide the assertion handler 806ea2206d7SArthur O'Dwyer#include <__bits> 8073e519524SHoward Hinnant#include <__config> 808134723edSLouis Dionne#include <__debug> 809a1d07d57SHoward Hinnant#include <cstddef> 810bfbd73f8SArthur O'Dwyer#include <cstring> 811bfbd73f8SArthur O'Dwyer#include <functional> 812bfbd73f8SArthur O'Dwyer#include <initializer_list> 813bfbd73f8SArthur O'Dwyer#include <iterator> 814bfbd73f8SArthur O'Dwyer#include <memory> 815bfbd73f8SArthur O'Dwyer#include <type_traits> 816f56972e2SMarshall Clow#include <version> 8175d1a701dSHoward Hinnant 818134723edSLouis Dionne#include <__algorithm/adjacent_find.h> 819134723edSLouis Dionne#include <__algorithm/all_of.h> 820134723edSLouis Dionne#include <__algorithm/any_of.h> 821134723edSLouis Dionne#include <__algorithm/binary_search.h> 822134723edSLouis Dionne#include <__algorithm/clamp.h> 823134723edSLouis Dionne#include <__algorithm/comp.h> 824134723edSLouis Dionne#include <__algorithm/comp_ref_type.h> 825134723edSLouis Dionne#include <__algorithm/copy.h> 826134723edSLouis Dionne#include <__algorithm/copy_backward.h> 827134723edSLouis Dionne#include <__algorithm/copy_if.h> 828134723edSLouis Dionne#include <__algorithm/copy_n.h> 829134723edSLouis Dionne#include <__algorithm/count.h> 830134723edSLouis Dionne#include <__algorithm/count_if.h> 831134723edSLouis Dionne#include <__algorithm/equal.h> 832134723edSLouis Dionne#include <__algorithm/equal_range.h> 833134723edSLouis Dionne#include <__algorithm/fill.h> 8344d81a46fSArthur O'Dwyer#include <__algorithm/fill_n.h> 835134723edSLouis Dionne#include <__algorithm/find.h> 836134723edSLouis Dionne#include <__algorithm/find_end.h> 837134723edSLouis Dionne#include <__algorithm/find_first_of.h> 838134723edSLouis Dionne#include <__algorithm/find_if.h> 839134723edSLouis Dionne#include <__algorithm/find_if_not.h> 840134723edSLouis Dionne#include <__algorithm/for_each.h> 841134723edSLouis Dionne#include <__algorithm/for_each_n.h> 842134723edSLouis Dionne#include <__algorithm/generate.h> 8434d81a46fSArthur O'Dwyer#include <__algorithm/generate_n.h> 844134723edSLouis Dionne#include <__algorithm/half_positive.h> 84568f4131cSNikolas Klauser#include <__algorithm/in_found_result.h> 8461e77b396SNikolas Klauser#include <__algorithm/in_fun_result.h> 847f3514af4SNikolas Klauser#include <__algorithm/in_in_out_result.h> 848d3729bb3SNikolas Klauser#include <__algorithm/in_in_result.h> 849610979b3SNikolas Klauser#include <__algorithm/in_out_out_result.h> 8508d23b742SKonstantin Varlamov#include <__algorithm/in_out_result.h> 851134723edSLouis Dionne#include <__algorithm/includes.h> 852134723edSLouis Dionne#include <__algorithm/inplace_merge.h> 853134723edSLouis Dionne#include <__algorithm/is_heap.h> 854134723edSLouis Dionne#include <__algorithm/is_heap_until.h> 855134723edSLouis Dionne#include <__algorithm/is_partitioned.h> 856134723edSLouis Dionne#include <__algorithm/is_permutation.h> 857134723edSLouis Dionne#include <__algorithm/is_sorted.h> 858134723edSLouis Dionne#include <__algorithm/is_sorted_until.h> 8596adbc83eSChristopher Di Bella#include <__algorithm/iter_swap.h> 860134723edSLouis Dionne#include <__algorithm/lexicographical_compare.h> 861134723edSLouis Dionne#include <__algorithm/lower_bound.h> 862134723edSLouis Dionne#include <__algorithm/make_heap.h> 863134723edSLouis Dionne#include <__algorithm/max.h> 864134723edSLouis Dionne#include <__algorithm/max_element.h> 865134723edSLouis Dionne#include <__algorithm/merge.h> 866134723edSLouis Dionne#include <__algorithm/min.h> 867134723edSLouis Dionne#include <__algorithm/min_element.h> 868807766beSNikolas Klauser#include <__algorithm/min_max_result.h> 869134723edSLouis Dionne#include <__algorithm/minmax.h> 870134723edSLouis Dionne#include <__algorithm/minmax_element.h> 871134723edSLouis Dionne#include <__algorithm/mismatch.h> 872134723edSLouis Dionne#include <__algorithm/move.h> 873134723edSLouis Dionne#include <__algorithm/move_backward.h> 874134723edSLouis Dionne#include <__algorithm/next_permutation.h> 875134723edSLouis Dionne#include <__algorithm/none_of.h> 876134723edSLouis Dionne#include <__algorithm/nth_element.h> 877134723edSLouis Dionne#include <__algorithm/partial_sort.h> 878134723edSLouis Dionne#include <__algorithm/partial_sort_copy.h> 879134723edSLouis Dionne#include <__algorithm/partition.h> 880134723edSLouis Dionne#include <__algorithm/partition_copy.h> 881134723edSLouis Dionne#include <__algorithm/partition_point.h> 882134723edSLouis Dionne#include <__algorithm/pop_heap.h> 883134723edSLouis Dionne#include <__algorithm/prev_permutation.h> 884134723edSLouis Dionne#include <__algorithm/push_heap.h> 885*1306b102SNikolas Klauser#include <__algorithm/ranges_count.h> 886*1306b102SNikolas Klauser#include <__algorithm/ranges_count_if.h> 887ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find.h> 888ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if.h> 889ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if_not.h> 890e476df56SNikolas Klauser#include <__algorithm/ranges_max.h> 891205557c9SNikolas Klauser#include <__algorithm/ranges_max_element.h> 892f83d833eSNikolas Klauser#include <__algorithm/ranges_min.h> 8933b470d1cSNikolas Klauser#include <__algorithm/ranges_min_element.h> 894c2cd15a6SNikolas Klauser#include <__algorithm/ranges_mismatch.h> 8959d905319SNikolas Klauser#include <__algorithm/ranges_swap_ranges.h> 8963ba8548cSNikolas Klauser#include <__algorithm/ranges_transform.h> 897134723edSLouis Dionne#include <__algorithm/remove.h> 898134723edSLouis Dionne#include <__algorithm/remove_copy.h> 899134723edSLouis Dionne#include <__algorithm/remove_copy_if.h> 900134723edSLouis Dionne#include <__algorithm/remove_if.h> 901134723edSLouis Dionne#include <__algorithm/replace.h> 902134723edSLouis Dionne#include <__algorithm/replace_copy.h> 903134723edSLouis Dionne#include <__algorithm/replace_copy_if.h> 904134723edSLouis Dionne#include <__algorithm/replace_if.h> 905134723edSLouis Dionne#include <__algorithm/reverse.h> 906134723edSLouis Dionne#include <__algorithm/reverse_copy.h> 907134723edSLouis Dionne#include <__algorithm/rotate.h> 908134723edSLouis Dionne#include <__algorithm/rotate_copy.h> 909134723edSLouis Dionne#include <__algorithm/sample.h> 910134723edSLouis Dionne#include <__algorithm/search.h> 911134723edSLouis Dionne#include <__algorithm/search_n.h> 912134723edSLouis Dionne#include <__algorithm/set_difference.h> 913134723edSLouis Dionne#include <__algorithm/set_intersection.h> 914134723edSLouis Dionne#include <__algorithm/set_symmetric_difference.h> 915134723edSLouis Dionne#include <__algorithm/set_union.h> 916134723edSLouis Dionne#include <__algorithm/shift_left.h> 917134723edSLouis Dionne#include <__algorithm/shift_right.h> 918134723edSLouis Dionne#include <__algorithm/shuffle.h> 919134723edSLouis Dionne#include <__algorithm/sift_down.h> 920134723edSLouis Dionne#include <__algorithm/sort.h> 921134723edSLouis Dionne#include <__algorithm/sort_heap.h> 922134723edSLouis Dionne#include <__algorithm/stable_partition.h> 923134723edSLouis Dionne#include <__algorithm/stable_sort.h> 9246adbc83eSChristopher Di Bella#include <__algorithm/swap_ranges.h> 925134723edSLouis Dionne#include <__algorithm/transform.h> 926134723edSLouis Dionne#include <__algorithm/unique.h> 9274d81a46fSArthur O'Dwyer#include <__algorithm/unique_copy.h> 928134723edSLouis Dionne#include <__algorithm/unwrap_iter.h> 929134723edSLouis Dionne#include <__algorithm/upper_bound.h> 930c1bd9197SEric Fiselier 931073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 9323e519524SHoward Hinnant# pragma GCC system_header 933073458b1SHoward Hinnant#endif 9343e519524SHoward Hinnant 9350a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 93695689243SLouis Dionne# include <__pstl_algorithm> 9370a06eb91SLouis Dionne#endif 9380a06eb91SLouis Dionne 9393e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 940