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 85*f83d833eSNikolas Klauser 86*f83d833eSNikolas Klauser template<class T, class Proj = identity, 87*f83d833eSNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 88*f83d833eSNikolas Klauser constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20 89*f83d833eSNikolas Klauser 90*f83d833eSNikolas Klauser template<copyable T, class Proj = identity, 91*f83d833eSNikolas Klauser indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> 92*f83d833eSNikolas Klauser constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20 93*f83d833eSNikolas Klauser 94*f83d833eSNikolas Klauser template<input_range R, class Proj = identity, 95*f83d833eSNikolas Klauser indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 96*f83d833eSNikolas Klauser requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> 97*f83d833eSNikolas Klauser constexpr range_value_t<R> 98*f83d833eSNikolas Klauser min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20 99d3729bb3SNikolas Klauser} 100d3729bb3SNikolas Klauser 101706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1023e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 1033e519524SHoward Hinnant 1043e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 105706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1063e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 1073e519524SHoward Hinnant 1083e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 109706ffef7SMarshall Clow constexpr bool // constexpr in C++20 1103e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 1113e519524SHoward Hinnant 1123e519524SHoward Hinnanttemplate <class InputIterator, class Function> 1131b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 1143e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 1153e519524SHoward Hinnant 116d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 1171b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 1181b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 119d5c65ffaSMarshall Clow 1203e519524SHoward Hinnanttemplate <class InputIterator, class T> 12149c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1223e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 1233e519524SHoward Hinnant 1243e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 12549c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 1263e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 1273e519524SHoward Hinnant 1283e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 129b8bc4e15SArthur O'Dwyer constexpr InputIterator // constexpr in C++20 1303e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 1313e519524SHoward Hinnant 1323e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 133b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 1343e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1353e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1363e519524SHoward Hinnant 1373e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 138b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 1393e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 1403e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1413e519524SHoward Hinnant 1423e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1438694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1443e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1453e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1463e519524SHoward Hinnant 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1488694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1493e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator> 1538694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 1543e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 1553e519524SHoward Hinnant 1563e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 1578694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 1583e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 1593e519524SHoward Hinnant 1603e519524SHoward Hinnanttemplate <class InputIterator, class T> 161056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 1623e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 1633e519524SHoward Hinnant 1643e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 165056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 1663e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 1673e519524SHoward Hinnant 1683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1696538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1703e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1713e519524SHoward Hinnant 1720b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1736538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1740b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1750b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1760b0bbd2fSMarshall Clow 1773e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1786538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1793e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1803e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1813e519524SHoward Hinnant 1820b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1836538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1840b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1850b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1860b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1870b0bbd2fSMarshall Clow 1883e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1896538e28dSMarshall Clow constexpr bool // constexpr in C++20 1903e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1913e519524SHoward Hinnant 1920b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1936538e28dSMarshall Clow constexpr bool // constexpr in C++20 1940b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1950b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1960b0bbd2fSMarshall Clow 1973e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1986538e28dSMarshall Clow constexpr bool // constexpr in C++20 1993e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 2003e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 2013e519524SHoward Hinnant 2020b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 2036538e28dSMarshall Clow constexpr bool // constexpr in C++20 2040b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 2050b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 2060b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2070b0bbd2fSMarshall Clow 2083e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 20949c7643cSMarshall Clow constexpr bool // constexpr in C++20 2103e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2113e519524SHoward Hinnant ForwardIterator2 first2); 2123e519524SHoward Hinnant 2130b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 21449c7643cSMarshall Clow constexpr bool // constexpr in C++20 2150b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2160b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 2170b0bbd2fSMarshall Clow 2183e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 21949c7643cSMarshall Clow constexpr bool // constexpr in C++20 2203e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2213e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 2223e519524SHoward Hinnant 2230b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 22449c7643cSMarshall Clow constexpr bool // constexpr in C++20 2250b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 2260b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 2270b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 2280b0bbd2fSMarshall Clow 2293e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 23012f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2313e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 2323e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 23512f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 2363e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 2373e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 2383e519524SHoward Hinnant 2393e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 24012f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2413e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 2423e519524SHoward Hinnant 2433e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 24412f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2453e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 2463e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 2473e519524SHoward Hinnant 2483e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 24913c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 2503e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 2513e519524SHoward Hinnant 2523e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 25313c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 2543e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 2553e519524SHoward Hinnant OutputIterator result, Predicate pred); 2563e519524SHoward Hinnant 2573e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 25813c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 2593e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 26213c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 2633e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 2643e519524SHoward Hinnant BidirectionalIterator2 result); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 267b8bc4e15SArthur O'Dwyer constexpr ForwardIterator2 // constexpr in C++20 2683e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 2693e519524SHoward Hinnant 2709d905319SNikolas Klausertemplate<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> 2719d905319SNikolas Klauser requires indirectly_swappable<I1, I2> 2729d905319SNikolas Klauser constexpr ranges::swap_ranges_result<I1, I2> 2739d905319SNikolas Klauser ranges::swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); 2749d905319SNikolas Klauser 2759d905319SNikolas Klausertemplate<input_range R1, input_range R2> 2769d905319SNikolas Klauser requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> 2779d905319SNikolas Klauser constexpr ranges::swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> 2789d905319SNikolas Klauser ranges::swap_ranges(R1&& r1, R2&& r2); 2799d905319SNikolas Klauser 2803e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 281b8bc4e15SArthur O'Dwyer constexpr void // constexpr in C++20 2823e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 2833e519524SHoward Hinnant 2843e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 28599894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2863e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 2873e519524SHoward Hinnant 2883e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 28999894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2903e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2913e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2923e519524SHoward Hinnant 2933e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 29412c7423fSMarshall Clow constexpr void // constexpr in C++20 2953e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2963e519524SHoward Hinnant 2973e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 29812c7423fSMarshall Clow constexpr void // constexpr in C++20 2993e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 3003e519524SHoward Hinnant 3013e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 30212c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3033e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 3043e519524SHoward Hinnant const T& old_value, const T& new_value); 3053e519524SHoward Hinnant 3063e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 30712c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 3083e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3114bfb9313SMarshall Clow constexpr void // constexpr in C++20 3123e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 3133e519524SHoward Hinnant 3143e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 3154bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3163e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 3194bfb9313SMarshall Clow constexpr void // constexpr in C++20 3203e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 3234bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 3243e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 327e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3283e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 331e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3323e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 335e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 3363e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 339e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 3403e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class ForwardIterator> 343b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 3443e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 347b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 3483e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 351b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 3523e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 355b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 3563e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class BidirectionalIterator> 359f851db3dSArthur O'Dwyer constexpr void // constexpr in C++20 3603e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 3613e519524SHoward Hinnant 3623e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 363e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 3643e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 3653e519524SHoward Hinnant 3663e519524SHoward Hinnanttemplate <class ForwardIterator> 367b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 3683e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 3693e519524SHoward Hinnant 3703e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 371b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 3723e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 3733e519524SHoward Hinnant 3743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3753e519524SHoward Hinnant void 3760f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 3773e519524SHoward Hinnant 3783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 3793e519524SHoward Hinnant void 38006965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 3810f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 3823e519524SHoward Hinnant 383e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 384e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 385e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 386e7154709SEric Fiselier SampleIterator out, Distance n, 387e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 388e7154709SEric Fiselier 389f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 390f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 391fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 392f9d540b0SHoward Hinnant 3933fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 3943fbd3eafSArthur O'Dwyer constexpr ForwardIterator 3953fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 3963fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 3973fbd3eafSArthur O'Dwyer 3983fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 3993fbd3eafSArthur O'Dwyer constexpr ForwardIterator 4003fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 4013fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 4023fbd3eafSArthur O'Dwyer 4033e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 40449c7643cSMarshall Clow constexpr bool // constexpr in C++20 4053e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 408f851db3dSArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 4093e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4103e519524SHoward Hinnant 4113e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 4123e519524SHoward Hinnant class OutputIterator2, class Predicate> 4131b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 4143e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 4153e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 4163e519524SHoward Hinnant Predicate pred); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 4193e519524SHoward Hinnant ForwardIterator 4203e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 423d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4243e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class ForwardIterator> 42749c7643cSMarshall Clow constexpr bool // constexpr in C++20 4283e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 431b8bc4e15SArthur O'Dwyer constexpr bool // constexpr in C++20 4323e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 4333e519524SHoward Hinnant 4343e519524SHoward Hinnanttemplate<class ForwardIterator> 435056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4363e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 4373e519524SHoward Hinnant 4383e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 439056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 4403e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 4413e519524SHoward Hinnant 4423e519524SHoward Hinnanttemplate <class RandomAccessIterator> 443493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 4443e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 4453e519524SHoward Hinnant 4463e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 447493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 4483e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4493e519524SHoward Hinnant 4503e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4513e519524SHoward Hinnant void 4523e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4553e519524SHoward Hinnant void 4563e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4595386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 4603e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 4613e519524SHoward Hinnant 4623e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4635386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 4643e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 4653e519524SHoward Hinnant 4663e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 4675386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 4683e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 4693e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 4703e519524SHoward Hinnant 4713e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 4725386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 4733e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 4743e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 4753e519524SHoward Hinnant 4763e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4775d956563SArthur O'Dwyer constexpr void // constexpr in C++20 4783e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4815d956563SArthur O'Dwyer constexpr void // constexpr in C++20 4823e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 485d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4863e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 4873e519524SHoward Hinnant 4883e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 489d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4903e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4913e519524SHoward Hinnant 4923e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 493d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4943e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 4953e519524SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 497d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4983e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 501d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5023e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 505d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 5063e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 509d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 5103e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 5138da1a487SMarshall Clow constexpr bool // constexpr in C++20 5143e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 51714098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5183e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5193e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5203e519524SHoward Hinnant 5213e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 52214098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5233e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 5243e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5253e519524SHoward Hinnant 5263e519524SHoward Hinnanttemplate <class BidirectionalIterator> 5273e519524SHoward Hinnant void 5283e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 5293e519524SHoward Hinnant 5303e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 5313e519524SHoward Hinnant void 5323e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 5333e519524SHoward Hinnant 5343e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5358da1a487SMarshall Clow constexpr bool // constexpr in C++20 5363e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5373e519524SHoward Hinnant 5383e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5398da1a487SMarshall Clow constexpr bool // constexpr in C++20 5403e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 5413e519524SHoward Hinnant 5423e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 54314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5443e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 5453e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5463e519524SHoward Hinnant 5473e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 54814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5493e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 5503e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5513e519524SHoward Hinnant 5523e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 5538da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 5543e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 5553e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5563e519524SHoward Hinnant 5573e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 5588da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 5593e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 5603e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5613e519524SHoward Hinnant 5623e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 56314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5643e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 5653e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5663e519524SHoward Hinnant 5673e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 56814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5693e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 5703e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5713e519524SHoward Hinnant 5723e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 57314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5743e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 5753e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 5763e519524SHoward Hinnant 5773e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 57814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 5793e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 5803e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 5813e519524SHoward Hinnant 5823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5835386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5843e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 5853e519524SHoward Hinnant 5863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5875386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5883e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5893e519524SHoward Hinnant 5903e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5915386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5923e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 5933e519524SHoward Hinnant 5943e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5955386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5963e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5973e519524SHoward Hinnant 5983e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5995386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6003e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 6013e519524SHoward Hinnant 6023e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6035386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6043e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6053e519524SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class RandomAccessIterator> 6075386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6083e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 6115386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 6123e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class RandomAccessIterator> 61549c7643cSMarshall Clow constexpr bool // constexpr in C++20 6163e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 61949c7643cSMarshall Clow constexpr bool // constexpr in C++20 6203e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6213e519524SHoward Hinnant 6223e519524SHoward Hinnanttemplate <class RandomAccessIterator> 62349c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6243e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 62749c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 6283e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 6293e519524SHoward Hinnant 6304eb27b79SHoward Hinnanttemplate <class ForwardIterator> 631b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 632b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last); 6334eb27b79SHoward Hinnant 6344eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 635b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 636b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last, Compare comp); 6374eb27b79SHoward Hinnant 6383e519524SHoward Hinnanttemplate <class T> 639b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 640b8bc4e15SArthur O'Dwyer min(const T& a, const T& b); 6413e519524SHoward Hinnant 6423e519524SHoward Hinnanttemplate <class T, class Compare> 643b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 644b8bc4e15SArthur O'Dwyer min(const T& a, const T& b, Compare comp); 6453e519524SHoward Hinnant 6463e519524SHoward Hinnanttemplate<class T> 647b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 648b8bc4e15SArthur O'Dwyer min(initializer_list<T> t); 6493e519524SHoward Hinnant 6503e519524SHoward Hinnanttemplate<class T, class Compare> 651b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 652b8bc4e15SArthur O'Dwyer min(initializer_list<T> t, Compare comp); 6533e519524SHoward Hinnant 654146c14acSMarshall Clowtemplate<class T> 655146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 656146c14acSMarshall Clow 657146c14acSMarshall Clowtemplate<class T, class Compare> 658146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 659146c14acSMarshall Clow 6603e519524SHoward Hinnanttemplate <class ForwardIterator> 661b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 662b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last); 6633e519524SHoward Hinnant 6643e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 665b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 666b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last, Compare comp); 6673e519524SHoward Hinnant 6684eb27b79SHoward Hinnanttemplate <class T> 669b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 670b8bc4e15SArthur O'Dwyer max(const T& a, const T& b); 6714eb27b79SHoward Hinnant 6724eb27b79SHoward Hinnanttemplate <class T, class Compare> 673b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 674b8bc4e15SArthur O'Dwyer max(const T& a, const T& b, Compare comp); 6754eb27b79SHoward Hinnant 6764eb27b79SHoward Hinnanttemplate<class T> 677b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 678b8bc4e15SArthur O'Dwyer max(initializer_list<T> t); 6794eb27b79SHoward Hinnant 6804eb27b79SHoward Hinnanttemplate<class T, class Compare> 681b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 682b8bc4e15SArthur O'Dwyer max(initializer_list<T> t, Compare comp); 6834eb27b79SHoward Hinnant 6844eb27b79SHoward Hinnanttemplate<class ForwardIterator> 685b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 686b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last); 6874eb27b79SHoward Hinnant 6884eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 689b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 690b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 6914eb27b79SHoward Hinnant 6924eb27b79SHoward Hinnanttemplate<class T> 693b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 694b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b); 6954eb27b79SHoward Hinnant 6964eb27b79SHoward Hinnanttemplate<class T, class Compare> 697b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 698b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b, Compare comp); 6994eb27b79SHoward Hinnant 7004eb27b79SHoward Hinnanttemplate<class T> 701b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 702b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t); 7034eb27b79SHoward Hinnant 7044eb27b79SHoward Hinnanttemplate<class T, class Compare> 705b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 706b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t, Compare comp); 7074eb27b79SHoward Hinnant 7083e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 7091b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7103e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 7113e519524SHoward Hinnant 7123e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 7131b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 7143e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 7153e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 7163e519524SHoward Hinnant 7173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 718f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7193e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 7203e519524SHoward Hinnant 7213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 722f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7233e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class BidirectionalIterator> 726f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7273e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 7283e519524SHoward Hinnant 7293e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 730f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 7313e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 7323e519524SHoward Hinnant} // std 7333e519524SHoward Hinnant 7343e519524SHoward Hinnant*/ 7353e519524SHoward Hinnant 736ea2206d7SArthur O'Dwyer#include <__bits> 7373e519524SHoward Hinnant#include <__config> 738134723edSLouis Dionne#include <__debug> 739a1d07d57SHoward Hinnant#include <cstddef> 740bfbd73f8SArthur O'Dwyer#include <cstring> 741bfbd73f8SArthur O'Dwyer#include <functional> 742bfbd73f8SArthur O'Dwyer#include <initializer_list> 743bfbd73f8SArthur O'Dwyer#include <iterator> 744bfbd73f8SArthur O'Dwyer#include <memory> 745bfbd73f8SArthur O'Dwyer#include <type_traits> 746f56972e2SMarshall Clow#include <version> 7475d1a701dSHoward Hinnant 748134723edSLouis Dionne#include <__algorithm/adjacent_find.h> 749134723edSLouis Dionne#include <__algorithm/all_of.h> 750134723edSLouis Dionne#include <__algorithm/any_of.h> 751134723edSLouis Dionne#include <__algorithm/binary_search.h> 752134723edSLouis Dionne#include <__algorithm/clamp.h> 753134723edSLouis Dionne#include <__algorithm/comp.h> 754134723edSLouis Dionne#include <__algorithm/comp_ref_type.h> 755134723edSLouis Dionne#include <__algorithm/copy.h> 756134723edSLouis Dionne#include <__algorithm/copy_backward.h> 757134723edSLouis Dionne#include <__algorithm/copy_if.h> 758134723edSLouis Dionne#include <__algorithm/copy_n.h> 759134723edSLouis Dionne#include <__algorithm/count.h> 760134723edSLouis Dionne#include <__algorithm/count_if.h> 761134723edSLouis Dionne#include <__algorithm/equal.h> 762134723edSLouis Dionne#include <__algorithm/equal_range.h> 763134723edSLouis Dionne#include <__algorithm/fill.h> 7644d81a46fSArthur O'Dwyer#include <__algorithm/fill_n.h> 765134723edSLouis Dionne#include <__algorithm/find.h> 766134723edSLouis Dionne#include <__algorithm/find_end.h> 767134723edSLouis Dionne#include <__algorithm/find_first_of.h> 768134723edSLouis Dionne#include <__algorithm/find_if.h> 769134723edSLouis Dionne#include <__algorithm/find_if_not.h> 770134723edSLouis Dionne#include <__algorithm/for_each.h> 771134723edSLouis Dionne#include <__algorithm/for_each_n.h> 772134723edSLouis Dionne#include <__algorithm/generate.h> 7734d81a46fSArthur O'Dwyer#include <__algorithm/generate_n.h> 774134723edSLouis Dionne#include <__algorithm/half_positive.h> 77568f4131cSNikolas Klauser#include <__algorithm/in_found_result.h> 7761e77b396SNikolas Klauser#include <__algorithm/in_fun_result.h> 777f3514af4SNikolas Klauser#include <__algorithm/in_in_out_result.h> 778d3729bb3SNikolas Klauser#include <__algorithm/in_in_result.h> 779610979b3SNikolas Klauser#include <__algorithm/in_out_out_result.h> 7808d23b742SKonstantin Varlamov#include <__algorithm/in_out_result.h> 781134723edSLouis Dionne#include <__algorithm/includes.h> 782134723edSLouis Dionne#include <__algorithm/inplace_merge.h> 783134723edSLouis Dionne#include <__algorithm/is_heap.h> 784134723edSLouis Dionne#include <__algorithm/is_heap_until.h> 785134723edSLouis Dionne#include <__algorithm/is_partitioned.h> 786134723edSLouis Dionne#include <__algorithm/is_permutation.h> 787134723edSLouis Dionne#include <__algorithm/is_sorted.h> 788134723edSLouis Dionne#include <__algorithm/is_sorted_until.h> 7896adbc83eSChristopher Di Bella#include <__algorithm/iter_swap.h> 790134723edSLouis Dionne#include <__algorithm/lexicographical_compare.h> 791134723edSLouis Dionne#include <__algorithm/lower_bound.h> 792134723edSLouis Dionne#include <__algorithm/make_heap.h> 793134723edSLouis Dionne#include <__algorithm/max.h> 794134723edSLouis Dionne#include <__algorithm/max_element.h> 795134723edSLouis Dionne#include <__algorithm/merge.h> 796134723edSLouis Dionne#include <__algorithm/min.h> 797134723edSLouis Dionne#include <__algorithm/min_element.h> 798807766beSNikolas Klauser#include <__algorithm/min_max_result.h> 799134723edSLouis Dionne#include <__algorithm/minmax.h> 800134723edSLouis Dionne#include <__algorithm/minmax_element.h> 801134723edSLouis Dionne#include <__algorithm/mismatch.h> 802134723edSLouis Dionne#include <__algorithm/move.h> 803134723edSLouis Dionne#include <__algorithm/move_backward.h> 804134723edSLouis Dionne#include <__algorithm/next_permutation.h> 805134723edSLouis Dionne#include <__algorithm/none_of.h> 806134723edSLouis Dionne#include <__algorithm/nth_element.h> 807134723edSLouis Dionne#include <__algorithm/partial_sort.h> 808134723edSLouis Dionne#include <__algorithm/partial_sort_copy.h> 809134723edSLouis Dionne#include <__algorithm/partition.h> 810134723edSLouis Dionne#include <__algorithm/partition_copy.h> 811134723edSLouis Dionne#include <__algorithm/partition_point.h> 812134723edSLouis Dionne#include <__algorithm/pop_heap.h> 813134723edSLouis Dionne#include <__algorithm/prev_permutation.h> 814134723edSLouis Dionne#include <__algorithm/push_heap.h> 815ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find.h> 816ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if.h> 817ee0f8c40SNikolas Klauser#include <__algorithm/ranges_find_if_not.h> 818205557c9SNikolas Klauser#include <__algorithm/ranges_max_element.h> 819*f83d833eSNikolas Klauser#include <__algorithm/ranges_min.h> 8203b470d1cSNikolas Klauser#include <__algorithm/ranges_min_element.h> 821c2cd15a6SNikolas Klauser#include <__algorithm/ranges_mismatch.h> 8229d905319SNikolas Klauser#include <__algorithm/ranges_swap_ranges.h> 823134723edSLouis Dionne#include <__algorithm/remove.h> 824134723edSLouis Dionne#include <__algorithm/remove_copy.h> 825134723edSLouis Dionne#include <__algorithm/remove_copy_if.h> 826134723edSLouis Dionne#include <__algorithm/remove_if.h> 827134723edSLouis Dionne#include <__algorithm/replace.h> 828134723edSLouis Dionne#include <__algorithm/replace_copy.h> 829134723edSLouis Dionne#include <__algorithm/replace_copy_if.h> 830134723edSLouis Dionne#include <__algorithm/replace_if.h> 831134723edSLouis Dionne#include <__algorithm/reverse.h> 832134723edSLouis Dionne#include <__algorithm/reverse_copy.h> 833134723edSLouis Dionne#include <__algorithm/rotate.h> 834134723edSLouis Dionne#include <__algorithm/rotate_copy.h> 835134723edSLouis Dionne#include <__algorithm/sample.h> 836134723edSLouis Dionne#include <__algorithm/search.h> 837134723edSLouis Dionne#include <__algorithm/search_n.h> 838134723edSLouis Dionne#include <__algorithm/set_difference.h> 839134723edSLouis Dionne#include <__algorithm/set_intersection.h> 840134723edSLouis Dionne#include <__algorithm/set_symmetric_difference.h> 841134723edSLouis Dionne#include <__algorithm/set_union.h> 842134723edSLouis Dionne#include <__algorithm/shift_left.h> 843134723edSLouis Dionne#include <__algorithm/shift_right.h> 844134723edSLouis Dionne#include <__algorithm/shuffle.h> 845134723edSLouis Dionne#include <__algorithm/sift_down.h> 846134723edSLouis Dionne#include <__algorithm/sort.h> 847134723edSLouis Dionne#include <__algorithm/sort_heap.h> 848134723edSLouis Dionne#include <__algorithm/stable_partition.h> 849134723edSLouis Dionne#include <__algorithm/stable_sort.h> 8506adbc83eSChristopher Di Bella#include <__algorithm/swap_ranges.h> 851134723edSLouis Dionne#include <__algorithm/transform.h> 852134723edSLouis Dionne#include <__algorithm/unique.h> 8534d81a46fSArthur O'Dwyer#include <__algorithm/unique_copy.h> 854134723edSLouis Dionne#include <__algorithm/unwrap_iter.h> 855134723edSLouis Dionne#include <__algorithm/upper_bound.h> 856c1bd9197SEric Fiselier 857073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 8583e519524SHoward Hinnant# pragma GCC system_header 859073458b1SHoward Hinnant#endif 8603e519524SHoward Hinnant 8610a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 86295689243SLouis Dionne# include <__pstl_algorithm> 8630a06eb91SLouis Dionne#endif 8640a06eb91SLouis Dionne 8653e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 866