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> 270f851db3dSArthur O'Dwyer constexpr void // constexpr in C++20 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 3043fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 3053fbd3eafSArthur O'Dwyer constexpr ForwardIterator 3063fbd3eafSArthur O'Dwyer shift_left(ForwardIterator first, ForwardIterator last, 3073fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 3083fbd3eafSArthur O'Dwyer 3093fbd3eafSArthur O'Dwyertemplate<class ForwardIterator> 3103fbd3eafSArthur O'Dwyer constexpr ForwardIterator 3113fbd3eafSArthur O'Dwyer shift_right(ForwardIterator first, ForwardIterator last, 3123fbd3eafSArthur O'Dwyer typename iterator_traits<ForwardIterator>::difference_type n); // C++20 3133fbd3eafSArthur 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> 319f851db3dSArthur O'Dwyer constexpr ForwardIterator // constexpr in C++20 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> 354493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 3553e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3563e519524SHoward Hinnant 3573e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 358493f1407SArthur O'Dwyer constexpr void // constexpr in C++20 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> 3705386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 3713e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3723e519524SHoward Hinnant 3733e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3745386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 3753e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3763e519524SHoward Hinnant 3773e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3785386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 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> 3835386aa26SArthur O'Dwyer constexpr RandomAccessIterator // constexpr in C++20 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> 3885d956563SArthur O'Dwyer constexpr void // constexpr in C++20 3893e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3903e519524SHoward Hinnant 3913e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3925d956563SArthur O'Dwyer constexpr void // constexpr in C++20 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> 4945386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 4953e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4963e519524SHoward Hinnant 4973e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4985386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 4993e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5003e519524SHoward Hinnant 5013e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5025386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5033e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 5043e519524SHoward Hinnant 5053e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5065386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5073e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5083e519524SHoward Hinnant 5093e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5105386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5113e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5123e519524SHoward Hinnant 5133e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5145386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5153e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5163e519524SHoward Hinnant 5173e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5185386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 5193e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5203e519524SHoward Hinnant 5213e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5225386aa26SArthur O'Dwyer constexpr void // constexpr in C++20 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> 629f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 6303e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6313e519524SHoward Hinnant 6323e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 633f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 6343e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6353e519524SHoward Hinnant 6363e519524SHoward Hinnanttemplate <class BidirectionalIterator> 637f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 6383e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6393e519524SHoward Hinnant 6403e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 641f851db3dSArthur O'Dwyer constexpr bool // constexpr in C++20 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> 649*bfbd73f8SArthur O'Dwyer#include <__bits> // __libcpp_clz 650a1d07d57SHoward Hinnant#include <cstddef> 651*bfbd73f8SArthur O'Dwyer#include <cstring> 652*bfbd73f8SArthur O'Dwyer#include <functional> 653*bfbd73f8SArthur O'Dwyer#include <initializer_list> 654*bfbd73f8SArthur O'Dwyer#include <iterator> 655*bfbd73f8SArthur O'Dwyer#include <memory> 656*bfbd73f8SArthur O'Dwyer#include <type_traits> 657*bfbd73f8SArthur O'Dwyer#include <utility> // swap_ranges 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 820ab3fcc50SArthur O'Dwyer decltype((void)declval<_Compare&>()( 821ab3fcc50SArthur O'Dwyer declval<_LHS &>(), 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 1642b13edf6eSMark de Wever// __unwrap_iter, __rewrap_iter 1643b13edf6eSMark de Wever 1644b13edf6eSMark de Wever// The job of __unwrap_iter is to lower contiguous iterators (such as 1645b13edf6eSMark de Wever// vector<T>::iterator) into pointers, to reduce the number of template 1646b13edf6eSMark de Wever// instantiations and to enable pointer-based optimizations e.g. in std::copy. 1647b13edf6eSMark de Wever// For iterators that are not contiguous, it must be a no-op. 1648b13edf6eSMark de Wever// In debug mode, we don't do this. 1649b13edf6eSMark de Wever// 1650b13edf6eSMark de Wever// __unwrap_iter is non-constexpr for user-defined iterators whose 1651b13edf6eSMark de Wever// `to_address` and/or `operator->` is non-constexpr. This is okay; but we 1652b13edf6eSMark de Wever// try to avoid doing __unwrap_iter in constant-evaluated contexts anyway. 1653b13edf6eSMark de Wever// 1654b13edf6eSMark de Wever// Some algorithms (e.g. std::copy, but not std::sort) need to convert an 1655b13edf6eSMark de Wever// "unwrapped" result back into a contiguous iterator. Since contiguous iterators 1656b13edf6eSMark de Wever// are random-access, we can do this portably using iterator arithmetic; this 1657b13edf6eSMark de Wever// is the job of __rewrap_iter. 1658b13edf6eSMark de Wever 1659b13edf6eSMark de Wevertemplate <class _Iter, bool = __is_cpp17_contiguous_iterator<_Iter>::value> 1660b13edf6eSMark de Weverstruct __unwrap_iter_impl { 1661b13edf6eSMark de Wever static _LIBCPP_CONSTEXPR _Iter 1662b13edf6eSMark de Wever __apply(_Iter __i) _NOEXCEPT { 1663b13edf6eSMark de Wever return __i; 1664b13edf6eSMark de Wever } 1665b13edf6eSMark de Wever}; 1666b13edf6eSMark de Wever 1667b13edf6eSMark de Wever#if _LIBCPP_DEBUG_LEVEL < 2 1668b13edf6eSMark de Wever 1669b13edf6eSMark de Wevertemplate <class _Iter> 1670b13edf6eSMark de Weverstruct __unwrap_iter_impl<_Iter, true> { 1671b13edf6eSMark de Wever static _LIBCPP_CONSTEXPR decltype(_VSTD::__to_address(declval<_Iter>())) 1672b13edf6eSMark de Wever __apply(_Iter __i) _NOEXCEPT { 1673b13edf6eSMark de Wever return _VSTD::__to_address(__i); 1674b13edf6eSMark de Wever } 1675b13edf6eSMark de Wever}; 1676b13edf6eSMark de Wever 1677b13edf6eSMark de Wever#endif // _LIBCPP_DEBUG_LEVEL < 2 1678b13edf6eSMark de Wever 1679b13edf6eSMark de Wevertemplate<class _Iter, class _Impl = __unwrap_iter_impl<_Iter> > 1680b13edf6eSMark de Weverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 1681b13edf6eSMark de Weverdecltype(_Impl::__apply(declval<_Iter>())) 1682b13edf6eSMark de Wever__unwrap_iter(_Iter __i) _NOEXCEPT 1683b13edf6eSMark de Wever{ 1684b13edf6eSMark de Wever return _Impl::__apply(__i); 1685b13edf6eSMark de Wever} 1686b13edf6eSMark de Wever 1687b13edf6eSMark de Wevertemplate<class _OrigIter> 1688b13edf6eSMark de Wever_OrigIter __rewrap_iter(_OrigIter, _OrigIter __result) 1689b13edf6eSMark de Wever{ 1690b13edf6eSMark de Wever return __result; 1691b13edf6eSMark de Wever} 1692b13edf6eSMark de Wever 1693b13edf6eSMark de Wevertemplate<class _OrigIter, class _UnwrappedIter> 1694b13edf6eSMark de Wever_OrigIter __rewrap_iter(_OrigIter __first, _UnwrappedIter __result) 1695b13edf6eSMark de Wever{ 1696b13edf6eSMark de Wever // Precondition: __result is reachable from __first 1697b13edf6eSMark de Wever // Precondition: _OrigIter is a contiguous iterator 1698b13edf6eSMark de Wever return __first + (__result - _VSTD::__unwrap_iter(__first)); 1699b13edf6eSMark de Wever} 1700b13edf6eSMark de Wever 1701d41c6d51SArthur O'Dwyer// copy 1702d41c6d51SArthur O'Dwyer 17033e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 170413c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17053e519524SHoward Hinnant_OutputIterator 170613c90a57SLouis Dionne__copy_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17073e519524SHoward Hinnant{ 1708910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17093e519524SHoward Hinnant *__result = *__first; 17103e519524SHoward Hinnant return __result; 17113e519524SHoward Hinnant} 17123e519524SHoward Hinnant 171313c90a57SLouis Dionnetemplate <class _InputIterator, class _OutputIterator> 171413c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY 171513c90a57SLouis Dionne_OutputIterator 171613c90a57SLouis Dionne__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 171713c90a57SLouis Dionne{ 17181968804aSArthur O'Dwyer return _VSTD::__copy_constexpr(__first, __last, __result); 171913c90a57SLouis Dionne} 172013c90a57SLouis Dionne 17213e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17233e519524SHoward Hinnanttypename enable_if 17243e519524SHoward Hinnant< 17253e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1726ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17273e519524SHoward Hinnant _Up* 17283e519524SHoward Hinnant>::type 17293e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17303e519524SHoward Hinnant{ 17313e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17325b312052SMarshall Clow if (__n > 0) 1733ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17343e519524SHoward Hinnant return __result + __n; 17353e519524SHoward Hinnant} 17363e519524SHoward Hinnant 17373e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 1738ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17393e519524SHoward Hinnant_OutputIterator 17403e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17413e519524SHoward Hinnant{ 174213c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 174385167fb7SArthur O'Dwyer return _VSTD::__copy_constexpr(__first, __last, __result); 174413c90a57SLouis Dionne } else { 174585167fb7SArthur O'Dwyer return _VSTD::__rewrap_iter(__result, 174685167fb7SArthur O'Dwyer _VSTD::__copy(_VSTD::__unwrap_iter(__first), 174785167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__last), 174885167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__result))); 174913c90a57SLouis Dionne } 17503e519524SHoward Hinnant} 17513e519524SHoward Hinnant 17523e519524SHoward Hinnant// copy_backward 17533e519524SHoward Hinnant 1754d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 175513c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 175613c90a57SLouis Dionne_OutputIterator 175713c90a57SLouis Dionne__copy_backward_constexpr(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 175813c90a57SLouis Dionne{ 175913c90a57SLouis Dionne while (__first != __last) 176013c90a57SLouis Dionne *--__result = *--__last; 176113c90a57SLouis Dionne return __result; 176213c90a57SLouis Dionne} 176313c90a57SLouis Dionne 176413c90a57SLouis Dionnetemplate <class _BidirectionalIterator, class _OutputIterator> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_OutputIterator 1767d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17683e519524SHoward Hinnant{ 17691968804aSArthur O'Dwyer return _VSTD::__copy_backward_constexpr(__first, __last, __result); 17703e519524SHoward Hinnant} 17713e519524SHoward Hinnant 17723e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17743e519524SHoward Hinnanttypename enable_if 17753e519524SHoward Hinnant< 17763e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1777ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17783e519524SHoward Hinnant _Up* 17793e519524SHoward Hinnant>::type 17803e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17813e519524SHoward Hinnant{ 17823e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17835b312052SMarshall Clow if (__n > 0) 17845b312052SMarshall Clow { 17853e519524SHoward Hinnant __result -= __n; 1786ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17875b312052SMarshall Clow } 17883e519524SHoward Hinnant return __result; 17893e519524SHoward Hinnant} 17903e519524SHoward Hinnant 17913e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 1792ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 17933e519524SHoward Hinnant_BidirectionalIterator2 17943e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17953e519524SHoward Hinnant _BidirectionalIterator2 __result) 17963e519524SHoward Hinnant{ 179713c90a57SLouis Dionne if (__libcpp_is_constant_evaluated()) { 179885167fb7SArthur O'Dwyer return _VSTD::__copy_backward_constexpr(__first, __last, __result); 179913c90a57SLouis Dionne } else { 180085167fb7SArthur O'Dwyer return _VSTD::__rewrap_iter(__result, 180185167fb7SArthur O'Dwyer _VSTD::__copy_backward(_VSTD::__unwrap_iter(__first), 18021968804aSArthur O'Dwyer _VSTD::__unwrap_iter(__last), 180385167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__result))); 18043e519524SHoward Hinnant } 180513c90a57SLouis Dionne} 18063e519524SHoward Hinnant 18073e519524SHoward Hinnant// copy_if 18083e519524SHoward Hinnant 18093e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 181013c90a57SLouis Dionneinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18113e519524SHoward Hinnant_OutputIterator 18123e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18133e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18143e519524SHoward Hinnant{ 18153e519524SHoward Hinnant for (; __first != __last; ++__first) 18163e519524SHoward Hinnant { 18173e519524SHoward Hinnant if (__pred(*__first)) 18183e519524SHoward Hinnant { 18193e519524SHoward Hinnant *__result = *__first; 18203e519524SHoward Hinnant ++__result; 18213e519524SHoward Hinnant } 18223e519524SHoward Hinnant } 18233e519524SHoward Hinnant return __result; 18243e519524SHoward Hinnant} 18253e519524SHoward Hinnant 18263e519524SHoward Hinnant// copy_n 18273e519524SHoward Hinnant 18283e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 1829ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18303e519524SHoward Hinnanttypename enable_if 18313e519524SHoward Hinnant< 1832f82dba01SEric Fiselier __is_cpp17_input_iterator<_InputIterator>::value && 1833f82dba01SEric Fiselier !__is_cpp17_random_access_iterator<_InputIterator>::value, 18343e519524SHoward Hinnant _OutputIterator 18353e519524SHoward Hinnant>::type 183651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18373e519524SHoward Hinnant{ 1838c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 183951544023SEric Fiselier _IntegralSize __n = __orig_n; 184099847d2bSHoward Hinnant if (__n > 0) 184199847d2bSHoward Hinnant { 18423e519524SHoward Hinnant *__result = *__first; 184399847d2bSHoward Hinnant ++__result; 184499847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184599847d2bSHoward Hinnant { 184699847d2bSHoward Hinnant ++__first; 184799847d2bSHoward Hinnant *__result = *__first; 184899847d2bSHoward Hinnant ++__result; 184999847d2bSHoward Hinnant } 185099847d2bSHoward Hinnant } 18513e519524SHoward Hinnant return __result; 18523e519524SHoward Hinnant} 18533e519524SHoward Hinnant 18543e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 1855ee95c702SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18563e519524SHoward Hinnanttypename enable_if 18573e519524SHoward Hinnant< 1858f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_InputIterator>::value, 18593e519524SHoward Hinnant _OutputIterator 18603e519524SHoward Hinnant>::type 186151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18623e519524SHoward Hinnant{ 1863c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 186451544023SEric Fiselier _IntegralSize __n = __orig_n; 1865ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18663e519524SHoward Hinnant} 18673e519524SHoward Hinnant 18683e519524SHoward Hinnant// move 18693e519524SHoward Hinnant 18703e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18713ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18723e519524SHoward Hinnant_OutputIterator 18733ed89b51Szoecarver__move_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18743e519524SHoward Hinnant{ 1875910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1876ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18773e519524SHoward Hinnant return __result; 18783e519524SHoward Hinnant} 18793e519524SHoward Hinnant 18803ed89b51Szoecarvertemplate <class _InputIterator, class _OutputIterator> 18813ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18823ed89b51Szoecarver_OutputIterator 18833ed89b51Szoecarver__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18843ed89b51Szoecarver{ 18851968804aSArthur O'Dwyer return _VSTD::__move_constexpr(__first, __last, __result); 18863ed89b51Szoecarver} 18873ed89b51Szoecarver 18883e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18893ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 18903e519524SHoward Hinnanttypename enable_if 18913e519524SHoward Hinnant< 18923e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1893d41c6d51SArthur O'Dwyer is_trivially_move_assignable<_Up>::value, 18943e519524SHoward Hinnant _Up* 18953e519524SHoward Hinnant>::type 18963e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18973e519524SHoward Hinnant{ 18983e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18995b312052SMarshall Clow if (__n > 0) 1900ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19013e519524SHoward Hinnant return __result + __n; 19023e519524SHoward Hinnant} 19033e519524SHoward Hinnant 19043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19053ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19063e519524SHoward Hinnant_OutputIterator 19073e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19083e519524SHoward Hinnant{ 190985167fb7SArthur O'Dwyer if (__libcpp_is_constant_evaluated()) { 191085167fb7SArthur O'Dwyer return _VSTD::__move_constexpr(__first, __last, __result); 191185167fb7SArthur O'Dwyer } else { 191285167fb7SArthur O'Dwyer return _VSTD::__rewrap_iter(__result, 191385167fb7SArthur O'Dwyer _VSTD::__move(_VSTD::__unwrap_iter(__first), 191485167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__last), 191585167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__result))); 191685167fb7SArthur O'Dwyer } 19173e519524SHoward Hinnant} 19183e519524SHoward Hinnant 19193e519524SHoward Hinnant// move_backward 19203e519524SHoward Hinnant 19213e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19223ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19233e519524SHoward Hinnant_OutputIterator 19243ed89b51Szoecarver__move_backward_constexpr(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19253e519524SHoward Hinnant{ 19263e519524SHoward Hinnant while (__first != __last) 1927ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19283e519524SHoward Hinnant return __result; 19293e519524SHoward Hinnant} 19303e519524SHoward Hinnant 19313ed89b51Szoecarvertemplate <class _InputIterator, class _OutputIterator> 19323ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19333ed89b51Szoecarver_OutputIterator 19343ed89b51Szoecarver__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19353ed89b51Szoecarver{ 19361968804aSArthur O'Dwyer return _VSTD::__move_backward_constexpr(__first, __last, __result); 19373ed89b51Szoecarver} 19383ed89b51Szoecarver 19393e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19403ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 19413e519524SHoward Hinnanttypename enable_if 19423e519524SHoward Hinnant< 19433e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1944d41c6d51SArthur O'Dwyer is_trivially_move_assignable<_Up>::value, 19453e519524SHoward Hinnant _Up* 19463e519524SHoward Hinnant>::type 19473e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19483e519524SHoward Hinnant{ 19493e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19505b312052SMarshall Clow if (__n > 0) 19515b312052SMarshall Clow { 19523e519524SHoward Hinnant __result -= __n; 1953ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19545b312052SMarshall Clow } 19553e519524SHoward Hinnant return __result; 19563e519524SHoward Hinnant} 19573e519524SHoward Hinnant 19583e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19593ed89b51Szoecarverinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19603e519524SHoward Hinnant_BidirectionalIterator2 19613e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19623e519524SHoward Hinnant _BidirectionalIterator2 __result) 19633e519524SHoward Hinnant{ 196485167fb7SArthur O'Dwyer if (__libcpp_is_constant_evaluated()) { 196585167fb7SArthur O'Dwyer return _VSTD::__move_backward_constexpr(__first, __last, __result); 196685167fb7SArthur O'Dwyer } else { 196785167fb7SArthur O'Dwyer return _VSTD::__rewrap_iter(__result, 196885167fb7SArthur O'Dwyer _VSTD::__move_backward(_VSTD::__unwrap_iter(__first), 196985167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__last), 197085167fb7SArthur O'Dwyer _VSTD::__unwrap_iter(__result))); 197185167fb7SArthur O'Dwyer } 19723e519524SHoward Hinnant} 19733e519524SHoward Hinnant 19743e519524SHoward Hinnant// iter_swap 19753e519524SHoward Hinnant 1976a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19773e519524SHoward Hinnant 19783e519524SHoward Hinnant// transform 19793e519524SHoward Hinnant 19803e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 198199894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19823e519524SHoward Hinnant_OutputIterator 19833e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19843e519524SHoward Hinnant{ 1985910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19863e519524SHoward Hinnant *__result = __op(*__first); 19873e519524SHoward Hinnant return __result; 19883e519524SHoward Hinnant} 19893e519524SHoward Hinnant 19903e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 199199894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19923e519524SHoward Hinnant_OutputIterator 19933e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19943e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19953e519524SHoward Hinnant{ 1996910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19973e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19983e519524SHoward Hinnant return __result; 19993e519524SHoward Hinnant} 20003e519524SHoward Hinnant 20013e519524SHoward Hinnant// replace 20023e519524SHoward Hinnant 20033e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 200412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20053e519524SHoward Hinnantvoid 20063e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20073e519524SHoward Hinnant{ 20083e519524SHoward Hinnant for (; __first != __last; ++__first) 20093e519524SHoward Hinnant if (*__first == __old_value) 20103e519524SHoward Hinnant *__first = __new_value; 20113e519524SHoward Hinnant} 20123e519524SHoward Hinnant 20133e519524SHoward Hinnant// replace_if 20143e519524SHoward Hinnant 20153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 201612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20173e519524SHoward Hinnantvoid 20183e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20193e519524SHoward Hinnant{ 20203e519524SHoward Hinnant for (; __first != __last; ++__first) 20213e519524SHoward Hinnant if (__pred(*__first)) 20223e519524SHoward Hinnant *__first = __new_value; 20233e519524SHoward Hinnant} 20243e519524SHoward Hinnant 20253e519524SHoward Hinnant// replace_copy 20263e519524SHoward Hinnant 20273e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 202812c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20293e519524SHoward Hinnant_OutputIterator 20303e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20313e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20323e519524SHoward Hinnant{ 2033910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20343e519524SHoward Hinnant if (*__first == __old_value) 20353e519524SHoward Hinnant *__result = __new_value; 20363e519524SHoward Hinnant else 20373e519524SHoward Hinnant *__result = *__first; 20383e519524SHoward Hinnant return __result; 20393e519524SHoward Hinnant} 20403e519524SHoward Hinnant 20413e519524SHoward Hinnant// replace_copy_if 20423e519524SHoward Hinnant 20433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 204412c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20453e519524SHoward Hinnant_OutputIterator 20463e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20473e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20483e519524SHoward Hinnant{ 2049910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20503e519524SHoward Hinnant if (__pred(*__first)) 20513e519524SHoward Hinnant *__result = __new_value; 20523e519524SHoward Hinnant else 20533e519524SHoward Hinnant *__result = *__first; 20543e519524SHoward Hinnant return __result; 20553e519524SHoward Hinnant} 20563e519524SHoward Hinnant 20573e519524SHoward Hinnant// fill_n 20583e519524SHoward Hinnant 20593e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20604bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20613e519524SHoward Hinnant_OutputIterator 20620f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20633e519524SHoward Hinnant{ 2064910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2065e4383379SHoward Hinnant *__first = __value_; 20663e519524SHoward Hinnant return __first; 20673e519524SHoward Hinnant} 20683e519524SHoward Hinnant 20693e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20704bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20713e519524SHoward Hinnant_OutputIterator 2072e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20733e519524SHoward Hinnant{ 2074c0428b3cSArthur O'Dwyer return _VSTD::__fill_n(__first, _VSTD::__convert_to_integral(__n), __value_); 20753e519524SHoward Hinnant} 20763e519524SHoward Hinnant 20773e519524SHoward Hinnant// fill 20783e519524SHoward Hinnant 20793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20804bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20813e519524SHoward Hinnantvoid 2082e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20833e519524SHoward Hinnant{ 20843e519524SHoward Hinnant for (; __first != __last; ++__first) 2085e4383379SHoward Hinnant *__first = __value_; 20863e519524SHoward Hinnant} 20873e519524SHoward Hinnant 20883e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20894bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20903e519524SHoward Hinnantvoid 2091e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20923e519524SHoward Hinnant{ 2093e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20943e519524SHoward Hinnant} 20953e519524SHoward Hinnant 20963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20974bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20983e519524SHoward Hinnantvoid 2099e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21003e519524SHoward Hinnant{ 2101e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21023e519524SHoward Hinnant} 21033e519524SHoward Hinnant 21043e519524SHoward Hinnant// generate 21053e519524SHoward Hinnant 21063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21074bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21083e519524SHoward Hinnantvoid 21093e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21103e519524SHoward Hinnant{ 21113e519524SHoward Hinnant for (; __first != __last; ++__first) 21123e519524SHoward Hinnant *__first = __gen(); 21133e519524SHoward Hinnant} 21143e519524SHoward Hinnant 21153e519524SHoward Hinnant// generate_n 21163e519524SHoward Hinnant 21173e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21184bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21193e519524SHoward Hinnant_OutputIterator 212051544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21213e519524SHoward Hinnant{ 2122c0428b3cSArthur O'Dwyer typedef decltype(_VSTD::__convert_to_integral(__orig_n)) _IntegralSize; 212351544023SEric Fiselier _IntegralSize __n = __orig_n; 2124910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21253e519524SHoward Hinnant *__first = __gen(); 21263e519524SHoward Hinnant return __first; 21273e519524SHoward Hinnant} 21283e519524SHoward Hinnant 21293e519524SHoward Hinnant// remove 21303e519524SHoward Hinnant 21313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21321362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2133e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21343e519524SHoward Hinnant{ 2135e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21363e519524SHoward Hinnant if (__first != __last) 21373e519524SHoward Hinnant { 21383e519524SHoward Hinnant _ForwardIterator __i = __first; 21393e519524SHoward Hinnant while (++__i != __last) 21403e519524SHoward Hinnant { 2141e4383379SHoward Hinnant if (!(*__i == __value_)) 21423e519524SHoward Hinnant { 2143ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21443e519524SHoward Hinnant ++__first; 21453e519524SHoward Hinnant } 21463e519524SHoward Hinnant } 21473e519524SHoward Hinnant } 21483e519524SHoward Hinnant return __first; 21493e519524SHoward Hinnant} 21503e519524SHoward Hinnant 21513e519524SHoward Hinnant// remove_if 21523e519524SHoward Hinnant 21533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21541362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21553e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21563e519524SHoward Hinnant{ 2157ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21583e519524SHoward Hinnant (__first, __last, __pred); 21593e519524SHoward Hinnant if (__first != __last) 21603e519524SHoward Hinnant { 21613e519524SHoward Hinnant _ForwardIterator __i = __first; 21623e519524SHoward Hinnant while (++__i != __last) 21633e519524SHoward Hinnant { 21643e519524SHoward Hinnant if (!__pred(*__i)) 21653e519524SHoward Hinnant { 2166ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21673e519524SHoward Hinnant ++__first; 21683e519524SHoward Hinnant } 21693e519524SHoward Hinnant } 21703e519524SHoward Hinnant } 21713e519524SHoward Hinnant return __first; 21723e519524SHoward Hinnant} 21733e519524SHoward Hinnant 21743e519524SHoward Hinnant// remove_copy 21753e519524SHoward Hinnant 21763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2177e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21783e519524SHoward Hinnant_OutputIterator 2179e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21803e519524SHoward Hinnant{ 21813e519524SHoward Hinnant for (; __first != __last; ++__first) 21823e519524SHoward Hinnant { 2183e4383379SHoward Hinnant if (!(*__first == __value_)) 21843e519524SHoward Hinnant { 21853e519524SHoward Hinnant *__result = *__first; 21863e519524SHoward Hinnant ++__result; 21873e519524SHoward Hinnant } 21883e519524SHoward Hinnant } 21893e519524SHoward Hinnant return __result; 21903e519524SHoward Hinnant} 21913e519524SHoward Hinnant 21923e519524SHoward Hinnant// remove_copy_if 21933e519524SHoward Hinnant 21943e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2195e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21963e519524SHoward Hinnant_OutputIterator 21973e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21983e519524SHoward Hinnant{ 21993e519524SHoward Hinnant for (; __first != __last; ++__first) 22003e519524SHoward Hinnant { 22013e519524SHoward Hinnant if (!__pred(*__first)) 22023e519524SHoward Hinnant { 22033e519524SHoward Hinnant *__result = *__first; 22043e519524SHoward Hinnant ++__result; 22053e519524SHoward Hinnant } 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant return __result; 22083e519524SHoward Hinnant} 22093e519524SHoward Hinnant 22103e519524SHoward Hinnant// unique 22113e519524SHoward Hinnant 22123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22131362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22143e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22153e519524SHoward Hinnant{ 2216ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22173e519524SHoward Hinnant (__first, __last, __pred); 22183e519524SHoward Hinnant if (__first != __last) 22193e519524SHoward Hinnant { 22203e519524SHoward Hinnant // ... a a ? ... 22213e519524SHoward Hinnant // f i 22223e519524SHoward Hinnant _ForwardIterator __i = __first; 22233e519524SHoward Hinnant for (++__i; ++__i != __last;) 22243e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2225ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22263e519524SHoward Hinnant ++__first; 22273e519524SHoward Hinnant } 22283e519524SHoward Hinnant return __first; 22293e519524SHoward Hinnant} 22303e519524SHoward Hinnant 22313e519524SHoward Hinnanttemplate <class _ForwardIterator> 22321362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 22331362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22343e519524SHoward Hinnant_ForwardIterator 22353e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22363e519524SHoward Hinnant{ 22373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2238ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22393e519524SHoward Hinnant} 22403e519524SHoward Hinnant 22413e519524SHoward Hinnant// unique_copy 22423e519524SHoward Hinnant 22433e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22444bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22453e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22463e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22473e519524SHoward Hinnant{ 22483e519524SHoward Hinnant if (__first != __last) 22493e519524SHoward Hinnant { 22503e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22513e519524SHoward Hinnant *__result = __t; 22523e519524SHoward Hinnant ++__result; 22533e519524SHoward Hinnant while (++__first != __last) 22543e519524SHoward Hinnant { 22553e519524SHoward Hinnant if (!__pred(__t, *__first)) 22563e519524SHoward Hinnant { 22573e519524SHoward Hinnant __t = *__first; 22583e519524SHoward Hinnant *__result = __t; 22593e519524SHoward Hinnant ++__result; 22603e519524SHoward Hinnant } 22613e519524SHoward Hinnant } 22623e519524SHoward Hinnant } 22633e519524SHoward Hinnant return __result; 22643e519524SHoward Hinnant} 22653e519524SHoward Hinnant 22663e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22674bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22683e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22693e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22703e519524SHoward Hinnant{ 22713e519524SHoward Hinnant if (__first != __last) 22723e519524SHoward Hinnant { 22733e519524SHoward Hinnant _ForwardIterator __i = __first; 22743e519524SHoward Hinnant *__result = *__i; 22753e519524SHoward Hinnant ++__result; 22763e519524SHoward Hinnant while (++__first != __last) 22773e519524SHoward Hinnant { 22783e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22793e519524SHoward Hinnant { 22803e519524SHoward Hinnant *__result = *__first; 22813e519524SHoward Hinnant ++__result; 22823e519524SHoward Hinnant __i = __first; 22833e519524SHoward Hinnant } 22843e519524SHoward Hinnant } 22853e519524SHoward Hinnant } 22863e519524SHoward Hinnant return __result; 22873e519524SHoward Hinnant} 22883e519524SHoward Hinnant 22893e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22904bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22913e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22923e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22933e519524SHoward Hinnant{ 22943e519524SHoward Hinnant if (__first != __last) 22953e519524SHoward Hinnant { 22963e519524SHoward Hinnant *__result = *__first; 22973e519524SHoward Hinnant while (++__first != __last) 22983e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22993e519524SHoward Hinnant *++__result = *__first; 23003e519524SHoward Hinnant ++__result; 23013e519524SHoward Hinnant } 23023e519524SHoward Hinnant return __result; 23033e519524SHoward Hinnant} 23043e519524SHoward Hinnant 23053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23064bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23073e519524SHoward Hinnant_OutputIterator 23083e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23093e519524SHoward Hinnant{ 2310ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23113e519524SHoward Hinnant (__first, __last, __result, __pred, 23123e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23133e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23143e519524SHoward Hinnant} 23153e519524SHoward Hinnant 23163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23174bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23183e519524SHoward Hinnant_OutputIterator 23193e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23203e519524SHoward Hinnant{ 23213e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2322ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23233e519524SHoward Hinnant} 23243e519524SHoward Hinnant 23253e519524SHoward Hinnant// reverse 23263e519524SHoward Hinnant 23273e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 2328f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23293e519524SHoward Hinnantvoid 23303e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23313e519524SHoward Hinnant{ 23323e519524SHoward Hinnant while (__first != __last) 23333e519524SHoward Hinnant { 23343e519524SHoward Hinnant if (__first == --__last) 23353e519524SHoward Hinnant break; 2336def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23373e519524SHoward Hinnant ++__first; 23383e519524SHoward Hinnant } 23393e519524SHoward Hinnant} 23403e519524SHoward Hinnant 23413e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 2342f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23433e519524SHoward Hinnantvoid 23443e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23453e519524SHoward Hinnant{ 23463e519524SHoward Hinnant if (__first != __last) 23473e519524SHoward Hinnant for (; __first < --__last; ++__first) 2348def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23493e519524SHoward Hinnant} 23503e519524SHoward Hinnant 23513e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 2352f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23533e519524SHoward Hinnantvoid 23543e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23553e519524SHoward Hinnant{ 2356ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23573e519524SHoward Hinnant} 23583e519524SHoward Hinnant 23593e519524SHoward Hinnant// reverse_copy 23603e519524SHoward Hinnant 23613e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2362e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23633e519524SHoward Hinnant_OutputIterator 23643e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23653e519524SHoward Hinnant{ 23663e519524SHoward Hinnant for (; __first != __last; ++__result) 23673e519524SHoward Hinnant *__result = *--__last; 23683e519524SHoward Hinnant return __result; 23693e519524SHoward Hinnant} 23703e519524SHoward Hinnant 23713e519524SHoward Hinnant// rotate 23723e519524SHoward Hinnant 23733e519524SHoward Hinnanttemplate <class _ForwardIterator> 23743ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator 2375aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23763e519524SHoward Hinnant{ 2377aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2378aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2379aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2380aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2381aca09de3SHoward Hinnant return __lm1; 2382aca09de3SHoward Hinnant} 2383aca09de3SHoward Hinnant 2384aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 23853ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator 2386aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2387aca09de3SHoward Hinnant{ 2388aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2389aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2390aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2391aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2392aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2393aca09de3SHoward Hinnant return __fp1; 2394aca09de3SHoward Hinnant} 2395aca09de3SHoward Hinnant 2396aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 23973ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _ForwardIterator 2398aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2399aca09de3SHoward Hinnant{ 24003e519524SHoward Hinnant _ForwardIterator __i = __middle; 24013e519524SHoward Hinnant while (true) 24023e519524SHoward Hinnant { 24033e519524SHoward Hinnant swap(*__first, *__i); 24043e519524SHoward Hinnant ++__first; 24053e519524SHoward Hinnant if (++__i == __last) 24063e519524SHoward Hinnant break; 24073e519524SHoward Hinnant if (__first == __middle) 24083e519524SHoward Hinnant __middle = __i; 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant _ForwardIterator __r = __first; 24113e519524SHoward Hinnant if (__first != __middle) 24123e519524SHoward Hinnant { 24133e519524SHoward Hinnant __i = __middle; 24143e519524SHoward Hinnant while (true) 24153e519524SHoward Hinnant { 24163e519524SHoward Hinnant swap(*__first, *__i); 24173e519524SHoward Hinnant ++__first; 24183e519524SHoward Hinnant if (++__i == __last) 24193e519524SHoward Hinnant { 24203e519524SHoward Hinnant if (__first == __middle) 24213e519524SHoward Hinnant break; 24223e519524SHoward Hinnant __i = __middle; 24233e519524SHoward Hinnant } 24243e519524SHoward Hinnant else if (__first == __middle) 24253e519524SHoward Hinnant __middle = __i; 24263e519524SHoward Hinnant } 24273e519524SHoward Hinnant } 24283e519524SHoward Hinnant return __r; 24293e519524SHoward Hinnant} 24303e519524SHoward Hinnant 24313e519524SHoward Hinnanttemplate<typename _Integral> 24323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24333ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _Integral 243419b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24353e519524SHoward Hinnant{ 24363e519524SHoward Hinnant do 24373e519524SHoward Hinnant { 24383e519524SHoward Hinnant _Integral __t = __x % __y; 24393e519524SHoward Hinnant __x = __y; 24403e519524SHoward Hinnant __y = __t; 24413e519524SHoward Hinnant } while (__y); 24423e519524SHoward Hinnant return __x; 24433e519524SHoward Hinnant} 24443e519524SHoward Hinnant 24453e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24463ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX14 _RandomAccessIterator 2447aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24483e519524SHoward Hinnant{ 24493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24513e519524SHoward Hinnant 24523e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24533e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24543e519524SHoward Hinnant if (__m1 == __m2) 24553e519524SHoward Hinnant { 2456ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24573e519524SHoward Hinnant return __middle; 24583e519524SHoward Hinnant } 245919b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24603e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24613e519524SHoward Hinnant { 2462aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24633e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24643e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24653e519524SHoward Hinnant do 24663e519524SHoward Hinnant { 2467aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24683e519524SHoward Hinnant __p1 = __p2; 24693e519524SHoward Hinnant const difference_type __d = __last - __p2; 24703e519524SHoward Hinnant if (__m1 < __d) 24713e519524SHoward Hinnant __p2 += __m1; 24723e519524SHoward Hinnant else 24733e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24743e519524SHoward Hinnant } while (__p2 != __p); 2475aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24763e519524SHoward Hinnant } 24773e519524SHoward Hinnant return __first + __m2; 24783e519524SHoward Hinnant} 24793e519524SHoward Hinnant 24803e519524SHoward Hinnanttemplate <class _ForwardIterator> 24813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24823ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator 2483aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2484aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2485aca09de3SHoward Hinnant{ 2486cfef7c91SMark de Wever typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2487cfef7c91SMark de Wever if (is_trivially_move_assignable<value_type>::value) 2488aca09de3SHoward Hinnant { 2489aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2490aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2491aca09de3SHoward Hinnant } 2492aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2493aca09de3SHoward Hinnant} 2494aca09de3SHoward Hinnant 2495aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2496aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24973ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _BidirectionalIterator 2498aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2499cfef7c91SMark de Wever bidirectional_iterator_tag) 2500aca09de3SHoward Hinnant{ 2501cfef7c91SMark de Wever typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2502cfef7c91SMark de Wever if (is_trivially_move_assignable<value_type>::value) 2503aca09de3SHoward Hinnant { 2504aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2505aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2506aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2507aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2508aca09de3SHoward Hinnant } 2509aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2510aca09de3SHoward Hinnant} 2511aca09de3SHoward Hinnant 2512aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2513aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25143ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator 2515aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2516cfef7c91SMark de Wever random_access_iterator_tag) 2517aca09de3SHoward Hinnant{ 2518cfef7c91SMark de Wever typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 2519cfef7c91SMark de Wever if (is_trivially_move_assignable<value_type>::value) 2520aca09de3SHoward Hinnant { 2521aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2522aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2523aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2524aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2525aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2526aca09de3SHoward Hinnant } 2527aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2528aca09de3SHoward Hinnant} 2529aca09de3SHoward Hinnant 2530aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2531aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25323ed89b51Szoecarver_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 25333e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25343e519524SHoward Hinnant{ 2535aca09de3SHoward Hinnant if (__first == __middle) 2536aca09de3SHoward Hinnant return __last; 2537aca09de3SHoward Hinnant if (__middle == __last) 2538aca09de3SHoward Hinnant return __first; 2539ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2540cfef7c91SMark de Wever typename iterator_traits<_ForwardIterator>::iterator_category()); 25413e519524SHoward Hinnant} 25423e519524SHoward Hinnant 25433e519524SHoward Hinnant// rotate_copy 25443e519524SHoward Hinnant 25453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 2546b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 25473e519524SHoward Hinnant_OutputIterator 25483e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25493e519524SHoward Hinnant{ 2550ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25513e519524SHoward Hinnant} 25523e519524SHoward Hinnant 25533e519524SHoward Hinnant// min_element 25543e519524SHoward Hinnant 25553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25561362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25571362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25583e519524SHoward Hinnant_ForwardIterator 25590b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25603e519524SHoward Hinnant{ 2561f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2562a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 25633e519524SHoward Hinnant if (__first != __last) 25643e519524SHoward Hinnant { 25653e519524SHoward Hinnant _ForwardIterator __i = __first; 25663e519524SHoward Hinnant while (++__i != __last) 25673e519524SHoward Hinnant if (__comp(*__i, *__first)) 25683e519524SHoward Hinnant __first = __i; 25693e519524SHoward Hinnant } 25703e519524SHoward Hinnant return __first; 25713e519524SHoward Hinnant} 25723e519524SHoward Hinnant 25733e519524SHoward Hinnanttemplate <class _ForwardIterator> 25741362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25751362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25763e519524SHoward Hinnant_ForwardIterator 25773e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25783e519524SHoward Hinnant{ 25790b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25804eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25814eb27b79SHoward Hinnant} 25824eb27b79SHoward Hinnant 25834eb27b79SHoward Hinnant// min 25844eb27b79SHoward Hinnant 25854eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25861362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25871362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25884eb27b79SHoward Hinnantconst _Tp& 25894eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25904eb27b79SHoward Hinnant{ 25914eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25924eb27b79SHoward Hinnant} 25934eb27b79SHoward Hinnant 25944eb27b79SHoward Hinnanttemplate <class _Tp> 25951362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 25961362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25974eb27b79SHoward Hinnantconst _Tp& 25984eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25994eb27b79SHoward Hinnant{ 2600ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26014eb27b79SHoward Hinnant} 26024eb27b79SHoward Hinnant 2603ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 260454976f26SHoward Hinnant 26054eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26061362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26071362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26084eb27b79SHoward Hinnant_Tp 26094eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26104eb27b79SHoward Hinnant{ 26110b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26124eb27b79SHoward Hinnant} 26134eb27b79SHoward Hinnant 26144eb27b79SHoward Hinnanttemplate<class _Tp> 26151362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26161362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26174eb27b79SHoward Hinnant_Tp 26184eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26194eb27b79SHoward Hinnant{ 26200b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26213e519524SHoward Hinnant} 26223e519524SHoward Hinnant 2623ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 262454976f26SHoward Hinnant 26253e519524SHoward Hinnant// max_element 26263e519524SHoward Hinnant 26273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26281362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26291362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26303e519524SHoward Hinnant_ForwardIterator 26310b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26323e519524SHoward Hinnant{ 2633f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2634a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 26353e519524SHoward Hinnant if (__first != __last) 26363e519524SHoward Hinnant { 26373e519524SHoward Hinnant _ForwardIterator __i = __first; 26383e519524SHoward Hinnant while (++__i != __last) 26393e519524SHoward Hinnant if (__comp(*__first, *__i)) 26403e519524SHoward Hinnant __first = __i; 26413e519524SHoward Hinnant } 26423e519524SHoward Hinnant return __first; 26433e519524SHoward Hinnant} 26443e519524SHoward Hinnant 26459d67c6d5SMarshall Clow 26463e519524SHoward Hinnanttemplate <class _ForwardIterator> 26471362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26481362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26493e519524SHoward Hinnant_ForwardIterator 26503e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26513e519524SHoward Hinnant{ 26520b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26534eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26544eb27b79SHoward Hinnant} 26554eb27b79SHoward Hinnant 26564eb27b79SHoward Hinnant// max 26574eb27b79SHoward Hinnant 26584eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26591362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26601362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26614eb27b79SHoward Hinnantconst _Tp& 26624eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26634eb27b79SHoward Hinnant{ 26644eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26654eb27b79SHoward Hinnant} 26664eb27b79SHoward Hinnant 26674eb27b79SHoward Hinnanttemplate <class _Tp> 26681362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26691362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26704eb27b79SHoward Hinnantconst _Tp& 26714eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26724eb27b79SHoward Hinnant{ 2673ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26744eb27b79SHoward Hinnant} 26754eb27b79SHoward Hinnant 2676ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 267754976f26SHoward Hinnant 26784eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26791362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26801362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26814eb27b79SHoward Hinnant_Tp 26824eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26834eb27b79SHoward Hinnant{ 26840b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26854eb27b79SHoward Hinnant} 26864eb27b79SHoward Hinnant 26874eb27b79SHoward Hinnanttemplate<class _Tp> 26881362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 26891362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26904eb27b79SHoward Hinnant_Tp 26914eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26924eb27b79SHoward Hinnant{ 26930b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26943e519524SHoward Hinnant} 26953e519524SHoward Hinnant 2696ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 269754976f26SHoward Hinnant 2698146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2699146c14acSMarshall Clow// clamp 2700146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 27011362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27021362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2703146c14acSMarshall Clowconst _Tp& 2704146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2705146c14acSMarshall Clow{ 2706146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2707146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2708146c14acSMarshall Clow 2709146c14acSMarshall Clow} 2710146c14acSMarshall Clow 2711146c14acSMarshall Clowtemplate<class _Tp> 27121362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27131362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2714146c14acSMarshall Clowconst _Tp& 2715146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2716146c14acSMarshall Clow{ 2717146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2718146c14acSMarshall Clow} 2719146c14acSMarshall Clow#endif 2720146c14acSMarshall Clow 27213e519524SHoward Hinnant// minmax_element 27223e519524SHoward Hinnant 27233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27241362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX11 2725d586f92cSArthur O'Dwyerpair<_ForwardIterator, _ForwardIterator> 27263e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27273e519524SHoward Hinnant{ 2728f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_ForwardIterator>::value, 2729a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 2730d586f92cSArthur O'Dwyer pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27313e519524SHoward Hinnant if (__first != __last) 27323e519524SHoward Hinnant { 27333e519524SHoward Hinnant if (++__first != __last) 27343e519524SHoward Hinnant { 27353e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27363e519524SHoward Hinnant __result.first = __first; 27373e519524SHoward Hinnant else 27383e519524SHoward Hinnant __result.second = __first; 27393e519524SHoward Hinnant while (++__first != __last) 27403e519524SHoward Hinnant { 27413e519524SHoward Hinnant _ForwardIterator __i = __first; 27423e519524SHoward Hinnant if (++__first == __last) 27433e519524SHoward Hinnant { 27443e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27453e519524SHoward Hinnant __result.first = __i; 27463e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27473e519524SHoward Hinnant __result.second = __i; 27483e519524SHoward Hinnant break; 27493e519524SHoward Hinnant } 27503e519524SHoward Hinnant else 27513e519524SHoward Hinnant { 27523e519524SHoward Hinnant if (__comp(*__first, *__i)) 27533e519524SHoward Hinnant { 27543e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27553e519524SHoward Hinnant __result.first = __first; 27563e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27573e519524SHoward Hinnant __result.second = __i; 27583e519524SHoward Hinnant } 27593e519524SHoward Hinnant else 27603e519524SHoward Hinnant { 27613e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27623e519524SHoward Hinnant __result.first = __i; 27633e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27643e519524SHoward Hinnant __result.second = __first; 27653e519524SHoward Hinnant } 27663e519524SHoward Hinnant } 27673e519524SHoward Hinnant } 27683e519524SHoward Hinnant } 27693e519524SHoward Hinnant } 27703e519524SHoward Hinnant return __result; 27713e519524SHoward Hinnant} 27723e519524SHoward Hinnant 27733e519524SHoward Hinnanttemplate <class _ForwardIterator> 27741362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27751362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 2776d586f92cSArthur O'Dwyerpair<_ForwardIterator, _ForwardIterator> 27773e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27783e519524SHoward Hinnant{ 27799d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27809d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27813e519524SHoward Hinnant} 27823e519524SHoward Hinnant 27834eb27b79SHoward Hinnant// minmax 27844eb27b79SHoward Hinnant 27854eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27861362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27871362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27884eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27894eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27904eb27b79SHoward Hinnant{ 27914eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27924eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27934eb27b79SHoward Hinnant} 27944eb27b79SHoward Hinnant 27954eb27b79SHoward Hinnanttemplate<class _Tp> 27961362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 27971362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27984eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27994eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 28004eb27b79SHoward Hinnant{ 2801ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 28024eb27b79SHoward Hinnant} 28034eb27b79SHoward Hinnant 2804ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 280554976f26SHoward Hinnant 28064eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28071362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 28081362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28094eb27b79SHoward Hinnantpair<_Tp, _Tp> 28104eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28114eb27b79SHoward Hinnant{ 28129d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28139d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28149d67c6d5SMarshall Clow _Iter __last = __t.end(); 2815d586f92cSArthur O'Dwyer pair<_Tp, _Tp> __result(*__first, *__first); 28169d67c6d5SMarshall Clow 28179d67c6d5SMarshall Clow ++__first; 28189d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28199d67c6d5SMarshall Clow { 28209d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28219d67c6d5SMarshall Clow __result.first = *__first; 28229d67c6d5SMarshall Clow else 28239d67c6d5SMarshall Clow __result.second = *__first; 28249d67c6d5SMarshall Clow ++__first; 28259d67c6d5SMarshall Clow } 28269d67c6d5SMarshall Clow 28279d67c6d5SMarshall Clow while (__first != __last) 28289d67c6d5SMarshall Clow { 28299d67c6d5SMarshall Clow _Tp __prev = *__first++; 2830002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2831002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2832002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28339d67c6d5SMarshall Clow } 28349d67c6d5SMarshall Clow else { 2835002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2836002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28379d67c6d5SMarshall Clow } 28389d67c6d5SMarshall Clow 28399d67c6d5SMarshall Clow __first++; 28409d67c6d5SMarshall Clow } 28419d67c6d5SMarshall Clow return __result; 28429d67c6d5SMarshall Clow} 28439d67c6d5SMarshall Clow 28449d67c6d5SMarshall Clowtemplate<class _Tp> 28451362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 28461362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28479d67c6d5SMarshall Clowpair<_Tp, _Tp> 28489d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28499d67c6d5SMarshall Clow{ 28509d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28514eb27b79SHoward Hinnant} 28524eb27b79SHoward Hinnant 2853ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 285454976f26SHoward Hinnant 28553e519524SHoward Hinnant// random_shuffle 28563e519524SHoward Hinnant 2857f9d540b0SHoward Hinnant// __independent_bits_engine 2858f9d540b0SHoward Hinnant 2859c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2860f9d540b0SHoward Hinnantstruct __log2_imp 28613e519524SHoward Hinnant{ 2862c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2863c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28643e519524SHoward Hinnant}; 28653e519524SHoward Hinnant 2866c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2867c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28683e519524SHoward Hinnant{ 2869f9d540b0SHoward Hinnant static const size_t value = 0; 28703e519524SHoward Hinnant}; 28713e519524SHoward Hinnant 2872c003db1fSHoward Hinnanttemplate <size_t _Rp> 2873c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28743e519524SHoward Hinnant{ 2875c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28763e519524SHoward Hinnant}; 28773e519524SHoward Hinnant 287889918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2879f9d540b0SHoward Hinnantstruct __log2 28803e519524SHoward Hinnant{ 2881c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 288289918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28833e519524SHoward Hinnant}; 28843e519524SHoward Hinnant 2885f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2886f9d540b0SHoward Hinnantclass __independent_bits_engine 28873e519524SHoward Hinnant{ 2888f9d540b0SHoward Hinnantpublic: 2889f9d540b0SHoward Hinnant // types 2890f9d540b0SHoward Hinnant typedef _UIntType result_type; 2891f9d540b0SHoward Hinnant 2892f9d540b0SHoward Hinnantprivate: 2893f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2894f9d540b0SHoward Hinnant typedef typename conditional 2895f9d540b0SHoward Hinnant < 2896f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2897f9d540b0SHoward Hinnant result_type, 2898f9d540b0SHoward Hinnant _Engine_result_type 2899f9d540b0SHoward Hinnant >::type _Working_result_type; 2900f9d540b0SHoward Hinnant 2901f9d540b0SHoward Hinnant _Engine& __e_; 2902f9d540b0SHoward Hinnant size_t __w_; 2903f9d540b0SHoward Hinnant size_t __w0_; 2904f9d540b0SHoward Hinnant size_t __n_; 2905f9d540b0SHoward Hinnant size_t __n0_; 2906f9d540b0SHoward Hinnant _Working_result_type __y0_; 2907f9d540b0SHoward Hinnant _Working_result_type __y1_; 2908f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2909f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2910f9d540b0SHoward Hinnant 2911ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2912c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2913f9d540b0SHoward Hinnant + _Working_result_type(1); 2914e386b7b3SHoward Hinnant#else 2915e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2916e386b7b3SHoward Hinnant + _Working_result_type(1); 2917e386b7b3SHoward Hinnant#endif 2918e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2919e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2920e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2921f9d540b0SHoward Hinnant 2922f9d540b0SHoward Hinnantpublic: 2923f9d540b0SHoward Hinnant // constructors and seeding functions 2924f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2925f9d540b0SHoward Hinnant 2926f9d540b0SHoward Hinnant // generating functions 2927c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2928f9d540b0SHoward Hinnant 2929f9d540b0SHoward Hinnantprivate: 293008bba64aSMarshall Clow result_type __eval(false_type); 293108bba64aSMarshall Clow result_type __eval(true_type); 2932f9d540b0SHoward Hinnant}; 2933f9d540b0SHoward Hinnant 2934f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2935f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2936f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2937f9d540b0SHoward Hinnant : __e_(__e), 2938f9d540b0SHoward Hinnant __w_(__w) 2939f9d540b0SHoward Hinnant{ 2940f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2941f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2942c003db1fSHoward Hinnant if (_Rp == 0) 2943c003db1fSHoward Hinnant __y0_ = _Rp; 2944f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2945c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2946f9d540b0SHoward Hinnant else 2947f9d540b0SHoward Hinnant __y0_ = 0; 2948c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2949f9d540b0SHoward Hinnant { 2950f9d540b0SHoward Hinnant ++__n_; 2951f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2952f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2953c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2954f9d540b0SHoward Hinnant else 2955f9d540b0SHoward Hinnant __y0_ = 0; 2956f9d540b0SHoward Hinnant } 2957f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2958f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2959c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2960f9d540b0SHoward Hinnant else 2961f9d540b0SHoward Hinnant __y1_ = 0; 2962f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2963f9d540b0SHoward Hinnant _Engine_result_type(0); 2964f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2965f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2966f9d540b0SHoward Hinnant _Engine_result_type(~0); 29673e519524SHoward Hinnant} 29683e519524SHoward Hinnant 2969f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2970f9d540b0SHoward Hinnantinline 2971f9d540b0SHoward Hinnant_UIntType 297208bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29733e519524SHoward Hinnant{ 2974f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29753e519524SHoward Hinnant} 29763e519524SHoward Hinnant 2977f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2978f9d540b0SHoward Hinnant_UIntType 297908bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29803e519524SHoward Hinnant{ 29815beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2982c003db1fSHoward Hinnant result_type _Sp = 0; 2983f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2984f9d540b0SHoward Hinnant { 2985f9d540b0SHoward Hinnant _Engine_result_type __u; 29863e519524SHoward Hinnant do 2987f9d540b0SHoward Hinnant { 2988f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2989f9d540b0SHoward Hinnant } while (__u >= __y0_); 29905beb2c3aSMarshall Clow if (__w0_ < _WRt) 2991c003db1fSHoward Hinnant _Sp <<= __w0_; 2992f9d540b0SHoward Hinnant else 2993c003db1fSHoward Hinnant _Sp = 0; 2994c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2995f9d540b0SHoward Hinnant } 2996f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2997f9d540b0SHoward Hinnant { 2998f9d540b0SHoward Hinnant _Engine_result_type __u; 2999f9d540b0SHoward Hinnant do 3000f9d540b0SHoward Hinnant { 3001f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3002f9d540b0SHoward Hinnant } while (__u >= __y1_); 30035beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 3004c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3005f9d540b0SHoward Hinnant else 3006c003db1fSHoward Hinnant _Sp = 0; 3007c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3008f9d540b0SHoward Hinnant } 3009c003db1fSHoward Hinnant return _Sp; 30103e519524SHoward Hinnant} 30113e519524SHoward Hinnant 3012f9d540b0SHoward Hinnant// uniform_int_distribution 30133e519524SHoward Hinnant 3014f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3015f9d540b0SHoward Hinnantclass uniform_int_distribution 30163e519524SHoward Hinnant{ 3017f9d540b0SHoward Hinnantpublic: 3018f9d540b0SHoward Hinnant // types 3019f9d540b0SHoward Hinnant typedef _IntType result_type; 3020f9d540b0SHoward Hinnant 3021f9d540b0SHoward Hinnant class param_type 3022f9d540b0SHoward Hinnant { 3023f9d540b0SHoward Hinnant result_type __a_; 3024f9d540b0SHoward Hinnant result_type __b_; 3025f9d540b0SHoward Hinnant public: 3026f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3027f9d540b0SHoward Hinnant 3028f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3029f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3030f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3031f9d540b0SHoward Hinnant 3032f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3033f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3034f9d540b0SHoward Hinnant 3035f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3036f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3037f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3038f9d540b0SHoward Hinnant {return !(__x == __y);} 30393e519524SHoward Hinnant }; 30403e519524SHoward Hinnant 3041f9d540b0SHoward Hinnantprivate: 3042f9d540b0SHoward Hinnant param_type __p_; 30433e519524SHoward Hinnant 3044f9d540b0SHoward Hinnantpublic: 3045f9d540b0SHoward Hinnant // constructors and reset functions 3046a11f8b1aSMarek Kurdej#ifndef _LIBCPP_CXX03_LANG 3047a11f8b1aSMarek Kurdej uniform_int_distribution() : uniform_int_distribution(0) {} 3048a11f8b1aSMarek Kurdej explicit uniform_int_distribution( 3049a11f8b1aSMarek Kurdej result_type __a, result_type __b = numeric_limits<result_type>::max()) 3050a11f8b1aSMarek Kurdej : __p_(param_type(__a, __b)) {} 3051a11f8b1aSMarek Kurdej#else 3052a11f8b1aSMarek Kurdej explicit uniform_int_distribution( 3053a11f8b1aSMarek Kurdej result_type __a = 0, 3054f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3055f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3056a11f8b1aSMarek Kurdej#endif 3057f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3058f9d540b0SHoward Hinnant void reset() {} 3059f9d540b0SHoward Hinnant 3060f9d540b0SHoward Hinnant // generating functions 3061f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3062f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3063f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3064f9d540b0SHoward Hinnant 3065f9d540b0SHoward Hinnant // property functions 3066f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3067f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3068f9d540b0SHoward Hinnant 3069f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3070f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3071f9d540b0SHoward Hinnant 3072f9d540b0SHoward Hinnant result_type min() const {return a();} 3073f9d540b0SHoward Hinnant result_type max() const {return b();} 3074f9d540b0SHoward Hinnant 3075f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3076f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3077f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3078f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3079f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3080f9d540b0SHoward Hinnant {return !(__x == __y);} 30813e519524SHoward Hinnant}; 30823e519524SHoward Hinnant 3083f9d540b0SHoward Hinnanttemplate<class _IntType> 3084f9d540b0SHoward Hinnanttemplate<class _URNG> 3085f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3086f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30872dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 30883e519524SHoward Hinnant{ 3089f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3090f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 30912dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 3092c003db1fSHoward Hinnant if (_Rp == 1) 3093f9d540b0SHoward Hinnant return __p.a(); 3094f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3095f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3096c003db1fSHoward Hinnant if (_Rp == 0) 3097f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3098f3b851f0SMarshall Clow size_t __w = _Dt - __libcpp_clz(_Rp) - 1; 3099d586f92cSArthur O'Dwyer if ((_Rp & (numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3100f9d540b0SHoward Hinnant ++__w; 3101f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3102f9d540b0SHoward Hinnant _UIntType __u; 3103f9d540b0SHoward Hinnant do 31043e519524SHoward Hinnant { 3105f9d540b0SHoward Hinnant __u = __e(); 3106c003db1fSHoward Hinnant } while (__u >= _Rp); 3107f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31083e519524SHoward Hinnant} 3109f9d540b0SHoward Hinnant 311066f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 311166f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3112f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3113f9d540b0SHoward Hinnant 3114f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3115f9d540b0SHoward Hinnant 3116f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31173e519524SHoward Hinnant{ 3118f9d540b0SHoward Hinnant static unsigned __c_; 3119f9d540b0SHoward Hinnant 3120f9d540b0SHoward Hinnant __rs_default(); 3121f9d540b0SHoward Hinnantpublic: 3122b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3123f9d540b0SHoward Hinnant 3124f9d540b0SHoward Hinnant static const result_type _Min = 0; 3125f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3126f9d540b0SHoward Hinnant 3127f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3128f9d540b0SHoward Hinnant ~__rs_default(); 3129f9d540b0SHoward Hinnant 3130f9d540b0SHoward Hinnant result_type operator()(); 3131f9d540b0SHoward Hinnant 3132788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3133788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3134f9d540b0SHoward Hinnant 3135f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3136f9d540b0SHoward Hinnant}; 3137f9d540b0SHoward Hinnant 3138f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31393e519524SHoward Hinnant 31403e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 3141ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 31423e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31433e519524SHoward Hinnant{ 31443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3145c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3146c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31473e519524SHoward Hinnant difference_type __d = __last - __first; 31483e519524SHoward Hinnant if (__d > 1) 31493e519524SHoward Hinnant { 3150c003db1fSHoward Hinnant _Dp __uid; 3151f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 31525a8525e0SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3153007b26beSHoward Hinnant { 3154c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3155007b26beSHoward Hinnant if (__i != difference_type(0)) 3156007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3157007b26beSHoward Hinnant } 31583e519524SHoward Hinnant } 31593e519524SHoward Hinnant} 31603e519524SHoward Hinnant 31613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3162ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 31633e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3164ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31653e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31663e519524SHoward Hinnant#else 31673e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31683e519524SHoward Hinnant#endif 31693e519524SHoward Hinnant{ 31703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31713e519524SHoward Hinnant difference_type __d = __last - __first; 31723e519524SHoward Hinnant if (__d > 1) 31733e519524SHoward Hinnant { 31745a8525e0SMarshall Clow for (--__last; __first < __last; ++__first, (void) --__d) 3175007b26beSHoward Hinnant { 3176007b26beSHoward Hinnant difference_type __i = __rand(__d); 3177e9cc5451SMarshall Clow if (__i != difference_type(0)) 3178007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3179007b26beSHoward Hinnant } 31803e519524SHoward Hinnant } 31813e519524SHoward Hinnant} 31820f37a410SMarshall Clow#endif 31833e519524SHoward Hinnant 3184e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3185e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3186e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3187e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 318842bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3189e7154709SEric Fiselier _Distance __n, 3190e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3191e7154709SEric Fiselier input_iterator_tag) { 3192e7154709SEric Fiselier 3193e7154709SEric Fiselier _Distance __k = 0; 3194e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void) ++__k) 319542bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3196e7154709SEric Fiselier _Distance __sz = __k; 3197e7154709SEric Fiselier for (; __first != __last; ++__first, (void) ++__k) { 31986491d99eSArthur O'Dwyer _Distance __r = uniform_int_distribution<_Distance>(0, __k)(__g); 3199e7154709SEric Fiselier if (__r < __sz) 320042bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3201e7154709SEric Fiselier } 320242bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3203e7154709SEric Fiselier} 3204e7154709SEric Fiselier 3205e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3206e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3207e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3208e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 320942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3210e7154709SEric Fiselier _Distance __n, 3211e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3212e7154709SEric Fiselier forward_iterator_tag) { 3213e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3214e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 32156491d99eSArthur O'Dwyer _Distance __r = uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3216e7154709SEric Fiselier if (__r < __n) { 321742bfedd9SAlexander Richardson *__output_iter++ = *__first; 3218e7154709SEric Fiselier --__n; 3219e7154709SEric Fiselier } 3220e7154709SEric Fiselier } 322142bfedd9SAlexander Richardson return __output_iter; 3222e7154709SEric Fiselier} 3223e7154709SEric Fiselier 3224e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3225e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3226e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3227e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 322842bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3229e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3230e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3231e7154709SEric Fiselier _PopCategory; 3232e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3233e7154709SEric Fiselier _Difference; 3234f82dba01SEric Fiselier static_assert(__is_cpp17_forward_iterator<_PopulationIterator>::value || 3235f82dba01SEric Fiselier __is_cpp17_random_access_iterator<_SampleIterator>::value, 3236e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3237e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3238e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3239e7154709SEric Fiselier return _VSTD::__sample( 324042bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3241e7154709SEric Fiselier __g, _PopCategory()); 3242e7154709SEric Fiselier} 3243e7154709SEric Fiselier 3244e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3245e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3246e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3247e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3248e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 324942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3250e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 325142bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3252e7154709SEric Fiselier} 3253e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3254e7154709SEric Fiselier 3255f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3256f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3257fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3258f9d540b0SHoward Hinnant{ 3259f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3260c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3261c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3262f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3263f9d540b0SHoward Hinnant if (__d > 1) 3264f9d540b0SHoward Hinnant { 3265c003db1fSHoward Hinnant _Dp __uid; 32667fa68653SMarshall Clow for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) 3267007b26beSHoward Hinnant { 3268c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3269007b26beSHoward Hinnant if (__i != difference_type(0)) 3270007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3271007b26beSHoward Hinnant } 3272f9d540b0SHoward Hinnant } 3273f9d540b0SHoward Hinnant} 3274f9d540b0SHoward Hinnant 32753fbd3eafSArthur O'Dwyer#if _LIBCPP_STD_VER > 17 32763fbd3eafSArthur O'Dwyer 32773fbd3eafSArthur O'Dwyer// shift_left, shift_right 32783fbd3eafSArthur O'Dwyer 32793fbd3eafSArthur O'Dwyertemplate <class _ForwardIterator> 32803fbd3eafSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY constexpr 32813fbd3eafSArthur O'Dwyer_ForwardIterator 32823fbd3eafSArthur O'Dwyershift_left(_ForwardIterator __first, _ForwardIterator __last, 32833fbd3eafSArthur O'Dwyer typename iterator_traits<_ForwardIterator>::difference_type __n) 32843fbd3eafSArthur O'Dwyer{ 32853fbd3eafSArthur O'Dwyer if (__n == 0) { 32863fbd3eafSArthur O'Dwyer return __last; 32873fbd3eafSArthur O'Dwyer } 32883fbd3eafSArthur O'Dwyer 32893fbd3eafSArthur O'Dwyer _ForwardIterator __m = __first; 32903fbd3eafSArthur O'Dwyer if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) { 32913fbd3eafSArthur O'Dwyer if (__n >= __last - __first) { 32923fbd3eafSArthur O'Dwyer return __first; 32933fbd3eafSArthur O'Dwyer } 32943fbd3eafSArthur O'Dwyer __m += __n; 32953fbd3eafSArthur O'Dwyer } else { 32963fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 32973fbd3eafSArthur O'Dwyer if (__m == __last) { 32983fbd3eafSArthur O'Dwyer return __first; 32993fbd3eafSArthur O'Dwyer } 33003fbd3eafSArthur O'Dwyer ++__m; 33013fbd3eafSArthur O'Dwyer } 33023fbd3eafSArthur O'Dwyer } 33033fbd3eafSArthur O'Dwyer return _VSTD::move(__m, __last, __first); 33043fbd3eafSArthur O'Dwyer} 33053fbd3eafSArthur O'Dwyer 33063fbd3eafSArthur O'Dwyertemplate <class _ForwardIterator> 33073fbd3eafSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY constexpr 33083fbd3eafSArthur O'Dwyer_ForwardIterator 33093fbd3eafSArthur O'Dwyershift_right(_ForwardIterator __first, _ForwardIterator __last, 33103fbd3eafSArthur O'Dwyer typename iterator_traits<_ForwardIterator>::difference_type __n) 33113fbd3eafSArthur O'Dwyer{ 33123fbd3eafSArthur O'Dwyer if (__n == 0) { 33133fbd3eafSArthur O'Dwyer return __first; 33143fbd3eafSArthur O'Dwyer } 33153fbd3eafSArthur O'Dwyer 33163fbd3eafSArthur O'Dwyer if constexpr (__is_cpp17_random_access_iterator<_ForwardIterator>::value) { 33173fbd3eafSArthur O'Dwyer decltype(__n) __d = __last - __first; 33183fbd3eafSArthur O'Dwyer if (__n >= __d) { 33193fbd3eafSArthur O'Dwyer return __last; 33203fbd3eafSArthur O'Dwyer } 33213fbd3eafSArthur O'Dwyer _ForwardIterator __m = __first + (__d - __n); 33223fbd3eafSArthur O'Dwyer return _VSTD::move_backward(__first, __m, __last); 33233fbd3eafSArthur O'Dwyer } else if constexpr (__is_cpp17_bidirectional_iterator<_ForwardIterator>::value) { 33243fbd3eafSArthur O'Dwyer _ForwardIterator __m = __last; 33253fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 33263fbd3eafSArthur O'Dwyer if (__m == __first) { 33273fbd3eafSArthur O'Dwyer return __last; 33283fbd3eafSArthur O'Dwyer } 33293fbd3eafSArthur O'Dwyer --__m; 33303fbd3eafSArthur O'Dwyer } 33313fbd3eafSArthur O'Dwyer return _VSTD::move_backward(__first, __m, __last); 33323fbd3eafSArthur O'Dwyer } else { 33333fbd3eafSArthur O'Dwyer _ForwardIterator __ret = __first; 33343fbd3eafSArthur O'Dwyer for (; __n > 0; --__n) { 33353fbd3eafSArthur O'Dwyer if (__ret == __last) { 33363fbd3eafSArthur O'Dwyer return __last; 33373fbd3eafSArthur O'Dwyer } 33383fbd3eafSArthur O'Dwyer ++__ret; 33393fbd3eafSArthur O'Dwyer } 33403fbd3eafSArthur O'Dwyer 33413fbd3eafSArthur O'Dwyer // We have an __n-element scratch space from __first to __ret. 33423fbd3eafSArthur O'Dwyer // Slide an __n-element window [__trail, __lead) from left to right. 33433fbd3eafSArthur O'Dwyer // We're essentially doing swap_ranges(__first, __ret, __trail, __lead) 33443fbd3eafSArthur O'Dwyer // over and over; but once __lead reaches __last we needn't bother 33453fbd3eafSArthur O'Dwyer // to save the values of elements [__trail, __last). 33463fbd3eafSArthur O'Dwyer 33473fbd3eafSArthur O'Dwyer auto __trail = __first; 33483fbd3eafSArthur O'Dwyer auto __lead = __ret; 33493fbd3eafSArthur O'Dwyer while (__trail != __ret) { 33503fbd3eafSArthur O'Dwyer if (__lead == __last) { 33513fbd3eafSArthur O'Dwyer _VSTD::move(__first, __trail, __ret); 33523fbd3eafSArthur O'Dwyer return __ret; 33533fbd3eafSArthur O'Dwyer } 33543fbd3eafSArthur O'Dwyer ++__trail; 33553fbd3eafSArthur O'Dwyer ++__lead; 33563fbd3eafSArthur O'Dwyer } 33573fbd3eafSArthur O'Dwyer 33583fbd3eafSArthur O'Dwyer _ForwardIterator __mid = __first; 33593fbd3eafSArthur O'Dwyer while (true) { 33603fbd3eafSArthur O'Dwyer if (__lead == __last) { 33613fbd3eafSArthur O'Dwyer __trail = _VSTD::move(__mid, __ret, __trail); 33623fbd3eafSArthur O'Dwyer _VSTD::move(__first, __mid, __trail); 33633fbd3eafSArthur O'Dwyer return __ret; 33643fbd3eafSArthur O'Dwyer } 33653fbd3eafSArthur O'Dwyer swap(*__mid, *__trail); 33663fbd3eafSArthur O'Dwyer ++__mid; 33673fbd3eafSArthur O'Dwyer ++__trail; 33683fbd3eafSArthur O'Dwyer ++__lead; 33693fbd3eafSArthur O'Dwyer if (__mid == __ret) { 33703fbd3eafSArthur O'Dwyer __mid = __first; 33713fbd3eafSArthur O'Dwyer } 33723fbd3eafSArthur O'Dwyer } 33733fbd3eafSArthur O'Dwyer } 33743fbd3eafSArthur O'Dwyer} 33753fbd3eafSArthur O'Dwyer 33763fbd3eafSArthur O'Dwyer#endif // _LIBCPP_STD_VER > 17 33773fbd3eafSArthur O'Dwyer 33783fbd3eafSArthur O'Dwyer// is_partitioned 33793fbd3eafSArthur O'Dwyer 33803e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 33811362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 bool 33823e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 33833e519524SHoward Hinnant{ 33843e519524SHoward Hinnant for (; __first != __last; ++__first) 33853e519524SHoward Hinnant if (!__pred(*__first)) 33863e519524SHoward Hinnant break; 3387b9595b79SMarshall Clow if ( __first == __last ) 3388b9595b79SMarshall Clow return true; 3389b9595b79SMarshall Clow ++__first; 33903e519524SHoward Hinnant for (; __first != __last; ++__first) 33913e519524SHoward Hinnant if (__pred(*__first)) 33923e519524SHoward Hinnant return false; 33933e519524SHoward Hinnant return true; 33943e519524SHoward Hinnant} 33953e519524SHoward Hinnant 33963e519524SHoward Hinnant// partition 33973e519524SHoward Hinnant 33983e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 3399f851db3dSArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 34003e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 34013e519524SHoward Hinnant{ 34023e519524SHoward Hinnant while (true) 34033e519524SHoward Hinnant { 34043e519524SHoward Hinnant if (__first == __last) 34053e519524SHoward Hinnant return __first; 34063e519524SHoward Hinnant if (!__pred(*__first)) 34073e519524SHoward Hinnant break; 34083e519524SHoward Hinnant ++__first; 34093e519524SHoward Hinnant } 34103e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 34113e519524SHoward Hinnant { 34123e519524SHoward Hinnant if (__pred(*__p)) 34133e519524SHoward Hinnant { 34143e519524SHoward Hinnant swap(*__first, *__p); 34153e519524SHoward Hinnant ++__first; 34163e519524SHoward Hinnant } 34173e519524SHoward Hinnant } 34183e519524SHoward Hinnant return __first; 34193e519524SHoward Hinnant} 34203e519524SHoward Hinnant 34213e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 3422f851db3dSArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator 34233e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34243e519524SHoward Hinnant bidirectional_iterator_tag) 34253e519524SHoward Hinnant{ 34263e519524SHoward Hinnant while (true) 34273e519524SHoward Hinnant { 34283e519524SHoward Hinnant while (true) 34293e519524SHoward Hinnant { 34303e519524SHoward Hinnant if (__first == __last) 34313e519524SHoward Hinnant return __first; 34323e519524SHoward Hinnant if (!__pred(*__first)) 34333e519524SHoward Hinnant break; 34343e519524SHoward Hinnant ++__first; 34353e519524SHoward Hinnant } 34363e519524SHoward Hinnant do 34373e519524SHoward Hinnant { 34383e519524SHoward Hinnant if (__first == --__last) 34393e519524SHoward Hinnant return __first; 34403e519524SHoward Hinnant } while (!__pred(*__last)); 34413e519524SHoward Hinnant swap(*__first, *__last); 34423e519524SHoward Hinnant ++__first; 34433e519524SHoward Hinnant } 34443e519524SHoward Hinnant} 34453e519524SHoward Hinnant 34463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 3447f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 34483e519524SHoward Hinnant_ForwardIterator 34493e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34503e519524SHoward Hinnant{ 3451ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 34523e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34533e519524SHoward Hinnant} 34543e519524SHoward Hinnant 34553e519524SHoward Hinnant// partition_copy 34563e519524SHoward Hinnant 34573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 34583e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 34591b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 34603e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 34613e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 34623e519524SHoward Hinnant _Predicate __pred) 34633e519524SHoward Hinnant{ 34643e519524SHoward Hinnant for (; __first != __last; ++__first) 34653e519524SHoward Hinnant { 34663e519524SHoward Hinnant if (__pred(*__first)) 34673e519524SHoward Hinnant { 34683e519524SHoward Hinnant *__out_true = *__first; 34693e519524SHoward Hinnant ++__out_true; 34703e519524SHoward Hinnant } 34713e519524SHoward Hinnant else 34723e519524SHoward Hinnant { 34733e519524SHoward Hinnant *__out_false = *__first; 34743e519524SHoward Hinnant ++__out_false; 34753e519524SHoward Hinnant } 34763e519524SHoward Hinnant } 34773e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 34783e519524SHoward Hinnant} 34793e519524SHoward Hinnant 34803e519524SHoward Hinnant// partition_point 34813e519524SHoward Hinnant 34823e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3483674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 34843e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34853e519524SHoward Hinnant{ 34863e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3487ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34883e519524SHoward Hinnant while (__len != 0) 34893e519524SHoward Hinnant { 349004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 34913e519524SHoward Hinnant _ForwardIterator __m = __first; 3492ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 34933e519524SHoward Hinnant if (__pred(*__m)) 34943e519524SHoward Hinnant { 34953e519524SHoward Hinnant __first = ++__m; 34963e519524SHoward Hinnant __len -= __l2 + 1; 34973e519524SHoward Hinnant } 34983e519524SHoward Hinnant else 34993e519524SHoward Hinnant __len = __l2; 35003e519524SHoward Hinnant } 35013e519524SHoward Hinnant return __first; 35023e519524SHoward Hinnant} 35033e519524SHoward Hinnant 35043e519524SHoward Hinnant// stable_partition 35053e519524SHoward Hinnant 35063e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 35073e519524SHoward Hinnant_ForwardIterator 35083e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35093e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 35103e519524SHoward Hinnant{ 35113e519524SHoward Hinnant // *__first is known to be false 35123e519524SHoward Hinnant // __len >= 1 35133e519524SHoward Hinnant if (__len == 1) 35143e519524SHoward Hinnant return __first; 35153e519524SHoward Hinnant if (__len == 2) 35163e519524SHoward Hinnant { 35173e519524SHoward Hinnant _ForwardIterator __m = __first; 35183e519524SHoward Hinnant if (__pred(*++__m)) 35193e519524SHoward Hinnant { 35203e519524SHoward Hinnant swap(*__first, *__m); 35213e519524SHoward Hinnant return __m; 35223e519524SHoward Hinnant } 35233e519524SHoward Hinnant return __first; 35243e519524SHoward Hinnant } 35253e519524SHoward Hinnant if (__len <= __p.second) 35263e519524SHoward Hinnant { // The buffer is big enough to use 35273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 35283e519524SHoward Hinnant __destruct_n __d(0); 35293e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35303e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35313e519524SHoward Hinnant // Update __first to always point to the end of the trues 35323e519524SHoward Hinnant value_type* __t = __p.first; 3533be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__first)); 3534527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 35353e519524SHoward Hinnant ++__t; 35363e519524SHoward Hinnant _ForwardIterator __i = __first; 35373e519524SHoward Hinnant while (++__i != __last) 35383e519524SHoward Hinnant { 35393e519524SHoward Hinnant if (__pred(*__i)) 35403e519524SHoward Hinnant { 3541ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35423e519524SHoward Hinnant ++__first; 35433e519524SHoward Hinnant } 35443e519524SHoward Hinnant else 35453e519524SHoward Hinnant { 3546be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__i)); 3547527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 35483e519524SHoward Hinnant ++__t; 35493e519524SHoward Hinnant } 35503e519524SHoward Hinnant } 35513e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35523e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35533e519524SHoward Hinnant __i = __first; 35547fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3555ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35563e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35573e519524SHoward Hinnant return __first; 35583e519524SHoward Hinnant } 35593e519524SHoward Hinnant // Else not enough buffer, do in place 35603e519524SHoward Hinnant // __len >= 3 35613e519524SHoward Hinnant _ForwardIterator __m = __first; 35623e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3563ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35643e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 35653e519524SHoward Hinnant // F????????????????? 35663e519524SHoward Hinnant // f m l 35673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35681968804aSArthur O'Dwyer _ForwardIterator __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 35693e519524SHoward Hinnant // TTTFFFFF?????????? 35703e519524SHoward Hinnant // f ff m l 35713e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35723e519524SHoward Hinnant _ForwardIterator __m1 = __m; 35733e519524SHoward Hinnant _ForwardIterator __second_false = __last; 35743e519524SHoward Hinnant _Distance __len_half = __len - __len2; 35753e519524SHoward Hinnant while (__pred(*__m1)) 35763e519524SHoward Hinnant { 35773e519524SHoward Hinnant if (++__m1 == __last) 35783e519524SHoward Hinnant goto __second_half_done; 35793e519524SHoward Hinnant --__len_half; 35803e519524SHoward Hinnant } 35813e519524SHoward Hinnant // TTTFFFFFTTTF?????? 35823e519524SHoward Hinnant // f ff m m1 l 35831968804aSArthur O'Dwyer __second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 35843e519524SHoward Hinnant__second_half_done: 35853e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35863e519524SHoward Hinnant // f ff m sf l 3587ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35883e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35893e519524SHoward Hinnant // | 35903e519524SHoward Hinnant} 35913e519524SHoward Hinnant 35923e519524SHoward Hinnantstruct __return_temporary_buffer 35933e519524SHoward Hinnant{ 35943e519524SHoward Hinnant template <class _Tp> 3595ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 35963e519524SHoward Hinnant}; 35973e519524SHoward Hinnant 35983e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 35993e519524SHoward Hinnant_ForwardIterator 36003e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 36013e519524SHoward Hinnant forward_iterator_tag) 36023e519524SHoward Hinnant{ 36033e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 36043e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36053e519524SHoward Hinnant while (true) 36063e519524SHoward Hinnant { 36073e519524SHoward Hinnant if (__first == __last) 36083e519524SHoward Hinnant return __first; 36093e519524SHoward Hinnant if (!__pred(*__first)) 36103e519524SHoward Hinnant break; 36113e519524SHoward Hinnant ++__first; 36123e519524SHoward Hinnant } 36133e519524SHoward Hinnant // We now have a reduced range [__first, __last) 36143e519524SHoward Hinnant // *__first is known to be false 36153e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 36163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3617ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 36183e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36193e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36203e519524SHoward Hinnant if (__len >= __alloc_limit) 36213e519524SHoward Hinnant { 3622ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36233e519524SHoward Hinnant __h.reset(__p.first); 36243e519524SHoward Hinnant } 36251968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 36263e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 36273e519524SHoward Hinnant} 36283e519524SHoward Hinnant 36293e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 36303e519524SHoward Hinnant_BidirectionalIterator 36313e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36323e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 36333e519524SHoward Hinnant{ 36343e519524SHoward Hinnant // *__first is known to be false 36353e519524SHoward Hinnant // *__last is known to be true 36363e519524SHoward Hinnant // __len >= 2 36373e519524SHoward Hinnant if (__len == 2) 36383e519524SHoward Hinnant { 36393e519524SHoward Hinnant swap(*__first, *__last); 36403e519524SHoward Hinnant return __last; 36413e519524SHoward Hinnant } 36423e519524SHoward Hinnant if (__len == 3) 36433e519524SHoward Hinnant { 36443e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36453e519524SHoward Hinnant if (__pred(*++__m)) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant swap(*__first, *__m); 36483e519524SHoward Hinnant swap(*__m, *__last); 36493e519524SHoward Hinnant return __last; 36503e519524SHoward Hinnant } 36513e519524SHoward Hinnant swap(*__m, *__last); 36523e519524SHoward Hinnant swap(*__first, *__m); 36533e519524SHoward Hinnant return __m; 36543e519524SHoward Hinnant } 36553e519524SHoward Hinnant if (__len <= __p.second) 36563e519524SHoward Hinnant { // The buffer is big enough to use 36573e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36583e519524SHoward Hinnant __destruct_n __d(0); 36593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 36603e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 36613e519524SHoward Hinnant // Update __first to always point to the end of the trues 36623e519524SHoward Hinnant value_type* __t = __p.first; 3663be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__first)); 3664527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 36653e519524SHoward Hinnant ++__t; 36663e519524SHoward Hinnant _BidirectionalIterator __i = __first; 36673e519524SHoward Hinnant while (++__i != __last) 36683e519524SHoward Hinnant { 36693e519524SHoward Hinnant if (__pred(*__i)) 36703e519524SHoward Hinnant { 3671ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36723e519524SHoward Hinnant ++__first; 36733e519524SHoward Hinnant } 36743e519524SHoward Hinnant else 36753e519524SHoward Hinnant { 3676be4c657bSArthur O'Dwyer ::new ((void*)__t) value_type(_VSTD::move(*__i)); 3677527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 36783e519524SHoward Hinnant ++__t; 36793e519524SHoward Hinnant } 36803e519524SHoward Hinnant } 36813e519524SHoward Hinnant // move *__last, known to be true 3682ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36833e519524SHoward Hinnant __i = ++__first; 36843e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 36853e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 36867fa68653SMarshall Clow for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) 3687ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 36883e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 36893e519524SHoward Hinnant return __first; 36903e519524SHoward Hinnant } 36913e519524SHoward Hinnant // Else not enough buffer, do in place 36923e519524SHoward Hinnant // __len >= 4 36933e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36943e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3695ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 36963e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 36973e519524SHoward Hinnant // F????????????????T 36983e519524SHoward Hinnant // f m l 36993e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 37003e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 37013e519524SHoward Hinnant _Distance __len_half = __len2; 37023e519524SHoward Hinnant while (!__pred(*--__m1)) 37033e519524SHoward Hinnant { 37043e519524SHoward Hinnant if (__m1 == __first) 37053e519524SHoward Hinnant goto __first_half_done; 37063e519524SHoward Hinnant --__len_half; 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant // F???TFFF?????????T 37093e519524SHoward Hinnant // f m1 m l 37103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 37111968804aSArthur O'Dwyer __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 37123e519524SHoward Hinnant__first_half_done: 37133e519524SHoward Hinnant // TTTFFFFF?????????T 37143e519524SHoward Hinnant // f ff m l 37153e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 37163e519524SHoward Hinnant __m1 = __m; 37173e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 37183e519524SHoward Hinnant ++__second_false; 37193e519524SHoward Hinnant __len_half = __len - __len2; 37203e519524SHoward Hinnant while (__pred(*__m1)) 37213e519524SHoward Hinnant { 37223e519524SHoward Hinnant if (++__m1 == __last) 37233e519524SHoward Hinnant goto __second_half_done; 37243e519524SHoward Hinnant --__len_half; 37253e519524SHoward Hinnant } 37263e519524SHoward Hinnant // TTTFFFFFTTTF?????T 37273e519524SHoward Hinnant // f ff m m1 l 37281968804aSArthur O'Dwyer __second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 37293e519524SHoward Hinnant__second_half_done: 37303e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 37313e519524SHoward Hinnant // f ff m sf l 3732ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 37333e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 37343e519524SHoward Hinnant // | 37353e519524SHoward Hinnant} 37363e519524SHoward Hinnant 37373e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 37383e519524SHoward Hinnant_BidirectionalIterator 37393e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 37403e519524SHoward Hinnant bidirectional_iterator_tag) 37413e519524SHoward Hinnant{ 37423e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 37433e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 37443e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 37453e519524SHoward Hinnant // Either prove all true and return __first or point to first false 37463e519524SHoward Hinnant while (true) 37473e519524SHoward Hinnant { 37483e519524SHoward Hinnant if (__first == __last) 37493e519524SHoward Hinnant return __first; 37503e519524SHoward Hinnant if (!__pred(*__first)) 37513e519524SHoward Hinnant break; 37523e519524SHoward Hinnant ++__first; 37533e519524SHoward Hinnant } 37543e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 37553e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 37563e519524SHoward Hinnant do 37573e519524SHoward Hinnant { 37583e519524SHoward Hinnant if (__first == --__last) 37593e519524SHoward Hinnant return __first; 37603e519524SHoward Hinnant } while (!__pred(*__last)); 37613e519524SHoward Hinnant // We now have a reduced range [__first, __last] 37623e519524SHoward Hinnant // *__first is known to be false 37633e519524SHoward Hinnant // *__last is known to be true 37643e519524SHoward Hinnant // __len >= 2 3765ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 37663e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 37673e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 37683e519524SHoward Hinnant if (__len >= __alloc_limit) 37693e519524SHoward Hinnant { 3770ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 37713e519524SHoward Hinnant __h.reset(__p.first); 37723e519524SHoward Hinnant } 37731968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 37743e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 37753e519524SHoward Hinnant} 37763e519524SHoward Hinnant 37773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 37783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37793e519524SHoward Hinnant_ForwardIterator 37803e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 37813e519524SHoward Hinnant{ 37821968804aSArthur O'Dwyer return _VSTD::__stable_partition<typename add_lvalue_reference<_Predicate>::type> 37833e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 37843e519524SHoward Hinnant} 37853e519524SHoward Hinnant 37863e519524SHoward Hinnant// is_sorted_until 37873e519524SHoward Hinnant 37883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37891362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 37903e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37913e519524SHoward Hinnant{ 37923e519524SHoward Hinnant if (__first != __last) 37933e519524SHoward Hinnant { 37943e519524SHoward Hinnant _ForwardIterator __i = __first; 37953e519524SHoward Hinnant while (++__i != __last) 37963e519524SHoward Hinnant { 37973e519524SHoward Hinnant if (__comp(*__i, *__first)) 37983e519524SHoward Hinnant return __i; 37993e519524SHoward Hinnant __first = __i; 38003e519524SHoward Hinnant } 38013e519524SHoward Hinnant } 38023e519524SHoward Hinnant return __last; 38033e519524SHoward Hinnant} 38043e519524SHoward Hinnant 38053e519524SHoward Hinnanttemplate<class _ForwardIterator> 38061362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38071362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38083e519524SHoward Hinnant_ForwardIterator 38093e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 38103e519524SHoward Hinnant{ 3811ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 38123e519524SHoward Hinnant} 38133e519524SHoward Hinnant 38143e519524SHoward Hinnant// is_sorted 38153e519524SHoward Hinnant 38163e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 38171362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38181362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38193e519524SHoward Hinnantbool 38203e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 38213e519524SHoward Hinnant{ 3822ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 38233e519524SHoward Hinnant} 38243e519524SHoward Hinnant 38253e519524SHoward Hinnanttemplate<class _ForwardIterator> 38261362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 38271362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 38283e519524SHoward Hinnantbool 38293e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 38303e519524SHoward Hinnant{ 3831ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 38323e519524SHoward Hinnant} 38333e519524SHoward Hinnant 38343e519524SHoward Hinnant// sort 38353e519524SHoward Hinnant 38363e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 38373e519524SHoward Hinnant 38383e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38395d956563SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 unsigned 38403e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 38413e519524SHoward Hinnant{ 38423e519524SHoward Hinnant unsigned __r = 0; 38433e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 38443e519524SHoward Hinnant { 38453e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 38463e519524SHoward Hinnant return __r; // x <= y && y <= z 38473e519524SHoward Hinnant // x <= y && y > z 38483e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 38493e519524SHoward Hinnant __r = 1; 38503e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 38513e519524SHoward Hinnant { 38523e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 38533e519524SHoward Hinnant __r = 2; 38543e519524SHoward Hinnant } 38553e519524SHoward Hinnant return __r; // x <= y && y < z 38563e519524SHoward Hinnant } 38573e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 38583e519524SHoward Hinnant { 38593e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 38603e519524SHoward Hinnant __r = 1; 38613e519524SHoward Hinnant return __r; 38623e519524SHoward Hinnant } 38633e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 38643e519524SHoward Hinnant __r = 1; // x < y && x <= z 38653e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 38663e519524SHoward Hinnant { 38673e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 38683e519524SHoward Hinnant __r = 2; 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant return __r; 38713e519524SHoward Hinnant} // x <= y && y <= z 38723e519524SHoward Hinnant 38733e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 38743e519524SHoward Hinnant 38753e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38763e519524SHoward Hinnantunsigned 38773e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38783e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 38793e519524SHoward Hinnant{ 38801968804aSArthur O'Dwyer unsigned __r = _VSTD::__sort3<_Compare>(__x1, __x2, __x3, __c); 38813e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38823e519524SHoward Hinnant { 38833e519524SHoward Hinnant swap(*__x3, *__x4); 38843e519524SHoward Hinnant ++__r; 38853e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38863e519524SHoward Hinnant { 38873e519524SHoward Hinnant swap(*__x2, *__x3); 38883e519524SHoward Hinnant ++__r; 38893e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38903e519524SHoward Hinnant { 38913e519524SHoward Hinnant swap(*__x1, *__x2); 38923e519524SHoward Hinnant ++__r; 38933e519524SHoward Hinnant } 38943e519524SHoward Hinnant } 38953e519524SHoward Hinnant } 38963e519524SHoward Hinnant return __r; 38973e519524SHoward Hinnant} 38983e519524SHoward Hinnant 38993e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 39003e519524SHoward Hinnant 39013e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3902835140a4SLouis Dionne_LIBCPP_HIDDEN 39033e519524SHoward Hinnantunsigned 39043e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 39053e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 39063e519524SHoward Hinnant{ 39071968804aSArthur O'Dwyer unsigned __r = _VSTD::__sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 39083e519524SHoward Hinnant if (__c(*__x5, *__x4)) 39093e519524SHoward Hinnant { 39103e519524SHoward Hinnant swap(*__x4, *__x5); 39113e519524SHoward Hinnant ++__r; 39123e519524SHoward Hinnant if (__c(*__x4, *__x3)) 39133e519524SHoward Hinnant { 39143e519524SHoward Hinnant swap(*__x3, *__x4); 39153e519524SHoward Hinnant ++__r; 39163e519524SHoward Hinnant if (__c(*__x3, *__x2)) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant swap(*__x2, *__x3); 39193e519524SHoward Hinnant ++__r; 39203e519524SHoward Hinnant if (__c(*__x2, *__x1)) 39213e519524SHoward Hinnant { 39223e519524SHoward Hinnant swap(*__x1, *__x2); 39233e519524SHoward Hinnant ++__r; 39243e519524SHoward Hinnant } 39253e519524SHoward Hinnant } 39263e519524SHoward Hinnant } 39273e519524SHoward Hinnant } 39283e519524SHoward Hinnant return __r; 39293e519524SHoward Hinnant} 39303e519524SHoward Hinnant 39313e519524SHoward Hinnant// Assumes size > 0 39321d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 39335d956563SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 void 39341d7c39e1SArthur O'Dwyer__selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 39353e519524SHoward Hinnant{ 39361d7c39e1SArthur O'Dwyer _BidirectionalIterator __lm1 = __last; 39373e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 39383e519524SHoward Hinnant { 39391d7c39e1SArthur O'Dwyer _BidirectionalIterator __i = _VSTD::min_element<_BidirectionalIterator, 39403e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 39413e519524SHoward Hinnant (__first, __last, __comp); 39423e519524SHoward Hinnant if (__i != __first) 39433e519524SHoward Hinnant swap(*__first, *__i); 39443e519524SHoward Hinnant } 39453e519524SHoward Hinnant} 39463e519524SHoward Hinnant 39471d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 39483e519524SHoward Hinnantvoid 39491d7c39e1SArthur O'Dwyer__insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 39503e519524SHoward Hinnant{ 39511d7c39e1SArthur O'Dwyer typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 39523e519524SHoward Hinnant if (__first != __last) 39533e519524SHoward Hinnant { 39541d7c39e1SArthur O'Dwyer _BidirectionalIterator __i = __first; 39553e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 39563e519524SHoward Hinnant { 39571d7c39e1SArthur O'Dwyer _BidirectionalIterator __j = __i; 3958ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 39591d7c39e1SArthur O'Dwyer for (_BidirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3960ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3961ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39623e519524SHoward Hinnant } 39633e519524SHoward Hinnant } 39643e519524SHoward Hinnant} 39653e519524SHoward Hinnant 39663e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39673e519524SHoward Hinnantvoid 39683e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39693e519524SHoward Hinnant{ 39703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39713e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39721968804aSArthur O'Dwyer _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); 39733e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39743e519524SHoward Hinnant { 39753e519524SHoward Hinnant if (__comp(*__i, *__j)) 39763e519524SHoward Hinnant { 3977ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39783e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39793e519524SHoward Hinnant __j = __i; 39803e519524SHoward Hinnant do 39813e519524SHoward Hinnant { 3982ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39833e519524SHoward Hinnant __j = __k; 39843e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3985ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39863e519524SHoward Hinnant } 39873e519524SHoward Hinnant __j = __i; 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant} 39903e519524SHoward Hinnant 39913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39923e519524SHoward Hinnantbool 39933e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39943e519524SHoward Hinnant{ 39953e519524SHoward Hinnant switch (__last - __first) 39963e519524SHoward Hinnant { 39973e519524SHoward Hinnant case 0: 39983e519524SHoward Hinnant case 1: 39993e519524SHoward Hinnant return true; 40003e519524SHoward Hinnant case 2: 40013e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40023e519524SHoward Hinnant swap(*__first, *__last); 40033e519524SHoward Hinnant return true; 40043e519524SHoward Hinnant case 3: 4005ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40063e519524SHoward Hinnant return true; 40073e519524SHoward Hinnant case 4: 4008ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40093e519524SHoward Hinnant return true; 40103e519524SHoward Hinnant case 5: 4011ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40123e519524SHoward Hinnant return true; 40133e519524SHoward Hinnant } 40143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 40153e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 40161968804aSArthur O'Dwyer _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); 40173e519524SHoward Hinnant const unsigned __limit = 8; 40183e519524SHoward Hinnant unsigned __count = 0; 40193e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 40203e519524SHoward Hinnant { 40213e519524SHoward Hinnant if (__comp(*__i, *__j)) 40223e519524SHoward Hinnant { 4023ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 40243e519524SHoward Hinnant _RandomAccessIterator __k = __j; 40253e519524SHoward Hinnant __j = __i; 40263e519524SHoward Hinnant do 40273e519524SHoward Hinnant { 4028ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 40293e519524SHoward Hinnant __j = __k; 40303e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 4031ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 40323e519524SHoward Hinnant if (++__count == __limit) 40333e519524SHoward Hinnant return ++__i == __last; 40343e519524SHoward Hinnant } 40353e519524SHoward Hinnant __j = __i; 40363e519524SHoward Hinnant } 40373e519524SHoward Hinnant return true; 40383e519524SHoward Hinnant} 40393e519524SHoward Hinnant 40401d7c39e1SArthur O'Dwyertemplate <class _Compare, class _BidirectionalIterator> 40413e519524SHoward Hinnantvoid 40421d7c39e1SArthur O'Dwyer__insertion_sort_move(_BidirectionalIterator __first1, _BidirectionalIterator __last1, 40431d7c39e1SArthur O'Dwyer typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) 40443e519524SHoward Hinnant{ 40451d7c39e1SArthur O'Dwyer typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 40463e519524SHoward Hinnant if (__first1 != __last1) 40473e519524SHoward Hinnant { 40483e519524SHoward Hinnant __destruct_n __d(0); 40493e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 40503e519524SHoward Hinnant value_type* __last2 = __first2; 4051be4c657bSArthur O'Dwyer ::new ((void*)__last2) value_type(_VSTD::move(*__first1)); 4052527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40533e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 40543e519524SHoward Hinnant { 40553e519524SHoward Hinnant value_type* __j2 = __last2; 40563e519524SHoward Hinnant value_type* __i2 = __j2; 40573e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 40583e519524SHoward Hinnant { 4059be4c657bSArthur O'Dwyer ::new ((void*)__j2) value_type(_VSTD::move(*__i2)); 4060527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40613e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 4062ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 4063ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 40643e519524SHoward Hinnant } 40653e519524SHoward Hinnant else 40663e519524SHoward Hinnant { 4067be4c657bSArthur O'Dwyer ::new ((void*)__j2) value_type(_VSTD::move(*__first1)); 4068527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 40693e519524SHoward Hinnant } 40703e519524SHoward Hinnant } 40713e519524SHoward Hinnant __h.release(); 40723e519524SHoward Hinnant } 40733e519524SHoward Hinnant} 40743e519524SHoward Hinnant 40753e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 40763e519524SHoward Hinnantvoid 40773e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40783e519524SHoward Hinnant{ 40793e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 40803e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4081ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 4082ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 40833e519524SHoward Hinnant while (true) 40843e519524SHoward Hinnant { 40853e519524SHoward Hinnant __restart: 40863e519524SHoward Hinnant difference_type __len = __last - __first; 40873e519524SHoward Hinnant switch (__len) 40883e519524SHoward Hinnant { 40893e519524SHoward Hinnant case 0: 40903e519524SHoward Hinnant case 1: 40913e519524SHoward Hinnant return; 40923e519524SHoward Hinnant case 2: 40933e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40943e519524SHoward Hinnant swap(*__first, *__last); 40953e519524SHoward Hinnant return; 40963e519524SHoward Hinnant case 3: 4097ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40983e519524SHoward Hinnant return; 40993e519524SHoward Hinnant case 4: 4100ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 41013e519524SHoward Hinnant return; 41023e519524SHoward Hinnant case 5: 4103ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 41043e519524SHoward Hinnant return; 41053e519524SHoward Hinnant } 41063e519524SHoward Hinnant if (__len <= __limit) 41073e519524SHoward Hinnant { 4108ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 41093e519524SHoward Hinnant return; 41103e519524SHoward Hinnant } 41113e519524SHoward Hinnant // __len > 5 41123e519524SHoward Hinnant _RandomAccessIterator __m = __first; 41133e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 41143e519524SHoward Hinnant --__lm1; 41153e519524SHoward Hinnant unsigned __n_swaps; 41163e519524SHoward Hinnant { 41173e519524SHoward Hinnant difference_type __delta; 41183e519524SHoward Hinnant if (__len >= 1000) 41193e519524SHoward Hinnant { 41203e519524SHoward Hinnant __delta = __len/2; 41213e519524SHoward Hinnant __m += __delta; 41223e519524SHoward Hinnant __delta /= 2; 4123ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 41243e519524SHoward Hinnant } 41253e519524SHoward Hinnant else 41263e519524SHoward Hinnant { 41273e519524SHoward Hinnant __delta = __len/2; 41283e519524SHoward Hinnant __m += __delta; 4129ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 41303e519524SHoward Hinnant } 41313e519524SHoward Hinnant } 41323e519524SHoward Hinnant // *__m is median 41333e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 41343e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 41353e519524SHoward Hinnant _RandomAccessIterator __i = __first; 41363e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 41373e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41383e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 41393e519524SHoward Hinnant // Prime the downward search with a guard. 41403e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 41413e519524SHoward Hinnant { 41423e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 41433e519524SHoward Hinnant // manually guard downward moving __j against __i 41443e519524SHoward Hinnant while (true) 41453e519524SHoward Hinnant { 41463e519524SHoward Hinnant if (__i == --__j) 41473e519524SHoward Hinnant { 41483e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 41493e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 41503e519524SHoward Hinnant ++__i; // __first + 1 41513e519524SHoward Hinnant __j = __last; 41523e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 41533e519524SHoward Hinnant { 41543e519524SHoward Hinnant while (true) 41553e519524SHoward Hinnant { 41563e519524SHoward Hinnant if (__i == __j) 41573e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 41583e519524SHoward Hinnant if (__comp(*__first, *__i)) 41593e519524SHoward Hinnant { 41603e519524SHoward Hinnant swap(*__i, *__j); 41613e519524SHoward Hinnant ++__n_swaps; 41623e519524SHoward Hinnant ++__i; 41633e519524SHoward Hinnant break; 41643e519524SHoward Hinnant } 41653e519524SHoward Hinnant ++__i; 41663e519524SHoward Hinnant } 41673e519524SHoward Hinnant } 41683e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 41693e519524SHoward Hinnant if (__i == __j) 41703e519524SHoward Hinnant return; 41713e519524SHoward Hinnant while (true) 41723e519524SHoward Hinnant { 41733e519524SHoward Hinnant while (!__comp(*__first, *__i)) 41743e519524SHoward Hinnant ++__i; 41753e519524SHoward Hinnant while (__comp(*__first, *--__j)) 41763e519524SHoward Hinnant ; 41773e519524SHoward Hinnant if (__i >= __j) 41783e519524SHoward Hinnant break; 41793e519524SHoward Hinnant swap(*__i, *__j); 41803e519524SHoward Hinnant ++__n_swaps; 41813e519524SHoward Hinnant ++__i; 41823e519524SHoward Hinnant } 41833e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 4184b6f19174SArthur O'Dwyer // The first part is sorted, sort the second part 4185ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 41863e519524SHoward Hinnant __first = __i; 41873e519524SHoward Hinnant goto __restart; 41883e519524SHoward Hinnant } 41893e519524SHoward Hinnant if (__comp(*__j, *__m)) 41903e519524SHoward Hinnant { 41913e519524SHoward Hinnant swap(*__i, *__j); 41923e519524SHoward Hinnant ++__n_swaps; 41933e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 41943e519524SHoward Hinnant } 41953e519524SHoward Hinnant } 41963e519524SHoward Hinnant } 41973e519524SHoward Hinnant // It is known that *__i < *__m 41983e519524SHoward Hinnant ++__i; 41993e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 42003e519524SHoward Hinnant // if not yet partitioned... 42013e519524SHoward Hinnant if (__i < __j) 42023e519524SHoward Hinnant { 42033e519524SHoward Hinnant // known that *(__i - 1) < *__m 42043e519524SHoward Hinnant // known that __i <= __m 42053e519524SHoward Hinnant while (true) 42063e519524SHoward Hinnant { 42073e519524SHoward Hinnant // __m still guards upward moving __i 42083e519524SHoward Hinnant while (__comp(*__i, *__m)) 42093e519524SHoward Hinnant ++__i; 42103e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 42113e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 42123e519524SHoward Hinnant ; 42133e519524SHoward Hinnant if (__i > __j) 42143e519524SHoward Hinnant break; 42153e519524SHoward Hinnant swap(*__i, *__j); 42163e519524SHoward Hinnant ++__n_swaps; 42173e519524SHoward Hinnant // It is known that __m != __j 42183e519524SHoward Hinnant // If __m just moved, follow it 42193e519524SHoward Hinnant if (__m == __i) 42203e519524SHoward Hinnant __m = __j; 42213e519524SHoward Hinnant ++__i; 42223e519524SHoward Hinnant } 42233e519524SHoward Hinnant } 42243e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 42253e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 42263e519524SHoward Hinnant { 42273e519524SHoward Hinnant swap(*__i, *__m); 42283e519524SHoward Hinnant ++__n_swaps; 42293e519524SHoward Hinnant } 42303e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 42313e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 42323e519524SHoward Hinnant if (__n_swaps == 0) 42333e519524SHoward Hinnant { 4234ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4235ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 42363e519524SHoward Hinnant { 42373e519524SHoward Hinnant if (__fs) 42383e519524SHoward Hinnant return; 42393e519524SHoward Hinnant __last = __i; 42403e519524SHoward Hinnant continue; 42413e519524SHoward Hinnant } 42423e519524SHoward Hinnant else 42433e519524SHoward Hinnant { 42443e519524SHoward Hinnant if (__fs) 42453e519524SHoward Hinnant { 42463e519524SHoward Hinnant __first = ++__i; 42473e519524SHoward Hinnant continue; 42483e519524SHoward Hinnant } 42493e519524SHoward Hinnant } 42503e519524SHoward Hinnant } 42513e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 42523e519524SHoward Hinnant if (__i - __first < __last - __i) 42533e519524SHoward Hinnant { 4254ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4255ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 42563e519524SHoward Hinnant __first = ++__i; 42573e519524SHoward Hinnant } 42583e519524SHoward Hinnant else 42593e519524SHoward Hinnant { 4260ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4261ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 42623e519524SHoward Hinnant __last = __i; 42633e519524SHoward Hinnant } 42643e519524SHoward Hinnant } 42653e519524SHoward Hinnant} 42663e519524SHoward Hinnant 4267493f1407SArthur O'Dwyertemplate <class _Compare, class _Tp> 42683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42693e519524SHoward Hinnantvoid 4270493f1407SArthur O'Dwyer__sort(_Tp** __first, _Tp** __last, __less<_Tp*>&) 42713e519524SHoward Hinnant{ 4272493f1407SArthur O'Dwyer __less<uintptr_t> __comp; 4273493f1407SArthur O'Dwyer _VSTD::__sort<__less<uintptr_t>&, uintptr_t*>((uintptr_t*)__first, (uintptr_t*)__last, __comp); 4274f554add5SHoward Hinnant} 4275f554add5SHoward Hinnant 4276f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4277f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4278f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4279f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4280f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4281f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4282f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4283f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4284f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4285f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4286f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4287f0544c20SHoward 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>&)) 4288f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4289f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4290f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42913e519524SHoward Hinnant 4292f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4293f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4294f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4295f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4296f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4297f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4298f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4299f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4300f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4301f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4302f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4303f0544c20SHoward 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>&)) 4304f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4305f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4306f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 43073e519524SHoward Hinnant 4308f0544c20SHoward 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>&)) 43093e519524SHoward Hinnant 43103e519524SHoward Hinnant// lower_bound 43113e519524SHoward Hinnant 43123e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4313d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4314e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43153e519524SHoward Hinnant{ 43163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4317ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43183e519524SHoward Hinnant while (__len != 0) 43193e519524SHoward Hinnant { 432004695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 43213e519524SHoward Hinnant _ForwardIterator __m = __first; 4322ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4323e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43243e519524SHoward Hinnant { 43253e519524SHoward Hinnant __first = ++__m; 43263e519524SHoward Hinnant __len -= __l2 + 1; 43273e519524SHoward Hinnant } 43283e519524SHoward Hinnant else 43293e519524SHoward Hinnant __len = __l2; 43303e519524SHoward Hinnant } 43313e519524SHoward Hinnant return __first; 43323e519524SHoward Hinnant} 43333e519524SHoward Hinnant 43343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43351362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43361362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43373e519524SHoward Hinnant_ForwardIterator 4338e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43393e519524SHoward Hinnant{ 43403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43411968804aSArthur O'Dwyer return _VSTD::__lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 43423e519524SHoward Hinnant} 43433e519524SHoward Hinnant 43443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43451362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43461362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43473e519524SHoward Hinnant_ForwardIterator 4348e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43493e519524SHoward Hinnant{ 4350e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 43513e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43523e519524SHoward Hinnant} 43533e519524SHoward Hinnant 43543e519524SHoward Hinnant// upper_bound 43553e519524SHoward Hinnant 43563e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4357d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4358e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43593e519524SHoward Hinnant{ 43603e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4361ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43623e519524SHoward Hinnant while (__len != 0) 43633e519524SHoward Hinnant { 436404695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 43653e519524SHoward Hinnant _ForwardIterator __m = __first; 4366ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4367e4383379SHoward Hinnant if (__comp(__value_, *__m)) 43683e519524SHoward Hinnant __len = __l2; 43693e519524SHoward Hinnant else 43703e519524SHoward Hinnant { 43713e519524SHoward Hinnant __first = ++__m; 43723e519524SHoward Hinnant __len -= __l2 + 1; 43733e519524SHoward Hinnant } 43743e519524SHoward Hinnant } 43753e519524SHoward Hinnant return __first; 43763e519524SHoward Hinnant} 43773e519524SHoward Hinnant 43783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43791362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43801362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43813e519524SHoward Hinnant_ForwardIterator 4382e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43833e519524SHoward Hinnant{ 43843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 43851968804aSArthur O'Dwyer return _VSTD::__upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 43863e519524SHoward Hinnant} 43873e519524SHoward Hinnant 43883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43891362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 43901362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43913e519524SHoward Hinnant_ForwardIterator 4392e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43933e519524SHoward Hinnant{ 4394e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43953e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43963e519524SHoward Hinnant} 43973e519524SHoward Hinnant 43983e519524SHoward Hinnant// equal_range 43993e519524SHoward Hinnant 44003e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4401d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4402e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44033e519524SHoward Hinnant{ 44043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4405ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 44063e519524SHoward Hinnant while (__len != 0) 44073e519524SHoward Hinnant { 440804695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 44093e519524SHoward Hinnant _ForwardIterator __m = __first; 4410ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4411e4383379SHoward Hinnant if (__comp(*__m, __value_)) 44123e519524SHoward Hinnant { 44133e519524SHoward Hinnant __first = ++__m; 44143e519524SHoward Hinnant __len -= __l2 + 1; 44153e519524SHoward Hinnant } 4416e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 44173e519524SHoward Hinnant { 44183e519524SHoward Hinnant __last = __m; 44193e519524SHoward Hinnant __len = __l2; 44203e519524SHoward Hinnant } 44213e519524SHoward Hinnant else 44223e519524SHoward Hinnant { 44233e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 44243e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 44253e519524SHoward Hinnant ( 44261968804aSArthur O'Dwyer _VSTD::__lower_bound<_Compare>(__first, __m, __value_, __comp), 44271968804aSArthur O'Dwyer _VSTD::__upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 44283e519524SHoward Hinnant ); 44293e519524SHoward Hinnant } 44303e519524SHoward Hinnant } 44313e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 44323e519524SHoward Hinnant} 44333e519524SHoward Hinnant 44343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44351362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44361362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44373e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4438e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44393e519524SHoward Hinnant{ 4440aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 44411968804aSArthur O'Dwyer return _VSTD::__equal_range<_Comp_ref>(__first, __last, __value_, __comp); 44423e519524SHoward Hinnant} 44433e519524SHoward Hinnant 44443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44451362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44461362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44473e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4448e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44493e519524SHoward Hinnant{ 4450e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44513e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44523e519524SHoward Hinnant} 44533e519524SHoward Hinnant 44543e519524SHoward Hinnant// binary_search 44553e519524SHoward Hinnant 44563e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4457d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44583e519524SHoward Hinnantbool 4459e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44603e519524SHoward Hinnant{ 44611968804aSArthur O'Dwyer __first = _VSTD::__lower_bound<_Compare>(__first, __last, __value_, __comp); 4462e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44633e519524SHoward Hinnant} 44643e519524SHoward Hinnant 44653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44661362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44671362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44683e519524SHoward Hinnantbool 4469e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44703e519524SHoward Hinnant{ 4471aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 44721968804aSArthur O'Dwyer return _VSTD::__binary_search<_Comp_ref>(__first, __last, __value_, __comp); 44733e519524SHoward Hinnant} 44743e519524SHoward Hinnant 44753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44761362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 44771362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 44783e519524SHoward Hinnantbool 4479e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44803e519524SHoward Hinnant{ 4481e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44823e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44833e519524SHoward Hinnant} 44843e519524SHoward Hinnant 44853e519524SHoward Hinnant// merge 44863e519524SHoward Hinnant 44873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 4488b552a302SNicholas-Baron_LIBCPP_CONSTEXPR_AFTER_CXX17 44893e519524SHoward Hinnant_OutputIterator 44903e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44923e519524SHoward Hinnant{ 44933e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44943e519524SHoward Hinnant { 44953e519524SHoward Hinnant if (__first2 == __last2) 4496ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44973e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44983e519524SHoward Hinnant { 44993e519524SHoward Hinnant *__result = *__first2; 45003e519524SHoward Hinnant ++__first2; 45013e519524SHoward Hinnant } 45023e519524SHoward Hinnant else 45033e519524SHoward Hinnant { 45043e519524SHoward Hinnant *__result = *__first1; 45053e519524SHoward Hinnant ++__first1; 45063e519524SHoward Hinnant } 45073e519524SHoward Hinnant } 4508ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 45093e519524SHoward Hinnant} 45103e519524SHoward Hinnant 45113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 4512b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45133e519524SHoward Hinnant_OutputIterator 45143e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 45163e519524SHoward Hinnant{ 4517aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4518ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 45193e519524SHoward Hinnant} 45203e519524SHoward Hinnant 45213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 4522b552a302SNicholas-Baroninline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 45233e519524SHoward Hinnant_OutputIterator 45243e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 45263e519524SHoward Hinnant{ 45273e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 45283e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 45294f41779cSMarshall Clow return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 45303e519524SHoward Hinnant} 45313e519524SHoward Hinnant 45323e519524SHoward Hinnant// inplace_merge 45333e519524SHoward Hinnant 4534adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4535adfdae18SMarshall Clow class _OutputIterator> 4536adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4537adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4538adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4539adfdae18SMarshall Clow{ 4540adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4541adfdae18SMarshall Clow { 4542adfdae18SMarshall Clow if (__first2 == __last2) 4543adfdae18SMarshall Clow { 4544adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4545adfdae18SMarshall Clow return; 4546adfdae18SMarshall Clow } 4547adfdae18SMarshall Clow 4548adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4549adfdae18SMarshall Clow { 4550adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4551adfdae18SMarshall Clow ++__first2; 4552adfdae18SMarshall Clow } 4553adfdae18SMarshall Clow else 4554adfdae18SMarshall Clow { 4555adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4556adfdae18SMarshall Clow ++__first1; 4557adfdae18SMarshall Clow } 4558adfdae18SMarshall Clow } 4559adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4560adfdae18SMarshall Clow} 4561adfdae18SMarshall Clow 45623e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45633e519524SHoward Hinnantvoid 45643e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45653e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45663e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45673e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45683e519524SHoward Hinnant{ 45693e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45703e519524SHoward Hinnant __destruct_n __d(0); 45713e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45723e519524SHoward Hinnant if (__len1 <= __len2) 45733e519524SHoward Hinnant { 45743e519524SHoward Hinnant value_type* __p = __buff; 4575527a7fdfSBruce Mitchener for (_BidirectionalIterator __i = __first; __i != __middle; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p) 4576be4c657bSArthur O'Dwyer ::new ((void*)__p) value_type(_VSTD::move(*__i)); 4577eef4bdbbSArthur O'Dwyer _VSTD::__half_inplace_merge<_Compare>(__buff, __p, __middle, __last, __first, __comp); 45783e519524SHoward Hinnant } 45793e519524SHoward Hinnant else 45803e519524SHoward Hinnant { 45813e519524SHoward Hinnant value_type* __p = __buff; 4582527a7fdfSBruce Mitchener for (_BidirectionalIterator __i = __middle; __i != __last; __d.template __incr<value_type>(), (void) ++__i, (void) ++__p) 4583be4c657bSArthur O'Dwyer ::new ((void*)__p) value_type(_VSTD::move(*__i)); 45843e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45853e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4586eef4bdbbSArthur O'Dwyer typedef __invert<_Compare> _Inverted; 4587eef4bdbbSArthur O'Dwyer _VSTD::__half_inplace_merge<_Inverted>(_Rv(__p), _Rv(__buff), 4588adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4589eef4bdbbSArthur O'Dwyer _RBi(__last), _Inverted(__comp)); 45903e519524SHoward Hinnant } 45913e519524SHoward Hinnant} 45923e519524SHoward Hinnant 45933e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45943e519524SHoward Hinnantvoid 45953e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45963e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45973e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45983e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45993e519524SHoward Hinnant{ 46003e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 46013e519524SHoward Hinnant while (true) 46023e519524SHoward Hinnant { 46033e519524SHoward Hinnant // if __middle == __last, we're done 46043e519524SHoward Hinnant if (__len2 == 0) 46053e519524SHoward Hinnant return; 4606526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 46071968804aSArthur O'Dwyer return _VSTD::__buffered_inplace_merge<_Compare> 4608526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 46093e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4610910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 46113e519524SHoward Hinnant { 46123e519524SHoward Hinnant if (__len1 == 0) 46133e519524SHoward Hinnant return; 46143e519524SHoward Hinnant if (__comp(*__middle, *__first)) 46153e519524SHoward Hinnant break; 46163e519524SHoward Hinnant } 46173e519524SHoward Hinnant // __first < __middle < __last 46183e519524SHoward Hinnant // *__first > *__middle 46193e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 46203e519524SHoward Hinnant // all elements in: 46213e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 46223e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 46233e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 46243e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 46253e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 46263e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 46273e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 46283e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 46293e519524SHoward Hinnant // binary search smaller range 46303e519524SHoward Hinnant if (__len1 < __len2) 46313e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 46323e519524SHoward Hinnant __len21 = __len2 / 2; 46333e519524SHoward Hinnant __m2 = __middle; 4634ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 46351968804aSArthur O'Dwyer __m1 = _VSTD::__upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4636ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46373e519524SHoward Hinnant } 46383e519524SHoward Hinnant else 46393e519524SHoward Hinnant { 46403e519524SHoward Hinnant if (__len1 == 1) 46413e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46423e519524SHoward Hinnant // It is known *__first > *__middle 46433e519524SHoward Hinnant swap(*__first, *__middle); 46443e519524SHoward Hinnant return; 46453e519524SHoward Hinnant } 46463e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46473e519524SHoward Hinnant __len11 = __len1 / 2; 46483e519524SHoward Hinnant __m1 = __first; 4649ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46501968804aSArthur O'Dwyer __m2 = _VSTD::__lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4651ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46543e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46553e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46563e519524SHoward Hinnant // swap middle two partitions 4657ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46583e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 4659b6f19174SArthur O'Dwyer // merge smaller range with recursive call and larger with tail recursion elimination 46603e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46613e519524SHoward Hinnant { 46621968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46631968804aSArthur O'Dwyer// _VSTD::__inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46643e519524SHoward Hinnant __first = __middle; 46653e519524SHoward Hinnant __middle = __m2; 46663e519524SHoward Hinnant __len1 = __len12; 46673e519524SHoward Hinnant __len2 = __len22; 46683e519524SHoward Hinnant } 46693e519524SHoward Hinnant else 46703e519524SHoward Hinnant { 46711968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46721968804aSArthur O'Dwyer// _VSTD::__inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46733e519524SHoward Hinnant __last = __middle; 46743e519524SHoward Hinnant __middle = __m1; 46753e519524SHoward Hinnant __len1 = __len11; 46763e519524SHoward Hinnant __len2 = __len21; 46773e519524SHoward Hinnant } 46783e519524SHoward Hinnant } 46793e519524SHoward Hinnant} 46803e519524SHoward Hinnant 46813e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46833e519524SHoward Hinnantvoid 46843e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46853e519524SHoward Hinnant _Compare __comp) 46863e519524SHoward Hinnant{ 46873e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46883e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4689ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4690ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4691ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46920b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46930b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 4694aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 4695ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46963e519524SHoward Hinnant __buf.first, __buf.second); 46973e519524SHoward Hinnant} 46983e519524SHoward Hinnant 46993e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 47003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47013e519524SHoward Hinnantvoid 47023e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 47033e519524SHoward Hinnant{ 4704ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 47053e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 47063e519524SHoward Hinnant} 47073e519524SHoward Hinnant 47083e519524SHoward Hinnant// stable_sort 47093e519524SHoward Hinnant 47103e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47113e519524SHoward Hinnantvoid 47123e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 47133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47143e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 47153e519524SHoward Hinnant{ 47163e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 47173e519524SHoward Hinnant __destruct_n __d(0); 47183e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 47193e519524SHoward Hinnant for (; true; ++__result) 47203e519524SHoward Hinnant { 47213e519524SHoward Hinnant if (__first1 == __last1) 47223e519524SHoward Hinnant { 4723527a7fdfSBruce Mitchener for (; __first2 != __last2; ++__first2, ++__result, (void)__d.template __incr<value_type>()) 4724be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first2)); 47253e519524SHoward Hinnant __h.release(); 47263e519524SHoward Hinnant return; 47273e519524SHoward Hinnant } 47283e519524SHoward Hinnant if (__first2 == __last2) 47293e519524SHoward Hinnant { 4730527a7fdfSBruce Mitchener for (; __first1 != __last1; ++__first1, ++__result, (void)__d.template __incr<value_type>()) 4731be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first1)); 47323e519524SHoward Hinnant __h.release(); 47333e519524SHoward Hinnant return; 47343e519524SHoward Hinnant } 47353e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47363e519524SHoward Hinnant { 4737be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first2)); 4738527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 47393e519524SHoward Hinnant ++__first2; 47403e519524SHoward Hinnant } 47413e519524SHoward Hinnant else 47423e519524SHoward Hinnant { 4743be4c657bSArthur O'Dwyer ::new ((void*)__result) value_type(_VSTD::move(*__first1)); 4744527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 47453e519524SHoward Hinnant ++__first1; 47463e519524SHoward Hinnant } 47473e519524SHoward Hinnant } 47483e519524SHoward Hinnant} 47493e519524SHoward Hinnant 47503e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47513e519524SHoward Hinnantvoid 47523e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47543e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47553e519524SHoward Hinnant{ 47563e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47573e519524SHoward Hinnant { 47583e519524SHoward Hinnant if (__first2 == __last2) 47593e519524SHoward Hinnant { 47607fa68653SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__result) 4761ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47623e519524SHoward Hinnant return; 47633e519524SHoward Hinnant } 47643e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47653e519524SHoward Hinnant { 4766ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47673e519524SHoward Hinnant ++__first2; 47683e519524SHoward Hinnant } 47693e519524SHoward Hinnant else 47703e519524SHoward Hinnant { 4771ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47723e519524SHoward Hinnant ++__first1; 47733e519524SHoward Hinnant } 47743e519524SHoward Hinnant } 47757fa68653SMarshall Clow for (; __first2 != __last2; ++__first2, (void) ++__result) 4776ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47773e519524SHoward Hinnant} 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47803e519524SHoward Hinnantvoid 47813e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47843e519524SHoward Hinnant 47853e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47863e519524SHoward Hinnantvoid 47873e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47903e519524SHoward Hinnant{ 47913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47923e519524SHoward Hinnant switch (__len) 47933e519524SHoward Hinnant { 47943e519524SHoward Hinnant case 0: 47953e519524SHoward Hinnant return; 47963e519524SHoward Hinnant case 1: 4797be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 47983e519524SHoward Hinnant return; 47993e519524SHoward Hinnant case 2: 48003e519524SHoward Hinnant __destruct_n __d(0); 48013e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 48023e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 48033e519524SHoward Hinnant { 4804be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__last1)); 4805527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 48063e519524SHoward Hinnant ++__first2; 4807be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 48083e519524SHoward Hinnant } 48093e519524SHoward Hinnant else 48103e519524SHoward Hinnant { 4811be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__first1)); 4812527a7fdfSBruce Mitchener __d.template __incr<value_type>(); 48133e519524SHoward Hinnant ++__first2; 4814be4c657bSArthur O'Dwyer ::new ((void*)__first2) value_type(_VSTD::move(*__last1)); 48153e519524SHoward Hinnant } 48163e519524SHoward Hinnant __h2.release(); 48173e519524SHoward Hinnant return; 48183e519524SHoward Hinnant } 48193e519524SHoward Hinnant if (__len <= 8) 48203e519524SHoward Hinnant { 48211968804aSArthur O'Dwyer _VSTD::__insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 48223e519524SHoward Hinnant return; 48233e519524SHoward Hinnant } 48243e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48253e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 48261968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 48271968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 48281968804aSArthur O'Dwyer _VSTD::__merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48293e519524SHoward Hinnant} 48303e519524SHoward Hinnant 48313e519524SHoward Hinnanttemplate <class _Tp> 48323e519524SHoward Hinnantstruct __stable_sort_switch 48333e519524SHoward Hinnant{ 4834ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48353e519524SHoward Hinnant}; 48363e519524SHoward Hinnant 48373e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48383e519524SHoward Hinnantvoid 48393e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48403e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48413e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48423e519524SHoward Hinnant{ 48433e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48453e519524SHoward Hinnant switch (__len) 48463e519524SHoward Hinnant { 48473e519524SHoward Hinnant case 0: 48483e519524SHoward Hinnant case 1: 48493e519524SHoward Hinnant return; 48503e519524SHoward Hinnant case 2: 48513e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48523e519524SHoward Hinnant swap(*__first, *__last); 48533e519524SHoward Hinnant return; 48543e519524SHoward Hinnant } 48553e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48563e519524SHoward Hinnant { 48571968804aSArthur O'Dwyer _VSTD::__insertion_sort<_Compare>(__first, __last, __comp); 48583e519524SHoward Hinnant return; 48593e519524SHoward Hinnant } 48603e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48613e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48623e519524SHoward Hinnant if (__len <= __buff_size) 48633e519524SHoward Hinnant { 48643e519524SHoward Hinnant __destruct_n __d(0); 48653e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48661968804aSArthur O'Dwyer _VSTD::__stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 4867527a7fdfSBruce Mitchener __d.__set(__l2, (value_type*)nullptr); 48681968804aSArthur O'Dwyer _VSTD::__stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 4869527a7fdfSBruce Mitchener __d.__set(__len, (value_type*)nullptr); 48701968804aSArthur O'Dwyer _VSTD::__merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48711968804aSArthur O'Dwyer// _VSTD::__merge<_Compare>(move_iterator<value_type*>(__buff), 48723e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48733e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48743e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48753e519524SHoward Hinnant// __first, __comp); 48763e519524SHoward Hinnant return; 48773e519524SHoward Hinnant } 48781968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48791968804aSArthur O'Dwyer _VSTD::__stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48801968804aSArthur O'Dwyer _VSTD::__inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48813e519524SHoward Hinnant} 48823e519524SHoward Hinnant 48833e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48853e519524SHoward Hinnantvoid 48863e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48873e519524SHoward Hinnant{ 48883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48903e519524SHoward Hinnant difference_type __len = __last - __first; 48913e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48923e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48933e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48943e519524SHoward Hinnant { 4895ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48963e519524SHoward Hinnant __h.reset(__buf.first); 48973e519524SHoward Hinnant } 4898aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 48991968804aSArthur O'Dwyer _VSTD::__stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 49003e519524SHoward Hinnant} 49013e519524SHoward Hinnant 49023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49043e519524SHoward Hinnantvoid 49053e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 49063e519524SHoward Hinnant{ 4907ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnant// is_heap_until 49113e519524SHoward Hinnant 49123e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49131362d7efSNico Weber_LIBCPP_NODISCARD_EXT _LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 49143e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49153e519524SHoward Hinnant{ 49166491d99eSArthur O'Dwyer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49173e519524SHoward Hinnant difference_type __len = __last - __first; 49183e519524SHoward Hinnant difference_type __p = 0; 49193e519524SHoward Hinnant difference_type __c = 1; 49203e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 49213e519524SHoward Hinnant while (__c < __len) 49223e519524SHoward Hinnant { 49233e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49243e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49253e519524SHoward Hinnant return __cp; 49263e519524SHoward Hinnant ++__c; 49273e519524SHoward Hinnant ++__cp; 49283e519524SHoward Hinnant if (__c == __len) 49293e519524SHoward Hinnant return __last; 49303e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49313e519524SHoward Hinnant return __cp; 49323e519524SHoward Hinnant ++__p; 49333e519524SHoward Hinnant ++__pp; 49343e519524SHoward Hinnant __c = 2 * __p + 1; 49353e519524SHoward Hinnant } 49363e519524SHoward Hinnant return __last; 49373e519524SHoward Hinnant} 49383e519524SHoward Hinnant 49393e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49401362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49411362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49423e519524SHoward Hinnant_RandomAccessIterator 49433e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49443e519524SHoward Hinnant{ 4945ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49463e519524SHoward Hinnant} 49473e519524SHoward Hinnant 49483e519524SHoward Hinnant// is_heap 49493e519524SHoward Hinnant 49503e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49511362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49521362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49533e519524SHoward Hinnantbool 49543e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49553e519524SHoward Hinnant{ 4956ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49573e519524SHoward Hinnant} 49583e519524SHoward Hinnant 49593e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49601362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 49611362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49623e519524SHoward Hinnantbool 49633e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49643e519524SHoward Hinnant{ 4965ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49663e519524SHoward Hinnant} 49673e519524SHoward Hinnant 49683e519524SHoward Hinnant// push_heap 49693e519524SHoward Hinnant 49703e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49715386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 void 49728b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49743e519524SHoward Hinnant{ 49753e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49763e519524SHoward Hinnant if (__len > 1) 49773e519524SHoward Hinnant { 49783e519524SHoward Hinnant __len = (__len - 2) / 2; 49793e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49803e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49813e519524SHoward Hinnant { 4982ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49833e519524SHoward Hinnant do 49843e519524SHoward Hinnant { 4985ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49863e519524SHoward Hinnant __last = __ptr; 49873e519524SHoward Hinnant if (__len == 0) 49883e519524SHoward Hinnant break; 49893e519524SHoward Hinnant __len = (__len - 1) / 2; 49903e519524SHoward Hinnant __ptr = __first + __len; 49913e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4992ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49933e519524SHoward Hinnant } 49943e519524SHoward Hinnant } 49953e519524SHoward Hinnant} 49963e519524SHoward Hinnant 49973e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49985386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 49993e519524SHoward Hinnantvoid 50003e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50013e519524SHoward Hinnant{ 5002aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50031968804aSArthur O'Dwyer _VSTD::__sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 50043e519524SHoward Hinnant} 50053e519524SHoward Hinnant 50063e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50075386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 50083e519524SHoward Hinnantvoid 50093e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50103e519524SHoward Hinnant{ 5011ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnant// pop_heap 50153e519524SHoward Hinnant 50163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50175386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 void 5018fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 5019fd838227SEric Fiselier _Compare __comp, 50208b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50218b512602SDavid Majnemer _RandomAccessIterator __start) 50228b512602SDavid Majnemer{ 50238b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50248b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50258b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50268b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50278b512602SDavid Majnemer difference_type __child = __start - __first; 50288b512602SDavid Majnemer 50298b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50308b512602SDavid Majnemer return; 50318b512602SDavid Majnemer 50328b512602SDavid Majnemer __child = 2 * __child + 1; 50338b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50348b512602SDavid Majnemer 50358b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50368b512602SDavid Majnemer // right-child exists and is greater than left-child 50378b512602SDavid Majnemer ++__child_i; 50388b512602SDavid Majnemer ++__child; 50398b512602SDavid Majnemer } 50408b512602SDavid Majnemer 50418b512602SDavid Majnemer // check if we are in heap-order 50428b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50438b512602SDavid Majnemer // we are, __start is larger than it's largest child 50448b512602SDavid Majnemer return; 50458b512602SDavid Majnemer 50468b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50478b512602SDavid Majnemer do 50488b512602SDavid Majnemer { 50495386aa26SArthur O'Dwyer // we are not in heap-order, swap the parent with its largest child 50508b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50518b512602SDavid Majnemer __start = __child_i; 50528b512602SDavid Majnemer 50538b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50548b512602SDavid Majnemer break; 50558b512602SDavid Majnemer 50568b512602SDavid Majnemer // recompute the child based off of the updated parent 50578b512602SDavid Majnemer __child = 2 * __child + 1; 50588b512602SDavid Majnemer __child_i = __first + __child; 50598b512602SDavid Majnemer 50608b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50618b512602SDavid Majnemer // right-child exists and is greater than left-child 50628b512602SDavid Majnemer ++__child_i; 50638b512602SDavid Majnemer ++__child; 50648b512602SDavid Majnemer } 50658b512602SDavid Majnemer 50668b512602SDavid Majnemer // check if we are in heap-order 50678b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50688b512602SDavid Majnemer *__start = _VSTD::move(__top); 50698b512602SDavid Majnemer} 50708b512602SDavid Majnemer 50718b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50725386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 50733e519524SHoward Hinnantvoid 50743e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50753e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50763e519524SHoward Hinnant{ 50773e519524SHoward Hinnant if (__len > 1) 50783e519524SHoward Hinnant { 50793e519524SHoward Hinnant swap(*__first, *--__last); 50801968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50813e519524SHoward Hinnant } 50823e519524SHoward Hinnant} 50833e519524SHoward Hinnant 50843e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50855386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 50863e519524SHoward Hinnantvoid 50873e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50883e519524SHoward Hinnant{ 5089aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 50901968804aSArthur O'Dwyer _VSTD::__pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 50913e519524SHoward Hinnant} 50923e519524SHoward Hinnant 50933e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50945386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 50953e519524SHoward Hinnantvoid 50963e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50973e519524SHoward Hinnant{ 5098ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50993e519524SHoward Hinnant} 51003e519524SHoward Hinnant 51013e519524SHoward Hinnant// make_heap 51023e519524SHoward Hinnant 51033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51045386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 void 51053e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51063e519524SHoward Hinnant{ 51073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51083e519524SHoward Hinnant difference_type __n = __last - __first; 51093e519524SHoward Hinnant if (__n > 1) 51103e519524SHoward Hinnant { 51118b512602SDavid Majnemer // start from the first parent, there is no need to consider children 51128b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 51138b512602SDavid Majnemer { 51141968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51158b512602SDavid Majnemer } 51163e519524SHoward Hinnant } 51173e519524SHoward Hinnant} 51183e519524SHoward Hinnant 51193e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51205386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51213e519524SHoward Hinnantvoid 51223e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51233e519524SHoward Hinnant{ 5124aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51251968804aSArthur O'Dwyer _VSTD::__make_heap<_Comp_ref>(__first, __last, __comp); 51263e519524SHoward Hinnant} 51273e519524SHoward Hinnant 51283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51295386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51303e519524SHoward Hinnantvoid 51313e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51323e519524SHoward Hinnant{ 5133ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51343e519524SHoward Hinnant} 51353e519524SHoward Hinnant 51363e519524SHoward Hinnant// sort_heap 51373e519524SHoward Hinnant 51383e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51395386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 void 51403e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51413e519524SHoward Hinnant{ 51423e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51437fa68653SMarshall Clow for (difference_type __n = __last - __first; __n > 1; --__last, (void) --__n) 51441968804aSArthur O'Dwyer _VSTD::__pop_heap<_Compare>(__first, __last, __comp, __n); 51453e519524SHoward Hinnant} 51463e519524SHoward Hinnant 51473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51485386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51493e519524SHoward Hinnantvoid 51503e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51513e519524SHoward Hinnant{ 5152aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51531968804aSArthur O'Dwyer _VSTD::__sort_heap<_Comp_ref>(__first, __last, __comp); 51543e519524SHoward Hinnant} 51553e519524SHoward Hinnant 51563e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51575386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51583e519524SHoward Hinnantvoid 51593e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51603e519524SHoward Hinnant{ 5161ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51623e519524SHoward Hinnant} 51633e519524SHoward Hinnant 51643e519524SHoward Hinnant// partial_sort 51653e519524SHoward Hinnant 51663e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51675386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 void 51683e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51693e519524SHoward Hinnant _Compare __comp) 51703e519524SHoward Hinnant{ 51711968804aSArthur O'Dwyer _VSTD::__make_heap<_Compare>(__first, __middle, __comp); 51723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51733e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51743e519524SHoward Hinnant { 51753e519524SHoward Hinnant if (__comp(*__i, *__first)) 51763e519524SHoward Hinnant { 51773e519524SHoward Hinnant swap(*__i, *__first); 51781968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51793e519524SHoward Hinnant } 51803e519524SHoward Hinnant } 51811968804aSArthur O'Dwyer _VSTD::__sort_heap<_Compare>(__first, __middle, __comp); 51823e519524SHoward Hinnant} 51833e519524SHoward Hinnant 51843e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51855386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51863e519524SHoward Hinnantvoid 51873e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51883e519524SHoward Hinnant _Compare __comp) 51893e519524SHoward Hinnant{ 5190aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 51911968804aSArthur O'Dwyer _VSTD::__partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 51923e519524SHoward Hinnant} 51933e519524SHoward Hinnant 51943e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51955386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 51963e519524SHoward Hinnantvoid 51973e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51983e519524SHoward Hinnant{ 5199ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52003e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52013e519524SHoward Hinnant} 52023e519524SHoward Hinnant 52033e519524SHoward Hinnant// partial_sort_copy 52043e519524SHoward Hinnant 52053e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52065386aa26SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 52073e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52083e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52093e519524SHoward Hinnant{ 52103e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52113e519524SHoward Hinnant if (__r != __result_last) 52123e519524SHoward Hinnant { 52137fa68653SMarshall Clow for (; __first != __last && __r != __result_last; ++__first, (void) ++__r) 52143e519524SHoward Hinnant *__r = *__first; 52151968804aSArthur O'Dwyer _VSTD::__make_heap<_Compare>(__result_first, __r, __comp); 52168b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52173e519524SHoward Hinnant for (; __first != __last; ++__first) 52183e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52193e519524SHoward Hinnant { 52203e519524SHoward Hinnant *__result_first = *__first; 52211968804aSArthur O'Dwyer _VSTD::__sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52223e519524SHoward Hinnant } 52231968804aSArthur O'Dwyer _VSTD::__sort_heap<_Compare>(__result_first, __r, __comp); 52243e519524SHoward Hinnant } 52253e519524SHoward Hinnant return __r; 52263e519524SHoward Hinnant} 52273e519524SHoward Hinnant 52283e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52295386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 52303e519524SHoward Hinnant_RandomAccessIterator 52313e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52323e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52333e519524SHoward Hinnant{ 5234aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 52351968804aSArthur O'Dwyer return _VSTD::__partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 52363e519524SHoward Hinnant} 52373e519524SHoward Hinnant 52383e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52395386aa26SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 52403e519524SHoward Hinnant_RandomAccessIterator 52413e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52423e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52433e519524SHoward Hinnant{ 5244ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52453e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52463e519524SHoward Hinnant} 52473e519524SHoward Hinnant 52483e519524SHoward Hinnant// nth_element 52493e519524SHoward Hinnant 52503e519524SHoward Hinnanttemplate<class _Compare, class _RandomAccessIterator> 52515d956563SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 bool 52525d956563SArthur O'Dwyer__nth_element_find_guard(_RandomAccessIterator& __i, _RandomAccessIterator& __j, 52535d956563SArthur O'Dwyer _RandomAccessIterator __m, _Compare __comp) 52545d956563SArthur O'Dwyer{ 52555d956563SArthur O'Dwyer // manually guard downward moving __j against __i 52565d956563SArthur O'Dwyer while (true) { 52575d956563SArthur O'Dwyer if (__i == --__j) { 52585d956563SArthur O'Dwyer return false; 52595d956563SArthur O'Dwyer } 52605d956563SArthur O'Dwyer if (__comp(*__j, *__m)) { 52615d956563SArthur O'Dwyer return true; // found guard for downward moving __j, now use unguarded partition 52625d956563SArthur O'Dwyer } 52635d956563SArthur O'Dwyer } 52645d956563SArthur O'Dwyer} 52655d956563SArthur O'Dwyer 52665d956563SArthur O'Dwyertemplate <class _Compare, class _RandomAccessIterator> 52675d956563SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX11 void 52683e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52693e519524SHoward Hinnant{ 52703e519524SHoward Hinnant // _Compare is known to be a reference type 52713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52723e519524SHoward Hinnant const difference_type __limit = 7; 52733e519524SHoward Hinnant while (true) 52743e519524SHoward Hinnant { 5275b34b4819SHoward Hinnant if (__nth == __last) 5276b34b4819SHoward Hinnant return; 52773e519524SHoward Hinnant difference_type __len = __last - __first; 52783e519524SHoward Hinnant switch (__len) 52793e519524SHoward Hinnant { 52803e519524SHoward Hinnant case 0: 52813e519524SHoward Hinnant case 1: 52823e519524SHoward Hinnant return; 52833e519524SHoward Hinnant case 2: 52843e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52853e519524SHoward Hinnant swap(*__first, *__last); 52863e519524SHoward Hinnant return; 52873e519524SHoward Hinnant case 3: 52883e519524SHoward Hinnant { 52893e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5290ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52913e519524SHoward Hinnant return; 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant } 52943e519524SHoward Hinnant if (__len <= __limit) 52953e519524SHoward Hinnant { 52961968804aSArthur O'Dwyer _VSTD::__selection_sort<_Compare>(__first, __last, __comp); 52973e519524SHoward Hinnant return; 52983e519524SHoward Hinnant } 52993e519524SHoward Hinnant // __len > __limit >= 3 53003e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 53013e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5302ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 53033e519524SHoward Hinnant // *__m is median 53043e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53053e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53063e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53073e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53083e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53093e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53103e519524SHoward Hinnant // Prime the downward search with a guard. 53113e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53123e519524SHoward Hinnant { 53133e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53145d956563SArthur O'Dwyer if (_VSTD::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { 53155d956563SArthur O'Dwyer swap(*__i, *__j); 53165d956563SArthur O'Dwyer ++__n_swaps; 53175d956563SArthur O'Dwyer } else { 5318b6ffece3SJordan Rupprecht // *__first == *__m, *__m <= all other elements 5319b6ffece3SJordan Rupprecht // Partition instead into [__first, __i) == *__first and *__first < [__i, __last) 5320b6ffece3SJordan Rupprecht ++__i; // __first + 1 5321b6ffece3SJordan Rupprecht __j = __last; 53225d956563SArthur O'Dwyer if (!__comp(*__first, *--__j)) { // we need a guard if *__first == *(__last-1) 53235d956563SArthur O'Dwyer while (true) { 53245d956563SArthur O'Dwyer if (__i == __j) { 5325b6ffece3SJordan Rupprecht return; // [__first, __last) all equivalent elements 53265d956563SArthur O'Dwyer } else if (__comp(*__first, *__i)) { 53273e519524SHoward Hinnant swap(*__i, *__j); 53283e519524SHoward Hinnant ++__n_swaps; 5329b6ffece3SJordan Rupprecht ++__i; 5330b6ffece3SJordan Rupprecht break; 5331b6ffece3SJordan Rupprecht } 5332b6ffece3SJordan Rupprecht ++__i; 5333b6ffece3SJordan Rupprecht } 5334b6ffece3SJordan Rupprecht } 5335b6ffece3SJordan Rupprecht // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53365d956563SArthur O'Dwyer if (__i == __j) { 53373e519524SHoward Hinnant return; 53385d956563SArthur O'Dwyer } 53395d956563SArthur O'Dwyer while (true) { 5340b6ffece3SJordan Rupprecht while (!__comp(*__first, *__i)) 5341b6ffece3SJordan Rupprecht ++__i; 5342b6ffece3SJordan Rupprecht while (__comp(*__first, *--__j)) 5343b6ffece3SJordan Rupprecht ; 5344b6ffece3SJordan Rupprecht if (__i >= __j) 5345b6ffece3SJordan Rupprecht break; 5346b6ffece3SJordan Rupprecht swap(*__i, *__j); 5347b6ffece3SJordan Rupprecht ++__n_swaps; 5348b6ffece3SJordan Rupprecht ++__i; 5349b6ffece3SJordan Rupprecht } 5350b6ffece3SJordan Rupprecht // [__first, __i) == *__first and *__first < [__i, __last) 5351b6ffece3SJordan Rupprecht // The first part is sorted, 53525d956563SArthur O'Dwyer if (__nth < __i) { 53533e519524SHoward Hinnant return; 53545d956563SArthur O'Dwyer } 53551968804aSArthur O'Dwyer // __nth_element the second part 53561968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__i, __nth, __last, __comp); 53573e519524SHoward Hinnant __first = __i; 53585d956563SArthur O'Dwyer continue; 53593e519524SHoward Hinnant } 53603e519524SHoward Hinnant } 53613e519524SHoward Hinnant ++__i; 53623e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53633e519524SHoward Hinnant // if not yet partitioned... 53643e519524SHoward Hinnant if (__i < __j) 53653e519524SHoward Hinnant { 53663e519524SHoward Hinnant // known that *(__i - 1) < *__m 53673e519524SHoward Hinnant while (true) 53683e519524SHoward Hinnant { 53693e519524SHoward Hinnant // __m still guards upward moving __i 53703e519524SHoward Hinnant while (__comp(*__i, *__m)) 53713e519524SHoward Hinnant ++__i; 53723e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53733e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53743e519524SHoward Hinnant ; 53753e519524SHoward Hinnant if (__i >= __j) 53763e519524SHoward Hinnant break; 53773e519524SHoward Hinnant swap(*__i, *__j); 53783e519524SHoward Hinnant ++__n_swaps; 53793e519524SHoward Hinnant // It is known that __m != __j 53803e519524SHoward Hinnant // If __m just moved, follow it 53813e519524SHoward Hinnant if (__m == __i) 53823e519524SHoward Hinnant __m = __j; 53833e519524SHoward Hinnant ++__i; 53843e519524SHoward Hinnant } 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53873e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53883e519524SHoward Hinnant { 53893e519524SHoward Hinnant swap(*__i, *__m); 53903e519524SHoward Hinnant ++__n_swaps; 53913e519524SHoward Hinnant } 53923e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53933e519524SHoward Hinnant if (__nth == __i) 53943e519524SHoward Hinnant return; 53953e519524SHoward Hinnant if (__n_swaps == 0) 53963e519524SHoward Hinnant { 53973e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53983e519524SHoward Hinnant if (__nth < __i) 53993e519524SHoward Hinnant { 54003e519524SHoward Hinnant // Check for [__first, __i) already sorted 54013e519524SHoward Hinnant __j = __m = __first; 54025d956563SArthur O'Dwyer while (true) { 54035d956563SArthur O'Dwyer if (++__j == __i) { 5404b6ffece3SJordan Rupprecht // [__first, __i) sorted 5405b6ffece3SJordan Rupprecht return; 54063e519524SHoward Hinnant } 54075d956563SArthur O'Dwyer if (__comp(*__j, *__m)) { 54085d956563SArthur O'Dwyer // not yet sorted, so sort 54095d956563SArthur O'Dwyer break; 54105d956563SArthur O'Dwyer } 54115d956563SArthur O'Dwyer __m = __j; 54125d956563SArthur O'Dwyer } 54135d956563SArthur O'Dwyer } 54143e519524SHoward Hinnant else 54153e519524SHoward Hinnant { 54163e519524SHoward Hinnant // Check for [__i, __last) already sorted 54173e519524SHoward Hinnant __j = __m = __i; 54185d956563SArthur O'Dwyer while (true) { 54195d956563SArthur O'Dwyer if (++__j == __last) { 5420b6ffece3SJordan Rupprecht // [__i, __last) sorted 5421b6ffece3SJordan Rupprecht return; 54223e519524SHoward Hinnant } 54235d956563SArthur O'Dwyer if (__comp(*__j, *__m)) { 54245d956563SArthur O'Dwyer // not yet sorted, so sort 54255d956563SArthur O'Dwyer break; 5426207d4be4SArthur O'Dwyer } 54275d956563SArthur O'Dwyer __m = __j; 54285d956563SArthur O'Dwyer } 54295d956563SArthur O'Dwyer } 54305d956563SArthur O'Dwyer } 54313e519524SHoward Hinnant // __nth_element on range containing __nth 54323e519524SHoward Hinnant if (__nth < __i) 54333e519524SHoward Hinnant { 54341968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__first, __nth, __i, __comp); 54353e519524SHoward Hinnant __last = __i; 54363e519524SHoward Hinnant } 54373e519524SHoward Hinnant else 54383e519524SHoward Hinnant { 54391968804aSArthur O'Dwyer // _VSTD::__nth_element<_Compare>(__i+1, __nth, __last, __comp); 54403e519524SHoward Hinnant __first = ++__i; 54413e519524SHoward Hinnant } 54423e519524SHoward Hinnant } 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54465d956563SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54473e519524SHoward Hinnantvoid 54483e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54493e519524SHoward Hinnant{ 5450aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 54511968804aSArthur O'Dwyer _VSTD::__nth_element<_Comp_ref>(__first, __nth, __last, __comp); 54523e519524SHoward Hinnant} 54533e519524SHoward Hinnant 54543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54555d956563SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54563e519524SHoward Hinnantvoid 54573e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54583e519524SHoward Hinnant{ 5459ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54603e519524SHoward Hinnant} 54613e519524SHoward Hinnant 5462493f1407SArthur O'Dwyer// sort 5463493f1407SArthur O'Dwyer 5464493f1407SArthur O'Dwyertemplate <class _RandomAccessIterator, class _Compare> 5465493f1407SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5466493f1407SArthur O'Dwyervoid 5467493f1407SArthur O'Dwyersort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 5468493f1407SArthur O'Dwyer{ 5469493f1407SArthur O'Dwyer typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 5470493f1407SArthur O'Dwyer if (__libcpp_is_constant_evaluated()) { 5471493f1407SArthur O'Dwyer _VSTD::__partial_sort<_Comp_ref>(__first, __last, __last, _Comp_ref(__comp)); 5472493f1407SArthur O'Dwyer } else { 5473493f1407SArthur O'Dwyer _VSTD::__sort<_Comp_ref>(_VSTD::__unwrap_iter(__first), _VSTD::__unwrap_iter(__last), _Comp_ref(__comp)); 5474493f1407SArthur O'Dwyer } 5475493f1407SArthur O'Dwyer} 5476493f1407SArthur O'Dwyer 5477493f1407SArthur O'Dwyertemplate <class _RandomAccessIterator> 5478493f1407SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 5479493f1407SArthur O'Dwyervoid 5480493f1407SArthur O'Dwyersort(_RandomAccessIterator __first, _RandomAccessIterator __last) 5481493f1407SArthur O'Dwyer{ 5482493f1407SArthur O'Dwyer _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 5483493f1407SArthur O'Dwyer} 5484493f1407SArthur O'Dwyer 54853e519524SHoward Hinnant// includes 54863e519524SHoward Hinnant 54873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54888da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 54893e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54903e519524SHoward Hinnant _Compare __comp) 54913e519524SHoward Hinnant{ 54923e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54933e519524SHoward Hinnant { 54943e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54953e519524SHoward Hinnant return false; 54963e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54973e519524SHoward Hinnant ++__first2; 54983e519524SHoward Hinnant } 54993e519524SHoward Hinnant return true; 55003e519524SHoward Hinnant} 55013e519524SHoward Hinnant 55023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55031362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55041362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55053e519524SHoward Hinnantbool 55063e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 55073e519524SHoward Hinnant _Compare __comp) 55083e519524SHoward Hinnant{ 5509aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55101968804aSArthur O'Dwyer return _VSTD::__includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 55113e519524SHoward Hinnant} 55123e519524SHoward Hinnant 55133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55141362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 55151362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55163e519524SHoward Hinnantbool 55173e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55183e519524SHoward Hinnant{ 5519ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55203e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55213e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55223e519524SHoward Hinnant} 55233e519524SHoward Hinnant 55243e519524SHoward Hinnant// set_union 55253e519524SHoward Hinnant 55263e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 552714098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 55283e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55293e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55303e519524SHoward Hinnant{ 55313e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55323e519524SHoward Hinnant { 55333e519524SHoward Hinnant if (__first2 == __last2) 5534ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55353e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55363e519524SHoward Hinnant { 55373e519524SHoward Hinnant *__result = *__first2; 55383e519524SHoward Hinnant ++__first2; 55393e519524SHoward Hinnant } 55403e519524SHoward Hinnant else 55413e519524SHoward Hinnant { 55423e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55433e519524SHoward Hinnant ++__first2; 554405da5b02SMarshall Clow *__result = *__first1; 55453e519524SHoward Hinnant ++__first1; 55463e519524SHoward Hinnant } 55473e519524SHoward Hinnant } 5548ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55493e519524SHoward Hinnant} 55503e519524SHoward Hinnant 55513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 555214098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55533e519524SHoward Hinnant_OutputIterator 55543e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55563e519524SHoward Hinnant{ 5557aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 55581968804aSArthur O'Dwyer return _VSTD::__set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 55593e519524SHoward Hinnant} 55603e519524SHoward Hinnant 55613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 556214098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55633e519524SHoward Hinnant_OutputIterator 55643e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55663e519524SHoward Hinnant{ 5567ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55683e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55693e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55703e519524SHoward Hinnant} 55713e519524SHoward Hinnant 55723e519524SHoward Hinnant// set_intersection 55733e519524SHoward Hinnant 55743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55758da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 55763e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55783e519524SHoward Hinnant{ 55793e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55803e519524SHoward Hinnant { 55813e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55823e519524SHoward Hinnant ++__first1; 55833e519524SHoward Hinnant else 55843e519524SHoward Hinnant { 55853e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55863e519524SHoward Hinnant { 55873e519524SHoward Hinnant *__result = *__first1; 55883e519524SHoward Hinnant ++__result; 55893e519524SHoward Hinnant ++__first1; 55903e519524SHoward Hinnant } 55913e519524SHoward Hinnant ++__first2; 55923e519524SHoward Hinnant } 55933e519524SHoward Hinnant } 55943e519524SHoward Hinnant return __result; 55953e519524SHoward Hinnant} 55963e519524SHoward Hinnant 55973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55988da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55993e519524SHoward Hinnant_OutputIterator 56003e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56023e519524SHoward Hinnant{ 5603aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56041968804aSArthur O'Dwyer return _VSTD::__set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 56053e519524SHoward Hinnant} 56063e519524SHoward Hinnant 56073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56088da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56093e519524SHoward Hinnant_OutputIterator 56103e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56123e519524SHoward Hinnant{ 5613ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56143e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56153e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56163e519524SHoward Hinnant} 56173e519524SHoward Hinnant 56183e519524SHoward Hinnant// set_difference 56193e519524SHoward Hinnant 56203e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 562114098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 56223e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56233e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56243e519524SHoward Hinnant{ 56253e519524SHoward Hinnant while (__first1 != __last1) 56263e519524SHoward Hinnant { 56273e519524SHoward Hinnant if (__first2 == __last2) 5628ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56293e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56303e519524SHoward Hinnant { 56313e519524SHoward Hinnant *__result = *__first1; 56323e519524SHoward Hinnant ++__result; 56333e519524SHoward Hinnant ++__first1; 56343e519524SHoward Hinnant } 56353e519524SHoward Hinnant else 56363e519524SHoward Hinnant { 56373e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56383e519524SHoward Hinnant ++__first1; 56393e519524SHoward Hinnant ++__first2; 56403e519524SHoward Hinnant } 56413e519524SHoward Hinnant } 56423e519524SHoward Hinnant return __result; 56433e519524SHoward Hinnant} 56443e519524SHoward Hinnant 56453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 564614098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56473e519524SHoward Hinnant_OutputIterator 56483e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56503e519524SHoward Hinnant{ 5651aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 56521968804aSArthur O'Dwyer return _VSTD::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 56533e519524SHoward Hinnant} 56543e519524SHoward Hinnant 56553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 565614098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56573e519524SHoward Hinnant_OutputIterator 56583e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56603e519524SHoward Hinnant{ 5661ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56623e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56633e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56643e519524SHoward Hinnant} 56653e519524SHoward Hinnant 56663e519524SHoward Hinnant// set_symmetric_difference 56673e519524SHoward Hinnant 56683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 566914098cf6SArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 56703e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56723e519524SHoward Hinnant{ 56733e519524SHoward Hinnant while (__first1 != __last1) 56743e519524SHoward Hinnant { 56753e519524SHoward Hinnant if (__first2 == __last2) 5676ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56773e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56783e519524SHoward Hinnant { 56793e519524SHoward Hinnant *__result = *__first1; 56803e519524SHoward Hinnant ++__result; 56813e519524SHoward Hinnant ++__first1; 56823e519524SHoward Hinnant } 56833e519524SHoward Hinnant else 56843e519524SHoward Hinnant { 56853e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56863e519524SHoward Hinnant { 56873e519524SHoward Hinnant *__result = *__first2; 56883e519524SHoward Hinnant ++__result; 56893e519524SHoward Hinnant } 56903e519524SHoward Hinnant else 56913e519524SHoward Hinnant ++__first1; 56923e519524SHoward Hinnant ++__first2; 56933e519524SHoward Hinnant } 56943e519524SHoward Hinnant } 5695ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56963e519524SHoward Hinnant} 56973e519524SHoward Hinnant 56983e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 569914098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57003e519524SHoward Hinnant_OutputIterator 57013e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57033e519524SHoward Hinnant{ 5704aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57051968804aSArthur O'Dwyer return _VSTD::__set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 57063e519524SHoward Hinnant} 57073e519524SHoward Hinnant 57083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 570914098cf6SArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57103e519524SHoward Hinnant_OutputIterator 57113e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57133e519524SHoward Hinnant{ 5714ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57153e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57163e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57173e519524SHoward Hinnant} 57183e519524SHoward Hinnant 57193e519524SHoward Hinnant// lexicographical_compare 57203e519524SHoward Hinnant 57213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57221b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 57233e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57253e519524SHoward Hinnant{ 5726910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57273e519524SHoward Hinnant { 57283e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57293e519524SHoward Hinnant return true; 57303e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57313e519524SHoward Hinnant return false; 57323e519524SHoward Hinnant } 57333e519524SHoward Hinnant return false; 57343e519524SHoward Hinnant} 57353e519524SHoward Hinnant 57363e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57371362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 57381362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57393e519524SHoward Hinnantbool 57403e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57413e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57423e519524SHoward Hinnant{ 5743aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57441968804aSArthur O'Dwyer return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 57453e519524SHoward Hinnant} 57463e519524SHoward Hinnant 57473e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57481362d7efSNico Weber_LIBCPP_NODISCARD_EXT inline 57491362d7efSNico Weber_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57503e519524SHoward Hinnantbool 57513e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57533e519524SHoward Hinnant{ 5754ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57553e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57563e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57573e519524SHoward Hinnant} 57583e519524SHoward Hinnant 57593e519524SHoward Hinnant// next_permutation 57603e519524SHoward Hinnant 57613e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 5762f851db3dSArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 57633e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57643e519524SHoward Hinnant{ 57653e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57663e519524SHoward Hinnant if (__first == __last || __first == --__i) 57673e519524SHoward Hinnant return false; 57683e519524SHoward Hinnant while (true) 57693e519524SHoward Hinnant { 57703e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57713e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57723e519524SHoward Hinnant { 57733e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57743e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57753e519524SHoward Hinnant ; 57763e519524SHoward Hinnant swap(*__i, *__j); 5777ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57783e519524SHoward Hinnant return true; 57793e519524SHoward Hinnant } 57803e519524SHoward Hinnant if (__i == __first) 57813e519524SHoward Hinnant { 5782ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57833e519524SHoward Hinnant return false; 57843e519524SHoward Hinnant } 57853e519524SHoward Hinnant } 57863e519524SHoward Hinnant} 57873e519524SHoward Hinnant 57883e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 5789f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57903e519524SHoward Hinnantbool 57913e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57923e519524SHoward Hinnant{ 5793aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 57941968804aSArthur O'Dwyer return _VSTD::__next_permutation<_Comp_ref>(__first, __last, __comp); 57953e519524SHoward Hinnant} 57963e519524SHoward Hinnant 57973e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 5798f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57993e519524SHoward Hinnantbool 58003e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58013e519524SHoward Hinnant{ 5802ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58033e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58043e519524SHoward Hinnant} 58053e519524SHoward Hinnant 58063e519524SHoward Hinnant// prev_permutation 58073e519524SHoward Hinnant 58083e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 5809f851db3dSArthur O'Dwyer_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 58103e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58113e519524SHoward Hinnant{ 58123e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58133e519524SHoward Hinnant if (__first == __last || __first == --__i) 58143e519524SHoward Hinnant return false; 58153e519524SHoward Hinnant while (true) 58163e519524SHoward Hinnant { 58173e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58183e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58193e519524SHoward Hinnant { 58203e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58213e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58223e519524SHoward Hinnant ; 58233e519524SHoward Hinnant swap(*__i, *__j); 5824ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58253e519524SHoward Hinnant return true; 58263e519524SHoward Hinnant } 58273e519524SHoward Hinnant if (__i == __first) 58283e519524SHoward Hinnant { 5829ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58303e519524SHoward Hinnant return false; 58313e519524SHoward Hinnant } 58323e519524SHoward Hinnant } 58333e519524SHoward Hinnant} 58343e519524SHoward Hinnant 58353e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 5836f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 58373e519524SHoward Hinnantbool 58383e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58393e519524SHoward Hinnant{ 5840aa1cad15SEric Fiselier typedef typename __comp_ref_type<_Compare>::type _Comp_ref; 58411968804aSArthur O'Dwyer return _VSTD::__prev_permutation<_Comp_ref>(__first, __last, __comp); 58423e519524SHoward Hinnant} 58433e519524SHoward Hinnant 58443e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 5845f851db3dSArthur O'Dwyerinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 58463e519524SHoward Hinnantbool 58473e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58483e519524SHoward Hinnant{ 5849ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58503e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58513e519524SHoward Hinnant} 58523e519524SHoward Hinnant 58533e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58543e519524SHoward Hinnant 5855a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5856a016efb1SEric Fiselier 58570a06eb91SLouis Dionne#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17 585895689243SLouis Dionne# include <__pstl_algorithm> 58590a06eb91SLouis Dionne#endif 58600a06eb91SLouis Dionne 58613e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5862