13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 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 213e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 22706ffef7SMarshall Clow constexpr bool // constexpr in C++20 233e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 243e519524SHoward Hinnant 253e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 26706ffef7SMarshall Clow constexpr bool // constexpr in C++20 273e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 283e519524SHoward Hinnant 293e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30706ffef7SMarshall Clow constexpr bool // constexpr in C++20 313e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 323e519524SHoward Hinnant 333e519524SHoward Hinnanttemplate <class InputIterator, class Function> 341b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 353e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 363e519524SHoward Hinnant 37d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 381b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 391b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 40d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 4249c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 433e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 443e519524SHoward Hinnant 453e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 4649c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 473e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 483e519524SHoward Hinnant 493e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 50b8bc4e15SArthur O'Dwyer constexpr InputIterator // constexpr in C++20 513e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 523e519524SHoward Hinnant 533e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 54b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 553e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 563e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 573e519524SHoward Hinnant 583e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 59b8bc4e15SArthur O'Dwyer constexpr ForwardIterator1 // constexpr in C++20 603e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 613e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 623e519524SHoward Hinnant 633e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 648694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 653e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 663e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 673e519524SHoward Hinnant 683e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 698694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 703e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 713e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 723e519524SHoward Hinnant 733e519524SHoward Hinnanttemplate <class ForwardIterator> 748694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 753e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 763e519524SHoward Hinnant 773e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 788694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 793e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 803e519524SHoward Hinnant 813e519524SHoward Hinnanttemplate <class InputIterator, class T> 82056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 833e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 843e519524SHoward Hinnant 853e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 86056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 873e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 883e519524SHoward Hinnant 893e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 906538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 913e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 923e519524SHoward Hinnant 930b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 946538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 950b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 960b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 970b0bbd2fSMarshall Clow 983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 996538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1003e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1013e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1023e519524SHoward Hinnant 1030b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1046538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1050b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1060b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1070b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1080b0bbd2fSMarshall Clow 1093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1106538e28dSMarshall Clow constexpr bool // constexpr in C++20 1113e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1123e519524SHoward Hinnant 1130b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1146538e28dSMarshall Clow constexpr bool // constexpr in C++20 1150b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1160b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1170b0bbd2fSMarshall Clow 1183e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1196538e28dSMarshall Clow constexpr bool // constexpr in C++20 1203e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1213e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1223e519524SHoward Hinnant 1230b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1246538e28dSMarshall Clow constexpr bool // constexpr in C++20 1250b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1260b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1270b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1280b0bbd2fSMarshall Clow 1293e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 13049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1313e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1323e519524SHoward Hinnant ForwardIterator2 first2); 1333e519524SHoward Hinnant 1340b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 13549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1360b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1370b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1380b0bbd2fSMarshall Clow 1393e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1413e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1423e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1433e519524SHoward Hinnant 1440b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1460b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1470b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1480b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1490b0bbd2fSMarshall Clow 1503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 15112f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1523e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 15612f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1573e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1593e519524SHoward Hinnant 1603e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 16112f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1623e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1633e519524SHoward Hinnant 1643e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 16512f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1663e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1673e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1683e519524SHoward Hinnant 1693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 17013c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1713e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 17413c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1753e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1763e519524SHoward Hinnant OutputIterator result, Predicate pred); 1773e519524SHoward Hinnant 1783e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 17913c90a57SLouis Dionne constexpr OutputIterator // constexpr in C++20 1803e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1813e519524SHoward Hinnant 1823e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 18313c90a57SLouis Dionne constexpr BidirectionalIterator2 // constexpr in C++20 1843e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1853e519524SHoward Hinnant BidirectionalIterator2 result); 1863e519524SHoward Hinnant 1873e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 188b8bc4e15SArthur O'Dwyer constexpr ForwardIterator2 // constexpr in C++20 1893e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1903e519524SHoward Hinnant 1913e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 192b8bc4e15SArthur O'Dwyer constexpr void // constexpr in C++20 1933e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1943e519524SHoward Hinnant 1953e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 19699894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 1973e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1983e519524SHoward Hinnant 1993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 20099894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2013e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2023e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2033e519524SHoward Hinnant 2043e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 20512c7423fSMarshall Clow constexpr void // constexpr in C++20 2063e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2073e519524SHoward Hinnant 2083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 20912c7423fSMarshall Clow constexpr void // constexpr in C++20 2103e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2113e519524SHoward Hinnant 2123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 21312c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2143e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2153e519524SHoward Hinnant const T& old_value, const T& new_value); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 21812c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2193e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2224bfb9313SMarshall Clow constexpr void // constexpr in C++20 2233e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2264bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2273e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2304bfb9313SMarshall Clow constexpr void // constexpr in C++20 2313e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2344bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2353e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 238e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2393e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 242e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2433e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 246e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2473e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 250e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2513e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class ForwardIterator> 254b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 2553e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2563e519524SHoward Hinnant 2573e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 258b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 2593e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 262b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 2633e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 266b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 2673e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2703e519524SHoward Hinnant void 2713e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2723e519524SHoward Hinnant 2733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 274e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2753e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2763e519524SHoward Hinnant 2773e519524SHoward Hinnanttemplate <class ForwardIterator> 278b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 2793e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2803e519524SHoward Hinnant 2813e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 282b8bc4e15SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 2833e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2843e519524SHoward Hinnant 2853e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2863e519524SHoward Hinnant void 2870f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2883e519524SHoward Hinnant 2893e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2903e519524SHoward Hinnant void 29106965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2920f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 2933e519524SHoward Hinnant 294e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 295e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 296e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 297e7154709SEric Fiselier SampleIterator out, Distance n, 298e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 299e7154709SEric Fiselier 300f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 301f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 302fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 303f9d540b0SHoward Hinnant 304*3fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 305*3fbd3eafSArthur O'Dwyer constexpr ForwardIterator 306*3fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 307*3fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 308*3fbd3eafSArthur O'Dwyer 309*3fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 310*3fbd3eafSArthur O'Dwyer constexpr ForwardIterator 311*3fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 312*3fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 313*3fbd3eafSArthur O'Dwyer 3143e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 31549c7643cSMarshall Clow constexpr bool // constexpr in C++20 3163e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3193e519524SHoward Hinnant ForwardIterator 3203e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3233e519524SHoward Hinnant class OutputIterator2, class Predicate> 3241b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 3253e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3263e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3273e519524SHoward Hinnant Predicate pred); 3283e519524SHoward Hinnant 3293e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3303e519524SHoward Hinnant ForwardIterator 3313e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3323e519524SHoward Hinnant 3333e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 334d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3353e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3363e519524SHoward Hinnant 3373e519524SHoward Hinnanttemplate <class ForwardIterator> 33849c7643cSMarshall Clow constexpr bool // constexpr in C++20 3393e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3403e519524SHoward Hinnant 3413e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 342b8bc4e15SArthur O'Dwyer constexpr bool // constexpr in C++20 3433e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3443e519524SHoward Hinnant 3453e519524SHoward Hinnanttemplate<class ForwardIterator> 346056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3473e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3483e519524SHoward Hinnant 3493e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 350056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3513e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3523e519524SHoward Hinnant 3533e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3543e519524SHoward Hinnant void 3553e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3583e519524SHoward Hinnant void 3593e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3603e519524SHoward Hinnant 3613e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3623e519524SHoward Hinnant void 3633e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3643e519524SHoward Hinnant 3653e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3663e519524SHoward Hinnant void 3673e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3683e519524SHoward Hinnant 3693e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3703e519524SHoward Hinnant void 3713e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3723e519524SHoward Hinnant 3733e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3743e519524SHoward Hinnant void 3753e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3763e519524SHoward Hinnant 3773e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3783e519524SHoward Hinnant RandomAccessIterator 3793e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3803e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3813e519524SHoward Hinnant 3823e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3833e519524SHoward Hinnant RandomAccessIterator 3843e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3853e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3863e519524SHoward Hinnant 3873e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3883e519524SHoward Hinnant void 3893e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3923e519524SHoward Hinnant void 3933e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3943e519524SHoward Hinnant 3953e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 396d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3973e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3983e519524SHoward Hinnant 3993e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 400d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4013e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4023e519524SHoward Hinnant 4033e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 404d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4053e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 4063e519524SHoward Hinnant 4073e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 408d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4093e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4103e519524SHoward Hinnant 4113e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 412d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4133e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4143e519524SHoward Hinnant 4153e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 416d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4173e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4183e519524SHoward Hinnant 4193e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 420d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 4213e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4223e519524SHoward Hinnant 4233e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4248da1a487SMarshall Clow constexpr bool // constexpr in C++20 4253e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 42814098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4293e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4303e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4313e519524SHoward Hinnant 4323e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 43314098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4343e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4353e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4363e519524SHoward Hinnant 4373e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4383e519524SHoward Hinnant void 4393e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4403e519524SHoward Hinnant 4413e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4423e519524SHoward Hinnant void 4433e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4443e519524SHoward Hinnant 4453e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4468da1a487SMarshall Clow constexpr bool // constexpr in C++20 4473e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4508da1a487SMarshall Clow constexpr bool // constexpr in C++20 4513e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 45414098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4553e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 45914098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4603e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4648da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4653e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4698da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4703e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 47414098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4753e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4763e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 47914098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4803e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4813e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4823e519524SHoward Hinnant 4833e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 48414098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4853e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4863e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4873e519524SHoward Hinnant 4883e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 48914098cf6SArthur O'Dwyer constexpr OutputIterator // constexpr in C++20 4903e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4913e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4923e519524SHoward Hinnant 4933e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4943e519524SHoward Hinnant void 4953e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4983e519524SHoward Hinnant void 4993e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5023e519524SHoward Hinnant void 5033e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5063e519524SHoward Hinnant void 5073e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5103e519524SHoward Hinnant void 5113e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5143e519524SHoward Hinnant void 5153e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5183e519524SHoward Hinnant void 5193e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5203e519524SHoward Hinnant 5213e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5223e519524SHoward Hinnant void 5233e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5243e519524SHoward Hinnant 5253e519524SHoward Hinnanttemplate <class RandomAccessIterator> 52649c7643cSMarshall Clow constexpr bool // constexpr in C++20 5273e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5283e519524SHoward Hinnant 5293e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 53049c7643cSMarshall Clow constexpr bool // constexpr in C++20 5313e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5323e519524SHoward Hinnant 5333e519524SHoward Hinnanttemplate <class RandomAccessIterator> 53449c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5353e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5363e519524SHoward Hinnant 5373e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 53849c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5393e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5403e519524SHoward Hinnant 5414eb27b79SHoward Hinnanttemplate <class ForwardIterator> 542b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 543b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last); 5444eb27b79SHoward Hinnant 5454eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 546b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 547b8bc4e15SArthur O'Dwyer min_element(ForwardIterator first, ForwardIterator last, Compare comp); 5484eb27b79SHoward Hinnant 5493e519524SHoward Hinnanttemplate <class T> 550b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 551b8bc4e15SArthur O'Dwyer min(const T& a, const T& b); 5523e519524SHoward Hinnant 5533e519524SHoward Hinnanttemplate <class T, class Compare> 554b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 555b8bc4e15SArthur O'Dwyer min(const T& a, const T& b, Compare comp); 5563e519524SHoward Hinnant 5573e519524SHoward Hinnanttemplate<class T> 558b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 559b8bc4e15SArthur O'Dwyer min(initializer_list<T> t); 5603e519524SHoward Hinnant 5613e519524SHoward Hinnanttemplate<class T, class Compare> 562b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 563b8bc4e15SArthur O'Dwyer min(initializer_list<T> t, Compare comp); 5643e519524SHoward Hinnant 565146c14acSMarshall Clowtemplate<class T> 566146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi); // C++17 567146c14acSMarshall Clow 568146c14acSMarshall Clowtemplate<class T, class Compare> 569146c14acSMarshall Clow constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); // C++17 570146c14acSMarshall Clow 5713e519524SHoward Hinnanttemplate <class ForwardIterator> 572b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 573b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last); 5743e519524SHoward Hinnant 5753e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 576b8bc4e15SArthur O'Dwyer constexpr ForwardIterator // constexpr in C++14 577b8bc4e15SArthur O'Dwyer max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5783e519524SHoward Hinnant 5794eb27b79SHoward Hinnanttemplate <class T> 580b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 581b8bc4e15SArthur O'Dwyer max(const T& a, const T& b); 5824eb27b79SHoward Hinnant 5834eb27b79SHoward Hinnanttemplate <class T, class Compare> 584b8bc4e15SArthur O'Dwyer constexpr const T& // constexpr in C++14 585b8bc4e15SArthur O'Dwyer max(const T& a, const T& b, Compare comp); 5864eb27b79SHoward Hinnant 5874eb27b79SHoward Hinnanttemplate<class T> 588b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 589b8bc4e15SArthur O'Dwyer max(initializer_list<T> t); 5904eb27b79SHoward Hinnant 5914eb27b79SHoward Hinnanttemplate<class T, class Compare> 592b8bc4e15SArthur O'Dwyer constexpr T // constexpr in C++14 593b8bc4e15SArthur O'Dwyer max(initializer_list<T> t, Compare comp); 5944eb27b79SHoward Hinnant 5954eb27b79SHoward Hinnanttemplate<class ForwardIterator> 596b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 597b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last); 5984eb27b79SHoward Hinnant 5994eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 600b8bc4e15SArthur O'Dwyer constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++14 601b8bc4e15SArthur O'Dwyer minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 6024eb27b79SHoward Hinnant 6034eb27b79SHoward Hinnanttemplate<class T> 604b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 605b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b); 6064eb27b79SHoward Hinnant 6074eb27b79SHoward Hinnanttemplate<class T, class Compare> 608b8bc4e15SArthur O'Dwyer constexpr pair<const T&, const T&> // constexpr in C++14 609b8bc4e15SArthur O'Dwyer minmax(const T& a, const T& b, Compare comp); 6104eb27b79SHoward Hinnant 6114eb27b79SHoward Hinnanttemplate<class T> 612b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 613b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t); 6144eb27b79SHoward Hinnant 6154eb27b79SHoward Hinnanttemplate<class T, class Compare> 616b8bc4e15SArthur O'Dwyer constexpr pair<T, T> // constexpr in C++14 617b8bc4e15SArthur O'Dwyer minmax(initializer_list<T> t, Compare comp); 6184eb27b79SHoward Hinnant 6193e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6201b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6213e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6223e519524SHoward Hinnant 6233e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6241b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6253e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6263e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6273e519524SHoward Hinnant 6283e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6293e519524SHoward Hinnant bool 6303e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6313e519524SHoward Hinnant 6323e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6333e519524SHoward Hinnant bool 6343e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6353e519524SHoward Hinnant 6363e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6373e519524SHoward Hinnant bool 6383e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6393e519524SHoward Hinnant 6403e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6413e519524SHoward Hinnant bool 6423e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6433e519524SHoward Hinnant 6443e519524SHoward Hinnant} // std 6453e519524SHoward Hinnant 6463e519524SHoward Hinnant*/ 6473e519524SHoward Hinnant 6483e519524SHoward Hinnant#include <__config> 6493e519524SHoward Hinnant#include <initializer_list> 6503e519524SHoward Hinnant#include <type_traits> 6513e519524SHoward Hinnant#include <cstring> 652f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6533e519524SHoward Hinnant#include <memory> 654d835e592SMarshall Clow#include <functional> 6553e519524SHoward Hinnant#include <iterator> 656a1d07d57SHoward Hinnant#include <cstddef> 657e02ee4f0SMarshall Clow#include <bit> 658f56972e2SMarshall Clow#include <version> 6595d1a701dSHoward Hinnant 660c1bd9197SEric Fiselier#include <__debug> 661c1bd9197SEric Fiselier 662073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6633e519524SHoward Hinnant#pragma GCC system_header 664073458b1SHoward Hinnant#endif 6653e519524SHoward Hinnant 666a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 667a016efb1SEric Fiselier#include <__undef_macros> 668a016efb1SEric Fiselier 669a016efb1SEric Fiselier 6703e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6713e519524SHoward Hinnant 6729d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6739d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6749d67c6d5SMarshall Clow// * We haven't included <functional> here. 6753e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6763e519524SHoward Hinnantstruct __equal_to 6773e519524SHoward Hinnant{ 678d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 679d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 680d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 681d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6823e519524SHoward Hinnant}; 6833e519524SHoward Hinnant 6843e519524SHoward Hinnanttemplate <class _T1> 6853e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6863e519524SHoward Hinnant{ 6879d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6889d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6893e519524SHoward Hinnant}; 6903e519524SHoward Hinnant 6913e519524SHoward Hinnanttemplate <class _T1> 6923e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6933e519524SHoward Hinnant{ 6949d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6959d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6963e519524SHoward Hinnant}; 6973e519524SHoward Hinnant 6983e519524SHoward Hinnanttemplate <class _T1> 6993e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 7003e519524SHoward Hinnant{ 7019d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7029d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 7033e519524SHoward Hinnant}; 7043e519524SHoward Hinnant 7053e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 7063e519524SHoward Hinnantstruct __less 7073e519524SHoward Hinnant{ 7089d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7099d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7109d67c6d5SMarshall Clow 7119d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7129d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7139d67c6d5SMarshall Clow 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7169d67c6d5SMarshall Clow 7179d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7189d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7193e519524SHoward Hinnant}; 7203e519524SHoward Hinnant 7213e519524SHoward Hinnanttemplate <class _T1> 7223e519524SHoward Hinnantstruct __less<_T1, _T1> 7233e519524SHoward Hinnant{ 7249d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7259d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7263e519524SHoward Hinnant}; 7273e519524SHoward Hinnant 7283e519524SHoward Hinnanttemplate <class _T1> 7293e519524SHoward Hinnantstruct __less<const _T1, _T1> 7303e519524SHoward Hinnant{ 7319d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7329d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7333e519524SHoward Hinnant}; 7343e519524SHoward Hinnant 7353e519524SHoward Hinnanttemplate <class _T1> 7363e519524SHoward Hinnantstruct __less<_T1, const _T1> 7373e519524SHoward Hinnant{ 7389d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7399d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7403e519524SHoward Hinnant}; 7413e519524SHoward Hinnant 7423e519524SHoward Hinnanttemplate <class _Predicate> 743a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7443e519524SHoward Hinnant{ 7453e519524SHoward Hinnantprivate: 7463e519524SHoward Hinnant _Predicate __p_; 7473e519524SHoward Hinnantpublic: 748a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7493e519524SHoward Hinnant 7503e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 751a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7523e519524SHoward Hinnant 7533e519524SHoward Hinnant template <class _T1> 7543e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7553e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7563e519524SHoward Hinnant 7573e519524SHoward Hinnant template <class _T1, class _T2> 7583e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 759a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7603e519524SHoward Hinnant}; 7613e519524SHoward Hinnant 76204695a75SLouis Dionne// Perform division by two quickly for positive integers (llvm.org/PR39129) 76304695a75SLouis Dionne 76404695a75SLouis Dionnetemplate <typename _Integral> 76504695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 76604695a75SLouis Dionnetypename enable_if 76704695a75SLouis Dionne< 76804695a75SLouis Dionne is_integral<_Integral>::value, 76904695a75SLouis Dionne _Integral 77004695a75SLouis Dionne>::type 77104695a75SLouis Dionne__half_positive(_Integral __value) 77204695a75SLouis Dionne{ 77304695a75SLouis Dionne return static_cast<_Integral>(static_cast<typename make_unsigned<_Integral>::type>(__value) / 2); 77404695a75SLouis Dionne} 77504695a75SLouis Dionne 77604695a75SLouis Dionnetemplate <typename _Tp> 77704695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 77804695a75SLouis Dionnetypename enable_if 77904695a75SLouis Dionne< 78004695a75SLouis Dionne !is_integral<_Tp>::value, 78104695a75SLouis Dionne _Tp 78204695a75SLouis Dionne>::type 78304695a75SLouis Dionne__half_positive(_Tp __value) 78404695a75SLouis Dionne{ 78504695a75SLouis Dionne return __value / 2; 78604695a75SLouis Dionne} 78704695a75SLouis Dionne 788145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7893e519524SHoward Hinnant 7903e519524SHoward Hinnanttemplate <class _Compare> 7913e519524SHoward Hinnantstruct __debug_less 7923e519524SHoward Hinnant{ 793aa1cad15SEric Fiselier _Compare &__comp_; 794aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 7953e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 796331d2159SEric Fiselier 7973e519524SHoward Hinnant template <class _Tp, class _Up> 7986ab51de0SThomas Anderson _LIBCPP_CONSTEXPR_AFTER_CXX17 7993c3ccc00SThomas Anderson bool operator()(const _Tp& __x, const _Up& __y) 8003c3ccc00SThomas Anderson { 8013c3ccc00SThomas Anderson bool __r = __comp_(__x, __y); 8023c3ccc00SThomas Anderson if (__r) 8033c3ccc00SThomas Anderson __do_compare_assert(0, __y, __x); 8043c3ccc00SThomas Anderson return __r; 8053c3ccc00SThomas Anderson } 8063c3ccc00SThomas Anderson 8073c3ccc00SThomas Anderson template <class _Tp, class _Up> 808aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 8096e4ec602SEric Fiselier bool operator()(_Tp& __x, _Up& __y) 8103e519524SHoward Hinnant { 8113e519524SHoward Hinnant bool __r = __comp_(__x, __y); 8123e519524SHoward Hinnant if (__r) 813331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 8143e519524SHoward Hinnant return __r; 8153e519524SHoward Hinnant } 816331d2159SEric Fiselier 817331d2159SEric Fiselier template <class _LHS, class _RHS> 818aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 819331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 820331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 8216e4ec602SEric Fiselier _VSTD::declval<_LHS &>(), _VSTD::declval<_RHS &>())) 8226e4ec602SEric Fiselier __do_compare_assert(int, _LHS & __l, _RHS & __r) { 823331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 824331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 825331d2159SEric Fiselier } 826331d2159SEric Fiselier 827331d2159SEric Fiselier template <class _LHS, class _RHS> 828aa1cad15SEric Fiselier _LIBCPP_CONSTEXPR_AFTER_CXX17 829331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 8306e4ec602SEric Fiselier void __do_compare_assert(long, _LHS &, _RHS &) {} 8313e519524SHoward Hinnant}; 8323e519524SHoward Hinnant 833145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8343e519524SHoward Hinnant 835aa1cad15SEric Fiseliertemplate <class _Comp> 836aa1cad15SEric Fiselierstruct __comp_ref_type { 837aa1cad15SEric Fiselier // Pass the comparator by lvalue reference. Or in debug mode, using a 838aa1cad15SEric Fiselier // debugging wrapper that stores a reference. 839aa1cad15SEric Fiselier#ifndef _LIBCPP_DEBUG 840aa1cad15SEric Fiselier typedef typename add_lvalue_reference<_Comp>::type type; 841aa1cad15SEric Fiselier#else 842aa1cad15SEric Fiselier typedef __debug_less<_Comp> type; 843aa1cad15SEric Fiselier#endif 844aa1cad15SEric Fiselier}; 845aa1cad15SEric Fiselier 8463e519524SHoward Hinnant// all_of 8473e519524SHoward Hinnant 8483e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8491362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8501362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8513e519524SHoward Hinnantbool 8523e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8533e519524SHoward Hinnant{ 8543e519524SHoward Hinnant for (; __first != __last; ++__first) 8553e519524SHoward Hinnant if (!__pred(*__first)) 8563e519524SHoward Hinnant return false; 8573e519524SHoward Hinnant return true; 8583e519524SHoward Hinnant} 8593e519524SHoward Hinnant 8603e519524SHoward Hinnant// any_of 8613e519524SHoward Hinnant 8623e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8631362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8641362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8653e519524SHoward Hinnantbool 8663e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8673e519524SHoward Hinnant{ 8683e519524SHoward Hinnant for (; __first != __last; ++__first) 8693e519524SHoward Hinnant if (__pred(*__first)) 8703e519524SHoward Hinnant return true; 8713e519524SHoward Hinnant return false; 8723e519524SHoward Hinnant} 8733e519524SHoward Hinnant 8743e519524SHoward Hinnant// none_of 8753e519524SHoward Hinnant 8763e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 8781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8793e519524SHoward Hinnantbool 8803e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8813e519524SHoward Hinnant{ 8823e519524SHoward Hinnant for (; __first != __last; ++__first) 8833e519524SHoward Hinnant if (__pred(*__first)) 8843e519524SHoward Hinnant return false; 8853e519524SHoward Hinnant return true; 8863e519524SHoward Hinnant} 8873e519524SHoward Hinnant 8883e519524SHoward Hinnant// for_each 8893e519524SHoward Hinnant 8903e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8911b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8923e519524SHoward Hinnant_Function 8933e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8943e519524SHoward Hinnant{ 8953e519524SHoward Hinnant for (; __first != __last; ++__first) 8963e519524SHoward Hinnant __f(*__first); 8971c7fe126SMarshall Clow return __f; 8983e519524SHoward Hinnant} 8993e519524SHoward Hinnant 9001d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 901d5c65ffaSMarshall Clow// for_each_n 902d5c65ffaSMarshall Clow 903d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 9041b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 905d5c65ffaSMarshall Clow_InputIterator 906d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 907d5c65ffaSMarshall Clow{ 908c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 909d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 910d5c65ffaSMarshall Clow while (__n > 0) 911d5c65ffaSMarshall Clow { 912d5c65ffaSMarshall Clow __f(*__first); 913d5c65ffaSMarshall Clow ++__first; 914d5c65ffaSMarshall Clow --__n; 915d5c65ffaSMarshall Clow } 916d5c65ffaSMarshall Clow return __first; 917d5c65ffaSMarshall Clow} 9181d02996dSMarshall Clow#endif 919d5c65ffaSMarshall Clow 9203e519524SHoward Hinnant// find 9213e519524SHoward Hinnant 9223e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9231362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9241362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9253e519524SHoward Hinnant_InputIterator 926e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9273e519524SHoward Hinnant{ 9283e519524SHoward Hinnant for (; __first != __last; ++__first) 929e4383379SHoward Hinnant if (*__first == __value_) 9303e519524SHoward Hinnant break; 9313e519524SHoward Hinnant return __first; 9323e519524SHoward Hinnant} 9333e519524SHoward Hinnant 9343e519524SHoward Hinnant// find_if 9353e519524SHoward Hinnant 9363e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9371362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9381362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9393e519524SHoward Hinnant_InputIterator 9403e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9413e519524SHoward Hinnant{ 9423e519524SHoward Hinnant for (; __first != __last; ++__first) 9433e519524SHoward Hinnant if (__pred(*__first)) 9443e519524SHoward Hinnant break; 9453e519524SHoward Hinnant return __first; 9463e519524SHoward Hinnant} 9473e519524SHoward Hinnant 9483e519524SHoward Hinnant// find_if_not 9493e519524SHoward Hinnant 9503e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 9521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9533e519524SHoward Hinnant_InputIterator 9543e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9553e519524SHoward Hinnant{ 9563e519524SHoward Hinnant for (; __first != __last; ++__first) 9573e519524SHoward Hinnant if (!__pred(*__first)) 9583e519524SHoward Hinnant break; 9593e519524SHoward Hinnant return __first; 9603e519524SHoward Hinnant} 9613e519524SHoward Hinnant 9623e519524SHoward Hinnant// find_end 9633e519524SHoward Hinnant 9643e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9658694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9663e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9673e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9683e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9693e519524SHoward Hinnant{ 9703e519524SHoward Hinnant // modeled after search algorithm 9713e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9723e519524SHoward Hinnant if (__first2 == __last2) 9733e519524SHoward Hinnant return __r; 9743e519524SHoward Hinnant while (true) 9753e519524SHoward Hinnant { 9763e519524SHoward Hinnant while (true) 9773e519524SHoward Hinnant { 9783e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9793e519524SHoward Hinnant return __r; // (or __last1 if never found) 9803e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9813e519524SHoward Hinnant break; 9823e519524SHoward Hinnant ++__first1; 9833e519524SHoward Hinnant } 9843e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9853e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9863e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9873e519524SHoward Hinnant while (true) 9883e519524SHoward Hinnant { 9893e519524SHoward Hinnant if (++__m2 == __last2) 9903e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9913e519524SHoward Hinnant __r = __first1; 9923e519524SHoward Hinnant ++__first1; 9933e519524SHoward Hinnant break; 9943e519524SHoward Hinnant } 9953e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9963e519524SHoward Hinnant return __r; 9973e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9983e519524SHoward Hinnant { 9993e519524SHoward Hinnant ++__first1; 10003e519524SHoward Hinnant break; 10013e519524SHoward Hinnant } // else there is a match, check next elements 10023e519524SHoward Hinnant } 10033e519524SHoward Hinnant } 10043e519524SHoward Hinnant} 10053e519524SHoward Hinnant 10063e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10078694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 10083e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10093e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10103e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10113e519524SHoward Hinnant{ 10123e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10133e519524SHoward Hinnant if (__first2 == __last2) 10143e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10153e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10163e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10173e519524SHoward Hinnant --__l2; 10183e519524SHoward Hinnant while (true) 10193e519524SHoward Hinnant { 10203e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10213e519524SHoward Hinnant while (true) 10223e519524SHoward Hinnant { 10233e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10243e519524SHoward Hinnant return __last1; 10253e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10263e519524SHoward Hinnant break; 10273e519524SHoward Hinnant } 10283e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10293e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10303e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10313e519524SHoward Hinnant while (true) 10323e519524SHoward Hinnant { 10333e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10343e519524SHoward Hinnant return __m1; 10353e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 10363e519524SHoward Hinnant return __last1; 10373e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 10383e519524SHoward Hinnant { 10393e519524SHoward Hinnant break; 10403e519524SHoward Hinnant } // else there is a match, check next elements 10413e519524SHoward Hinnant } 10423e519524SHoward Hinnant } 10433e519524SHoward Hinnant} 10443e519524SHoward Hinnant 10453e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10469b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10473e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10483e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10493e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10503e519524SHoward Hinnant{ 10513e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10533e519524SHoward Hinnant if (__len2 == 0) 10543e519524SHoward Hinnant return __last1; 10553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10563e519524SHoward Hinnant if (__len1 < __len2) 10573e519524SHoward Hinnant return __last1; 10583e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10593e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10603e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10613e519524SHoward Hinnant --__l2; 10623e519524SHoward Hinnant while (true) 10633e519524SHoward Hinnant { 10643e519524SHoward Hinnant while (true) 10653e519524SHoward Hinnant { 10663e519524SHoward Hinnant if (__s == __l1) 10673e519524SHoward Hinnant return __last1; 10683e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10693e519524SHoward Hinnant break; 10703e519524SHoward Hinnant } 10713e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10723e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10733e519524SHoward Hinnant while (true) 10743e519524SHoward Hinnant { 10753e519524SHoward Hinnant if (__m2 == __first2) 10763e519524SHoward Hinnant return __m1; 10773e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10783e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10793e519524SHoward Hinnant { 10803e519524SHoward Hinnant break; 10813e519524SHoward Hinnant } 10823e519524SHoward Hinnant } 10833e519524SHoward Hinnant } 10843e519524SHoward Hinnant} 10853e519524SHoward Hinnant 10863e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10871362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 10881362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10893e519524SHoward Hinnant_ForwardIterator1 10903e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10913e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10923e519524SHoward Hinnant{ 1093ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10943e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10953e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10963e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10973e519524SHoward Hinnant} 10983e519524SHoward Hinnant 10993e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11001362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11011362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11023e519524SHoward Hinnant_ForwardIterator1 11033e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11043e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11053e519524SHoward Hinnant{ 11063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11073e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1108ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11093e519524SHoward Hinnant} 11103e519524SHoward Hinnant 11113e519524SHoward Hinnant// find_first_of 11123e519524SHoward Hinnant 11133e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11149b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11159b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11163e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11173e519524SHoward Hinnant{ 11183e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11193e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11203e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11213e519524SHoward Hinnant return __first1; 11223e519524SHoward Hinnant return __last1; 11233e519524SHoward Hinnant} 11243e519524SHoward Hinnant 11259b0af34dSMarshall Clow 11269b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11271362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11281362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11299b0af34dSMarshall Clow_ForwardIterator1 11309b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11319b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11329b0af34dSMarshall Clow{ 11339b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11349b0af34dSMarshall Clow} 11359b0af34dSMarshall Clow 11363e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11371362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11381362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11393e519524SHoward Hinnant_ForwardIterator1 11403e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11413e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11423e519524SHoward Hinnant{ 11433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11459b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11463e519524SHoward Hinnant} 11473e519524SHoward Hinnant 11483e519524SHoward Hinnant// adjacent_find 11493e519524SHoward Hinnant 11503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11533e519524SHoward Hinnant_ForwardIterator 11543e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11553e519524SHoward Hinnant{ 11563e519524SHoward Hinnant if (__first != __last) 11573e519524SHoward Hinnant { 11583e519524SHoward Hinnant _ForwardIterator __i = __first; 11593e519524SHoward Hinnant while (++__i != __last) 11603e519524SHoward Hinnant { 11613e519524SHoward Hinnant if (__pred(*__first, *__i)) 11623e519524SHoward Hinnant return __first; 11633e519524SHoward Hinnant __first = __i; 11643e519524SHoward Hinnant } 11653e519524SHoward Hinnant } 11663e519524SHoward Hinnant return __last; 11673e519524SHoward Hinnant} 11683e519524SHoward Hinnant 11693e519524SHoward Hinnanttemplate <class _ForwardIterator> 11701362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11711362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11723e519524SHoward Hinnant_ForwardIterator 11733e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11743e519524SHoward Hinnant{ 11753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1176ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11773e519524SHoward Hinnant} 11783e519524SHoward Hinnant 11793e519524SHoward Hinnant// count 11803e519524SHoward Hinnant 11813e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11821362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11831362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11843e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1185e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11863e519524SHoward Hinnant{ 11873e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11883e519524SHoward Hinnant for (; __first != __last; ++__first) 1189e4383379SHoward Hinnant if (*__first == __value_) 11903e519524SHoward Hinnant ++__r; 11913e519524SHoward Hinnant return __r; 11923e519524SHoward Hinnant} 11933e519524SHoward Hinnant 11943e519524SHoward Hinnant// count_if 11953e519524SHoward Hinnant 11963e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11971362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 11981362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11993e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12003e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12013e519524SHoward Hinnant{ 12023e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12033e519524SHoward Hinnant for (; __first != __last; ++__first) 12043e519524SHoward Hinnant if (__pred(*__first)) 12053e519524SHoward Hinnant ++__r; 12063e519524SHoward Hinnant return __r; 12073e519524SHoward Hinnant} 12083e519524SHoward Hinnant 12093e519524SHoward Hinnant// mismatch 12103e519524SHoward Hinnant 12113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12121362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12131362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12143e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12153e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12163e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12173e519524SHoward Hinnant{ 1218bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12193e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12203e519524SHoward Hinnant break; 12213e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12223e519524SHoward Hinnant} 12233e519524SHoward Hinnant 12243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12251362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12261362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12273e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12283e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12293e519524SHoward Hinnant{ 12303e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12313e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1232ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12333e519524SHoward Hinnant} 12343e519524SHoward Hinnant 12350b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12360b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12371362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12381362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12390b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12400b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12410b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12420b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12430b0bbd2fSMarshall Clow{ 1244bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12450b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12460b0bbd2fSMarshall Clow break; 12470b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12480b0bbd2fSMarshall Clow} 12490b0bbd2fSMarshall Clow 12500b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12530b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12540b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12550b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12560b0bbd2fSMarshall Clow{ 12570b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12580b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12590b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12600b0bbd2fSMarshall Clow} 12610b0bbd2fSMarshall Clow#endif 12620b0bbd2fSMarshall Clow 12633e519524SHoward Hinnant// equal 12643e519524SHoward Hinnant 12653e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12661362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12671362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12683e519524SHoward Hinnantbool 12693e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12703e519524SHoward Hinnant{ 1271910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12723e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12733e519524SHoward Hinnant return false; 12743e519524SHoward Hinnant return true; 12753e519524SHoward Hinnant} 12763e519524SHoward Hinnant 12773e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12781362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 12791362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12803e519524SHoward Hinnantbool 12813e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12823e519524SHoward Hinnant{ 12833e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12843e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1285ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12863e519524SHoward Hinnant} 12873e519524SHoward Hinnant 12880b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12890b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12906538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12910b0bbd2fSMarshall Clowbool 12920b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12930b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12940b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12950b0bbd2fSMarshall Clow{ 1296910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12970b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12980b0bbd2fSMarshall Clow return false; 12990b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13000b0bbd2fSMarshall Clow} 13010b0bbd2fSMarshall Clow 13020b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13036538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13040b0bbd2fSMarshall Clowbool 13050b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13060b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13070b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13080b0bbd2fSMarshall Clow{ 13090b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13100b0bbd2fSMarshall Clow return false; 13110b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13120b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13130b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13140b0bbd2fSMarshall Clow} 13150b0bbd2fSMarshall Clow 13160b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13171362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13181362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13190b0bbd2fSMarshall Clowbool 13200b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13210b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13220b0bbd2fSMarshall Clow{ 13230b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13240b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13250b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13260b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13270b0bbd2fSMarshall Clow} 13280b0bbd2fSMarshall Clow 13290b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13301362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13311362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13320b0bbd2fSMarshall Clowbool 13330b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13340b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13350b0bbd2fSMarshall Clow{ 13360b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13370b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13380b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13390b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13400b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13410b0bbd2fSMarshall Clow} 13420b0bbd2fSMarshall Clow#endif 13430b0bbd2fSMarshall Clow 13443e519524SHoward Hinnant// is_permutation 13453e519524SHoward Hinnant 13463e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13471362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13483e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13493e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13503e519524SHoward Hinnant{ 135149c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1352910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13533e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 135449c7643cSMarshall Clow break; 135549c7643cSMarshall Clow if (__first1 == __last1) 13563e519524SHoward Hinnant return true; 135749c7643cSMarshall Clow 13583e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13593e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1360ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13613e519524SHoward Hinnant if (__l1 == _D1(1)) 13623e519524SHoward Hinnant return false; 1363ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13643e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13653e519524SHoward Hinnant // equal elements in [f2, l2) 13663e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13673e519524SHoward Hinnant { 13683e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1369939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1370939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1371939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1372939b1623SPeter Collingbourne break; 1373939b1623SPeter Collingbourne if (__match == __i) { 13743e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13753e519524SHoward Hinnant _D1 __c2 = 0; 13763e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13773e519524SHoward Hinnant if (__pred(*__i, *__j)) 13783e519524SHoward Hinnant ++__c2; 13793e519524SHoward Hinnant if (__c2 == 0) 13803e519524SHoward Hinnant return false; 13813e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13823e519524SHoward Hinnant _D1 __c1 = 1; 1383ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13843e519524SHoward Hinnant if (__pred(*__i, *__j)) 13853e519524SHoward Hinnant ++__c1; 13863e519524SHoward Hinnant if (__c1 != __c2) 13873e519524SHoward Hinnant return false; 13883e519524SHoward Hinnant } 13893e519524SHoward Hinnant } 13903e519524SHoward Hinnant return true; 13913e519524SHoward Hinnant} 13923e519524SHoward Hinnant 13933e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13941362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 13951362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13963e519524SHoward Hinnantbool 13973e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13983e519524SHoward Hinnant _ForwardIterator2 __first2) 13993e519524SHoward Hinnant{ 14003e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14013e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1402ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14033e519524SHoward Hinnant} 14043e519524SHoward Hinnant 14050b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14060b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 140749c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14080b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14090b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14100b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14110b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14120b0bbd2fSMarshall Clow{ 141349c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1414847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14150b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 141649c7643cSMarshall Clow break; 141749c7643cSMarshall Clow if (__first1 == __last1) 141849c7643cSMarshall Clow return __first2 == __last2; 141949c7643cSMarshall Clow else if (__first2 == __last2) 142049c7643cSMarshall Clow return false; 142149c7643cSMarshall Clow 14220b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14230b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14240b0bbd2fSMarshall Clow 14250b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1426fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14270b0bbd2fSMarshall Clow if (__l1 != __l2) 14280b0bbd2fSMarshall Clow return false; 14290b0bbd2fSMarshall Clow 14300b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14310b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14320b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14330b0bbd2fSMarshall Clow { 14340b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1435939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1436939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1437939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1438939b1623SPeter Collingbourne break; 1439939b1623SPeter Collingbourne if (__match == __i) { 14400b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14410b0bbd2fSMarshall Clow _D1 __c2 = 0; 14420b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14430b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14440b0bbd2fSMarshall Clow ++__c2; 14450b0bbd2fSMarshall Clow if (__c2 == 0) 14460b0bbd2fSMarshall Clow return false; 14470b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14480b0bbd2fSMarshall Clow _D1 __c1 = 1; 14490b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14500b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14510b0bbd2fSMarshall Clow ++__c1; 14520b0bbd2fSMarshall Clow if (__c1 != __c2) 14530b0bbd2fSMarshall Clow return false; 14540b0bbd2fSMarshall Clow } 14550b0bbd2fSMarshall Clow } 14560b0bbd2fSMarshall Clow return true; 14570b0bbd2fSMarshall Clow} 14580b0bbd2fSMarshall Clow 14590b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 146049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14610b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14620b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14630b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14640b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14650b0bbd2fSMarshall Clow{ 14660b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14670b0bbd2fSMarshall Clow return false; 14680b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14690b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14700b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14710b0bbd2fSMarshall Clow} 14720b0bbd2fSMarshall Clow 14730b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14741362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14751362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14760b0bbd2fSMarshall Clowbool 14770b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14780b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14790b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14800b0bbd2fSMarshall Clow{ 14810b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14820b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14830b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14840b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14850b0bbd2fSMarshall Clow} 14860b0bbd2fSMarshall Clow 14870b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14881362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 14891362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14900b0bbd2fSMarshall Clowbool 14910b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14920b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14930b0bbd2fSMarshall Clow{ 14940b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14950b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14960b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14970b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14980b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14990b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15000b0bbd2fSMarshall Clow} 15010b0bbd2fSMarshall Clow#endif 15020b0bbd2fSMarshall Clow 15033e519524SHoward Hinnant// search 1504d835e592SMarshall Clow// __search is in <functional> 15053e519524SHoward Hinnant 15063e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 15081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15093e519524SHoward Hinnant_ForwardIterator1 15103e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15113e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15123e519524SHoward Hinnant{ 1513ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15143e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 151528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 151628cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 151728cc4ddeSMarshall Clow .first; 15183e519524SHoward Hinnant} 15193e519524SHoward Hinnant 15203e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15211362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 15221362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15233e519524SHoward Hinnant_ForwardIterator1 15243e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15253e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15263e519524SHoward Hinnant{ 152728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 152828cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1529ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15303e519524SHoward Hinnant} 15313e519524SHoward Hinnant 1532d835e592SMarshall Clow 1533d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1534d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 15351362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1536d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1537d835e592SMarshall Clow{ return __s(__f, __l).first; } 1538d835e592SMarshall Clow#endif 1539d835e592SMarshall Clow 15403e519524SHoward Hinnant// search_n 15413e519524SHoward Hinnant 15423e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 154312f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 15443e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1545e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15463e519524SHoward Hinnant{ 15473e519524SHoward Hinnant if (__count <= 0) 15483e519524SHoward Hinnant return __first; 15493e519524SHoward Hinnant while (true) 15503e519524SHoward Hinnant { 1551e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15523e519524SHoward Hinnant while (true) 15533e519524SHoward Hinnant { 1554e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15553e519524SHoward Hinnant return __last; 1556e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15573e519524SHoward Hinnant break; 15583e519524SHoward Hinnant ++__first; 15593e519524SHoward Hinnant } 1560e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15613e519524SHoward Hinnant _ForwardIterator __m = __first; 15623e519524SHoward Hinnant _Size __c(0); 15633e519524SHoward Hinnant while (true) 15643e519524SHoward Hinnant { 15653e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15663e519524SHoward Hinnant return __first; 15673e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15683e519524SHoward Hinnant return __last; 1569e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15703e519524SHoward Hinnant { 15713e519524SHoward Hinnant __first = __m; 15723e519524SHoward Hinnant ++__first; 15733e519524SHoward Hinnant break; 15743e519524SHoward Hinnant } // else there is a match, check next elements 15753e519524SHoward Hinnant } 15763e519524SHoward Hinnant } 15773e519524SHoward Hinnant} 15783e519524SHoward Hinnant 15793e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 158012f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15813e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1582e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant if (__count <= 0) 15853e519524SHoward Hinnant return __first; 15863e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15873e519524SHoward Hinnant if (__len < __count) 15883e519524SHoward Hinnant return __last; 15893e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15903e519524SHoward Hinnant while (true) 15913e519524SHoward Hinnant { 1592e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15933e519524SHoward Hinnant while (true) 15943e519524SHoward Hinnant { 1595b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15963e519524SHoward Hinnant return __last; 1597e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15983e519524SHoward Hinnant break; 15993e519524SHoward Hinnant ++__first; 16003e519524SHoward Hinnant } 1601e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16023e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16033e519524SHoward Hinnant _Size __c(0); 16043e519524SHoward Hinnant while (true) 16053e519524SHoward Hinnant { 16063e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16073e519524SHoward Hinnant return __first; 16083e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1609e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16103e519524SHoward Hinnant { 16113e519524SHoward Hinnant __first = __m; 16123e519524SHoward Hinnant ++__first; 16133e519524SHoward Hinnant break; 16143e519524SHoward Hinnant } // else there is a match, check next elements 16153e519524SHoward Hinnant } 16163e519524SHoward Hinnant } 16173e519524SHoward Hinnant} 16183e519524SHoward Hinnant 16193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16201362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16211362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16223e519524SHoward Hinnant_ForwardIterator 16233e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1624e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16253e519524SHoward Hinnant{ 1626ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1627c0428b3cSArthur O'Dwyer (__first, __last, _VSTD::__convert_to_integral(__count), __value_, __pred, 162851544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16293e519524SHoward Hinnant} 16303e519524SHoward Hinnant 16313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16321362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 16331362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16343e519524SHoward Hinnant_ForwardIterator 1635e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16363e519524SHoward Hinnant{ 16373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1638c0428b3cSArthur O'Dwyer return _VSTD::search_n(__first, __last, _VSTD::__convert_to_integral(__count), 163951544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16403e519524SHoward Hinnant} 16413e519524SHoward Hinnant 16423e519524SHoward Hinnant// copy 16433e519524SHoward Hinnanttemplate <class _Iter> 16443ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 16453e519524SHoward Hinnant_Iter 16463e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16473e519524SHoward Hinnant{ 16483e519524SHoward Hinnant return __i; 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnanttemplate <class _Tp> 16523ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 16533e519524SHoward Hinnanttypename enable_if 16543e519524SHoward Hinnant< 1655ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16563e519524SHoward Hinnant _Tp* 16573e519524SHoward Hinnant>::type 16583e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16593e519524SHoward Hinnant{ 16603e519524SHoward Hinnant return __i.base(); 16613e519524SHoward Hinnant} 16623e519524SHoward Hinnant 1663fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1664fc88dbd2SHoward Hinnant 16653e519524SHoward Hinnanttemplate <class _Tp> 16663ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 16673e519524SHoward Hinnanttypename enable_if 16683e519524SHoward Hinnant< 1669ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16703e519524SHoward Hinnant _Tp* 16713e519524SHoward Hinnant>::type 16723e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16733e519524SHoward Hinnant{ 16743e519524SHoward Hinnant return __i.base(); 16753e519524SHoward Hinnant} 16763e519524SHoward Hinnant 1677c8879ab2SMarshall Clowtemplate <class _Tp> 16783ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 1679c8879ab2SMarshall Clowtypename enable_if 1680c8879ab2SMarshall Clow< 1681c8879ab2SMarshall Clow is_trivially_copy_assignable<_Tp>::value, 1682c8879ab2SMarshall Clow const _Tp* 1683c8879ab2SMarshall Clow>::type 1684c8879ab2SMarshall Clow__unwrap_iter(__wrap_iter<const _Tp*> __i) 1685c8879ab2SMarshall Clow{ 1686c8879ab2SMarshall Clow return __i.base(); 1687c8879ab2SMarshall Clow} 1688c8879ab2SMarshall Clow 168914bd0bf0SEric Fiselier#else 169014bd0bf0SEric Fiselier 169114bd0bf0SEric Fiseliertemplate <class _Tp> 16923ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 169314bd0bf0SEric Fiseliertypename enable_if 169414bd0bf0SEric Fiselier< 169514bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 169614bd0bf0SEric Fiselier __wrap_iter<_Tp*> 169714bd0bf0SEric Fiselier>::type 169814bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 169914bd0bf0SEric Fiselier{ 170014bd0bf0SEric Fiselier return __i; 170114bd0bf0SEric Fiselier} 170214bd0bf0SEric Fiselier 1703fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1704fc88dbd2SHoward Hinnant 17053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 170613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17073e519524SHoward Hinnant_OutputIterator 170813c90a57SLouis Dionne__copy_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17093e519524SHoward Hinnant{ 1710910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17113e519524SHoward Hinnant *__result = *__first; 17123e519524SHoward Hinnant return __result; 17133e519524SHoward Hinnant} 17143e519524SHoward Hinnant 171513c90a57SLouis Dionnetemplate <class _InputIterator, class _OutputIterator> 171613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY 171713c90a57SLouis Dionne_OutputIterator 171813c90a57SLouis Dionne__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 171913c90a57SLouis Dionne{ 17201968804aSArthur O'Dwyer return _VSTD::__copy_constexpr(__first, __last, __result); 172113c90a57SLouis Dionne} 172213c90a57SLouis Dionne 17233e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17253e519524SHoward Hinnanttypename enable_if 17263e519524SHoward Hinnant< 17273e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1728ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17293e519524SHoward Hinnant _Up* 17303e519524SHoward Hinnant>::type 17313e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17323e519524SHoward Hinnant{ 17333e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17345b312052SMarshall Clow if (__n > 0) 1735ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17363e519524SHoward Hinnant return __result + __n; 17373e519524SHoward Hinnant} 17383e519524SHoward Hinnant 17393e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 1740ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17413e519524SHoward Hinnant_OutputIterator 17423e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17433e519524SHoward Hinnant{ 174413c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 174513c90a57SLouis Dionne return _VSTD::__copy_constexpr( 17461968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__first), _VSTD::__unwrap_iter(__last), _VSTD::__unwrap_iter(__result)); 174713c90a57SLouis Dionne } else { 174813c90a57SLouis Dionne return _VSTD::__copy( 17491968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__first), _VSTD::__unwrap_iter(__last), _VSTD::__unwrap_iter(__result)); 175013c90a57SLouis Dionne } 17513e519524SHoward Hinnant} 17523e519524SHoward Hinnant 17533e519524SHoward Hinnant// copy_backward 17543e519524SHoward Hinnant 1755d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 175613c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 175713c90a57SLouis Dionne_OutputIterator 175813c90a57SLouis Dionne__copy_backward_constexpr(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 175913c90a57SLouis Dionne{ 176013c90a57SLouis Dionne while (__first != __last) 176113c90a57SLouis Dionne *--__result = *--__last; 176213c90a57SLouis Dionne return __result; 176313c90a57SLouis Dionne} 176413c90a57SLouis Dionne 176513c90a57SLouis Dionnetemplate <class _BidirectionalIterator, class _OutputIterator> 17663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17673e519524SHoward Hinnant_OutputIterator 1768d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17693e519524SHoward Hinnant{ 17701968804aSArthur O'Dwyer return _VSTD::__copy_backward_constexpr(__first, __last, __result); 17713e519524SHoward Hinnant} 17723e519524SHoward Hinnant 17733e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17753e519524SHoward Hinnanttypename enable_if 17763e519524SHoward Hinnant< 17773e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1778ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17793e519524SHoward Hinnant _Up* 17803e519524SHoward Hinnant>::type 17813e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17823e519524SHoward Hinnant{ 17833e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17845b312052SMarshall Clow if (__n > 0) 17855b312052SMarshall Clow { 17863e519524SHoward Hinnant __result -= __n; 1787ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17885b312052SMarshall Clow } 17893e519524SHoward Hinnant return __result; 17903e519524SHoward Hinnant} 17913e519524SHoward Hinnant 17923e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 1793ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17943e519524SHoward Hinnant_BidirectionalIterator2 17953e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17963e519524SHoward Hinnant _BidirectionalIterator2 __result) 17973e519524SHoward Hinnant{ 179813c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 17991968804aSArthur O'Dwyer return _VSTD::__copy_backward_constexpr(_VSTD::__unwrap_iter(__first), 18001968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__last), 18011968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__result)); 180213c90a57SLouis Dionne } else { 18031968804aSArthur O'Dwyer return _VSTD::__copy_backward(_VSTD::__unwrap_iter(__first), 18041968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__last), 18051968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__result)); 18063e519524SHoward Hinnant } 180713c90a57SLouis Dionne} 18083e519524SHoward Hinnant 18093e519524SHoward Hinnant// copy_if 18103e519524SHoward Hinnant 18113e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 181213c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18133e519524SHoward Hinnant_OutputIterator 18143e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18153e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18163e519524SHoward Hinnant{ 18173e519524SHoward Hinnant for (; __first != __last; ++__first) 18183e519524SHoward Hinnant { 18193e519524SHoward Hinnant if (__pred(*__first)) 18203e519524SHoward Hinnant { 18213e519524SHoward Hinnant *__result = *__first; 18223e519524SHoward Hinnant ++__result; 18233e519524SHoward Hinnant } 18243e519524SHoward Hinnant } 18253e519524SHoward Hinnant return __result; 18263e519524SHoward Hinnant} 18273e519524SHoward Hinnant 18283e519524SHoward Hinnant// copy_n 18293e519524SHoward Hinnant 18303e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 1831ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18323e519524SHoward Hinnanttypename enable_if 18333e519524SHoward Hinnant< 1834f82dba01SEric Fiselier __is_cpp17_input_iterator<_InputIterator>::value && 1835f82dba01SEric Fiselier !__is_cpp17_random_access_iterator<_InputIterator>::value, 18363e519524SHoward Hinnant _OutputIterator 18373e519524SHoward Hinnant>::type 183851544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18393e519524SHoward Hinnant{ 1840c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 184151544023SEric Fiselier _IntegralSize __n = __orig_n; 184299847d2bSHoward Hinnant if (__n > 0) 184399847d2bSHoward Hinnant { 18443e519524SHoward Hinnant *__result = *__first; 184599847d2bSHoward Hinnant ++__result; 184699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184799847d2bSHoward Hinnant { 184899847d2bSHoward Hinnant ++__first; 184999847d2bSHoward Hinnant *__result = *__first; 185099847d2bSHoward Hinnant ++__result; 185199847d2bSHoward Hinnant } 185299847d2bSHoward Hinnant } 18533e519524SHoward Hinnant return __result; 18543e519524SHoward Hinnant} 18553e519524SHoward Hinnant 18563e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 1857ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18583e519524SHoward Hinnanttypename enable_if 18593e519524SHoward Hinnant< 1860f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_InputIterator>::value, 18613e519524SHoward Hinnant _OutputIterator 18623e519524SHoward Hinnant>::type 186351544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18643e519524SHoward Hinnant{ 1865c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 186651544023SEric Fiselier _IntegralSize __n = __orig_n; 1867ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18683e519524SHoward Hinnant} 18693e519524SHoward Hinnant 18703e519524SHoward Hinnant// move 18713e519524SHoward Hinnant 18723ed89b51Szoecarver// __move_constexpr exists so that __move doesn't call itself when delegating to the constexpr 18733ed89b51Szoecarver// version of __move. 18743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18753ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18763e519524SHoward Hinnant_OutputIterator 18773ed89b51Szoecarver__move_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18783e519524SHoward Hinnant{ 1879910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1880ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18813e519524SHoward Hinnant return __result; 18823e519524SHoward Hinnant} 18833e519524SHoward Hinnant 18843ed89b51Szoecarvertemplate <class _InputIterator, class _OutputIterator> 18853ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18863ed89b51Szoecarver_OutputIterator 18873ed89b51Szoecarver__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18883ed89b51Szoecarver{ 18891968804aSArthur O'Dwyer return _VSTD::__move_constexpr(__first, __last, __result); 18903ed89b51Szoecarver} 18913ed89b51Szoecarver 18923e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18933ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18943e519524SHoward Hinnanttypename enable_if 18953e519524SHoward Hinnant< 18963e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1897ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18983e519524SHoward Hinnant _Up* 18993e519524SHoward Hinnant>::type 19003e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19013e519524SHoward Hinnant{ 19023ed89b51Szoecarver if (__libcpp_is_constant_evaluated()) 19031968804aSArthur O'Dwyer return _VSTD::__move_constexpr(__first, __last, __result); 19043e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19055b312052SMarshall Clow if (__n > 0) 1906ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19073e519524SHoward Hinnant return __result + __n; 19083e519524SHoward Hinnant} 19093e519524SHoward Hinnant 19103e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19113ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19123e519524SHoward Hinnant_OutputIterator 19133e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19143e519524SHoward Hinnant{ 19151968804aSArthur O'Dwyer return _VSTD::__move(_VSTD::__unwrap_iter(__first), _VSTD::__unwrap_iter(__last), _VSTD::__unwrap_iter(__result)); 19163e519524SHoward Hinnant} 19173e519524SHoward Hinnant 19183e519524SHoward Hinnant// move_backward 19193e519524SHoward Hinnant 19203ed89b51Szoecarver// __move_backward_constexpr exists so that __move_backward doesn't call itself when delegating to 19213ed89b51Szoecarver// the constexpr version of __move_backward. 19223e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19233ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19243e519524SHoward Hinnant_OutputIterator 19253ed89b51Szoecarver__move_backward_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19263e519524SHoward Hinnant{ 19273e519524SHoward Hinnant while (__first != __last) 1928ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19293e519524SHoward Hinnant return __result; 19303e519524SHoward Hinnant} 19313e519524SHoward Hinnant 19323ed89b51Szoecarvertemplate <class _InputIterator, class _OutputIterator> 19333ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19343ed89b51Szoecarver_OutputIterator 19353ed89b51Szoecarver__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19363ed89b51Szoecarver{ 19371968804aSArthur O'Dwyer return _VSTD::__move_backward_constexpr(__first, __last, __result); 19383ed89b51Szoecarver} 19393ed89b51Szoecarver 19403e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19413ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19423e519524SHoward Hinnanttypename enable_if 19433e519524SHoward Hinnant< 19443e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1945ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19463e519524SHoward Hinnant _Up* 19473e519524SHoward Hinnant>::type 19483e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19493e519524SHoward Hinnant{ 19503ed89b51Szoecarver if (__libcpp_is_constant_evaluated()) 19511968804aSArthur O'Dwyer return _VSTD::__move_backward_constexpr(__first, __last, __result); 19523e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19535b312052SMarshall Clow if (__n > 0) 19545b312052SMarshall Clow { 19553e519524SHoward Hinnant __result -= __n; 1956ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19575b312052SMarshall Clow } 19583e519524SHoward Hinnant return __result; 19593e519524SHoward Hinnant} 19603e519524SHoward Hinnant 19613e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19623ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19633e519524SHoward Hinnant_BidirectionalIterator2 19643e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19653e519524SHoward Hinnant _BidirectionalIterator2 __result) 19663e519524SHoward Hinnant{ 19671968804aSArthur O'Dwyer return _VSTD::__move_backward(_VSTD::__unwrap_iter(__first), _VSTD::__unwrap_iter(__last), _VSTD::__unwrap_iter(__result)); 19683e519524SHoward Hinnant} 19693e519524SHoward Hinnant 19703e519524SHoward Hinnant// iter_swap 19713e519524SHoward Hinnant 1972a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19733e519524SHoward Hinnant 19743e519524SHoward Hinnant// transform 19753e519524SHoward Hinnant 19763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 197799894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19783e519524SHoward Hinnant_OutputIterator 19793e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19803e519524SHoward Hinnant{ 1981910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19823e519524SHoward Hinnant *__result = __op(*__first); 19833e519524SHoward Hinnant return __result; 19843e519524SHoward Hinnant} 19853e519524SHoward Hinnant 19863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 198799894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19883e519524SHoward Hinnant_OutputIterator 19893e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19903e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19913e519524SHoward Hinnant{ 1992910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19933e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19943e519524SHoward Hinnant return __result; 19953e519524SHoward Hinnant} 19963e519524SHoward Hinnant 19973e519524SHoward Hinnant// replace 19983e519524SHoward Hinnant 19993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 200012c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20013e519524SHoward Hinnantvoid 20023e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20033e519524SHoward Hinnant{ 20043e519524SHoward Hinnant for (; __first != __last; ++__first) 20053e519524SHoward Hinnant if (*__first == __old_value) 20063e519524SHoward Hinnant *__first = __new_value; 20073e519524SHoward Hinnant} 20083e519524SHoward Hinnant 20093e519524SHoward Hinnant// replace_if 20103e519524SHoward Hinnant 20113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 201212c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20133e519524SHoward Hinnantvoid 20143e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20153e519524SHoward Hinnant{ 20163e519524SHoward Hinnant for (; __first != __last; ++__first) 20173e519524SHoward Hinnant if (__pred(*__first)) 20183e519524SHoward Hinnant *__first = __new_value; 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnant// replace_copy 20223e519524SHoward Hinnant 20233e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 202412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20253e519524SHoward Hinnant_OutputIterator 20263e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20273e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20283e519524SHoward Hinnant{ 2029910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20303e519524SHoward Hinnant if (*__first == __old_value) 20313e519524SHoward Hinnant *__result = __new_value; 20323e519524SHoward Hinnant else 20333e519524SHoward Hinnant *__result = *__first; 20343e519524SHoward Hinnant return __result; 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20373e519524SHoward Hinnant// replace_copy_if 20383e519524SHoward Hinnant 20393e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 204012c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20413e519524SHoward Hinnant_OutputIterator 20423e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20433e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20443e519524SHoward Hinnant{ 2045910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20463e519524SHoward Hinnant if (__pred(*__first)) 20473e519524SHoward Hinnant *__result = __new_value; 20483e519524SHoward Hinnant else 20493e519524SHoward Hinnant *__result = *__first; 20503e519524SHoward Hinnant return __result; 20513e519524SHoward Hinnant} 20523e519524SHoward Hinnant 20533e519524SHoward Hinnant// fill_n 20543e519524SHoward Hinnant 20553e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20564bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20573e519524SHoward Hinnant_OutputIterator 20580f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20593e519524SHoward Hinnant{ 2060910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2061e4383379SHoward Hinnant *__first = __value_; 20623e519524SHoward Hinnant return __first; 20633e519524SHoward Hinnant} 20643e519524SHoward Hinnant 20653e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20664bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20673e519524SHoward Hinnant_OutputIterator 2068e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20693e519524SHoward Hinnant{ 2070c0428b3cSArthur O'Dwyer return _VSTD::__fill_n(__first, _VSTD::__convert_to_integral(__n), __value_); 20713e519524SHoward Hinnant} 20723e519524SHoward Hinnant 20733e519524SHoward Hinnant// fill 20743e519524SHoward Hinnant 20753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20764bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20773e519524SHoward Hinnantvoid 2078e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20793e519524SHoward Hinnant{ 20803e519524SHoward Hinnant for (; __first != __last; ++__first) 2081e4383379SHoward Hinnant *__first = __value_; 20823e519524SHoward Hinnant} 20833e519524SHoward Hinnant 20843e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20854bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20863e519524SHoward Hinnantvoid 2087e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20883e519524SHoward Hinnant{ 2089e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20903e519524SHoward Hinnant} 20913e519524SHoward Hinnant 20923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20934bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20943e519524SHoward Hinnantvoid 2095e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20963e519524SHoward Hinnant{ 2097e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20983e519524SHoward Hinnant} 20993e519524SHoward Hinnant 21003e519524SHoward Hinnant// generate 21013e519524SHoward Hinnant 21023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21034bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21043e519524SHoward Hinnantvoid 21053e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21063e519524SHoward Hinnant{ 21073e519524SHoward Hinnant for (; __first != __last; ++__first) 21083e519524SHoward Hinnant *__first = __gen(); 21093e519524SHoward Hinnant} 21103e519524SHoward Hinnant 21113e519524SHoward Hinnant// generate_n 21123e519524SHoward Hinnant 21133e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21144bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21153e519524SHoward Hinnant_OutputIterator 211651544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21173e519524SHoward Hinnant{ 2118c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 211951544023SEric Fiselier _IntegralSize __n = __orig_n; 2120910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21213e519524SHoward Hinnant *__first = __gen(); 21223e519524SHoward Hinnant return __first; 21233e519524SHoward Hinnant} 21243e519524SHoward Hinnant 21253e519524SHoward Hinnant// remove 21263e519524SHoward Hinnant 21273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21281362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2129e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21303e519524SHoward Hinnant{ 2131e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21323e519524SHoward Hinnant if (__first != __last) 21333e519524SHoward Hinnant { 21343e519524SHoward Hinnant _ForwardIterator __i = __first; 21353e519524SHoward Hinnant while (++__i != __last) 21363e519524SHoward Hinnant { 2137e4383379SHoward Hinnant if (!(*__i == __value_)) 21383e519524SHoward Hinnant { 2139ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21403e519524SHoward Hinnant ++__first; 21413e519524SHoward Hinnant } 21423e519524SHoward Hinnant } 21433e519524SHoward Hinnant } 21443e519524SHoward Hinnant return __first; 21453e519524SHoward Hinnant} 21463e519524SHoward Hinnant 21473e519524SHoward Hinnant// remove_if 21483e519524SHoward Hinnant 21493e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21501362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21513e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21523e519524SHoward Hinnant{ 2153ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21543e519524SHoward Hinnant (__first, __last, __pred); 21553e519524SHoward Hinnant if (__first != __last) 21563e519524SHoward Hinnant { 21573e519524SHoward Hinnant _ForwardIterator __i = __first; 21583e519524SHoward Hinnant while (++__i != __last) 21593e519524SHoward Hinnant { 21603e519524SHoward Hinnant if (!__pred(*__i)) 21613e519524SHoward Hinnant { 2162ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21633e519524SHoward Hinnant ++__first; 21643e519524SHoward Hinnant } 21653e519524SHoward Hinnant } 21663e519524SHoward Hinnant } 21673e519524SHoward Hinnant return __first; 21683e519524SHoward Hinnant} 21693e519524SHoward Hinnant 21703e519524SHoward Hinnant// remove_copy 21713e519524SHoward Hinnant 21723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2173e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21743e519524SHoward Hinnant_OutputIterator 2175e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21763e519524SHoward Hinnant{ 21773e519524SHoward Hinnant for (; __first != __last; ++__first) 21783e519524SHoward Hinnant { 2179e4383379SHoward Hinnant if (!(*__first == __value_)) 21803e519524SHoward Hinnant { 21813e519524SHoward Hinnant *__result = *__first; 21823e519524SHoward Hinnant ++__result; 21833e519524SHoward Hinnant } 21843e519524SHoward Hinnant } 21853e519524SHoward Hinnant return __result; 21863e519524SHoward Hinnant} 21873e519524SHoward Hinnant 21883e519524SHoward Hinnant// remove_copy_if 21893e519524SHoward Hinnant 21903e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2191e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21923e519524SHoward Hinnant_OutputIterator 21933e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21943e519524SHoward Hinnant{ 21953e519524SHoward Hinnant for (; __first != __last; ++__first) 21963e519524SHoward Hinnant { 21973e519524SHoward Hinnant if (!__pred(*__first)) 21983e519524SHoward Hinnant { 21993e519524SHoward Hinnant *__result = *__first; 22003e519524SHoward Hinnant ++__result; 22013e519524SHoward Hinnant } 22023e519524SHoward Hinnant } 22033e519524SHoward Hinnant return __result; 22043e519524SHoward Hinnant} 22053e519524SHoward Hinnant 22063e519524SHoward Hinnant// unique 22073e519524SHoward Hinnant 22083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22091362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22103e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22113e519524SHoward Hinnant{ 2212ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22133e519524SHoward Hinnant (__first, __last, __pred); 22143e519524SHoward Hinnant if (__first != __last) 22153e519524SHoward Hinnant { 22163e519524SHoward Hinnant // ... a a ? ... 22173e519524SHoward Hinnant // f i 22183e519524SHoward Hinnant _ForwardIterator __i = __first; 22193e519524SHoward Hinnant for (++__i; ++__i != __last;) 22203e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2221ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22223e519524SHoward Hinnant ++__first; 22233e519524SHoward Hinnant } 22243e519524SHoward Hinnant return __first; 22253e519524SHoward Hinnant} 22263e519524SHoward Hinnant 22273e519524SHoward Hinnanttemplate <class _ForwardIterator> 22281362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 22291362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22303e519524SHoward Hinnant_ForwardIterator 22313e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22323e519524SHoward Hinnant{ 22333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2234ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22353e519524SHoward Hinnant} 22363e519524SHoward Hinnant 22373e519524SHoward Hinnant// unique_copy 22383e519524SHoward Hinnant 22393e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22404bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22413e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22423e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22433e519524SHoward Hinnant{ 22443e519524SHoward Hinnant if (__first != __last) 22453e519524SHoward Hinnant { 22463e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22473e519524SHoward Hinnant *__result = __t; 22483e519524SHoward Hinnant ++__result; 22493e519524SHoward Hinnant while (++__first != __last) 22503e519524SHoward Hinnant { 22513e519524SHoward Hinnant if (!__pred(__t, *__first)) 22523e519524SHoward Hinnant { 22533e519524SHoward Hinnant __t = *__first; 22543e519524SHoward Hinnant *__result = __t; 22553e519524SHoward Hinnant ++__result; 22563e519524SHoward Hinnant } 22573e519524SHoward Hinnant } 22583e519524SHoward Hinnant } 22593e519524SHoward Hinnant return __result; 22603e519524SHoward Hinnant} 22613e519524SHoward Hinnant 22623e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22634bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22643e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22653e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22663e519524SHoward Hinnant{ 22673e519524SHoward Hinnant if (__first != __last) 22683e519524SHoward Hinnant { 22693e519524SHoward Hinnant _ForwardIterator __i = __first; 22703e519524SHoward Hinnant *__result = *__i; 22713e519524SHoward Hinnant ++__result; 22723e519524SHoward Hinnant while (++__first != __last) 22733e519524SHoward Hinnant { 22743e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22753e519524SHoward Hinnant { 22763e519524SHoward Hinnant *__result = *__first; 22773e519524SHoward Hinnant ++__result; 22783e519524SHoward Hinnant __i = __first; 22793e519524SHoward Hinnant } 22803e519524SHoward Hinnant } 22813e519524SHoward Hinnant } 22823e519524SHoward Hinnant return __result; 22833e519524SHoward Hinnant} 22843e519524SHoward Hinnant 22853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22864bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22873e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22883e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22893e519524SHoward Hinnant{ 22903e519524SHoward Hinnant if (__first != __last) 22913e519524SHoward Hinnant { 22923e519524SHoward Hinnant *__result = *__first; 22933e519524SHoward Hinnant while (++__first != __last) 22943e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22953e519524SHoward Hinnant *++__result = *__first; 22963e519524SHoward Hinnant ++__result; 22973e519524SHoward Hinnant } 22983e519524SHoward Hinnant return __result; 22993e519524SHoward Hinnant} 23003e519524SHoward Hinnant 23013e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23024bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23033e519524SHoward Hinnant_OutputIterator 23043e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23053e519524SHoward Hinnant{ 2306ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23073e519524SHoward Hinnant (__first, __last, __result, __pred, 23083e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23093e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23103e519524SHoward Hinnant} 23113e519524SHoward Hinnant 23123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23134bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23143e519524SHoward Hinnant_OutputIterator 23153e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23163e519524SHoward Hinnant{ 23173e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2318ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23193e519524SHoward Hinnant} 23203e519524SHoward Hinnant 23213e519524SHoward Hinnant// reverse 23223e519524SHoward Hinnant 23233e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23253e519524SHoward Hinnantvoid 23263e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23273e519524SHoward Hinnant{ 23283e519524SHoward Hinnant while (__first != __last) 23293e519524SHoward Hinnant { 23303e519524SHoward Hinnant if (__first == --__last) 23313e519524SHoward Hinnant break; 2332def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23333e519524SHoward Hinnant ++__first; 23343e519524SHoward Hinnant } 23353e519524SHoward Hinnant} 23363e519524SHoward Hinnant 23373e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23393e519524SHoward Hinnantvoid 23403e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23413e519524SHoward Hinnant{ 23423e519524SHoward Hinnant if (__first != __last) 23433e519524SHoward Hinnant for (; __first < --__last; ++__first) 2344def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23493e519524SHoward Hinnantvoid 23503e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23513e519524SHoward Hinnant{ 2352ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23533e519524SHoward Hinnant} 23543e519524SHoward Hinnant 23553e519524SHoward Hinnant// reverse_copy 23563e519524SHoward Hinnant 23573e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2358e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23593e519524SHoward Hinnant_OutputIterator 23603e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23613e519524SHoward Hinnant{ 23623e519524SHoward Hinnant for (; __first != __last; ++__result) 23633e519524SHoward Hinnant *__result = *--__last; 23643e519524SHoward Hinnant return __result; 23653e519524SHoward Hinnant} 23663e519524SHoward Hinnant 23673e519524SHoward Hinnant// rotate 23683e519524SHoward Hinnant 23693e519524SHoward Hinnanttemplate <class _ForwardIterator> 23703ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator 2371aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23723e519524SHoward Hinnant{ 2373aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2374aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2375aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2376aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2377aca09de3SHoward Hinnant return __lm1; 2378aca09de3SHoward Hinnant} 2379aca09de3SHoward Hinnant 2380aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 23813ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator 2382aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2383aca09de3SHoward Hinnant{ 2384aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2385aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2386aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2387aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2388aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2389aca09de3SHoward Hinnant return __fp1; 2390aca09de3SHoward Hinnant} 2391aca09de3SHoward Hinnant 2392aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 23933ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _ForwardIterator 2394aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2395aca09de3SHoward Hinnant{ 23963e519524SHoward Hinnant _ForwardIterator __i = __middle; 23973e519524SHoward Hinnant while (true) 23983e519524SHoward Hinnant { 23993e519524SHoward Hinnant swap(*__first, *__i); 24003e519524SHoward Hinnant ++__first; 24013e519524SHoward Hinnant if (++__i == __last) 24023e519524SHoward Hinnant break; 24033e519524SHoward Hinnant if (__first == __middle) 24043e519524SHoward Hinnant __middle = __i; 24053e519524SHoward Hinnant } 24063e519524SHoward Hinnant _ForwardIterator __r = __first; 24073e519524SHoward Hinnant if (__first != __middle) 24083e519524SHoward Hinnant { 24093e519524SHoward Hinnant __i = __middle; 24103e519524SHoward Hinnant while (true) 24113e519524SHoward Hinnant { 24123e519524SHoward Hinnant swap(*__first, *__i); 24133e519524SHoward Hinnant ++__first; 24143e519524SHoward Hinnant if (++__i == __last) 24153e519524SHoward Hinnant { 24163e519524SHoward Hinnant if (__first == __middle) 24173e519524SHoward Hinnant break; 24183e519524SHoward Hinnant __i = __middle; 24193e519524SHoward Hinnant } 24203e519524SHoward Hinnant else if (__first == __middle) 24213e519524SHoward Hinnant __middle = __i; 24223e519524SHoward Hinnant } 24233e519524SHoward Hinnant } 24243e519524SHoward Hinnant return __r; 24253e519524SHoward Hinnant} 24263e519524SHoward Hinnant 24273e519524SHoward Hinnanttemplate<typename _Integral> 24283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24293ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _Integral 243019b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24313e519524SHoward Hinnant{ 24323e519524SHoward Hinnant do 24333e519524SHoward Hinnant { 24343e519524SHoward Hinnant _Integral __t = __x % __y; 24353e519524SHoward Hinnant __x = __y; 24363e519524SHoward Hinnant __y = __t; 24373e519524SHoward Hinnant } while (__y); 24383e519524SHoward Hinnant return __x; 24393e519524SHoward Hinnant} 24403e519524SHoward Hinnant 24413e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24423ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _RandomAccessIterator 2443aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24443e519524SHoward Hinnant{ 24453e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24463e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24473e519524SHoward Hinnant 24483e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24493e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24503e519524SHoward Hinnant if (__m1 == __m2) 24513e519524SHoward Hinnant { 2452ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24533e519524SHoward Hinnant return __middle; 24543e519524SHoward Hinnant } 245519b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24563e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24573e519524SHoward Hinnant { 2458aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24593e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24603e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24613e519524SHoward Hinnant do 24623e519524SHoward Hinnant { 2463aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24643e519524SHoward Hinnant __p1 = __p2; 24653e519524SHoward Hinnant const difference_type __d = __last - __p2; 24663e519524SHoward Hinnant if (__m1 < __d) 24673e519524SHoward Hinnant __p2 += __m1; 24683e519524SHoward Hinnant else 24693e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24703e519524SHoward Hinnant } while (__p2 != __p); 2471aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24723e519524SHoward Hinnant } 24733e519524SHoward Hinnant return __first + __m2; 24743e519524SHoward Hinnant} 24753e519524SHoward Hinnant 24763e519524SHoward Hinnanttemplate <class _ForwardIterator> 24773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24783ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator 2479aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2480aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2481aca09de3SHoward Hinnant{ 2482aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2483aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2484aca09de3SHoward Hinnant { 2485aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2486aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2487aca09de3SHoward Hinnant } 2488aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2489aca09de3SHoward Hinnant} 2490aca09de3SHoward Hinnant 2491aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2492aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24933ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator 2494aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2495aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2496aca09de3SHoward Hinnant{ 2497aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2498aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2499aca09de3SHoward Hinnant { 2500aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2501aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2502aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2503aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2504aca09de3SHoward Hinnant } 2505aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2506aca09de3SHoward Hinnant} 2507aca09de3SHoward Hinnant 2508aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2509aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25103ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator 2511aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2512aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2513aca09de3SHoward Hinnant{ 2514aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2515aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2516aca09de3SHoward Hinnant { 2517aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2518aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2519aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2520aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2521aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2522aca09de3SHoward Hinnant } 2523aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2524aca09de3SHoward Hinnant} 2525aca09de3SHoward Hinnant 2526aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2527aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25283ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 25293e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25303e519524SHoward Hinnant{ 2531aca09de3SHoward Hinnant if (__first == __middle) 2532aca09de3SHoward Hinnant return __last; 2533aca09de3SHoward Hinnant if (__middle == __last) 2534aca09de3SHoward Hinnant return __first; 2535ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2536aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25373e519524SHoward Hinnant} 25383e519524SHoward Hinnant 25393e519524SHoward Hinnant// rotate_copy 25403e519524SHoward Hinnant 25413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 2542b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 25433e519524SHoward Hinnant_OutputIterator 25443e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25453e519524SHoward Hinnant{ 2546ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25473e519524SHoward Hinnant} 25483e519524SHoward Hinnant 25493e519524SHoward Hinnant// min_element 25503e519524SHoward Hinnant 25513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25521362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25531362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25543e519524SHoward Hinnant_ForwardIterator 25550b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25563e519524SHoward Hinnant{ 2557f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2558a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 25593e519524SHoward Hinnant if (__first != __last) 25603e519524SHoward Hinnant { 25613e519524SHoward Hinnant _ForwardIterator __i = __first; 25623e519524SHoward Hinnant while (++__i != __last) 25633e519524SHoward Hinnant if (__comp(*__i, *__first)) 25643e519524SHoward Hinnant __first = __i; 25653e519524SHoward Hinnant } 25663e519524SHoward Hinnant return __first; 25673e519524SHoward Hinnant} 25683e519524SHoward Hinnant 25693e519524SHoward Hinnanttemplate <class _ForwardIterator> 25701362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25711362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25723e519524SHoward Hinnant_ForwardIterator 25733e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25743e519524SHoward Hinnant{ 25750b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25764eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25774eb27b79SHoward Hinnant} 25784eb27b79SHoward Hinnant 25794eb27b79SHoward Hinnant// min 25804eb27b79SHoward Hinnant 25814eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25821362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25831362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25844eb27b79SHoward Hinnantconst _Tp& 25854eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25864eb27b79SHoward Hinnant{ 25874eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25884eb27b79SHoward Hinnant} 25894eb27b79SHoward Hinnant 25904eb27b79SHoward Hinnanttemplate <class _Tp> 25911362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25921362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25934eb27b79SHoward Hinnantconst _Tp& 25944eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25954eb27b79SHoward Hinnant{ 2596ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25974eb27b79SHoward Hinnant} 25984eb27b79SHoward Hinnant 2599ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 260054976f26SHoward Hinnant 26014eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26021362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26031362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26044eb27b79SHoward Hinnant_Tp 26054eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26064eb27b79SHoward Hinnant{ 26070b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26084eb27b79SHoward Hinnant} 26094eb27b79SHoward Hinnant 26104eb27b79SHoward Hinnanttemplate<class _Tp> 26111362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26121362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26134eb27b79SHoward Hinnant_Tp 26144eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26154eb27b79SHoward Hinnant{ 26160b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26173e519524SHoward Hinnant} 26183e519524SHoward Hinnant 2619ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 262054976f26SHoward Hinnant 26213e519524SHoward Hinnant// max_element 26223e519524SHoward Hinnant 26233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26241362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26251362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26263e519524SHoward Hinnant_ForwardIterator 26270b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26283e519524SHoward Hinnant{ 2629f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2630a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 26313e519524SHoward Hinnant if (__first != __last) 26323e519524SHoward Hinnant { 26333e519524SHoward Hinnant _ForwardIterator __i = __first; 26343e519524SHoward Hinnant while (++__i != __last) 26353e519524SHoward Hinnant if (__comp(*__first, *__i)) 26363e519524SHoward Hinnant __first = __i; 26373e519524SHoward Hinnant } 26383e519524SHoward Hinnant return __first; 26393e519524SHoward Hinnant} 26403e519524SHoward Hinnant 26419d67c6d5SMarshall Clow 26423e519524SHoward Hinnanttemplate <class _ForwardIterator> 26431362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26441362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26453e519524SHoward Hinnant_ForwardIterator 26463e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26473e519524SHoward Hinnant{ 26480b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26494eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26504eb27b79SHoward Hinnant} 26514eb27b79SHoward Hinnant 26524eb27b79SHoward Hinnant// max 26534eb27b79SHoward Hinnant 26544eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26551362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26561362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26574eb27b79SHoward Hinnantconst _Tp& 26584eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26594eb27b79SHoward Hinnant{ 26604eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26614eb27b79SHoward Hinnant} 26624eb27b79SHoward Hinnant 26634eb27b79SHoward Hinnanttemplate <class _Tp> 26641362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26651362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26664eb27b79SHoward Hinnantconst _Tp& 26674eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26684eb27b79SHoward Hinnant{ 2669ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26704eb27b79SHoward Hinnant} 26714eb27b79SHoward Hinnant 2672ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 267354976f26SHoward Hinnant 26744eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26751362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26761362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26774eb27b79SHoward Hinnant_Tp 26784eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26794eb27b79SHoward Hinnant{ 26800b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26814eb27b79SHoward Hinnant} 26824eb27b79SHoward Hinnant 26834eb27b79SHoward Hinnanttemplate<class _Tp> 26841362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26851362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26864eb27b79SHoward Hinnant_Tp 26874eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26884eb27b79SHoward Hinnant{ 26890b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26903e519524SHoward Hinnant} 26913e519524SHoward Hinnant 2692ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 269354976f26SHoward Hinnant 2694146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2695146c14acSMarshall Clow// clamp 2696146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 26971362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26981362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2699146c14acSMarshall Clowconst _Tp& 2700146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2701146c14acSMarshall Clow{ 2702146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2703146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2704146c14acSMarshall Clow 2705146c14acSMarshall Clow} 2706146c14acSMarshall Clow 2707146c14acSMarshall Clowtemplate<class _Tp> 27081362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27091362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2710146c14acSMarshall Clowconst _Tp& 2711146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2712146c14acSMarshall Clow{ 2713146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2714146c14acSMarshall Clow} 2715146c14acSMarshall Clow#endif 2716146c14acSMarshall Clow 27173e519524SHoward Hinnant// minmax_element 27183e519524SHoward Hinnant 27193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27201362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX11 2721d586f92cSArthur O'Dwyerpair<_ForwardIterator, _ForwardIterator> 27223e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27233e519524SHoward Hinnant{ 2724f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2725a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 2726d586f92cSArthur O'Dwyer pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27273e519524SHoward Hinnant if (__first != __last) 27283e519524SHoward Hinnant { 27293e519524SHoward Hinnant if (++__first != __last) 27303e519524SHoward Hinnant { 27313e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27323e519524SHoward Hinnant __result.first = __first; 27333e519524SHoward Hinnant else 27343e519524SHoward Hinnant __result.second = __first; 27353e519524SHoward Hinnant while (++__first != __last) 27363e519524SHoward Hinnant { 27373e519524SHoward Hinnant _ForwardIterator __i = __first; 27383e519524SHoward Hinnant if (++__first == __last) 27393e519524SHoward Hinnant { 27403e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27413e519524SHoward Hinnant __result.first = __i; 27423e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27433e519524SHoward Hinnant __result.second = __i; 27443e519524SHoward Hinnant break; 27453e519524SHoward Hinnant } 27463e519524SHoward Hinnant else 27473e519524SHoward Hinnant { 27483e519524SHoward Hinnant if (__comp(*__first, *__i)) 27493e519524SHoward Hinnant { 27503e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27513e519524SHoward Hinnant __result.first = __first; 27523e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27533e519524SHoward Hinnant __result.second = __i; 27543e519524SHoward Hinnant } 27553e519524SHoward Hinnant else 27563e519524SHoward Hinnant { 27573e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27583e519524SHoward Hinnant __result.first = __i; 27593e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27603e519524SHoward Hinnant __result.second = __first; 27613e519524SHoward Hinnant } 27623e519524SHoward Hinnant } 27633e519524SHoward Hinnant } 27643e519524SHoward Hinnant } 27653e519524SHoward Hinnant } 27663e519524SHoward Hinnant return __result; 27673e519524SHoward Hinnant} 27683e519524SHoward Hinnant 27693e519524SHoward Hinnanttemplate <class _ForwardIterator> 27701362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27711362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2772d586f92cSArthur O'Dwyerpair<_ForwardIterator, _ForwardIterator> 27733e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27743e519524SHoward Hinnant{ 27759d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27769d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27773e519524SHoward Hinnant} 27783e519524SHoward Hinnant 27794eb27b79SHoward Hinnant// minmax 27804eb27b79SHoward Hinnant 27814eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27821362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27831362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27844eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27854eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27864eb27b79SHoward Hinnant{ 27874eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27884eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27894eb27b79SHoward Hinnant} 27904eb27b79SHoward Hinnant 27914eb27b79SHoward Hinnanttemplate<class _Tp> 27921362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27931362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27944eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27954eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27964eb27b79SHoward Hinnant{ 2797ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27984eb27b79SHoward Hinnant} 27994eb27b79SHoward Hinnant 2800ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 280154976f26SHoward Hinnant 28024eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28031362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 28041362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28054eb27b79SHoward Hinnantpair<_Tp, _Tp> 28064eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28074eb27b79SHoward Hinnant{ 28089d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28099d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28109d67c6d5SMarshall Clow _Iter __last = __t.end(); 2811d586f92cSArthur O'Dwyer pair<_Tp, _Tp> __result(*__first, *__first); 28129d67c6d5SMarshall Clow 28139d67c6d5SMarshall Clow ++__first; 28149d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28159d67c6d5SMarshall Clow { 28169d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28179d67c6d5SMarshall Clow __result.first = *__first; 28189d67c6d5SMarshall Clow else 28199d67c6d5SMarshall Clow __result.second = *__first; 28209d67c6d5SMarshall Clow ++__first; 28219d67c6d5SMarshall Clow } 28229d67c6d5SMarshall Clow 28239d67c6d5SMarshall Clow while (__first != __last) 28249d67c6d5SMarshall Clow { 28259d67c6d5SMarshall Clow _Tp __prev = *__first++; 2826002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2827002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2828002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28299d67c6d5SMarshall Clow } 28309d67c6d5SMarshall Clow else { 2831002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2832002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28339d67c6d5SMarshall Clow } 28349d67c6d5SMarshall Clow 28359d67c6d5SMarshall Clow __first++; 28369d67c6d5SMarshall Clow } 28379d67c6d5SMarshall Clow return __result; 28389d67c6d5SMarshall Clow} 28399d67c6d5SMarshall Clow 28409d67c6d5SMarshall Clowtemplate<class _Tp> 28411362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 28421362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28439d67c6d5SMarshall Clowpair<_Tp, _Tp> 28449d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28459d67c6d5SMarshall Clow{ 28469d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28474eb27b79SHoward Hinnant} 28484eb27b79SHoward Hinnant 2849ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 285054976f26SHoward Hinnant 28513e519524SHoward Hinnant// random_shuffle 28523e519524SHoward Hinnant 2853f9d540b0SHoward Hinnant// __independent_bits_engine 2854f9d540b0SHoward Hinnant 2855c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2856f9d540b0SHoward Hinnantstruct __log2_imp 28573e519524SHoward Hinnant{ 2858c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2859c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28603e519524SHoward Hinnant}; 28613e519524SHoward Hinnant 2862c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2863c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28643e519524SHoward Hinnant{ 2865f9d540b0SHoward Hinnant static const size_t value = 0; 28663e519524SHoward Hinnant}; 28673e519524SHoward Hinnant 2868c003db1fSHoward Hinnanttemplate <size_t _Rp> 2869c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28703e519524SHoward Hinnant{ 2871c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28723e519524SHoward Hinnant}; 28733e519524SHoward Hinnant 287489918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2875f9d540b0SHoward Hinnantstruct __log2 28763e519524SHoward Hinnant{ 2877c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 287889918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28793e519524SHoward Hinnant}; 28803e519524SHoward Hinnant 2881f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2882f9d540b0SHoward Hinnantclass __independent_bits_engine 28833e519524SHoward Hinnant{ 2884f9d540b0SHoward Hinnantpublic: 2885f9d540b0SHoward Hinnant // types 2886f9d540b0SHoward Hinnant typedef _UIntType result_type; 2887f9d540b0SHoward Hinnant 2888f9d540b0SHoward Hinnantprivate: 2889f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2890f9d540b0SHoward Hinnant typedef typename conditional 2891f9d540b0SHoward Hinnant < 2892f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2893f9d540b0SHoward Hinnant result_type, 2894f9d540b0SHoward Hinnant _Engine_result_type 2895f9d540b0SHoward Hinnant >::type _Working_result_type; 2896f9d540b0SHoward Hinnant 2897f9d540b0SHoward Hinnant _Engine& __e_; 2898f9d540b0SHoward Hinnant size_t __w_; 2899f9d540b0SHoward Hinnant size_t __w0_; 2900f9d540b0SHoward Hinnant size_t __n_; 2901f9d540b0SHoward Hinnant size_t __n0_; 2902f9d540b0SHoward Hinnant _Working_result_type __y0_; 2903f9d540b0SHoward Hinnant _Working_result_type __y1_; 2904f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2905f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2906f9d540b0SHoward Hinnant 2907ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2908c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2909f9d540b0SHoward Hinnant + _Working_result_type(1); 2910e386b7b3SHoward Hinnant#else 2911e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2912e386b7b3SHoward Hinnant + _Working_result_type(1); 2913e386b7b3SHoward Hinnant#endif 2914e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2915e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2916e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2917f9d540b0SHoward Hinnant 2918f9d540b0SHoward Hinnantpublic: 2919f9d540b0SHoward Hinnant // constructors and seeding functions 2920f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2921f9d540b0SHoward Hinnant 2922f9d540b0SHoward Hinnant // generating functions 2923c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2924f9d540b0SHoward Hinnant 2925f9d540b0SHoward Hinnantprivate: 292608bba64aSMarshall Clow result_type __eval(false_type); 292708bba64aSMarshall Clow result_type __eval(true_type); 2928f9d540b0SHoward Hinnant}; 2929f9d540b0SHoward Hinnant 2930f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2931f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2932f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2933f9d540b0SHoward Hinnant : __e_(__e), 2934f9d540b0SHoward Hinnant __w_(__w) 2935f9d540b0SHoward Hinnant{ 2936f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2937f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2938c003db1fSHoward Hinnant if (_Rp == 0) 2939c003db1fSHoward Hinnant __y0_ = _Rp; 2940f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2941c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2942f9d540b0SHoward Hinnant else 2943f9d540b0SHoward Hinnant __y0_ = 0; 2944c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2945f9d540b0SHoward Hinnant { 2946f9d540b0SHoward Hinnant ++__n_; 2947f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2948f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2949c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2950f9d540b0SHoward Hinnant else 2951f9d540b0SHoward Hinnant __y0_ = 0; 2952f9d540b0SHoward Hinnant } 2953f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2954f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2955c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2956f9d540b0SHoward Hinnant else 2957f9d540b0SHoward Hinnant __y1_ = 0; 2958f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2959f9d540b0SHoward Hinnant _Engine_result_type(0); 2960f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2961f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2962f9d540b0SHoward Hinnant _Engine_result_type(~0); 29633e519524SHoward Hinnant} 29643e519524SHoward Hinnant 2965f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2966f9d540b0SHoward Hinnantinline 2967f9d540b0SHoward Hinnant_UIntType 296808bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29693e519524SHoward Hinnant{ 2970f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29713e519524SHoward Hinnant} 29723e519524SHoward Hinnant 2973f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2974f9d540b0SHoward Hinnant_UIntType 297508bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29763e519524SHoward Hinnant{ 29775beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2978c003db1fSHoward Hinnant result_type _Sp = 0; 2979f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2980f9d540b0SHoward Hinnant { 2981f9d540b0SHoward Hinnant _Engine_result_type __u; 29823e519524SHoward Hinnant do 2983f9d540b0SHoward Hinnant { 2984f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2985f9d540b0SHoward Hinnant } while (__u >= __y0_); 29865beb2c3aSMarshall Clow if (__w0_ < _WRt) 2987c003db1fSHoward Hinnant _Sp <<= __w0_; 2988f9d540b0SHoward Hinnant else 2989c003db1fSHoward Hinnant _Sp = 0; 2990c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2991f9d540b0SHoward Hinnant } 2992f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2993f9d540b0SHoward Hinnant { 2994f9d540b0SHoward Hinnant _Engine_result_type __u; 2995f9d540b0SHoward Hinnant do 2996f9d540b0SHoward Hinnant { 2997f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2998f9d540b0SHoward Hinnant } while (__u >= __y1_); 29995beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 3000c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3001f9d540b0SHoward Hinnant else 3002c003db1fSHoward Hinnant _Sp = 0; 3003c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3004f9d540b0SHoward Hinnant } 3005c003db1fSHoward Hinnant return _Sp; 30063e519524SHoward Hinnant} 30073e519524SHoward Hinnant 3008f9d540b0SHoward Hinnant// uniform_int_distribution 30093e519524SHoward Hinnant 3010f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3011f9d540b0SHoward Hinnantclass uniform_int_distribution 30123e519524SHoward Hinnant{ 3013f9d540b0SHoward Hinnantpublic: 3014f9d540b0SHoward Hinnant // types 3015f9d540b0SHoward Hinnant typedef _IntType result_type; 3016f9d540b0SHoward Hinnant 3017f9d540b0SHoward Hinnant class param_type 3018f9d540b0SHoward Hinnant { 3019f9d540b0SHoward Hinnant result_type __a_; 3020f9d540b0SHoward Hinnant result_type __b_; 3021f9d540b0SHoward Hinnant public: 3022f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3023f9d540b0SHoward Hinnant 3024f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3025f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3026f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3027f9d540b0SHoward Hinnant 3028f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3029f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3030f9d540b0SHoward Hinnant 3031f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3032f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3033f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3034f9d540b0SHoward Hinnant {return !(__x == __y);} 30353e519524SHoward Hinnant }; 30363e519524SHoward Hinnant 3037f9d540b0SHoward Hinnantprivate: 3038f9d540b0SHoward Hinnant param_type __p_; 30393e519524SHoward Hinnant 3040f9d540b0SHoward Hinnantpublic: 3041f9d540b0SHoward Hinnant // constructors and reset functions 3042a11f8b1aSMarek Kurdej#ifndef _LIBCPP_CXX03_LANG 3043a11f8b1aSMarek Kurdej uniform_int_distribution() : uniform_int_distribution(0) {} 3044a11f8b1aSMarek Kurdej explicit uniform_int_distribution( 3045a11f8b1aSMarek Kurdej result_type __a, result_type __b = numeric_limits<result_type>::max()) 3046a11f8b1aSMarek Kurdej : __p_(param_type(__a, __b)) {} 3047a11f8b1aSMarek Kurdej#else 3048a11f8b1aSMarek Kurdej explicit uniform_int_distribution( 3049a11f8b1aSMarek Kurdej result_type __a = 0, 3050f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3051f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3052a11f8b1aSMarek Kurdej#endif 3053f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3054f9d540b0SHoward Hinnant void reset() {} 3055f9d540b0SHoward Hinnant 3056f9d540b0SHoward Hinnant // generating functions 3057f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3058f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3059f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3060f9d540b0SHoward Hinnant 3061f9d540b0SHoward Hinnant // property functions 3062f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3063f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3064f9d540b0SHoward Hinnant 3065f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3066f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3067f9d540b0SHoward Hinnant 3068f9d540b0SHoward Hinnant result_type min() const {return a();} 3069f9d540b0SHoward Hinnant result_type max() const {return b();} 3070f9d540b0SHoward Hinnant 3071f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3072f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3073f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3074f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3075f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3076f9d540b0SHoward Hinnant {return !(__x == __y);} 30773e519524SHoward Hinnant}; 30783e519524SHoward Hinnant 3079f9d540b0SHoward Hinnanttemplate<class _IntType> 3080f9d540b0SHoward Hinnanttemplate<class _URNG> 3081f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3082f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30832dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 30843e519524SHoward Hinnant{ 3085f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3086f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 30872dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 3088c003db1fSHoward Hinnant if (_Rp == 1) 3089f9d540b0SHoward Hinnant return __p.a(); 3090f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3091f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3092c003db1fSHoward Hinnant if (_Rp == 0) 3093f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3094f3b851f0SMarshall Clow size_t __w = _Dt - __libcpp_clz(_Rp) - 1; 3095d586f92cSArthur O'Dwyer if ((_Rp & (numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3096f9d540b0SHoward Hinnant ++__w; 3097f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3098f9d540b0SHoward Hinnant _UIntType __u; 3099f9d540b0SHoward Hinnant do 31003e519524SHoward Hinnant { 3101f9d540b0SHoward Hinnant __u = __e(); 3102c003db1fSHoward Hinnant } while (__u >= _Rp); 3103f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31043e519524SHoward Hinnant} 3105f9d540b0SHoward Hinnant 310666f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 310766f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3108f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3109f9d540b0SHoward Hinnant 3110f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3111f9d540b0SHoward Hinnant 3112f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31133e519524SHoward Hinnant{ 3114f9d540b0SHoward Hinnant static unsigned __c_; 3115f9d540b0SHoward Hinnant 3116f9d540b0SHoward Hinnant __rs_default(); 3117f9d540b0SHoward Hinnantpublic: 3118b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3119f9d540b0SHoward Hinnant 3120f9d540b0SHoward Hinnant static const result_type _Min = 0; 3121f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3122f9d540b0SHoward Hinnant 3123f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3124f9d540b0SHoward Hinnant ~__rs_default(); 3125f9d540b0SHoward Hinnant 3126f9d540b0SHoward Hinnant result_type operator()(); 3127f9d540b0SHoward Hinnant 3128788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3129788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3130f9d540b0SHoward Hinnant 3131f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3132f9d540b0SHoward Hinnant}; 3133f9d540b0SHoward Hinnant 3134f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31353e519524SHoward Hinnant 31363e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 3137ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 31383e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31393e519524SHoward Hinnant{ 31403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3141c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3142c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31433e519524SHoward Hinnant difference_type __d = __last - __first; 31443e519524SHoward Hinnant if (__d > 1) 31453e519524SHoward Hinnant { 3146c003db1fSHoward Hinnant _Dp __uid; 3147f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 31485a8525e0SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3149007b26beSHoward Hinnant { 3150c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3151007b26beSHoward Hinnant if (__i != difference_type(0)) 3152007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3153007b26beSHoward Hinnant } 31543e519524SHoward Hinnant } 31553e519524SHoward Hinnant} 31563e519524SHoward Hinnant 31573e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3158ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 31593e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3160ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31613e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31623e519524SHoward Hinnant#else 31633e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31643e519524SHoward Hinnant#endif 31653e519524SHoward Hinnant{ 31663e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31673e519524SHoward Hinnant difference_type __d = __last - __first; 31683e519524SHoward Hinnant if (__d > 1) 31693e519524SHoward Hinnant { 31705a8525e0SMarshall Clow for (--__last; __first < __last; ++__first, (void) --__d) 3171007b26beSHoward Hinnant { 3172007b26beSHoward Hinnant difference_type __i = __rand(__d); 3173e9cc5451SMarshall Clow if (__i != difference_type(0)) 3174007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3175007b26beSHoward Hinnant } 31763e519524SHoward Hinnant } 31773e519524SHoward Hinnant} 31780f37a410SMarshall Clow#endif 31793e519524SHoward Hinnant 3180e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3181e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3182e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3183e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 318442bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3185e7154709SEric Fiselier _Distance __n, 3186e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3187e7154709SEric Fiselier input_iterator_tag) { 3188e7154709SEric Fiselier 3189e7154709SEric Fiselier _Distance __k = 0; 3190e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void) ++__k) 319142bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3192e7154709SEric Fiselier _Distance __sz = __k; 3193e7154709SEric Fiselier for (; __first != __last; ++__first, (void) ++__k) { 3194e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3195e7154709SEric Fiselier if (__r < __sz) 319642bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3197e7154709SEric Fiselier } 319842bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3199e7154709SEric Fiselier} 3200e7154709SEric Fiselier 3201e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3202e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3203e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3204e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 320542bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3206e7154709SEric Fiselier _Distance __n, 3207e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3208e7154709SEric Fiselier forward_iterator_tag) { 3209e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3210e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3211e7154709SEric Fiselier _Distance __r = 3212e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3213e7154709SEric Fiselier if (__r < __n) { 321442bfedd9SAlexander Richardson *__output_iter++ = *__first; 3215e7154709SEric Fiselier --__n; 3216e7154709SEric Fiselier } 3217e7154709SEric Fiselier } 321842bfedd9SAlexander Richardson return __output_iter; 3219e7154709SEric Fiselier} 3220e7154709SEric Fiselier 3221e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3222e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3223e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3224e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 322542bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3226e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3227e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3228e7154709SEric Fiselier _PopCategory; 3229e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3230e7154709SEric Fiselier _Difference; 3231f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_PopulationIterator>::value || 3232f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_SampleIterator>::value, 3233e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3234e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3235e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3236e7154709SEric Fiselier return _VSTD::__sample( 323742bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3238e7154709SEric Fiselier __g, _PopCategory()); 3239e7154709SEric Fiselier} 3240e7154709SEric Fiselier 3241e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3242e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3243e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3244e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3245e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 324642bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3247e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 324842bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3249e7154709SEric Fiselier} 3250e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3251e7154709SEric Fiselier 3252f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3253f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3254fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3255f9d540b0SHoward Hinnant{ 3256f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3257c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3258c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3259f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3260f9d540b0SHoward Hinnant if (__d > 1) 3261f9d540b0SHoward Hinnant { 3262c003db1fSHoward Hinnant _Dp __uid; 32637fa68653SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3264007b26beSHoward Hinnant { 3265c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3266007b26beSHoward Hinnant if (__i != difference_type(0)) 3267007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3268007b26beSHoward Hinnant } 3269f9d540b0SHoward Hinnant } 3270f9d540b0SHoward Hinnant} 3271f9d540b0SHoward Hinnant 3272*3fbd3eafSArthur O'Dwyer#if _LIBCPP_STD_VER > 17 3273*3fbd3eafSArthur O'Dwyer 3274*3fbd3eafSArthur O'Dwyer// shift_left, shift_right 3275*3fbd3eafSArthur O'Dwyer 3276*3fbd3eafSArthur O'Dwyertemplate <class _ForwardIterator> 3277*3fbd3eafSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY constexpr 3278*3fbd3eafSArthur O'Dwyer_ForwardIterator 3279*3fbd3eafSArthur O'Dwyershift_left(_ForwardIterator __first, _ForwardIterator __last, 3280*3fbd3eafSArthur O'Dwyer typename iterator_traits<_ForwardIterator>::difference_type __n) 3281*3fbd3eafSArthur O'Dwyer{ 3282*3fbd3eafSArthur O'Dwyer if (__n == 0) { 3283*3fbd3eafSArthur O'Dwyer return __last; 3284*3fbd3eafSArthur O'Dwyer } 3285*3fbd3eafSArthur O'Dwyer 3286*3fbd3eafSArthur O'Dwyer _ForwardIterator __m = __first; 3287*3fbd3eafSArthur O'Dwyer if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) { 3288*3fbd3eafSArthur O'Dwyer if (__n >= __last - __first) { 3289*3fbd3eafSArthur O'Dwyer return __first; 3290*3fbd3eafSArthur O'Dwyer } 3291*3fbd3eafSArthur O'Dwyer __m += __n; 3292*3fbd3eafSArthur O'Dwyer } else { 3293*3fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 3294*3fbd3eafSArthur O'Dwyer if (__m == __last) { 3295*3fbd3eafSArthur O'Dwyer return __first; 3296*3fbd3eafSArthur O'Dwyer } 3297*3fbd3eafSArthur O'Dwyer ++__m; 3298*3fbd3eafSArthur O'Dwyer } 3299*3fbd3eafSArthur O'Dwyer } 3300*3fbd3eafSArthur O'Dwyer return _VSTD::move(__m, __last, __first); 3301*3fbd3eafSArthur O'Dwyer} 3302*3fbd3eafSArthur O'Dwyer 3303*3fbd3eafSArthur O'Dwyertemplate <class _ForwardIterator> 3304*3fbd3eafSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY constexpr 3305*3fbd3eafSArthur O'Dwyer_ForwardIterator 3306*3fbd3eafSArthur O'Dwyershift_right(_ForwardIterator __first, _ForwardIterator __last, 3307*3fbd3eafSArthur O'Dwyer typename iterator_traits<_ForwardIterator>::difference_type __n) 3308*3fbd3eafSArthur O'Dwyer{ 3309*3fbd3eafSArthur O'Dwyer if (__n == 0) { 3310*3fbd3eafSArthur O'Dwyer return __first; 3311*3fbd3eafSArthur O'Dwyer } 3312*3fbd3eafSArthur O'Dwyer 3313*3fbd3eafSArthur O'Dwyer if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) { 3314*3fbd3eafSArthur O'Dwyer decltype(__n) __d = __last - __first; 3315*3fbd3eafSArthur O'Dwyer if (__n >= __d) { 3316*3fbd3eafSArthur O'Dwyer return __last; 3317*3fbd3eafSArthur O'Dwyer } 3318*3fbd3eafSArthur O'Dwyer _ForwardIterator __m = __first + (__d - __n); 3319*3fbd3eafSArthur O'Dwyer return _VSTD::move_backward(__first, __m, __last); 3320*3fbd3eafSArthur O'Dwyer } else if constexpr (__is_cpp17_bidirectional_iterator<_ForwardIterator>::value) { 3321*3fbd3eafSArthur O'Dwyer _ForwardIterator __m = __last; 3322*3fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 3323*3fbd3eafSArthur O'Dwyer if (__m == __first) { 3324*3fbd3eafSArthur O'Dwyer return __last; 3325*3fbd3eafSArthur O'Dwyer } 3326*3fbd3eafSArthur O'Dwyer --__m; 3327*3fbd3eafSArthur O'Dwyer } 3328*3fbd3eafSArthur O'Dwyer return _VSTD::move_backward(__first, __m, __last); 3329*3fbd3eafSArthur O'Dwyer } else { 3330*3fbd3eafSArthur O'Dwyer _ForwardIterator __ret = __first; 3331*3fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 3332*3fbd3eafSArthur O'Dwyer if (__ret == __last) { 3333*3fbd3eafSArthur O'Dwyer return __last; 3334*3fbd3eafSArthur O'Dwyer } 3335*3fbd3eafSArthur O'Dwyer ++__ret; 3336*3fbd3eafSArthur O'Dwyer } 3337*3fbd3eafSArthur O'Dwyer 3338*3fbd3eafSArthur O'Dwyer // We have an __n-element scratch space from __first to __ret. 3339*3fbd3eafSArthur O'Dwyer // Slide an __n-element window [__trail, __lead) from left to right. 3340*3fbd3eafSArthur O'Dwyer // We're essentially doing swap_ranges(__first, __ret, __trail, __lead) 3341*3fbd3eafSArthur O'Dwyer // over and over; but once __lead reaches __last we needn't bother 3342*3fbd3eafSArthur O'Dwyer // to save the values of elements [__trail, __last). 3343*3fbd3eafSArthur O'Dwyer 3344*3fbd3eafSArthur O'Dwyer auto __trail = __first; 3345*3fbd3eafSArthur O'Dwyer auto __lead = __ret; 3346*3fbd3eafSArthur O'Dwyer while (__trail != __ret) { 3347*3fbd3eafSArthur O'Dwyer if (__lead == __last) { 3348*3fbd3eafSArthur O'Dwyer _VSTD::move(__first, __trail, __ret); 3349*3fbd3eafSArthur O'Dwyer return __ret; 3350*3fbd3eafSArthur O'Dwyer } 3351*3fbd3eafSArthur O'Dwyer ++__trail; 3352*3fbd3eafSArthur O'Dwyer ++__lead; 3353*3fbd3eafSArthur O'Dwyer } 3354*3fbd3eafSArthur O'Dwyer 3355*3fbd3eafSArthur O'Dwyer _ForwardIterator __mid = __first; 3356*3fbd3eafSArthur O'Dwyer while (true) { 3357*3fbd3eafSArthur O'Dwyer if (__lead == __last) { 3358*3fbd3eafSArthur O'Dwyer __trail = _VSTD::move(__mid, __ret, __trail); 3359*3fbd3eafSArthur O'Dwyer _VSTD::move(__first, __mid, __trail); 3360*3fbd3eafSArthur O'Dwyer return __ret; 3361*3fbd3eafSArthur O'Dwyer } 3362*3fbd3eafSArthur O'Dwyer swap(*__mid, *__trail); 3363*3fbd3eafSArthur O'Dwyer ++__mid; 3364*3fbd3eafSArthur O'Dwyer ++__trail; 3365*3fbd3eafSArthur O'Dwyer ++__lead; 3366*3fbd3eafSArthur O'Dwyer if (__mid == __ret) { 3367*3fbd3eafSArthur O'Dwyer __mid = __first; 3368*3fbd3eafSArthur O'Dwyer } 3369*3fbd3eafSArthur O'Dwyer } 3370*3fbd3eafSArthur O'Dwyer } 3371*3fbd3eafSArthur O'Dwyer} 3372*3fbd3eafSArthur O'Dwyer 3373*3fbd3eafSArthur O'Dwyer#endif // _LIBCPP_STD_VER > 17 3374*3fbd3eafSArthur O'Dwyer 3375*3fbd3eafSArthur O'Dwyer// is_partitioned 3376*3fbd3eafSArthur O'Dwyer 33773e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 33781362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 33793e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 33803e519524SHoward Hinnant{ 33813e519524SHoward Hinnant for (; __first != __last; ++__first) 33823e519524SHoward Hinnant if (!__pred(*__first)) 33833e519524SHoward Hinnant break; 3384b9595b79SMarshall Clow if ( __first == __last ) 3385b9595b79SMarshall Clow return true; 3386b9595b79SMarshall Clow ++__first; 33873e519524SHoward Hinnant for (; __first != __last; ++__first) 33883e519524SHoward Hinnant if (__pred(*__first)) 33893e519524SHoward Hinnant return false; 33903e519524SHoward Hinnant return true; 33913e519524SHoward Hinnant} 33923e519524SHoward Hinnant 33933e519524SHoward Hinnant// partition 33943e519524SHoward Hinnant 33953e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33963e519524SHoward Hinnant_ForwardIterator 33973e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 33983e519524SHoward Hinnant{ 33993e519524SHoward Hinnant while (true) 34003e519524SHoward Hinnant { 34013e519524SHoward Hinnant if (__first == __last) 34023e519524SHoward Hinnant return __first; 34033e519524SHoward Hinnant if (!__pred(*__first)) 34043e519524SHoward Hinnant break; 34053e519524SHoward Hinnant ++__first; 34063e519524SHoward Hinnant } 34073e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 34083e519524SHoward Hinnant { 34093e519524SHoward Hinnant if (__pred(*__p)) 34103e519524SHoward Hinnant { 34113e519524SHoward Hinnant swap(*__first, *__p); 34123e519524SHoward Hinnant ++__first; 34133e519524SHoward Hinnant } 34143e519524SHoward Hinnant } 34153e519524SHoward Hinnant return __first; 34163e519524SHoward Hinnant} 34173e519524SHoward Hinnant 34183e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34193e519524SHoward Hinnant_BidirectionalIterator 34203e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34213e519524SHoward Hinnant bidirectional_iterator_tag) 34223e519524SHoward Hinnant{ 34233e519524SHoward Hinnant while (true) 34243e519524SHoward Hinnant { 34253e519524SHoward Hinnant while (true) 34263e519524SHoward Hinnant { 34273e519524SHoward Hinnant if (__first == __last) 34283e519524SHoward Hinnant return __first; 34293e519524SHoward Hinnant if (!__pred(*__first)) 34303e519524SHoward Hinnant break; 34313e519524SHoward Hinnant ++__first; 34323e519524SHoward Hinnant } 34333e519524SHoward Hinnant do 34343e519524SHoward Hinnant { 34353e519524SHoward Hinnant if (__first == --__last) 34363e519524SHoward Hinnant return __first; 34373e519524SHoward Hinnant } while (!__pred(*__last)); 34383e519524SHoward Hinnant swap(*__first, *__last); 34393e519524SHoward Hinnant ++__first; 34403e519524SHoward Hinnant } 34413e519524SHoward Hinnant} 34423e519524SHoward Hinnant 34433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34453e519524SHoward Hinnant_ForwardIterator 34463e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34473e519524SHoward Hinnant{ 3448ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 34493e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34503e519524SHoward Hinnant} 34513e519524SHoward Hinnant 34523e519524SHoward Hinnant// partition_copy 34533e519524SHoward Hinnant 34543e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 34553e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 34561b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 34573e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 34583e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 34593e519524SHoward Hinnant _Predicate __pred) 34603e519524SHoward Hinnant{ 34613e519524SHoward Hinnant for (; __first != __last; ++__first) 34623e519524SHoward Hinnant { 34633e519524SHoward Hinnant if (__pred(*__first)) 34643e519524SHoward Hinnant { 34653e519524SHoward Hinnant *__out_true = *__first; 34663e519524SHoward Hinnant ++__out_true; 34673e519524SHoward Hinnant } 34683e519524SHoward Hinnant else 34693e519524SHoward Hinnant { 34703e519524SHoward Hinnant *__out_false = *__first; 34713e519524SHoward Hinnant ++__out_false; 34723e519524SHoward Hinnant } 34733e519524SHoward Hinnant } 34743e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 34753e519524SHoward Hinnant} 34763e519524SHoward Hinnant 34773e519524SHoward Hinnant// partition_point 34783e519524SHoward Hinnant 34793e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3480674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 34813e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34823e519524SHoward Hinnant{ 34833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3484ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34853e519524SHoward Hinnant while (__len != 0) 34863e519524SHoward Hinnant { 348704695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 34883e519524SHoward Hinnant _ForwardIterator __m = __first; 3489ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 34903e519524SHoward Hinnant if (__pred(*__m)) 34913e519524SHoward Hinnant { 34923e519524SHoward Hinnant __first = ++__m; 34933e519524SHoward Hinnant __len -= __l2 + 1; 34943e519524SHoward Hinnant } 34953e519524SHoward Hinnant else 34963e519524SHoward Hinnant __len = __l2; 34973e519524SHoward Hinnant } 34983e519524SHoward Hinnant return __first; 34993e519524SHoward Hinnant} 35003e519524SHoward Hinnant 35013e519524SHoward Hinnant// stable_partition 35023e519524SHoward Hinnant 35033e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 35043e519524SHoward Hinnant_ForwardIterator 35053e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35063e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 35073e519524SHoward Hinnant{ 35083e519524SHoward Hinnant // *__first is known to be false 35093e519524SHoward Hinnant // __len >= 1 35103e519524SHoward Hinnant if (__len == 1) 35113e519524SHoward Hinnant return __first; 35123e519524SHoward Hinnant if (__len == 2) 35133e519524SHoward Hinnant { 35143e519524SHoward Hinnant _ForwardIterator __m = __first; 35153e519524SHoward Hinnant if (__pred(*++__m)) 35163e519524SHoward Hinnant { 35173e519524SHoward Hinnant swap(*__first, *__m); 35183e519524SHoward Hinnant return __m; 35193e519524SHoward Hinnant } 35203e519524SHoward Hinnant return __first; 35213e519524SHoward Hinnant } 35223e519524SHoward Hinnant if (__len <= __p.second) 35233e519524SHoward Hinnant { // The buffer is big enough to use 35243e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 35253e519524SHoward Hinnant __destruct_n __d(0); 35263e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35273e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35283e519524SHoward Hinnant // Update __first to always point to the end of the trues 35293e519524SHoward Hinnant value_type* __t = __p.first; 3530be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__first)); 3531527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 35323e519524SHoward Hinnant ++__t; 35333e519524SHoward Hinnant _ForwardIterator __i = __first; 35343e519524SHoward Hinnant while (++__i != __last) 35353e519524SHoward Hinnant { 35363e519524SHoward Hinnant if (__pred(*__i)) 35373e519524SHoward Hinnant { 3538ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35393e519524SHoward Hinnant ++__first; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant else 35423e519524SHoward Hinnant { 3543be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__i)); 3544527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 35453e519524SHoward Hinnant ++__t; 35463e519524SHoward Hinnant } 35473e519524SHoward Hinnant } 35483e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35493e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35503e519524SHoward Hinnant __i = __first; 35517fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3552ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35533e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35543e519524SHoward Hinnant return __first; 35553e519524SHoward Hinnant } 35563e519524SHoward Hinnant // Else not enough buffer, do in place 35573e519524SHoward Hinnant // __len >= 3 35583e519524SHoward Hinnant _ForwardIterator __m = __first; 35593e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3560ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35613e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 35623e519524SHoward Hinnant // F????????????????? 35633e519524SHoward Hinnant // f m l 35643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35651968804aSArthur O'Dwyer _ForwardIterator __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 35663e519524SHoward Hinnant // TTTFFFFF?????????? 35673e519524SHoward Hinnant // f ff m l 35683e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35693e519524SHoward Hinnant _ForwardIterator __m1 = __m; 35703e519524SHoward Hinnant _ForwardIterator __second_false = __last; 35713e519524SHoward Hinnant _Distance __len_half = __len - __len2; 35723e519524SHoward Hinnant while (__pred(*__m1)) 35733e519524SHoward Hinnant { 35743e519524SHoward Hinnant if (++__m1 == __last) 35753e519524SHoward Hinnant goto __second_half_done; 35763e519524SHoward Hinnant --__len_half; 35773e519524SHoward Hinnant } 35783e519524SHoward Hinnant // TTTFFFFFTTTF?????? 35793e519524SHoward Hinnant // f ff m m1 l 35801968804aSArthur O'Dwyer __second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 35813e519524SHoward Hinnant__second_half_done: 35823e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35833e519524SHoward Hinnant // f ff m sf l 3584ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35853e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35863e519524SHoward Hinnant // | 35873e519524SHoward Hinnant} 35883e519524SHoward Hinnant 35893e519524SHoward Hinnantstruct __return_temporary_buffer 35903e519524SHoward Hinnant{ 35913e519524SHoward Hinnant template <class _Tp> 3592ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 35933e519524SHoward Hinnant}; 35943e519524SHoward Hinnant 35953e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 35963e519524SHoward Hinnant_ForwardIterator 35973e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35983e519524SHoward Hinnant forward_iterator_tag) 35993e519524SHoward Hinnant{ 36003e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 36013e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36023e519524SHoward Hinnant while (true) 36033e519524SHoward Hinnant { 36043e519524SHoward Hinnant if (__first == __last) 36053e519524SHoward Hinnant return __first; 36063e519524SHoward Hinnant if (!__pred(*__first)) 36073e519524SHoward Hinnant break; 36083e519524SHoward Hinnant ++__first; 36093e519524SHoward Hinnant } 36103e519524SHoward Hinnant // We now have a reduced range [__first, __last) 36113e519524SHoward Hinnant // *__first is known to be false 36123e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 36133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3614ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 36153e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36163e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36173e519524SHoward Hinnant if (__len >= __alloc_limit) 36183e519524SHoward Hinnant { 3619ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36203e519524SHoward Hinnant __h.reset(__p.first); 36213e519524SHoward Hinnant } 36221968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 36233e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 36243e519524SHoward Hinnant} 36253e519524SHoward Hinnant 36263e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 36273e519524SHoward Hinnant_BidirectionalIterator 36283e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36293e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 36303e519524SHoward Hinnant{ 36313e519524SHoward Hinnant // *__first is known to be false 36323e519524SHoward Hinnant // *__last is known to be true 36333e519524SHoward Hinnant // __len >= 2 36343e519524SHoward Hinnant if (__len == 2) 36353e519524SHoward Hinnant { 36363e519524SHoward Hinnant swap(*__first, *__last); 36373e519524SHoward Hinnant return __last; 36383e519524SHoward Hinnant } 36393e519524SHoward Hinnant if (__len == 3) 36403e519524SHoward Hinnant { 36413e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36423e519524SHoward Hinnant if (__pred(*++__m)) 36433e519524SHoward Hinnant { 36443e519524SHoward Hinnant swap(*__first, *__m); 36453e519524SHoward Hinnant swap(*__m, *__last); 36463e519524SHoward Hinnant return __last; 36473e519524SHoward Hinnant } 36483e519524SHoward Hinnant swap(*__m, *__last); 36493e519524SHoward Hinnant swap(*__first, *__m); 36503e519524SHoward Hinnant return __m; 36513e519524SHoward Hinnant } 36523e519524SHoward Hinnant if (__len <= __p.second) 36533e519524SHoward Hinnant { // The buffer is big enough to use 36543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36553e519524SHoward Hinnant __destruct_n __d(0); 36563e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 36573e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 36583e519524SHoward Hinnant // Update __first to always point to the end of the trues 36593e519524SHoward Hinnant value_type* __t = __p.first; 3660be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__first)); 3661527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 36623e519524SHoward Hinnant ++__t; 36633e519524SHoward Hinnant _BidirectionalIterator __i = __first; 36643e519524SHoward Hinnant while (++__i != __last) 36653e519524SHoward Hinnant { 36663e519524SHoward Hinnant if (__pred(*__i)) 36673e519524SHoward Hinnant { 3668ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36693e519524SHoward Hinnant ++__first; 36703e519524SHoward Hinnant } 36713e519524SHoward Hinnant else 36723e519524SHoward Hinnant { 3673be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__i)); 3674527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 36753e519524SHoward Hinnant ++__t; 36763e519524SHoward Hinnant } 36773e519524SHoward Hinnant } 36783e519524SHoward Hinnant // move *__last, known to be true 3679ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36803e519524SHoward Hinnant __i = ++__first; 36813e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 36823e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 36837fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3684ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 36853e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 36863e519524SHoward Hinnant return __first; 36873e519524SHoward Hinnant } 36883e519524SHoward Hinnant // Else not enough buffer, do in place 36893e519524SHoward Hinnant // __len >= 4 36903e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36913e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3692ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 36933e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 36943e519524SHoward Hinnant // F????????????????T 36953e519524SHoward Hinnant // f m l 36963e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 36973e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 36983e519524SHoward Hinnant _Distance __len_half = __len2; 36993e519524SHoward Hinnant while (!__pred(*--__m1)) 37003e519524SHoward Hinnant { 37013e519524SHoward Hinnant if (__m1 == __first) 37023e519524SHoward Hinnant goto __first_half_done; 37033e519524SHoward Hinnant --__len_half; 37043e519524SHoward Hinnant } 37053e519524SHoward Hinnant // F???TFFF?????????T 37063e519524SHoward Hinnant // f m1 m l 37073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 37081968804aSArthur O'Dwyer __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 37093e519524SHoward Hinnant__first_half_done: 37103e519524SHoward Hinnant // TTTFFFFF?????????T 37113e519524SHoward Hinnant // f ff m l 37123e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 37133e519524SHoward Hinnant __m1 = __m; 37143e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 37153e519524SHoward Hinnant ++__second_false; 37163e519524SHoward Hinnant __len_half = __len - __len2; 37173e519524SHoward Hinnant while (__pred(*__m1)) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant if (++__m1 == __last) 37203e519524SHoward Hinnant goto __second_half_done; 37213e519524SHoward Hinnant --__len_half; 37223e519524SHoward Hinnant } 37233e519524SHoward Hinnant // TTTFFFFFTTTF?????T 37243e519524SHoward Hinnant // f ff m m1 l 37251968804aSArthur O'Dwyer __second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 37263e519524SHoward Hinnant__second_half_done: 37273e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 37283e519524SHoward Hinnant // f ff m sf l 3729ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 37303e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 37313e519524SHoward Hinnant // | 37323e519524SHoward Hinnant} 37333e519524SHoward Hinnant 37343e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 37353e519524SHoward Hinnant_BidirectionalIterator 37363e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 37373e519524SHoward Hinnant bidirectional_iterator_tag) 37383e519524SHoward Hinnant{ 37393e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 37403e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 37413e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 37423e519524SHoward Hinnant // Either prove all true and return __first or point to first false 37433e519524SHoward Hinnant while (true) 37443e519524SHoward Hinnant { 37453e519524SHoward Hinnant if (__first == __last) 37463e519524SHoward Hinnant return __first; 37473e519524SHoward Hinnant if (!__pred(*__first)) 37483e519524SHoward Hinnant break; 37493e519524SHoward Hinnant ++__first; 37503e519524SHoward Hinnant } 37513e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 37523e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 37533e519524SHoward Hinnant do 37543e519524SHoward Hinnant { 37553e519524SHoward Hinnant if (__first == --__last) 37563e519524SHoward Hinnant return __first; 37573e519524SHoward Hinnant } while (!__pred(*__last)); 37583e519524SHoward Hinnant // We now have a reduced range [__first, __last] 37593e519524SHoward Hinnant // *__first is known to be false 37603e519524SHoward Hinnant // *__last is known to be true 37613e519524SHoward Hinnant // __len >= 2 3762ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 37633e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 37643e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 37653e519524SHoward Hinnant if (__len >= __alloc_limit) 37663e519524SHoward Hinnant { 3767ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 37683e519524SHoward Hinnant __h.reset(__p.first); 37693e519524SHoward Hinnant } 37701968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 37713e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 37723e519524SHoward Hinnant} 37733e519524SHoward Hinnant 37743e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 37753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37763e519524SHoward Hinnant_ForwardIterator 37773e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 37783e519524SHoward Hinnant{ 37791968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 37803e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 37813e519524SHoward Hinnant} 37823e519524SHoward Hinnant 37833e519524SHoward Hinnant// is_sorted_until 37843e519524SHoward Hinnant 37853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37861362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 37873e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37883e519524SHoward Hinnant{ 37893e519524SHoward Hinnant if (__first != __last) 37903e519524SHoward Hinnant { 37913e519524SHoward Hinnant _ForwardIterator __i = __first; 37923e519524SHoward Hinnant while (++__i != __last) 37933e519524SHoward Hinnant { 37943e519524SHoward Hinnant if (__comp(*__i, *__first)) 37953e519524SHoward Hinnant return __i; 37963e519524SHoward Hinnant __first = __i; 37973e519524SHoward Hinnant } 37983e519524SHoward Hinnant } 37993e519524SHoward Hinnant return __last; 38003e519524SHoward Hinnant} 38013e519524SHoward Hinnant 38023e519524SHoward Hinnanttemplate<class _ForwardIterator> 38031362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38041362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38053e519524SHoward Hinnant_ForwardIterator 38063e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 38073e519524SHoward Hinnant{ 3808ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 38093e519524SHoward Hinnant} 38103e519524SHoward Hinnant 38113e519524SHoward Hinnant// is_sorted 38123e519524SHoward Hinnant 38133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 38141362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38151362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38163e519524SHoward Hinnantbool 38173e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 38183e519524SHoward Hinnant{ 3819ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 38203e519524SHoward Hinnant} 38213e519524SHoward Hinnant 38223e519524SHoward Hinnanttemplate<class _ForwardIterator> 38231362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38241362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38253e519524SHoward Hinnantbool 38263e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 38273e519524SHoward Hinnant{ 3828ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 38293e519524SHoward Hinnant} 38303e519524SHoward Hinnant 38313e519524SHoward Hinnant// sort 38323e519524SHoward Hinnant 38333e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 38343e519524SHoward Hinnant 38353e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38363e519524SHoward Hinnantunsigned 38373e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 38383e519524SHoward Hinnant{ 38393e519524SHoward Hinnant unsigned __r = 0; 38403e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 38413e519524SHoward Hinnant { 38423e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 38433e519524SHoward Hinnant return __r; // x <= y && y <= z 38443e519524SHoward Hinnant // x <= y && y > z 38453e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 38463e519524SHoward Hinnant __r = 1; 38473e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 38483e519524SHoward Hinnant { 38493e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 38503e519524SHoward Hinnant __r = 2; 38513e519524SHoward Hinnant } 38523e519524SHoward Hinnant return __r; // x <= y && y < z 38533e519524SHoward Hinnant } 38543e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 38553e519524SHoward Hinnant { 38563e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 38573e519524SHoward Hinnant __r = 1; 38583e519524SHoward Hinnant return __r; 38593e519524SHoward Hinnant } 38603e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 38613e519524SHoward Hinnant __r = 1; // x < y && x <= z 38623e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 38633e519524SHoward Hinnant { 38643e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 38653e519524SHoward Hinnant __r = 2; 38663e519524SHoward Hinnant } 38673e519524SHoward Hinnant return __r; 38683e519524SHoward Hinnant} // x <= y && y <= z 38693e519524SHoward Hinnant 38703e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 38713e519524SHoward Hinnant 38723e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38733e519524SHoward Hinnantunsigned 38743e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38753e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 38763e519524SHoward Hinnant{ 38771968804aSArthur O'Dwyer unsigned __r = _VSTD::__sort3<_Compare>(__x1, __x2, __x3, __c); 38783e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38793e519524SHoward Hinnant { 38803e519524SHoward Hinnant swap(*__x3, *__x4); 38813e519524SHoward Hinnant ++__r; 38823e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38833e519524SHoward Hinnant { 38843e519524SHoward Hinnant swap(*__x2, *__x3); 38853e519524SHoward Hinnant ++__r; 38863e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38873e519524SHoward Hinnant { 38883e519524SHoward Hinnant swap(*__x1, *__x2); 38893e519524SHoward Hinnant ++__r; 38903e519524SHoward Hinnant } 38913e519524SHoward Hinnant } 38923e519524SHoward Hinnant } 38933e519524SHoward Hinnant return __r; 38943e519524SHoward Hinnant} 38953e519524SHoward Hinnant 38963e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 38973e519524SHoward Hinnant 38983e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3899835140a4SLouis Dionne_LIBCPP_HIDDEN 39003e519524SHoward Hinnantunsigned 39013e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 39023e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 39033e519524SHoward Hinnant{ 39041968804aSArthur O'Dwyer unsigned __r = _VSTD::__sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 39053e519524SHoward Hinnant if (__c(*__x5, *__x4)) 39063e519524SHoward Hinnant { 39073e519524SHoward Hinnant swap(*__x4, *__x5); 39083e519524SHoward Hinnant ++__r; 39093e519524SHoward Hinnant if (__c(*__x4, *__x3)) 39103e519524SHoward Hinnant { 39113e519524SHoward Hinnant swap(*__x3, *__x4); 39123e519524SHoward Hinnant ++__r; 39133e519524SHoward Hinnant if (__c(*__x3, *__x2)) 39143e519524SHoward Hinnant { 39153e519524SHoward Hinnant swap(*__x2, *__x3); 39163e519524SHoward Hinnant ++__r; 39173e519524SHoward Hinnant if (__c(*__x2, *__x1)) 39183e519524SHoward Hinnant { 39193e519524SHoward Hinnant swap(*__x1, *__x2); 39203e519524SHoward Hinnant ++__r; 39213e519524SHoward Hinnant } 39223e519524SHoward Hinnant } 39233e519524SHoward Hinnant } 39243e519524SHoward Hinnant } 39253e519524SHoward Hinnant return __r; 39263e519524SHoward Hinnant} 39273e519524SHoward Hinnant 39283e519524SHoward Hinnant// Assumes size > 0 39291d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 39303e519524SHoward Hinnantvoid 39311d7c39e1SArthur O'Dwyer__selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 39323e519524SHoward Hinnant{ 39331d7c39e1SArthur O'Dwyer _BidirectionalIterator __lm1 = __last; 39343e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 39353e519524SHoward Hinnant { 39361d7c39e1SArthur O'Dwyer _BidirectionalIterator __i = _VSTD::min_element<_BidirectionalIterator, 39373e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 39383e519524SHoward Hinnant (__first, __last, __comp); 39393e519524SHoward Hinnant if (__i != __first) 39403e519524SHoward Hinnant swap(*__first, *__i); 39413e519524SHoward Hinnant } 39423e519524SHoward Hinnant} 39433e519524SHoward Hinnant 39441d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 39453e519524SHoward Hinnantvoid 39461d7c39e1SArthur O'Dwyer__insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 39473e519524SHoward Hinnant{ 39481d7c39e1SArthur O'Dwyer typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39493e519524SHoward Hinnant if (__first != __last) 39503e519524SHoward Hinnant { 39511d7c39e1SArthur O'Dwyer _BidirectionalIterator __i = __first; 39523e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 39533e519524SHoward Hinnant { 39541d7c39e1SArthur O'Dwyer _BidirectionalIterator __j = __i; 3955ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 39561d7c39e1SArthur O'Dwyer for (_BidirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3957ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3958ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39593e519524SHoward Hinnant } 39603e519524SHoward Hinnant } 39613e519524SHoward Hinnant} 39623e519524SHoward Hinnant 39633e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39643e519524SHoward Hinnantvoid 39653e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39663e519524SHoward Hinnant{ 39673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39683e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39691968804aSArthur O'Dwyer _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); 39703e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39713e519524SHoward Hinnant { 39723e519524SHoward Hinnant if (__comp(*__i, *__j)) 39733e519524SHoward Hinnant { 3974ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39753e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39763e519524SHoward Hinnant __j = __i; 39773e519524SHoward Hinnant do 39783e519524SHoward Hinnant { 3979ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39803e519524SHoward Hinnant __j = __k; 39813e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3982ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39833e519524SHoward Hinnant } 39843e519524SHoward Hinnant __j = __i; 39853e519524SHoward Hinnant } 39863e519524SHoward Hinnant} 39873e519524SHoward Hinnant 39883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39893e519524SHoward Hinnantbool 39903e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39913e519524SHoward Hinnant{ 39923e519524SHoward Hinnant switch (__last - __first) 39933e519524SHoward Hinnant { 39943e519524SHoward Hinnant case 0: 39953e519524SHoward Hinnant case 1: 39963e519524SHoward Hinnant return true; 39973e519524SHoward Hinnant case 2: 39983e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39993e519524SHoward Hinnant swap(*__first, *__last); 40003e519524SHoward Hinnant return true; 40013e519524SHoward Hinnant case 3: 4002ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40033e519524SHoward Hinnant return true; 40043e519524SHoward Hinnant case 4: 4005ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40063e519524SHoward Hinnant return true; 40073e519524SHoward Hinnant case 5: 4008ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40093e519524SHoward Hinnant return true; 40103e519524SHoward Hinnant } 40113e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 40123e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 40131968804aSArthur O'Dwyer _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); 40143e519524SHoward Hinnant const unsigned __limit = 8; 40153e519524SHoward Hinnant unsigned __count = 0; 40163e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 40173e519524SHoward Hinnant { 40183e519524SHoward Hinnant if (__comp(*__i, *__j)) 40193e519524SHoward Hinnant { 4020ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 40213e519524SHoward Hinnant _RandomAccessIterator __k = __j; 40223e519524SHoward Hinnant __j = __i; 40233e519524SHoward Hinnant do 40243e519524SHoward Hinnant { 4025ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 40263e519524SHoward Hinnant __j = __k; 40273e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 4028ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 40293e519524SHoward Hinnant if (++__count == __limit) 40303e519524SHoward Hinnant return ++__i == __last; 40313e519524SHoward Hinnant } 40323e519524SHoward Hinnant __j = __i; 40333e519524SHoward Hinnant } 40343e519524SHoward Hinnant return true; 40353e519524SHoward Hinnant} 40363e519524SHoward Hinnant 40371d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 40383e519524SHoward Hinnantvoid 40391d7c39e1SArthur O'Dwyer__insertion_sort_move(_BidirectionalIterator __first1, _BidirectionalIterator __last1, 40401d7c39e1SArthur O'Dwyer typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) 40413e519524SHoward Hinnant{ 40421d7c39e1SArthur O'Dwyer typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40433e519524SHoward Hinnant if (__first1 != __last1) 40443e519524SHoward Hinnant { 40453e519524SHoward Hinnant __destruct_n __d(0); 40463e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 40473e519524SHoward Hinnant value_type* __last2 = __first2; 4048be4c657bSArthur O'Dwyer ::new ((void*)__last2) value_type(_VSTD::move(*__first1)); 4049527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40503e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 40513e519524SHoward Hinnant { 40523e519524SHoward Hinnant value_type* __j2 = __last2; 40533e519524SHoward Hinnant value_type* __i2 = __j2; 40543e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 40553e519524SHoward Hinnant { 4056be4c657bSArthur O'Dwyer ::new ((void*)__j2) value_type(_VSTD::move(*__i2)); 4057527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40583e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 4059ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 4060ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 40613e519524SHoward Hinnant } 40623e519524SHoward Hinnant else 40633e519524SHoward Hinnant { 4064be4c657bSArthur O'Dwyer ::new ((void*)__j2) value_type(_VSTD::move(*__first1)); 4065527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40663e519524SHoward Hinnant } 40673e519524SHoward Hinnant } 40683e519524SHoward Hinnant __h.release(); 40693e519524SHoward Hinnant } 40703e519524SHoward Hinnant} 40713e519524SHoward Hinnant 40723e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 40733e519524SHoward Hinnantvoid 40743e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40753e519524SHoward Hinnant{ 40763e519524SHoward Hinnant // _Compare is known to be a reference type 40773e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 40783e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4079ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 4080ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 40813e519524SHoward Hinnant while (true) 40823e519524SHoward Hinnant { 40833e519524SHoward Hinnant __restart: 40843e519524SHoward Hinnant difference_type __len = __last - __first; 40853e519524SHoward Hinnant switch (__len) 40863e519524SHoward Hinnant { 40873e519524SHoward Hinnant case 0: 40883e519524SHoward Hinnant case 1: 40893e519524SHoward Hinnant return; 40903e519524SHoward Hinnant case 2: 40913e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40923e519524SHoward Hinnant swap(*__first, *__last); 40933e519524SHoward Hinnant return; 40943e519524SHoward Hinnant case 3: 4095ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40963e519524SHoward Hinnant return; 40973e519524SHoward Hinnant case 4: 4098ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40993e519524SHoward Hinnant return; 41003e519524SHoward Hinnant case 5: 4101ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 41023e519524SHoward Hinnant return; 41033e519524SHoward Hinnant } 41043e519524SHoward Hinnant if (__len <= __limit) 41053e519524SHoward Hinnant { 4106ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 41073e519524SHoward Hinnant return; 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant // __len > 5 41103e519524SHoward Hinnant _RandomAccessIterator __m = __first; 41113e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 41123e519524SHoward Hinnant --__lm1; 41133e519524SHoward Hinnant unsigned __n_swaps; 41143e519524SHoward Hinnant { 41153e519524SHoward Hinnant difference_type __delta; 41163e519524SHoward Hinnant if (__len >= 1000) 41173e519524SHoward Hinnant { 41183e519524SHoward Hinnant __delta = __len/2; 41193e519524SHoward Hinnant __m += __delta; 41203e519524SHoward Hinnant __delta /= 2; 4121ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 41223e519524SHoward Hinnant } 41233e519524SHoward Hinnant else 41243e519524SHoward Hinnant { 41253e519524SHoward Hinnant __delta = __len/2; 41263e519524SHoward Hinnant __m += __delta; 4127ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 41283e519524SHoward Hinnant } 41293e519524SHoward Hinnant } 41303e519524SHoward Hinnant // *__m is median 41313e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 41323e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 41333e519524SHoward Hinnant _RandomAccessIterator __i = __first; 41343e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 41353e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41363e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 41373e519524SHoward Hinnant // Prime the downward search with a guard. 41383e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 41393e519524SHoward Hinnant { 41403e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 41413e519524SHoward Hinnant // manually guard downward moving __j against __i 41423e519524SHoward Hinnant while (true) 41433e519524SHoward Hinnant { 41443e519524SHoward Hinnant if (__i == --__j) 41453e519524SHoward Hinnant { 41463e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 41473e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 41483e519524SHoward Hinnant ++__i; // __first + 1 41493e519524SHoward Hinnant __j = __last; 41503e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 41513e519524SHoward Hinnant { 41523e519524SHoward Hinnant while (true) 41533e519524SHoward Hinnant { 41543e519524SHoward Hinnant if (__i == __j) 41553e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 41563e519524SHoward Hinnant if (__comp(*__first, *__i)) 41573e519524SHoward Hinnant { 41583e519524SHoward Hinnant swap(*__i, *__j); 41593e519524SHoward Hinnant ++__n_swaps; 41603e519524SHoward Hinnant ++__i; 41613e519524SHoward Hinnant break; 41623e519524SHoward Hinnant } 41633e519524SHoward Hinnant ++__i; 41643e519524SHoward Hinnant } 41653e519524SHoward Hinnant } 41663e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 41673e519524SHoward Hinnant if (__i == __j) 41683e519524SHoward Hinnant return; 41693e519524SHoward Hinnant while (true) 41703e519524SHoward Hinnant { 41713e519524SHoward Hinnant while (!__comp(*__first, *__i)) 41723e519524SHoward Hinnant ++__i; 41733e519524SHoward Hinnant while (__comp(*__first, *--__j)) 41743e519524SHoward Hinnant ; 41753e519524SHoward Hinnant if (__i >= __j) 41763e519524SHoward Hinnant break; 41773e519524SHoward Hinnant swap(*__i, *__j); 41783e519524SHoward Hinnant ++__n_swaps; 41793e519524SHoward Hinnant ++__i; 41803e519524SHoward Hinnant } 41813e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 4182b6f19174SArthur O'Dwyer // The first part is sorted, sort the second part 4183ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 41843e519524SHoward Hinnant __first = __i; 41853e519524SHoward Hinnant goto __restart; 41863e519524SHoward Hinnant } 41873e519524SHoward Hinnant if (__comp(*__j, *__m)) 41883e519524SHoward Hinnant { 41893e519524SHoward Hinnant swap(*__i, *__j); 41903e519524SHoward Hinnant ++__n_swaps; 41913e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 41923e519524SHoward Hinnant } 41933e519524SHoward Hinnant } 41943e519524SHoward Hinnant } 41953e519524SHoward Hinnant // It is known that *__i < *__m 41963e519524SHoward Hinnant ++__i; 41973e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41983e519524SHoward Hinnant // if not yet partitioned... 41993e519524SHoward Hinnant if (__i < __j) 42003e519524SHoward Hinnant { 42013e519524SHoward Hinnant // known that *(__i - 1) < *__m 42023e519524SHoward Hinnant // known that __i <= __m 42033e519524SHoward Hinnant while (true) 42043e519524SHoward Hinnant { 42053e519524SHoward Hinnant // __m still guards upward moving __i 42063e519524SHoward Hinnant while (__comp(*__i, *__m)) 42073e519524SHoward Hinnant ++__i; 42083e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 42093e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 42103e519524SHoward Hinnant ; 42113e519524SHoward Hinnant if (__i > __j) 42123e519524SHoward Hinnant break; 42133e519524SHoward Hinnant swap(*__i, *__j); 42143e519524SHoward Hinnant ++__n_swaps; 42153e519524SHoward Hinnant // It is known that __m != __j 42163e519524SHoward Hinnant // If __m just moved, follow it 42173e519524SHoward Hinnant if (__m == __i) 42183e519524SHoward Hinnant __m = __j; 42193e519524SHoward Hinnant ++__i; 42203e519524SHoward Hinnant } 42213e519524SHoward Hinnant } 42223e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 42233e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 42243e519524SHoward Hinnant { 42253e519524SHoward Hinnant swap(*__i, *__m); 42263e519524SHoward Hinnant ++__n_swaps; 42273e519524SHoward Hinnant } 42283e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 42293e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 42303e519524SHoward Hinnant if (__n_swaps == 0) 42313e519524SHoward Hinnant { 4232ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4233ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 42343e519524SHoward Hinnant { 42353e519524SHoward Hinnant if (__fs) 42363e519524SHoward Hinnant return; 42373e519524SHoward Hinnant __last = __i; 42383e519524SHoward Hinnant continue; 42393e519524SHoward Hinnant } 42403e519524SHoward Hinnant else 42413e519524SHoward Hinnant { 42423e519524SHoward Hinnant if (__fs) 42433e519524SHoward Hinnant { 42443e519524SHoward Hinnant __first = ++__i; 42453e519524SHoward Hinnant continue; 42463e519524SHoward Hinnant } 42473e519524SHoward Hinnant } 42483e519524SHoward Hinnant } 42493e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 42503e519524SHoward Hinnant if (__i - __first < __last - __i) 42513e519524SHoward Hinnant { 4252ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4253ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 42543e519524SHoward Hinnant __first = ++__i; 42553e519524SHoward Hinnant } 42563e519524SHoward Hinnant else 42573e519524SHoward Hinnant { 4258ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4259ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 42603e519524SHoward Hinnant __last = __i; 42613e519524SHoward Hinnant } 42623e519524SHoward Hinnant } 42633e519524SHoward Hinnant} 42643e519524SHoward Hinnant 42653e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 42663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 42673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42683e519524SHoward Hinnantvoid 42693e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 42703e519524SHoward Hinnant{ 4271aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4272aa1cad15SEric Fiselier _VSTD::__sort<_Comp_ref>(__first, __last, _Comp_ref(__comp)); 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42773e519524SHoward Hinnantvoid 42783e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 42793e519524SHoward Hinnant{ 4280ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42813e519524SHoward Hinnant} 42823e519524SHoward Hinnant 42833e519524SHoward Hinnanttemplate <class _Tp> 42843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42853e519524SHoward Hinnantvoid 42863e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 42873e519524SHoward Hinnant{ 4288297c839eSBrett Gutstein _VSTD::sort((uintptr_t*)__first, (uintptr_t*)__last, __less<uintptr_t>()); 42893e519524SHoward Hinnant} 42903e519524SHoward Hinnant 42913e519524SHoward Hinnanttemplate <class _Tp> 42923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42933e519524SHoward Hinnantvoid 42943e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 42953e519524SHoward Hinnant{ 4296ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 42973e519524SHoward Hinnant} 42983e519524SHoward Hinnant 4299f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4300f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4301f554add5SHoward Hinnantvoid 4302f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4303f554add5SHoward Hinnant{ 4304f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4305f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4306f554add5SHoward Hinnant} 4307f554add5SHoward Hinnant 4308f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4309f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4310f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4311f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4312f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4313f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4314f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4315f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4316f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4317f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4318f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4319f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4320f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4321f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4322f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 43233e519524SHoward Hinnant 4324f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4325f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4326f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4327f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4328f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4329f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4330f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4331f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4332f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4333f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4334f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4335f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long long>&, unsigned long long*>(unsigned long long*, unsigned long long*, __less<unsigned long long>&)) 4336f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4337f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4338f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 43393e519524SHoward Hinnant 4340f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS unsigned __sort5<__less<long double>&, long double*>(long double*, long double*, long double*, long double*, long double*, __less<long double>&)) 43413e519524SHoward Hinnant 43423e519524SHoward Hinnant// lower_bound 43433e519524SHoward Hinnant 43443e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4345d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4346e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43473e519524SHoward Hinnant{ 43483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4349ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43503e519524SHoward Hinnant while (__len != 0) 43513e519524SHoward Hinnant { 435204695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 43533e519524SHoward Hinnant _ForwardIterator __m = __first; 4354ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4355e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43563e519524SHoward Hinnant { 43573e519524SHoward Hinnant __first = ++__m; 43583e519524SHoward Hinnant __len -= __l2 + 1; 43593e519524SHoward Hinnant } 43603e519524SHoward Hinnant else 43613e519524SHoward Hinnant __len = __l2; 43623e519524SHoward Hinnant } 43633e519524SHoward Hinnant return __first; 43643e519524SHoward Hinnant} 43653e519524SHoward Hinnant 43663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43671362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43681362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43693e519524SHoward Hinnant_ForwardIterator 4370e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43713e519524SHoward Hinnant{ 43723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43731968804aSArthur O'Dwyer return _VSTD::__lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 43743e519524SHoward Hinnant} 43753e519524SHoward Hinnant 43763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43793e519524SHoward Hinnant_ForwardIterator 4380e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43813e519524SHoward Hinnant{ 4382e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 43833e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43843e519524SHoward Hinnant} 43853e519524SHoward Hinnant 43863e519524SHoward Hinnant// upper_bound 43873e519524SHoward Hinnant 43883e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4389d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4390e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43913e519524SHoward Hinnant{ 43923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4393ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43943e519524SHoward Hinnant while (__len != 0) 43953e519524SHoward Hinnant { 439604695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 43973e519524SHoward Hinnant _ForwardIterator __m = __first; 4398ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4399e4383379SHoward Hinnant if (__comp(__value_, *__m)) 44003e519524SHoward Hinnant __len = __l2; 44013e519524SHoward Hinnant else 44023e519524SHoward Hinnant { 44033e519524SHoward Hinnant __first = ++__m; 44043e519524SHoward Hinnant __len -= __l2 + 1; 44053e519524SHoward Hinnant } 44063e519524SHoward Hinnant } 44073e519524SHoward Hinnant return __first; 44083e519524SHoward Hinnant} 44093e519524SHoward Hinnant 44103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44111362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44121362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44133e519524SHoward Hinnant_ForwardIterator 4414e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44153e519524SHoward Hinnant{ 44163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 44171968804aSArthur O'Dwyer return _VSTD::__upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 44183e519524SHoward Hinnant} 44193e519524SHoward Hinnant 44203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44211362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44221362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44233e519524SHoward Hinnant_ForwardIterator 4424e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44253e519524SHoward Hinnant{ 4426e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 44273e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 44283e519524SHoward Hinnant} 44293e519524SHoward Hinnant 44303e519524SHoward Hinnant// equal_range 44313e519524SHoward Hinnant 44323e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4433d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4434e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44353e519524SHoward Hinnant{ 44363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4437ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 44383e519524SHoward Hinnant while (__len != 0) 44393e519524SHoward Hinnant { 444004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 44413e519524SHoward Hinnant _ForwardIterator __m = __first; 4442ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4443e4383379SHoward Hinnant if (__comp(*__m, __value_)) 44443e519524SHoward Hinnant { 44453e519524SHoward Hinnant __first = ++__m; 44463e519524SHoward Hinnant __len -= __l2 + 1; 44473e519524SHoward Hinnant } 4448e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 44493e519524SHoward Hinnant { 44503e519524SHoward Hinnant __last = __m; 44513e519524SHoward Hinnant __len = __l2; 44523e519524SHoward Hinnant } 44533e519524SHoward Hinnant else 44543e519524SHoward Hinnant { 44553e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 44563e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 44573e519524SHoward Hinnant ( 44581968804aSArthur O'Dwyer _VSTD::__lower_bound<_Compare>(__first, __m, __value_, __comp), 44591968804aSArthur O'Dwyer _VSTD::__upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 44603e519524SHoward Hinnant ); 44613e519524SHoward Hinnant } 44623e519524SHoward Hinnant } 44633e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 44643e519524SHoward Hinnant} 44653e519524SHoward Hinnant 44663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44671362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44681362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44693e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4470e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44713e519524SHoward Hinnant{ 4472aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 44731968804aSArthur O'Dwyer return _VSTD::__equal_range<_Comp_ref>(__first, __last, __value_, __comp); 44743e519524SHoward Hinnant} 44753e519524SHoward Hinnant 44763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44771362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44781362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44793e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4480e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44813e519524SHoward Hinnant{ 4482e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44833e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44843e519524SHoward Hinnant} 44853e519524SHoward Hinnant 44863e519524SHoward Hinnant// binary_search 44873e519524SHoward Hinnant 44883e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4489d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44903e519524SHoward Hinnantbool 4491e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44923e519524SHoward Hinnant{ 44931968804aSArthur O'Dwyer __first = _VSTD::__lower_bound<_Compare>(__first, __last, __value_, __comp); 4494e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44953e519524SHoward Hinnant} 44963e519524SHoward Hinnant 44973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44981362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44991362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45003e519524SHoward Hinnantbool 4501e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 45023e519524SHoward Hinnant{ 4503aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 45041968804aSArthur O'Dwyer return _VSTD::__binary_search<_Comp_ref>(__first, __last, __value_, __comp); 45053e519524SHoward Hinnant} 45063e519524SHoward Hinnant 45073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 45081362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 45091362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45103e519524SHoward Hinnantbool 4511e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 45123e519524SHoward Hinnant{ 4513e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 45143e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 45153e519524SHoward Hinnant} 45163e519524SHoward Hinnant 45173e519524SHoward Hinnant// merge 45183e519524SHoward Hinnant 45193e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 4520b552a302SNicholas-Baron_LIBCPP_CONSTEXPR_AFTER_CXX17 45213e519524SHoward Hinnant_OutputIterator 45223e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 45233e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 45243e519524SHoward Hinnant{ 45253e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45263e519524SHoward Hinnant { 45273e519524SHoward Hinnant if (__first2 == __last2) 4528ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 45293e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45303e519524SHoward Hinnant { 45313e519524SHoward Hinnant *__result = *__first2; 45323e519524SHoward Hinnant ++__first2; 45333e519524SHoward Hinnant } 45343e519524SHoward Hinnant else 45353e519524SHoward Hinnant { 45363e519524SHoward Hinnant *__result = *__first1; 45373e519524SHoward Hinnant ++__first1; 45383e519524SHoward Hinnant } 45393e519524SHoward Hinnant } 4540ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 45413e519524SHoward Hinnant} 45423e519524SHoward Hinnant 45433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 4544b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45453e519524SHoward Hinnant_OutputIterator 45463e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 45483e519524SHoward Hinnant{ 4549aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4550ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 45513e519524SHoward Hinnant} 45523e519524SHoward Hinnant 45533e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 4554b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45553e519524SHoward Hinnant_OutputIterator 45563e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45573e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 45583e519524SHoward Hinnant{ 45593e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 45603e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 45614f41779cSMarshall Clow return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 45623e519524SHoward Hinnant} 45633e519524SHoward Hinnant 45643e519524SHoward Hinnant// inplace_merge 45653e519524SHoward Hinnant 4566adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4567adfdae18SMarshall Clow class _OutputIterator> 4568adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4569adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4570adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4571adfdae18SMarshall Clow{ 4572adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4573adfdae18SMarshall Clow { 4574adfdae18SMarshall Clow if (__first2 == __last2) 4575adfdae18SMarshall Clow { 4576adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4577adfdae18SMarshall Clow return; 4578adfdae18SMarshall Clow } 4579adfdae18SMarshall Clow 4580adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4581adfdae18SMarshall Clow { 4582adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4583adfdae18SMarshall Clow ++__first2; 4584adfdae18SMarshall Clow } 4585adfdae18SMarshall Clow else 4586adfdae18SMarshall Clow { 4587adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4588adfdae18SMarshall Clow ++__first1; 4589adfdae18SMarshall Clow } 4590adfdae18SMarshall Clow } 4591adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4592adfdae18SMarshall Clow} 4593adfdae18SMarshall Clow 45943e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45953e519524SHoward Hinnantvoid 45963e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45973e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45983e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45993e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 46003e519524SHoward Hinnant{ 46013e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46023e519524SHoward Hinnant __destruct_n __d(0); 46033e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46043e519524SHoward Hinnant if (__len1 <= __len2) 46053e519524SHoward Hinnant { 46063e519524SHoward Hinnant value_type* __p = __buff; 4607527a7fdfSBruce Mitchener for (_BidirectionalIterator __i = __first; __i != __middle; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p) 4608be4c657bSArthur O'Dwyer ::new ((void*)__p) value_type(_VSTD::move(*__i)); 4609eef4bdbbSArthur O'Dwyer _VSTD::__half_inplace_merge<_Compare>(__buff, __p, __middle, __last, __first, __comp); 46103e519524SHoward Hinnant } 46113e519524SHoward Hinnant else 46123e519524SHoward Hinnant { 46133e519524SHoward Hinnant value_type* __p = __buff; 4614527a7fdfSBruce Mitchener for (_BidirectionalIterator __i = __middle; __i != __last; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p) 4615be4c657bSArthur O'Dwyer ::new ((void*)__p) value_type(_VSTD::move(*__i)); 46163e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 46173e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4618eef4bdbbSArthur O'Dwyer typedef __invert<_Compare> _Inverted; 4619eef4bdbbSArthur O'Dwyer _VSTD::__half_inplace_merge<_Inverted>(_Rv(__p), _Rv(__buff), 4620adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4621eef4bdbbSArthur O'Dwyer _RBi(__last), _Inverted(__comp)); 46223e519524SHoward Hinnant } 46233e519524SHoward Hinnant} 46243e519524SHoward Hinnant 46253e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 46263e519524SHoward Hinnantvoid 46273e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46283e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 46293e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 46303e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 46313e519524SHoward Hinnant{ 46323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 46333e519524SHoward Hinnant while (true) 46343e519524SHoward Hinnant { 46353e519524SHoward Hinnant // if __middle == __last, we're done 46363e519524SHoward Hinnant if (__len2 == 0) 46373e519524SHoward Hinnant return; 4638526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 46391968804aSArthur O'Dwyer return _VSTD::__buffered_inplace_merge<_Compare> 4640526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 46413e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4642910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 46433e519524SHoward Hinnant { 46443e519524SHoward Hinnant if (__len1 == 0) 46453e519524SHoward Hinnant return; 46463e519524SHoward Hinnant if (__comp(*__middle, *__first)) 46473e519524SHoward Hinnant break; 46483e519524SHoward Hinnant } 46493e519524SHoward Hinnant // __first < __middle < __last 46503e519524SHoward Hinnant // *__first > *__middle 46513e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 46523e519524SHoward Hinnant // all elements in: 46533e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 46543e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 46553e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 46563e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 46573e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 46583e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 46593e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 46603e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 46613e519524SHoward Hinnant // binary search smaller range 46623e519524SHoward Hinnant if (__len1 < __len2) 46633e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 46643e519524SHoward Hinnant __len21 = __len2 / 2; 46653e519524SHoward Hinnant __m2 = __middle; 4666ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 46671968804aSArthur O'Dwyer __m1 = _VSTD::__upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4668ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46693e519524SHoward Hinnant } 46703e519524SHoward Hinnant else 46713e519524SHoward Hinnant { 46723e519524SHoward Hinnant if (__len1 == 1) 46733e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46743e519524SHoward Hinnant // It is known *__first > *__middle 46753e519524SHoward Hinnant swap(*__first, *__middle); 46763e519524SHoward Hinnant return; 46773e519524SHoward Hinnant } 46783e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46793e519524SHoward Hinnant __len11 = __len1 / 2; 46803e519524SHoward Hinnant __m1 = __first; 4681ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46821968804aSArthur O'Dwyer __m2 = _VSTD::__lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4683ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46843e519524SHoward Hinnant } 46853e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46863e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46873e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46883e519524SHoward Hinnant // swap middle two partitions 4689ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46903e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 4691b6f19174SArthur O'Dwyer // merge smaller range with recursive call and larger with tail recursion elimination 46923e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46933e519524SHoward Hinnant { 46941968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46951968804aSArthur O'Dwyer// _VSTD::__inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46963e519524SHoward Hinnant __first = __middle; 46973e519524SHoward Hinnant __middle = __m2; 46983e519524SHoward Hinnant __len1 = __len12; 46993e519524SHoward Hinnant __len2 = __len22; 47003e519524SHoward Hinnant } 47013e519524SHoward Hinnant else 47023e519524SHoward Hinnant { 47031968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 47041968804aSArthur O'Dwyer// _VSTD::__inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 47053e519524SHoward Hinnant __last = __middle; 47063e519524SHoward Hinnant __middle = __m1; 47073e519524SHoward Hinnant __len1 = __len11; 47083e519524SHoward Hinnant __len2 = __len21; 47093e519524SHoward Hinnant } 47103e519524SHoward Hinnant } 47113e519524SHoward Hinnant} 47123e519524SHoward Hinnant 47133e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 47143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47153e519524SHoward Hinnantvoid 47163e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 47173e519524SHoward Hinnant _Compare __comp) 47183e519524SHoward Hinnant{ 47193e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 47203e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4721ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4722ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4723ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 47240b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 47250b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 4726aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4727ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 47283e519524SHoward Hinnant __buf.first, __buf.second); 47293e519524SHoward Hinnant} 47303e519524SHoward Hinnant 47313e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 47323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47333e519524SHoward Hinnantvoid 47343e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 47353e519524SHoward Hinnant{ 4736ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 47373e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 47383e519524SHoward Hinnant} 47393e519524SHoward Hinnant 47403e519524SHoward Hinnant// stable_sort 47413e519524SHoward Hinnant 47423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47433e519524SHoward Hinnantvoid 47443e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 47453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47463e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 47473e519524SHoward Hinnant{ 47483e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 47493e519524SHoward Hinnant __destruct_n __d(0); 47503e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 47513e519524SHoward Hinnant for (; true; ++__result) 47523e519524SHoward Hinnant { 47533e519524SHoward Hinnant if (__first1 == __last1) 47543e519524SHoward Hinnant { 4755527a7fdfSBruce Mitchener for (; __first2 != __last2; ++__first2, ++__result, (void)__d.template __incr<value_type>()) 4756be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first2)); 47573e519524SHoward Hinnant __h.release(); 47583e519524SHoward Hinnant return; 47593e519524SHoward Hinnant } 47603e519524SHoward Hinnant if (__first2 == __last2) 47613e519524SHoward Hinnant { 4762527a7fdfSBruce Mitchener for (; __first1 != __last1; ++__first1, ++__result, (void)__d.template __incr<value_type>()) 4763be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first1)); 47643e519524SHoward Hinnant __h.release(); 47653e519524SHoward Hinnant return; 47663e519524SHoward Hinnant } 47673e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47683e519524SHoward Hinnant { 4769be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first2)); 4770527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 47713e519524SHoward Hinnant ++__first2; 47723e519524SHoward Hinnant } 47733e519524SHoward Hinnant else 47743e519524SHoward Hinnant { 4775be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first1)); 4776527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 47773e519524SHoward Hinnant ++__first1; 47783e519524SHoward Hinnant } 47793e519524SHoward Hinnant } 47803e519524SHoward Hinnant} 47813e519524SHoward Hinnant 47823e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47833e519524SHoward Hinnantvoid 47843e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47863e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47873e519524SHoward Hinnant{ 47883e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47893e519524SHoward Hinnant { 47903e519524SHoward Hinnant if (__first2 == __last2) 47913e519524SHoward Hinnant { 47927fa68653SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__result) 4793ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47943e519524SHoward Hinnant return; 47953e519524SHoward Hinnant } 47963e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47973e519524SHoward Hinnant { 4798ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47993e519524SHoward Hinnant ++__first2; 48003e519524SHoward Hinnant } 48013e519524SHoward Hinnant else 48023e519524SHoward Hinnant { 4803ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 48043e519524SHoward Hinnant ++__first1; 48053e519524SHoward Hinnant } 48063e519524SHoward Hinnant } 48077fa68653SMarshall Clow for (; __first2 != __last2; ++__first2, (void) ++__result) 4808ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 48093e519524SHoward Hinnant} 48103e519524SHoward Hinnant 48113e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48123e519524SHoward Hinnantvoid 48133e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48153e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 48163e519524SHoward Hinnant 48173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48183e519524SHoward Hinnantvoid 48193e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 48203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48213e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 48223e519524SHoward Hinnant{ 48233e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48243e519524SHoward Hinnant switch (__len) 48253e519524SHoward Hinnant { 48263e519524SHoward Hinnant case 0: 48273e519524SHoward Hinnant return; 48283e519524SHoward Hinnant case 1: 4829be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 48303e519524SHoward Hinnant return; 48313e519524SHoward Hinnant case 2: 48323e519524SHoward Hinnant __destruct_n __d(0); 48333e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 48343e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 48353e519524SHoward Hinnant { 4836be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__last1)); 4837527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 48383e519524SHoward Hinnant ++__first2; 4839be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 48403e519524SHoward Hinnant } 48413e519524SHoward Hinnant else 48423e519524SHoward Hinnant { 4843be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 4844527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 48453e519524SHoward Hinnant ++__first2; 4846be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__last1)); 48473e519524SHoward Hinnant } 48483e519524SHoward Hinnant __h2.release(); 48493e519524SHoward Hinnant return; 48503e519524SHoward Hinnant } 48513e519524SHoward Hinnant if (__len <= 8) 48523e519524SHoward Hinnant { 48531968804aSArthur O'Dwyer _VSTD::__insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 48543e519524SHoward Hinnant return; 48553e519524SHoward Hinnant } 48563e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48573e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 48581968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 48591968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 48601968804aSArthur O'Dwyer _VSTD::__merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48613e519524SHoward Hinnant} 48623e519524SHoward Hinnant 48633e519524SHoward Hinnanttemplate <class _Tp> 48643e519524SHoward Hinnantstruct __stable_sort_switch 48653e519524SHoward Hinnant{ 4866ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48673e519524SHoward Hinnant}; 48683e519524SHoward Hinnant 48693e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48703e519524SHoward Hinnantvoid 48713e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48743e519524SHoward Hinnant{ 48753e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48763e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48773e519524SHoward Hinnant switch (__len) 48783e519524SHoward Hinnant { 48793e519524SHoward Hinnant case 0: 48803e519524SHoward Hinnant case 1: 48813e519524SHoward Hinnant return; 48823e519524SHoward Hinnant case 2: 48833e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48843e519524SHoward Hinnant swap(*__first, *__last); 48853e519524SHoward Hinnant return; 48863e519524SHoward Hinnant } 48873e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48883e519524SHoward Hinnant { 48891968804aSArthur O'Dwyer _VSTD::__insertion_sort<_Compare>(__first, __last, __comp); 48903e519524SHoward Hinnant return; 48913e519524SHoward Hinnant } 48923e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48933e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48943e519524SHoward Hinnant if (__len <= __buff_size) 48953e519524SHoward Hinnant { 48963e519524SHoward Hinnant __destruct_n __d(0); 48973e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48981968804aSArthur O'Dwyer _VSTD::__stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 4899527a7fdfSBruce Mitchener __d.__set(__l2, (value_type*)nullptr); 49001968804aSArthur O'Dwyer _VSTD::__stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 4901527a7fdfSBruce Mitchener __d.__set(__len, (value_type*)nullptr); 49021968804aSArthur O'Dwyer _VSTD::__merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 49031968804aSArthur O'Dwyer// _VSTD::__merge<_Compare>(move_iterator<value_type*>(__buff), 49043e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 49053e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 49063e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 49073e519524SHoward Hinnant// __first, __comp); 49083e519524SHoward Hinnant return; 49093e519524SHoward Hinnant } 49101968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 49111968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 49121968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 49133e519524SHoward Hinnant} 49143e519524SHoward Hinnant 49153e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49173e519524SHoward Hinnantvoid 49183e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49193e519524SHoward Hinnant{ 49203e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49213e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49223e519524SHoward Hinnant difference_type __len = __last - __first; 49233e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 49243e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 49253e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 49263e519524SHoward Hinnant { 4927ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 49283e519524SHoward Hinnant __h.reset(__buf.first); 49293e519524SHoward Hinnant } 4930aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 49311968804aSArthur O'Dwyer _VSTD::__stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 49323e519524SHoward Hinnant} 49333e519524SHoward Hinnant 49343e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49363e519524SHoward Hinnantvoid 49373e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 49383e519524SHoward Hinnant{ 4939ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49403e519524SHoward Hinnant} 49413e519524SHoward Hinnant 49423e519524SHoward Hinnant// is_heap_until 49433e519524SHoward Hinnant 49443e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49451362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 49463e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49473e519524SHoward Hinnant{ 4948ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49493e519524SHoward Hinnant difference_type __len = __last - __first; 49503e519524SHoward Hinnant difference_type __p = 0; 49513e519524SHoward Hinnant difference_type __c = 1; 49523e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 49533e519524SHoward Hinnant while (__c < __len) 49543e519524SHoward Hinnant { 49553e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49563e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49573e519524SHoward Hinnant return __cp; 49583e519524SHoward Hinnant ++__c; 49593e519524SHoward Hinnant ++__cp; 49603e519524SHoward Hinnant if (__c == __len) 49613e519524SHoward Hinnant return __last; 49623e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49633e519524SHoward Hinnant return __cp; 49643e519524SHoward Hinnant ++__p; 49653e519524SHoward Hinnant ++__pp; 49663e519524SHoward Hinnant __c = 2 * __p + 1; 49673e519524SHoward Hinnant } 49683e519524SHoward Hinnant return __last; 49693e519524SHoward Hinnant} 49703e519524SHoward Hinnant 49713e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49721362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49731362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49743e519524SHoward Hinnant_RandomAccessIterator 49753e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49763e519524SHoward Hinnant{ 4977ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49783e519524SHoward Hinnant} 49793e519524SHoward Hinnant 49803e519524SHoward Hinnant// is_heap 49813e519524SHoward Hinnant 49823e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49831362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49841362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49853e519524SHoward Hinnantbool 49863e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49873e519524SHoward Hinnant{ 4988ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49893e519524SHoward Hinnant} 49903e519524SHoward Hinnant 49913e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49921362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49931362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49943e519524SHoward Hinnantbool 49953e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49963e519524SHoward Hinnant{ 4997ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49983e519524SHoward Hinnant} 49993e519524SHoward Hinnant 50003e519524SHoward Hinnant// push_heap 50013e519524SHoward Hinnant 50023e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50033e519524SHoward Hinnantvoid 50048b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50053e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50063e519524SHoward Hinnant{ 50073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50083e519524SHoward Hinnant if (__len > 1) 50093e519524SHoward Hinnant { 50103e519524SHoward Hinnant __len = (__len - 2) / 2; 50113e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 50123e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 50133e519524SHoward Hinnant { 5014ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 50153e519524SHoward Hinnant do 50163e519524SHoward Hinnant { 5017ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 50183e519524SHoward Hinnant __last = __ptr; 50193e519524SHoward Hinnant if (__len == 0) 50203e519524SHoward Hinnant break; 50213e519524SHoward Hinnant __len = (__len - 1) / 2; 50223e519524SHoward Hinnant __ptr = __first + __len; 50233e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 5024ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 50253e519524SHoward Hinnant } 50263e519524SHoward Hinnant } 50273e519524SHoward Hinnant} 50283e519524SHoward Hinnant 50293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50313e519524SHoward Hinnantvoid 50323e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50333e519524SHoward Hinnant{ 5034aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50351968804aSArthur O'Dwyer _VSTD::__sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 50363e519524SHoward Hinnant} 50373e519524SHoward Hinnant 50383e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50403e519524SHoward Hinnantvoid 50413e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50423e519524SHoward Hinnant{ 5043ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50443e519524SHoward Hinnant} 50453e519524SHoward Hinnant 50463e519524SHoward Hinnant// pop_heap 50473e519524SHoward Hinnant 50483e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50498b512602SDavid Majnemervoid 5050fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 5051fd838227SEric Fiselier _Compare __comp, 50528b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50538b512602SDavid Majnemer _RandomAccessIterator __start) 50548b512602SDavid Majnemer{ 50558b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50568b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50578b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50588b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50598b512602SDavid Majnemer difference_type __child = __start - __first; 50608b512602SDavid Majnemer 50618b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50628b512602SDavid Majnemer return; 50638b512602SDavid Majnemer 50648b512602SDavid Majnemer __child = 2 * __child + 1; 50658b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50668b512602SDavid Majnemer 50678b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50688b512602SDavid Majnemer // right-child exists and is greater than left-child 50698b512602SDavid Majnemer ++__child_i; 50708b512602SDavid Majnemer ++__child; 50718b512602SDavid Majnemer } 50728b512602SDavid Majnemer 50738b512602SDavid Majnemer // check if we are in heap-order 50748b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50758b512602SDavid Majnemer // we are, __start is larger than it's largest child 50768b512602SDavid Majnemer return; 50778b512602SDavid Majnemer 50788b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50798b512602SDavid Majnemer do 50808b512602SDavid Majnemer { 50818b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 50828b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50838b512602SDavid Majnemer __start = __child_i; 50848b512602SDavid Majnemer 50858b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50868b512602SDavid Majnemer break; 50878b512602SDavid Majnemer 50888b512602SDavid Majnemer // recompute the child based off of the updated parent 50898b512602SDavid Majnemer __child = 2 * __child + 1; 50908b512602SDavid Majnemer __child_i = __first + __child; 50918b512602SDavid Majnemer 50928b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50938b512602SDavid Majnemer // right-child exists and is greater than left-child 50948b512602SDavid Majnemer ++__child_i; 50958b512602SDavid Majnemer ++__child; 50968b512602SDavid Majnemer } 50978b512602SDavid Majnemer 50988b512602SDavid Majnemer // check if we are in heap-order 50998b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 51008b512602SDavid Majnemer *__start = _VSTD::move(__top); 51018b512602SDavid Majnemer} 51028b512602SDavid Majnemer 51038b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 51043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51053e519524SHoward Hinnantvoid 51063e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 51073e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 51083e519524SHoward Hinnant{ 51093e519524SHoward Hinnant if (__len > 1) 51103e519524SHoward Hinnant { 51113e519524SHoward Hinnant swap(*__first, *--__last); 51121968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 51133e519524SHoward Hinnant } 51143e519524SHoward Hinnant} 51153e519524SHoward Hinnant 51163e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51183e519524SHoward Hinnantvoid 51193e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51203e519524SHoward Hinnant{ 5121aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51221968804aSArthur O'Dwyer _VSTD::__pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 51233e519524SHoward Hinnant} 51243e519524SHoward Hinnant 51253e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51273e519524SHoward Hinnantvoid 51283e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51293e519524SHoward Hinnant{ 5130ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51313e519524SHoward Hinnant} 51323e519524SHoward Hinnant 51333e519524SHoward Hinnant// make_heap 51343e519524SHoward Hinnant 51353e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51363e519524SHoward Hinnantvoid 51373e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51383e519524SHoward Hinnant{ 51393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51403e519524SHoward Hinnant difference_type __n = __last - __first; 51413e519524SHoward Hinnant if (__n > 1) 51423e519524SHoward Hinnant { 51438b512602SDavid Majnemer // start from the first parent, there is no need to consider children 51448b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 51458b512602SDavid Majnemer { 51461968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51478b512602SDavid Majnemer } 51483e519524SHoward Hinnant } 51493e519524SHoward Hinnant} 51503e519524SHoward Hinnant 51513e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51533e519524SHoward Hinnantvoid 51543e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51553e519524SHoward Hinnant{ 5156aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51571968804aSArthur O'Dwyer _VSTD::__make_heap<_Comp_ref>(__first, __last, __comp); 51583e519524SHoward Hinnant} 51593e519524SHoward Hinnant 51603e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51623e519524SHoward Hinnantvoid 51633e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51643e519524SHoward Hinnant{ 5165ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51663e519524SHoward Hinnant} 51673e519524SHoward Hinnant 51683e519524SHoward Hinnant// sort_heap 51693e519524SHoward Hinnant 51703e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51713e519524SHoward Hinnantvoid 51723e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51733e519524SHoward Hinnant{ 51743e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51757fa68653SMarshall Clow for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n) 51761968804aSArthur O'Dwyer _VSTD::__pop_heap<_Compare>(__first, __last, __comp, __n); 51773e519524SHoward Hinnant} 51783e519524SHoward Hinnant 51793e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51813e519524SHoward Hinnantvoid 51823e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51833e519524SHoward Hinnant{ 5184aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51851968804aSArthur O'Dwyer _VSTD::__sort_heap<_Comp_ref>(__first, __last, __comp); 51863e519524SHoward Hinnant} 51873e519524SHoward Hinnant 51883e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51903e519524SHoward Hinnantvoid 51913e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51923e519524SHoward Hinnant{ 5193ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51943e519524SHoward Hinnant} 51953e519524SHoward Hinnant 51963e519524SHoward Hinnant// partial_sort 51973e519524SHoward Hinnant 51983e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51993e519524SHoward Hinnantvoid 52003e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 52013e519524SHoward Hinnant _Compare __comp) 52023e519524SHoward Hinnant{ 52031968804aSArthur O'Dwyer _VSTD::__make_heap<_Compare>(__first, __middle, __comp); 52043e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 52053e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 52063e519524SHoward Hinnant { 52073e519524SHoward Hinnant if (__comp(*__i, *__first)) 52083e519524SHoward Hinnant { 52093e519524SHoward Hinnant swap(*__i, *__first); 52101968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __middle, __comp, __len, __first); 52113e519524SHoward Hinnant } 52123e519524SHoward Hinnant } 52131968804aSArthur O'Dwyer _VSTD::__sort_heap<_Compare>(__first, __middle, __comp); 52143e519524SHoward Hinnant} 52153e519524SHoward Hinnant 52163e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52183e519524SHoward Hinnantvoid 52193e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 52203e519524SHoward Hinnant _Compare __comp) 52213e519524SHoward Hinnant{ 5222aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 52231968804aSArthur O'Dwyer _VSTD::__partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 52243e519524SHoward Hinnant} 52253e519524SHoward Hinnant 52263e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52283e519524SHoward Hinnantvoid 52293e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 52303e519524SHoward Hinnant{ 5231ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52323e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52333e519524SHoward Hinnant} 52343e519524SHoward Hinnant 52353e519524SHoward Hinnant// partial_sort_copy 52363e519524SHoward Hinnant 52373e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52383e519524SHoward Hinnant_RandomAccessIterator 52393e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52403e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52413e519524SHoward Hinnant{ 52423e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52433e519524SHoward Hinnant if (__r != __result_last) 52443e519524SHoward Hinnant { 52457fa68653SMarshall Clow for (; __first != __last && __r != __result_last; ++__first, (void) ++__r) 52463e519524SHoward Hinnant *__r = *__first; 52471968804aSArthur O'Dwyer _VSTD::__make_heap<_Compare>(__result_first, __r, __comp); 52488b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52493e519524SHoward Hinnant for (; __first != __last; ++__first) 52503e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52513e519524SHoward Hinnant { 52523e519524SHoward Hinnant *__result_first = *__first; 52531968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52543e519524SHoward Hinnant } 52551968804aSArthur O'Dwyer _VSTD::__sort_heap<_Compare>(__result_first, __r, __comp); 52563e519524SHoward Hinnant } 52573e519524SHoward Hinnant return __r; 52583e519524SHoward Hinnant} 52593e519524SHoward Hinnant 52603e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52623e519524SHoward Hinnant_RandomAccessIterator 52633e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52643e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52653e519524SHoward Hinnant{ 5266aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 52671968804aSArthur O'Dwyer return _VSTD::__partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 52683e519524SHoward Hinnant} 52693e519524SHoward Hinnant 52703e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52723e519524SHoward Hinnant_RandomAccessIterator 52733e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52743e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52753e519524SHoward Hinnant{ 5276ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52773e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52783e519524SHoward Hinnant} 52793e519524SHoward Hinnant 52803e519524SHoward Hinnant// nth_element 52813e519524SHoward Hinnant 52823e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52833e519524SHoward Hinnantvoid 52843e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52853e519524SHoward Hinnant{ 52863e519524SHoward Hinnant // _Compare is known to be a reference type 52873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52883e519524SHoward Hinnant const difference_type __limit = 7; 52893e519524SHoward Hinnant while (true) 52903e519524SHoward Hinnant { 52913e519524SHoward Hinnant __restart: 5292b34b4819SHoward Hinnant if (__nth == __last) 5293b34b4819SHoward Hinnant return; 52943e519524SHoward Hinnant difference_type __len = __last - __first; 52953e519524SHoward Hinnant switch (__len) 52963e519524SHoward Hinnant { 52973e519524SHoward Hinnant case 0: 52983e519524SHoward Hinnant case 1: 52993e519524SHoward Hinnant return; 53003e519524SHoward Hinnant case 2: 53013e519524SHoward Hinnant if (__comp(*--__last, *__first)) 53023e519524SHoward Hinnant swap(*__first, *__last); 53033e519524SHoward Hinnant return; 53043e519524SHoward Hinnant case 3: 53053e519524SHoward Hinnant { 53063e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5307ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 53083e519524SHoward Hinnant return; 53093e519524SHoward Hinnant } 53103e519524SHoward Hinnant } 53113e519524SHoward Hinnant if (__len <= __limit) 53123e519524SHoward Hinnant { 53131968804aSArthur O'Dwyer _VSTD::__selection_sort<_Compare>(__first, __last, __comp); 53143e519524SHoward Hinnant return; 53153e519524SHoward Hinnant } 53163e519524SHoward Hinnant // __len > __limit >= 3 53173e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 53183e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5319ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 53203e519524SHoward Hinnant // *__m is median 53213e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53223e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53233e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53243e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53253e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53263e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53273e519524SHoward Hinnant // Prime the downward search with a guard. 53283e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53293e519524SHoward Hinnant { 53303e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53313e519524SHoward Hinnant // manually guard downward moving __j against __i 53323e519524SHoward Hinnant while (true) 53333e519524SHoward Hinnant { 53343e519524SHoward Hinnant if (__i == --__j) 53353e519524SHoward Hinnant { 53363e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 53371968804aSArthur O'Dwyer // Partition instead into [__first, __i) == *__first and *__first < [__i, __last) 53383e519524SHoward Hinnant ++__i; // __first + 1 53393e519524SHoward Hinnant __j = __last; 53403e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 53413e519524SHoward Hinnant { 53423e519524SHoward Hinnant while (true) 53433e519524SHoward Hinnant { 53443e519524SHoward Hinnant if (__i == __j) 53453e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 53463e519524SHoward Hinnant if (__comp(*__first, *__i)) 53473e519524SHoward Hinnant { 53483e519524SHoward Hinnant swap(*__i, *__j); 53493e519524SHoward Hinnant ++__n_swaps; 53503e519524SHoward Hinnant ++__i; 53513e519524SHoward Hinnant break; 53523e519524SHoward Hinnant } 53533e519524SHoward Hinnant ++__i; 53543e519524SHoward Hinnant } 53553e519524SHoward Hinnant } 53563e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53573e519524SHoward Hinnant if (__i == __j) 53583e519524SHoward Hinnant return; 53593e519524SHoward Hinnant while (true) 53603e519524SHoward Hinnant { 53613e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53623e519524SHoward Hinnant ++__i; 53633e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53643e519524SHoward Hinnant ; 53653e519524SHoward Hinnant if (__i >= __j) 53663e519524SHoward Hinnant break; 53673e519524SHoward Hinnant swap(*__i, *__j); 53683e519524SHoward Hinnant ++__n_swaps; 53693e519524SHoward Hinnant ++__i; 53703e519524SHoward Hinnant } 53713e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53723e519524SHoward Hinnant // The first part is sorted, 53733e519524SHoward Hinnant if (__nth < __i) 53743e519524SHoward Hinnant return; 53751968804aSArthur O'Dwyer // __nth_element the second part 53761968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__i, __nth, __last, __comp); 53773e519524SHoward Hinnant __first = __i; 53783e519524SHoward Hinnant goto __restart; 53793e519524SHoward Hinnant } 53803e519524SHoward Hinnant if (__comp(*__j, *__m)) 53813e519524SHoward Hinnant { 53823e519524SHoward Hinnant swap(*__i, *__j); 53833e519524SHoward Hinnant ++__n_swaps; 53843e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant } 53873e519524SHoward Hinnant } 53883e519524SHoward Hinnant ++__i; 53893e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53903e519524SHoward Hinnant // if not yet partitioned... 53913e519524SHoward Hinnant if (__i < __j) 53923e519524SHoward Hinnant { 53933e519524SHoward Hinnant // known that *(__i - 1) < *__m 53943e519524SHoward Hinnant while (true) 53953e519524SHoward Hinnant { 53963e519524SHoward Hinnant // __m still guards upward moving __i 53973e519524SHoward Hinnant while (__comp(*__i, *__m)) 53983e519524SHoward Hinnant ++__i; 53993e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 54003e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 54013e519524SHoward Hinnant ; 54023e519524SHoward Hinnant if (__i >= __j) 54033e519524SHoward Hinnant break; 54043e519524SHoward Hinnant swap(*__i, *__j); 54053e519524SHoward Hinnant ++__n_swaps; 54063e519524SHoward Hinnant // It is known that __m != __j 54073e519524SHoward Hinnant // If __m just moved, follow it 54083e519524SHoward Hinnant if (__m == __i) 54093e519524SHoward Hinnant __m = __j; 54103e519524SHoward Hinnant ++__i; 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant } 54133e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 54143e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 54153e519524SHoward Hinnant { 54163e519524SHoward Hinnant swap(*__i, *__m); 54173e519524SHoward Hinnant ++__n_swaps; 54183e519524SHoward Hinnant } 54193e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 54203e519524SHoward Hinnant if (__nth == __i) 54213e519524SHoward Hinnant return; 54223e519524SHoward Hinnant if (__n_swaps == 0) 54233e519524SHoward Hinnant { 54243e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 54253e519524SHoward Hinnant if (__nth < __i) 54263e519524SHoward Hinnant { 54273e519524SHoward Hinnant // Check for [__first, __i) already sorted 54283e519524SHoward Hinnant __j = __m = __first; 54293e519524SHoward Hinnant while (++__j != __i) 54303e519524SHoward Hinnant { 54313e519524SHoward Hinnant if (__comp(*__j, *__m)) 54323e519524SHoward Hinnant // not yet sorted, so sort 54333e519524SHoward Hinnant goto not_sorted; 54343e519524SHoward Hinnant __m = __j; 54353e519524SHoward Hinnant } 54363e519524SHoward Hinnant // [__first, __i) sorted 54373e519524SHoward Hinnant return; 54383e519524SHoward Hinnant } 54393e519524SHoward Hinnant else 54403e519524SHoward Hinnant { 54413e519524SHoward Hinnant // Check for [__i, __last) already sorted 54423e519524SHoward Hinnant __j = __m = __i; 54433e519524SHoward Hinnant while (++__j != __last) 54443e519524SHoward Hinnant { 54453e519524SHoward Hinnant if (__comp(*__j, *__m)) 54463e519524SHoward Hinnant // not yet sorted, so sort 54473e519524SHoward Hinnant goto not_sorted; 54483e519524SHoward Hinnant __m = __j; 54493e519524SHoward Hinnant } 54503e519524SHoward Hinnant // [__i, __last) sorted 54513e519524SHoward Hinnant return; 54523e519524SHoward Hinnant } 54533e519524SHoward Hinnant } 54543e519524SHoward Hinnantnot_sorted: 54553e519524SHoward Hinnant // __nth_element on range containing __nth 54563e519524SHoward Hinnant if (__nth < __i) 54573e519524SHoward Hinnant { 54581968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__first, __nth, __i, __comp); 54593e519524SHoward Hinnant __last = __i; 54603e519524SHoward Hinnant } 54613e519524SHoward Hinnant else 54623e519524SHoward Hinnant { 54631968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__i+1, __nth, __last, __comp); 54643e519524SHoward Hinnant __first = ++__i; 54653e519524SHoward Hinnant } 54663e519524SHoward Hinnant } 54673e519524SHoward Hinnant} 54683e519524SHoward Hinnant 54693e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54713e519524SHoward Hinnantvoid 54723e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54733e519524SHoward Hinnant{ 5474aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54751968804aSArthur O'Dwyer _VSTD::__nth_element<_Comp_ref>(__first, __nth, __last, __comp); 54763e519524SHoward Hinnant} 54773e519524SHoward Hinnant 54783e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54803e519524SHoward Hinnantvoid 54813e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54823e519524SHoward Hinnant{ 5483ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54843e519524SHoward Hinnant} 54853e519524SHoward Hinnant 54863e519524SHoward Hinnant// includes 54873e519524SHoward Hinnant 54883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54898da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 54903e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54913e519524SHoward Hinnant _Compare __comp) 54923e519524SHoward Hinnant{ 54933e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54943e519524SHoward Hinnant { 54953e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54963e519524SHoward Hinnant return false; 54973e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54983e519524SHoward Hinnant ++__first2; 54993e519524SHoward Hinnant } 55003e519524SHoward Hinnant return true; 55013e519524SHoward Hinnant} 55023e519524SHoward Hinnant 55033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55041362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55051362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55063e519524SHoward Hinnantbool 55073e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 55083e519524SHoward Hinnant _Compare __comp) 55093e519524SHoward Hinnant{ 5510aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55111968804aSArthur O'Dwyer return _VSTD::__includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 55123e519524SHoward Hinnant} 55133e519524SHoward Hinnant 55143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55151362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55161362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55173e519524SHoward Hinnantbool 55183e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55193e519524SHoward Hinnant{ 5520ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55213e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55223e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55233e519524SHoward Hinnant} 55243e519524SHoward Hinnant 55253e519524SHoward Hinnant// set_union 55263e519524SHoward Hinnant 55273e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 552814098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 55293e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55303e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55313e519524SHoward Hinnant{ 55323e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55333e519524SHoward Hinnant { 55343e519524SHoward Hinnant if (__first2 == __last2) 5535ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55363e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55373e519524SHoward Hinnant { 55383e519524SHoward Hinnant *__result = *__first2; 55393e519524SHoward Hinnant ++__first2; 55403e519524SHoward Hinnant } 55413e519524SHoward Hinnant else 55423e519524SHoward Hinnant { 55433e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55443e519524SHoward Hinnant ++__first2; 554505da5b02SMarshall Clow *__result = *__first1; 55463e519524SHoward Hinnant ++__first1; 55473e519524SHoward Hinnant } 55483e519524SHoward Hinnant } 5549ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55503e519524SHoward Hinnant} 55513e519524SHoward Hinnant 55523e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 555314098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55543e519524SHoward Hinnant_OutputIterator 55553e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55563e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55573e519524SHoward Hinnant{ 5558aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55591968804aSArthur O'Dwyer return _VSTD::__set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 55603e519524SHoward Hinnant} 55613e519524SHoward Hinnant 55623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 556314098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55643e519524SHoward Hinnant_OutputIterator 55653e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55673e519524SHoward Hinnant{ 5568ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55693e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55703e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55713e519524SHoward Hinnant} 55723e519524SHoward Hinnant 55733e519524SHoward Hinnant// set_intersection 55743e519524SHoward Hinnant 55753e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55768da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 55773e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55783e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55793e519524SHoward Hinnant{ 55803e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55813e519524SHoward Hinnant { 55823e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55833e519524SHoward Hinnant ++__first1; 55843e519524SHoward Hinnant else 55853e519524SHoward Hinnant { 55863e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55873e519524SHoward Hinnant { 55883e519524SHoward Hinnant *__result = *__first1; 55893e519524SHoward Hinnant ++__result; 55903e519524SHoward Hinnant ++__first1; 55913e519524SHoward Hinnant } 55923e519524SHoward Hinnant ++__first2; 55933e519524SHoward Hinnant } 55943e519524SHoward Hinnant } 55953e519524SHoward Hinnant return __result; 55963e519524SHoward Hinnant} 55973e519524SHoward Hinnant 55983e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55998da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56003e519524SHoward Hinnant_OutputIterator 56013e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56033e519524SHoward Hinnant{ 5604aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56051968804aSArthur O'Dwyer return _VSTD::__set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 56063e519524SHoward Hinnant} 56073e519524SHoward Hinnant 56083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56098da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56103e519524SHoward Hinnant_OutputIterator 56113e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56133e519524SHoward Hinnant{ 5614ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56153e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56163e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56173e519524SHoward Hinnant} 56183e519524SHoward Hinnant 56193e519524SHoward Hinnant// set_difference 56203e519524SHoward Hinnant 56213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 562214098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 56233e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56253e519524SHoward Hinnant{ 56263e519524SHoward Hinnant while (__first1 != __last1) 56273e519524SHoward Hinnant { 56283e519524SHoward Hinnant if (__first2 == __last2) 5629ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56303e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56313e519524SHoward Hinnant { 56323e519524SHoward Hinnant *__result = *__first1; 56333e519524SHoward Hinnant ++__result; 56343e519524SHoward Hinnant ++__first1; 56353e519524SHoward Hinnant } 56363e519524SHoward Hinnant else 56373e519524SHoward Hinnant { 56383e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56393e519524SHoward Hinnant ++__first1; 56403e519524SHoward Hinnant ++__first2; 56413e519524SHoward Hinnant } 56423e519524SHoward Hinnant } 56433e519524SHoward Hinnant return __result; 56443e519524SHoward Hinnant} 56453e519524SHoward Hinnant 56463e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 564714098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56483e519524SHoward Hinnant_OutputIterator 56493e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56513e519524SHoward Hinnant{ 5652aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56531968804aSArthur O'Dwyer return _VSTD::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 56543e519524SHoward Hinnant} 56553e519524SHoward Hinnant 56563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 565714098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56583e519524SHoward Hinnant_OutputIterator 56593e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56613e519524SHoward Hinnant{ 5662ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56633e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56643e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56653e519524SHoward Hinnant} 56663e519524SHoward Hinnant 56673e519524SHoward Hinnant// set_symmetric_difference 56683e519524SHoward Hinnant 56693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 567014098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 56713e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56733e519524SHoward Hinnant{ 56743e519524SHoward Hinnant while (__first1 != __last1) 56753e519524SHoward Hinnant { 56763e519524SHoward Hinnant if (__first2 == __last2) 5677ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56783e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56793e519524SHoward Hinnant { 56803e519524SHoward Hinnant *__result = *__first1; 56813e519524SHoward Hinnant ++__result; 56823e519524SHoward Hinnant ++__first1; 56833e519524SHoward Hinnant } 56843e519524SHoward Hinnant else 56853e519524SHoward Hinnant { 56863e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56873e519524SHoward Hinnant { 56883e519524SHoward Hinnant *__result = *__first2; 56893e519524SHoward Hinnant ++__result; 56903e519524SHoward Hinnant } 56913e519524SHoward Hinnant else 56923e519524SHoward Hinnant ++__first1; 56933e519524SHoward Hinnant ++__first2; 56943e519524SHoward Hinnant } 56953e519524SHoward Hinnant } 5696ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56973e519524SHoward Hinnant} 56983e519524SHoward Hinnant 56993e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 570014098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57013e519524SHoward Hinnant_OutputIterator 57023e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57033e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57043e519524SHoward Hinnant{ 5705aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57061968804aSArthur O'Dwyer return _VSTD::__set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 57073e519524SHoward Hinnant} 57083e519524SHoward Hinnant 57093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 571014098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57113e519524SHoward Hinnant_OutputIterator 57123e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57143e519524SHoward Hinnant{ 5715ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57163e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57173e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57183e519524SHoward Hinnant} 57193e519524SHoward Hinnant 57203e519524SHoward Hinnant// lexicographical_compare 57213e519524SHoward Hinnant 57223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57231b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 57243e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57263e519524SHoward Hinnant{ 5727910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57283e519524SHoward Hinnant { 57293e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57303e519524SHoward Hinnant return true; 57313e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57323e519524SHoward Hinnant return false; 57333e519524SHoward Hinnant } 57343e519524SHoward Hinnant return false; 57353e519524SHoward Hinnant} 57363e519524SHoward Hinnant 57373e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57381362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 57391362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57403e519524SHoward Hinnantbool 57413e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57433e519524SHoward Hinnant{ 5744aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57451968804aSArthur O'Dwyer return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 57463e519524SHoward Hinnant} 57473e519524SHoward Hinnant 57483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57491362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 57501362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57513e519524SHoward Hinnantbool 57523e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57543e519524SHoward Hinnant{ 5755ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57563e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57573e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57583e519524SHoward Hinnant} 57593e519524SHoward Hinnant 57603e519524SHoward Hinnant// next_permutation 57613e519524SHoward Hinnant 57623e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57633e519524SHoward Hinnantbool 57643e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57653e519524SHoward Hinnant{ 57663e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57673e519524SHoward Hinnant if (__first == __last || __first == --__i) 57683e519524SHoward Hinnant return false; 57693e519524SHoward Hinnant while (true) 57703e519524SHoward Hinnant { 57713e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57723e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57733e519524SHoward Hinnant { 57743e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57753e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57763e519524SHoward Hinnant ; 57773e519524SHoward Hinnant swap(*__i, *__j); 5778ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57793e519524SHoward Hinnant return true; 57803e519524SHoward Hinnant } 57813e519524SHoward Hinnant if (__i == __first) 57823e519524SHoward Hinnant { 5783ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57843e519524SHoward Hinnant return false; 57853e519524SHoward Hinnant } 57863e519524SHoward Hinnant } 57873e519524SHoward Hinnant} 57883e519524SHoward Hinnant 57893e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57913e519524SHoward Hinnantbool 57923e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57933e519524SHoward Hinnant{ 5794aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57951968804aSArthur O'Dwyer return _VSTD::__next_permutation<_Comp_ref>(__first, __last, __comp); 57963e519524SHoward Hinnant} 57973e519524SHoward Hinnant 57983e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58003e519524SHoward Hinnantbool 58013e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58023e519524SHoward Hinnant{ 5803ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58043e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58053e519524SHoward Hinnant} 58063e519524SHoward Hinnant 58073e519524SHoward Hinnant// prev_permutation 58083e519524SHoward Hinnant 58093e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58103e519524SHoward Hinnantbool 58113e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58123e519524SHoward Hinnant{ 58133e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58143e519524SHoward Hinnant if (__first == __last || __first == --__i) 58153e519524SHoward Hinnant return false; 58163e519524SHoward Hinnant while (true) 58173e519524SHoward Hinnant { 58183e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58193e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58203e519524SHoward Hinnant { 58213e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58223e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58233e519524SHoward Hinnant ; 58243e519524SHoward Hinnant swap(*__i, *__j); 5825ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58263e519524SHoward Hinnant return true; 58273e519524SHoward Hinnant } 58283e519524SHoward Hinnant if (__i == __first) 58293e519524SHoward Hinnant { 5830ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58313e519524SHoward Hinnant return false; 58323e519524SHoward Hinnant } 58333e519524SHoward Hinnant } 58343e519524SHoward Hinnant} 58353e519524SHoward Hinnant 58363e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58383e519524SHoward Hinnantbool 58393e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58403e519524SHoward Hinnant{ 5841aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 58421968804aSArthur O'Dwyer return _VSTD::__prev_permutation<_Comp_ref>(__first, __last, __comp); 58433e519524SHoward Hinnant} 58443e519524SHoward Hinnant 58453e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58473e519524SHoward Hinnantbool 58483e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58493e519524SHoward Hinnant{ 5850ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58513e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58523e519524SHoward Hinnant} 58533e519524SHoward Hinnant 58543e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58553e519524SHoward Hinnant 5856a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5857a016efb1SEric Fiselier 58580a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 585995689243SLouis Dionne# include <__pstl_algorithm> 58600a06eb91SLouis Dionne#endif 58610a06eb91SLouis Dionne 58623e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5863