13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 6412dbebeSHoward Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 7412dbebeSHoward Hinnant// Source Licenses. See LICENSE.TXT for details. 83e519524SHoward Hinnant// 93e519524SHoward Hinnant//===----------------------------------------------------------------------===// 103e519524SHoward Hinnant 113e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 123e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 133e519524SHoward Hinnant 143e519524SHoward Hinnant/* 153e519524SHoward Hinnant algorithm synopsis 163e519524SHoward Hinnant 173e519524SHoward Hinnant#include <initializer_list> 183e519524SHoward Hinnant 193e519524SHoward Hinnantnamespace std 203e519524SHoward Hinnant{ 213e519524SHoward Hinnant 223e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 23706ffef7SMarshall Clow constexpr bool // constexpr in C++20 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 27706ffef7SMarshall Clow constexpr bool // constexpr in C++20 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 31706ffef7SMarshall Clow constexpr bool // constexpr in C++20 323e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 333e519524SHoward Hinnant 343e519524SHoward Hinnanttemplate <class InputIterator, class Function> 351b9a4ffdSMarshall Clow constexpr Function // constexpr in C++20 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 38d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 391b9a4ffdSMarshall Clow constexpr InputIterator // constexpr in C++20 401b9a4ffdSMarshall Clow for_each_n(InputIterator first, Size n, Function f); // C++17 41d5c65ffaSMarshall Clow 423e519524SHoward Hinnanttemplate <class InputIterator, class T> 4349c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 443e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 4749c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 483e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 518694428eSMarshall Clow InputIterator // constexpr in C++20 523e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 533e519524SHoward Hinnant 543e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 558694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 563e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 573e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 583e519524SHoward Hinnant 593e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 608694428eSMarshall Clow ForwardIterator1 // constexpr in C++20 613e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 623e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 633e519524SHoward Hinnant 643e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 658694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 663e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 673e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 683e519524SHoward Hinnant 693e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 708694428eSMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 713e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 723e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator> 758694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 798694428eSMarshall Clow constexpr ForwardIterator // constexpr in C++20 803e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class T> 83056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 843e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 87056f15e3SMarshall Clow constexpr typename iterator_traits<InputIterator>::difference_type // constexpr in C++20 883e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 893e519524SHoward Hinnant 903e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 916538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 923e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 933e519524SHoward Hinnant 940b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 956538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 960b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 970b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 980b0bbd2fSMarshall Clow 993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1006538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1013e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1023e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1033e519524SHoward Hinnant 1040b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1056538e28dSMarshall Clow constexpr pair<InputIterator1, InputIterator2> // constexpr in C++20 1060b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1070b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1080b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1090b0bbd2fSMarshall Clow 1103e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1116538e28dSMarshall Clow constexpr bool // constexpr in C++20 1123e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1133e519524SHoward Hinnant 1140b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1156538e28dSMarshall Clow constexpr bool // constexpr in C++20 1160b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1170b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1180b0bbd2fSMarshall Clow 1193e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1206538e28dSMarshall Clow constexpr bool // constexpr in C++20 1213e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1223e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1233e519524SHoward Hinnant 1240b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1256538e28dSMarshall Clow constexpr bool // constexpr in C++20 1260b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1270b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1280b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1290b0bbd2fSMarshall Clow 1303e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 13149c7643cSMarshall Clow constexpr bool // constexpr in C++20 1323e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1333e519524SHoward Hinnant ForwardIterator2 first2); 1343e519524SHoward Hinnant 1350b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 13649c7643cSMarshall Clow constexpr bool // constexpr in C++20 1370b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1380b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1390b0bbd2fSMarshall Clow 1403e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14149c7643cSMarshall Clow constexpr bool // constexpr in C++20 1423e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1433e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1443e519524SHoward Hinnant 1450b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14649c7643cSMarshall Clow constexpr bool // constexpr in C++20 1470b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1480b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1490b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1500b0bbd2fSMarshall Clow 1513e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 15212f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1533e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1543e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1553e519524SHoward Hinnant 1563e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 15712f0a779SMarshall Clow constexpr ForwardIterator1 // constexpr in C++20 1583e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1593e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 16212f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1643e519524SHoward Hinnant 1653e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 16612f0a779SMarshall Clow constexpr ForwardIterator // constexpr in C++20 1673e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1683e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1733e519524SHoward Hinnant 1743e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1753e519524SHoward Hinnant OutputIterator 1763e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1773e519524SHoward Hinnant OutputIterator result, Predicate pred); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1803e519524SHoward Hinnant OutputIterator 1813e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1823e519524SHoward Hinnant 1833e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1843e519524SHoward Hinnant BidirectionalIterator2 1853e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1863e519524SHoward Hinnant BidirectionalIterator2 result); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant ForwardIterator2 1903e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1933e519524SHoward Hinnant void 1943e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 19799894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 1983e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1993e519524SHoward Hinnant 2003e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 20199894b61SMarshall Clow constexpr OutputIterator // constexpr in C++20 2023e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2033e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 20612c7423fSMarshall Clow constexpr void // constexpr in C++20 2073e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 21012c7423fSMarshall Clow constexpr void // constexpr in C++20 2113e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2123e519524SHoward Hinnant 2133e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 21412c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2153e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2163e519524SHoward Hinnant const T& old_value, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 21912c7423fSMarshall Clow constexpr OutputIterator // constexpr in C++20 2203e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2234bfb9313SMarshall Clow constexpr void // constexpr in C++20 2243e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2274bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2283e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2314bfb9313SMarshall Clow constexpr void // constexpr in C++20 2323e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2354bfb9313SMarshall Clow constexpr OutputIterator // constexpr in C++20 2363e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 239e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2403e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 243e8ea8296SMarshall Clow constexpr ForwardIterator // constexpr in C++20 2443e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 247e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2483e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 251e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2523e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2593e519524SHoward Hinnant ForwardIterator 2603e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2673e519524SHoward Hinnant OutputIterator 2683e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2713e519524SHoward Hinnant void 2723e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 275e8ea8296SMarshall Clow constexpr OutputIterator // constexpr in C++20 2763e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator> 2793e519524SHoward Hinnant ForwardIterator 2803e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2833e519524SHoward Hinnant OutputIterator 2843e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2873e519524SHoward Hinnant void 2880f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2893e519524SHoward Hinnant 2903e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2913e519524SHoward Hinnant void 29206965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2930f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 2943e519524SHoward Hinnant 295e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 296e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 297e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 298e7154709SEric Fiselier SampleIterator out, Distance n, 299e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 300e7154709SEric Fiselier 301f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 302f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 303fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 304f9d540b0SHoward Hinnant 3053e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30649c7643cSMarshall Clow constexpr bool // constexpr in C++20 3073e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3103e519524SHoward Hinnant ForwardIterator 3113e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3123e519524SHoward Hinnant 3133e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3143e519524SHoward Hinnant class OutputIterator2, class Predicate> 3151b9a4ffdSMarshall Clow constexpr pair<OutputIterator1, OutputIterator2> // constexpr in C++20 3163e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3173e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3183e519524SHoward Hinnant Predicate pred); 3193e519524SHoward Hinnant 3203e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3213e519524SHoward Hinnant ForwardIterator 3223e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3233e519524SHoward Hinnant 3243e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 325d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3263e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3273e519524SHoward Hinnant 3283e519524SHoward Hinnanttemplate <class ForwardIterator> 32949c7643cSMarshall Clow constexpr bool // constexpr in C++20 3303e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3313e519524SHoward Hinnant 3323e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3333e519524SHoward Hinnant bool 3343e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3353e519524SHoward Hinnant 3363e519524SHoward Hinnanttemplate<class ForwardIterator> 337056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3383e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3393e519524SHoward Hinnant 3403e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 341056f15e3SMarshall Clow constexpr ForwardIterator // constexpr in C++20 3423e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3433e519524SHoward Hinnant 3443e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3453e519524SHoward Hinnant void 3463e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3473e519524SHoward Hinnant 3483e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3493e519524SHoward Hinnant void 3503e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3513e519524SHoward Hinnant 3523e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3533e519524SHoward Hinnant void 3543e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3553e519524SHoward Hinnant 3563e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3573e519524SHoward Hinnant void 3583e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3593e519524SHoward Hinnant 3603e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3613e519524SHoward Hinnant void 3623e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3633e519524SHoward Hinnant 3643e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3653e519524SHoward Hinnant void 3663e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3673e519524SHoward Hinnant 3683e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3693e519524SHoward Hinnant RandomAccessIterator 3703e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3713e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3723e519524SHoward Hinnant 3733e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3743e519524SHoward Hinnant RandomAccessIterator 3753e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3763e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3773e519524SHoward Hinnant 3783e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3793e519524SHoward Hinnant void 3803e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3813e519524SHoward Hinnant 3823e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3833e519524SHoward Hinnant void 3843e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3853e519524SHoward Hinnant 3863e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 387d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3883e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3893e519524SHoward Hinnant 3903e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 391d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3923e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3933e519524SHoward Hinnant 3943e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 395d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 3963e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3973e519524SHoward Hinnant 3983e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 399d57c03ddSMarshall Clow constexpr ForwardIterator // constexpr in C++20 4003e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4013e519524SHoward Hinnant 4023e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 403d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4043e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4053e519524SHoward Hinnant 4063e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 407d57c03ddSMarshall Clow constexpr pair<ForwardIterator, ForwardIterator> // constexpr in C++20 4083e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4093e519524SHoward Hinnant 4103e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 411d57c03ddSMarshall Clow constexpr bool // constexpr in C++20 4123e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4133e519524SHoward Hinnant 4143e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4158da1a487SMarshall Clow constexpr bool // constexpr in C++20 4163e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4193e519524SHoward Hinnant OutputIterator 4203e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4213e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4223e519524SHoward Hinnant 4233e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4243e519524SHoward Hinnant OutputIterator 4253e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4263e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4273e519524SHoward Hinnant 4283e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4293e519524SHoward Hinnant void 4303e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4313e519524SHoward Hinnant 4323e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4333e519524SHoward Hinnant void 4343e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4353e519524SHoward Hinnant 4363e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4378da1a487SMarshall Clow constexpr bool // constexpr in C++20 4383e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4393e519524SHoward Hinnant 4403e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4418da1a487SMarshall Clow constexpr bool // constexpr in C++20 4423e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4453e519524SHoward Hinnant OutputIterator 4463e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4473e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4503e519524SHoward Hinnant OutputIterator 4513e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4523e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4558da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4563e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4573e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4583e519524SHoward Hinnant 4593e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4608da1a487SMarshall Clow constexpr OutputIterator // constexpr in C++20 4613e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4623e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4653e519524SHoward Hinnant OutputIterator 4663e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4703e519524SHoward Hinnant OutputIterator 4713e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4723e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4733e519524SHoward Hinnant 4743e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4753e519524SHoward Hinnant OutputIterator 4763e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4773e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4783e519524SHoward Hinnant 4793e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4803e519524SHoward Hinnant OutputIterator 4813e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4823e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4853e519524SHoward Hinnant void 4863e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4873e519524SHoward Hinnant 4883e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4893e519524SHoward Hinnant void 4903e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4913e519524SHoward Hinnant 4923e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4933e519524SHoward Hinnant void 4943e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4953e519524SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4973e519524SHoward Hinnant void 4983e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5013e519524SHoward Hinnant void 5023e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5053e519524SHoward Hinnant void 5063e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5093e519524SHoward Hinnant void 5103e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5133e519524SHoward Hinnant void 5143e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class RandomAccessIterator> 51749c7643cSMarshall Clow constexpr bool // constexpr in C++20 5183e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5193e519524SHoward Hinnant 5203e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52149c7643cSMarshall Clow constexpr bool // constexpr in C++20 5223e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5233e519524SHoward Hinnant 5243e519524SHoward Hinnanttemplate <class RandomAccessIterator> 52549c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5263e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5273e519524SHoward Hinnant 5283e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52949c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5303e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5313e519524SHoward Hinnant 5324eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5334eb27b79SHoward Hinnant ForwardIterator 5340b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5354eb27b79SHoward Hinnant 5364eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5374eb27b79SHoward Hinnant ForwardIterator 5380b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5394eb27b79SHoward Hinnant 5403e519524SHoward Hinnanttemplate <class T> 5413e519524SHoward Hinnant const T& 5429d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5433e519524SHoward Hinnant 5443e519524SHoward Hinnanttemplate <class T, class Compare> 5453e519524SHoward Hinnant const T& 5469d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5473e519524SHoward Hinnant 5483e519524SHoward Hinnanttemplate<class T> 5494eb27b79SHoward Hinnant T 5509d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5513e519524SHoward Hinnant 5523e519524SHoward Hinnanttemplate<class T, class Compare> 5534eb27b79SHoward Hinnant T 5549d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5553e519524SHoward Hinnant 556146c14acSMarshall Clowtemplate<class T> 557146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 558146c14acSMarshall Clow 559146c14acSMarshall Clowtemplate<class T, class Compare> 560146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 561146c14acSMarshall Clow 5623e519524SHoward Hinnanttemplate <class ForwardIterator> 5633e519524SHoward Hinnant ForwardIterator 5640b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5653e519524SHoward Hinnant 5663e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5673e519524SHoward Hinnant ForwardIterator 5680b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5693e519524SHoward Hinnant 5704eb27b79SHoward Hinnanttemplate <class T> 5714eb27b79SHoward Hinnant const T& 5729d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5734eb27b79SHoward Hinnant 5744eb27b79SHoward Hinnanttemplate <class T, class Compare> 5754eb27b79SHoward Hinnant const T& 5769d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5774eb27b79SHoward Hinnant 5784eb27b79SHoward Hinnanttemplate<class T> 5794eb27b79SHoward Hinnant T 5809d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5814eb27b79SHoward Hinnant 5824eb27b79SHoward Hinnanttemplate<class T, class Compare> 5834eb27b79SHoward Hinnant T 5849d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5854eb27b79SHoward Hinnant 5864eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5874eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5880b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5894eb27b79SHoward Hinnant 5904eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5914eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5920b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5934eb27b79SHoward Hinnant 5944eb27b79SHoward Hinnanttemplate<class T> 5954eb27b79SHoward Hinnant pair<const T&, const T&> 5969d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5974eb27b79SHoward Hinnant 5984eb27b79SHoward Hinnanttemplate<class T, class Compare> 5994eb27b79SHoward Hinnant pair<const T&, const T&> 6009d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 6014eb27b79SHoward Hinnant 6024eb27b79SHoward Hinnanttemplate<class T> 6034eb27b79SHoward Hinnant pair<T, T> 6049d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 6054eb27b79SHoward Hinnant 6064eb27b79SHoward Hinnanttemplate<class T, class Compare> 6074eb27b79SHoward Hinnant pair<T, T> 6089d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 6094eb27b79SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6111b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6123e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6133e519524SHoward Hinnant 6143e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6151b9a4ffdSMarshall Clow constexpr bool // constexpr in C++20 6163e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6173e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6183e519524SHoward Hinnant 6193e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6203e519524SHoward Hinnant bool 6213e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6223e519524SHoward Hinnant 6233e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6243e519524SHoward Hinnant bool 6253e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6263e519524SHoward Hinnant 6273e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6283e519524SHoward Hinnant bool 6293e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6303e519524SHoward Hinnant 6313e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6323e519524SHoward Hinnant bool 6333e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6343e519524SHoward Hinnant 6353e519524SHoward Hinnant} // std 6363e519524SHoward Hinnant 6373e519524SHoward Hinnant*/ 6383e519524SHoward Hinnant 6393e519524SHoward Hinnant#include <__config> 6403e519524SHoward Hinnant#include <initializer_list> 6413e519524SHoward Hinnant#include <type_traits> 6423e519524SHoward Hinnant#include <cstring> 643f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6443e519524SHoward Hinnant#include <memory> 645d835e592SMarshall Clow#include <functional> 6463e519524SHoward Hinnant#include <iterator> 647a1d07d57SHoward Hinnant#include <cstddef> 648e02ee4f0SMarshall Clow#include <bit> 6495d1a701dSHoward Hinnant 650c1bd9197SEric Fiselier#include <__debug> 651c1bd9197SEric Fiselier 652073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6533e519524SHoward Hinnant#pragma GCC system_header 654073458b1SHoward Hinnant#endif 6553e519524SHoward Hinnant 656a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 657a016efb1SEric Fiselier#include <__undef_macros> 658a016efb1SEric Fiselier 659a016efb1SEric Fiselier 6603e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6613e519524SHoward Hinnant 6629d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6639d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6649d67c6d5SMarshall Clow// * We haven't included <functional> here. 6653e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6663e519524SHoward Hinnantstruct __equal_to 6673e519524SHoward Hinnant{ 668d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 669d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 670d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 671d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6723e519524SHoward Hinnant}; 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _T1> 6753e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6763e519524SHoward Hinnant{ 6779d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6789d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6833e519524SHoward Hinnant{ 6849d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6859d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1> 6893e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6903e519524SHoward Hinnant{ 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6933e519524SHoward Hinnant}; 6943e519524SHoward Hinnant 6953e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6963e519524SHoward Hinnantstruct __less 6973e519524SHoward Hinnant{ 6989d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6999d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7009d67c6d5SMarshall Clow 7019d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7029d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7039d67c6d5SMarshall Clow 7049d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7059d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7069d67c6d5SMarshall Clow 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7093e519524SHoward Hinnant}; 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _T1> 7123e519524SHoward Hinnantstruct __less<_T1, _T1> 7133e519524SHoward Hinnant{ 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7163e519524SHoward Hinnant}; 7173e519524SHoward Hinnant 7183e519524SHoward Hinnanttemplate <class _T1> 7193e519524SHoward Hinnantstruct __less<const _T1, _T1> 7203e519524SHoward Hinnant{ 7219d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7229d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7233e519524SHoward Hinnant}; 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _T1> 7263e519524SHoward Hinnantstruct __less<_T1, const _T1> 7273e519524SHoward Hinnant{ 7289d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7299d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7303e519524SHoward Hinnant}; 7313e519524SHoward Hinnant 7323e519524SHoward Hinnanttemplate <class _Predicate> 733a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7343e519524SHoward Hinnant{ 7353e519524SHoward Hinnantprivate: 7363e519524SHoward Hinnant _Predicate __p_; 7373e519524SHoward Hinnantpublic: 738a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7393e519524SHoward Hinnant 7403e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 741a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7423e519524SHoward Hinnant 7433e519524SHoward Hinnant template <class _T1> 7443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7453e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7463e519524SHoward Hinnant 7473e519524SHoward Hinnant template <class _T1, class _T2> 7483e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 749a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7503e519524SHoward Hinnant}; 7513e519524SHoward Hinnant 752145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7533e519524SHoward Hinnant 7543e519524SHoward Hinnanttemplate <class _Compare> 7553e519524SHoward Hinnantstruct __debug_less 7563e519524SHoward Hinnant{ 7573e519524SHoward Hinnant _Compare __comp_; 7583e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 759331d2159SEric Fiselier 7603e519524SHoward Hinnant template <class _Tp, class _Up> 7613e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7623e519524SHoward Hinnant { 7633e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7643e519524SHoward Hinnant if (__r) 765331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7663e519524SHoward Hinnant return __r; 7673e519524SHoward Hinnant } 768331d2159SEric Fiselier 769331d2159SEric Fiselier template <class _LHS, class _RHS> 770331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 771331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 772331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 773331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 774331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 775331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 776331d2159SEric Fiselier } 777331d2159SEric Fiselier 778331d2159SEric Fiselier template <class _LHS, class _RHS> 779331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 780331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7813e519524SHoward Hinnant}; 7823e519524SHoward Hinnant 783145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7843e519524SHoward Hinnant 7853e519524SHoward Hinnant// all_of 7863e519524SHoward Hinnant 7873e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 788706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 7893e519524SHoward Hinnantbool 7903e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 7913e519524SHoward Hinnant{ 7923e519524SHoward Hinnant for (; __first != __last; ++__first) 7933e519524SHoward Hinnant if (!__pred(*__first)) 7943e519524SHoward Hinnant return false; 7953e519524SHoward Hinnant return true; 7963e519524SHoward Hinnant} 7973e519524SHoward Hinnant 7983e519524SHoward Hinnant// any_of 7993e519524SHoward Hinnant 8003e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 801706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8023e519524SHoward Hinnantbool 8033e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8043e519524SHoward Hinnant{ 8053e519524SHoward Hinnant for (; __first != __last; ++__first) 8063e519524SHoward Hinnant if (__pred(*__first)) 8073e519524SHoward Hinnant return true; 8083e519524SHoward Hinnant return false; 8093e519524SHoward Hinnant} 8103e519524SHoward Hinnant 8113e519524SHoward Hinnant// none_of 8123e519524SHoward Hinnant 8133e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 814706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8153e519524SHoward Hinnantbool 8163e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8173e519524SHoward Hinnant{ 8183e519524SHoward Hinnant for (; __first != __last; ++__first) 8193e519524SHoward Hinnant if (__pred(*__first)) 8203e519524SHoward Hinnant return false; 8213e519524SHoward Hinnant return true; 8223e519524SHoward Hinnant} 8233e519524SHoward Hinnant 8243e519524SHoward Hinnant// for_each 8253e519524SHoward Hinnant 8263e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8271b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8283e519524SHoward Hinnant_Function 8293e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8303e519524SHoward Hinnant{ 8313e519524SHoward Hinnant for (; __first != __last; ++__first) 8323e519524SHoward Hinnant __f(*__first); 8331c7fe126SMarshall Clow return __f; 8343e519524SHoward Hinnant} 8353e519524SHoward Hinnant 8361d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 837d5c65ffaSMarshall Clow// for_each_n 838d5c65ffaSMarshall Clow 839d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8401b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 841d5c65ffaSMarshall Clow_InputIterator 842d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 843d5c65ffaSMarshall Clow{ 844d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 845d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 846d5c65ffaSMarshall Clow while (__n > 0) 847d5c65ffaSMarshall Clow { 848d5c65ffaSMarshall Clow __f(*__first); 849d5c65ffaSMarshall Clow ++__first; 850d5c65ffaSMarshall Clow --__n; 851d5c65ffaSMarshall Clow } 852d5c65ffaSMarshall Clow return __first; 853d5c65ffaSMarshall Clow} 8541d02996dSMarshall Clow#endif 855d5c65ffaSMarshall Clow 8563e519524SHoward Hinnant// find 8573e519524SHoward Hinnant 8583e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 85949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8603e519524SHoward Hinnant_InputIterator 861e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8623e519524SHoward Hinnant{ 8633e519524SHoward Hinnant for (; __first != __last; ++__first) 864e4383379SHoward Hinnant if (*__first == __value_) 8653e519524SHoward Hinnant break; 8663e519524SHoward Hinnant return __first; 8673e519524SHoward Hinnant} 8683e519524SHoward Hinnant 8693e519524SHoward Hinnant// find_if 8703e519524SHoward Hinnant 8713e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 87249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8733e519524SHoward Hinnant_InputIterator 8743e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8753e519524SHoward Hinnant{ 8763e519524SHoward Hinnant for (; __first != __last; ++__first) 8773e519524SHoward Hinnant if (__pred(*__first)) 8783e519524SHoward Hinnant break; 8793e519524SHoward Hinnant return __first; 8803e519524SHoward Hinnant} 8813e519524SHoward Hinnant 8823e519524SHoward Hinnant// find_if_not 8833e519524SHoward Hinnant 8843e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8858694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8863e519524SHoward Hinnant_InputIterator 8873e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8883e519524SHoward Hinnant{ 8893e519524SHoward Hinnant for (; __first != __last; ++__first) 8903e519524SHoward Hinnant if (!__pred(*__first)) 8913e519524SHoward Hinnant break; 8923e519524SHoward Hinnant return __first; 8933e519524SHoward Hinnant} 8943e519524SHoward Hinnant 8953e519524SHoward Hinnant// find_end 8963e519524SHoward Hinnant 8973e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8988694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 8993e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9003e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9013e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9023e519524SHoward Hinnant{ 9033e519524SHoward Hinnant // modeled after search algorithm 9043e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9053e519524SHoward Hinnant if (__first2 == __last2) 9063e519524SHoward Hinnant return __r; 9073e519524SHoward Hinnant while (true) 9083e519524SHoward Hinnant { 9093e519524SHoward Hinnant while (true) 9103e519524SHoward Hinnant { 9113e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9123e519524SHoward Hinnant return __r; // (or __last1 if never found) 9133e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9143e519524SHoward Hinnant break; 9153e519524SHoward Hinnant ++__first1; 9163e519524SHoward Hinnant } 9173e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9183e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9193e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9203e519524SHoward Hinnant while (true) 9213e519524SHoward Hinnant { 9223e519524SHoward Hinnant if (++__m2 == __last2) 9233e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9243e519524SHoward Hinnant __r = __first1; 9253e519524SHoward Hinnant ++__first1; 9263e519524SHoward Hinnant break; 9273e519524SHoward Hinnant } 9283e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9293e519524SHoward Hinnant return __r; 9303e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9313e519524SHoward Hinnant { 9323e519524SHoward Hinnant ++__first1; 9333e519524SHoward Hinnant break; 9343e519524SHoward Hinnant } // else there is a match, check next elements 9353e519524SHoward Hinnant } 9363e519524SHoward Hinnant } 9373e519524SHoward Hinnant} 9383e519524SHoward Hinnant 9393e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9408694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9413e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9423e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9433e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9443e519524SHoward Hinnant{ 9453e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9463e519524SHoward Hinnant if (__first2 == __last2) 9473e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9483e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9493e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9503e519524SHoward Hinnant --__l2; 9513e519524SHoward Hinnant while (true) 9523e519524SHoward Hinnant { 9533e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9543e519524SHoward Hinnant while (true) 9553e519524SHoward Hinnant { 9563e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9573e519524SHoward Hinnant return __last1; 9583e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9593e519524SHoward Hinnant break; 9603e519524SHoward Hinnant } 9613e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9623e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9633e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9643e519524SHoward Hinnant while (true) 9653e519524SHoward Hinnant { 9663e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9673e519524SHoward Hinnant return __m1; 9683e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9693e519524SHoward Hinnant return __last1; 9703e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9713e519524SHoward Hinnant { 9723e519524SHoward Hinnant break; 9733e519524SHoward Hinnant } // else there is a match, check next elements 9743e519524SHoward Hinnant } 9753e519524SHoward Hinnant } 9763e519524SHoward Hinnant} 9773e519524SHoward Hinnant 9783e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9799b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 9803e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9813e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9823e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9833e519524SHoward Hinnant{ 9843e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9853e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9863e519524SHoward Hinnant if (__len2 == 0) 9873e519524SHoward Hinnant return __last1; 9883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9893e519524SHoward Hinnant if (__len1 < __len2) 9903e519524SHoward Hinnant return __last1; 9913e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9923e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9933e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9943e519524SHoward Hinnant --__l2; 9953e519524SHoward Hinnant while (true) 9963e519524SHoward Hinnant { 9973e519524SHoward Hinnant while (true) 9983e519524SHoward Hinnant { 9993e519524SHoward Hinnant if (__s == __l1) 10003e519524SHoward Hinnant return __last1; 10013e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10023e519524SHoward Hinnant break; 10033e519524SHoward Hinnant } 10043e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10053e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10063e519524SHoward Hinnant while (true) 10073e519524SHoward Hinnant { 10083e519524SHoward Hinnant if (__m2 == __first2) 10093e519524SHoward Hinnant return __m1; 10103e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10113e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10123e519524SHoward Hinnant { 10133e519524SHoward Hinnant break; 10143e519524SHoward Hinnant } 10153e519524SHoward Hinnant } 10163e519524SHoward Hinnant } 10173e519524SHoward Hinnant} 10183e519524SHoward Hinnant 10193e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10208694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10213e519524SHoward Hinnant_ForwardIterator1 10223e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10233e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10243e519524SHoward Hinnant{ 1025ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10263e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10273e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10283e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10293e519524SHoward Hinnant} 10303e519524SHoward Hinnant 10313e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10328694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10333e519524SHoward Hinnant_ForwardIterator1 10343e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10353e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10363e519524SHoward Hinnant{ 10373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1039ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10403e519524SHoward Hinnant} 10413e519524SHoward Hinnant 10423e519524SHoward Hinnant// find_first_of 10433e519524SHoward Hinnant 10443e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10459b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10469b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10473e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10483e519524SHoward Hinnant{ 10493e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10503e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10513e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10523e519524SHoward Hinnant return __first1; 10533e519524SHoward Hinnant return __last1; 10543e519524SHoward Hinnant} 10553e519524SHoward Hinnant 10569b0af34dSMarshall Clow 10579b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10588694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10599b0af34dSMarshall Clow_ForwardIterator1 10609b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10619b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10629b0af34dSMarshall Clow{ 10639b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10649b0af34dSMarshall Clow} 10659b0af34dSMarshall Clow 10663e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10678694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10683e519524SHoward Hinnant_ForwardIterator1 10693e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10703e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10713e519524SHoward Hinnant{ 10723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10749b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10753e519524SHoward Hinnant} 10763e519524SHoward Hinnant 10773e519524SHoward Hinnant// adjacent_find 10783e519524SHoward Hinnant 10793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10808694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10813e519524SHoward Hinnant_ForwardIterator 10823e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10833e519524SHoward Hinnant{ 10843e519524SHoward Hinnant if (__first != __last) 10853e519524SHoward Hinnant { 10863e519524SHoward Hinnant _ForwardIterator __i = __first; 10873e519524SHoward Hinnant while (++__i != __last) 10883e519524SHoward Hinnant { 10893e519524SHoward Hinnant if (__pred(*__first, *__i)) 10903e519524SHoward Hinnant return __first; 10913e519524SHoward Hinnant __first = __i; 10923e519524SHoward Hinnant } 10933e519524SHoward Hinnant } 10943e519524SHoward Hinnant return __last; 10953e519524SHoward Hinnant} 10963e519524SHoward Hinnant 10973e519524SHoward Hinnanttemplate <class _ForwardIterator> 10988694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10993e519524SHoward Hinnant_ForwardIterator 11003e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11013e519524SHoward Hinnant{ 11023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1103ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11043e519524SHoward Hinnant} 11053e519524SHoward Hinnant 11063e519524SHoward Hinnant// count 11073e519524SHoward Hinnant 11083e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 1109056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11103e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1111e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11123e519524SHoward Hinnant{ 11133e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11143e519524SHoward Hinnant for (; __first != __last; ++__first) 1115e4383379SHoward Hinnant if (*__first == __value_) 11163e519524SHoward Hinnant ++__r; 11173e519524SHoward Hinnant return __r; 11183e519524SHoward Hinnant} 11193e519524SHoward Hinnant 11203e519524SHoward Hinnant// count_if 11213e519524SHoward Hinnant 11223e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 1123056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11243e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11253e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11263e519524SHoward Hinnant{ 11273e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11283e519524SHoward Hinnant for (; __first != __last; ++__first) 11293e519524SHoward Hinnant if (__pred(*__first)) 11303e519524SHoward Hinnant ++__r; 11313e519524SHoward Hinnant return __r; 11323e519524SHoward Hinnant} 11333e519524SHoward Hinnant 11343e519524SHoward Hinnant// mismatch 11353e519524SHoward Hinnant 11363e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11376538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11383e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11393e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11403e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11413e519524SHoward Hinnant{ 1142bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11433e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11443e519524SHoward Hinnant break; 11453e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11463e519524SHoward Hinnant} 11473e519524SHoward Hinnant 11483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11496538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11503e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11513e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11523e519524SHoward Hinnant{ 11533e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11543e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1155ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11563e519524SHoward Hinnant} 11573e519524SHoward Hinnant 11580b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11590b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11606538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11610b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11620b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11630b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11640b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11650b0bbd2fSMarshall Clow{ 1166bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11670b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11680b0bbd2fSMarshall Clow break; 11690b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11700b0bbd2fSMarshall Clow} 11710b0bbd2fSMarshall Clow 11720b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11736538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11740b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11750b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11760b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11770b0bbd2fSMarshall Clow{ 11780b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11790b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11800b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11810b0bbd2fSMarshall Clow} 11820b0bbd2fSMarshall Clow#endif 11830b0bbd2fSMarshall Clow 11843e519524SHoward Hinnant// equal 11853e519524SHoward Hinnant 11863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11876538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11883e519524SHoward Hinnantbool 11893e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11903e519524SHoward Hinnant{ 1191910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 11923e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11933e519524SHoward Hinnant return false; 11943e519524SHoward Hinnant return true; 11953e519524SHoward Hinnant} 11963e519524SHoward Hinnant 11973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11986538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11993e519524SHoward Hinnantbool 12003e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12013e519524SHoward Hinnant{ 12023e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12033e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1204ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12053e519524SHoward Hinnant} 12063e519524SHoward Hinnant 12070b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12080b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12096538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12100b0bbd2fSMarshall Clowbool 12110b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12120b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12130b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12140b0bbd2fSMarshall Clow{ 1215910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12160b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12170b0bbd2fSMarshall Clow return false; 12180b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12190b0bbd2fSMarshall Clow} 12200b0bbd2fSMarshall Clow 12210b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12226538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12230b0bbd2fSMarshall Clowbool 12240b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12250b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12260b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12270b0bbd2fSMarshall Clow{ 12280b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12290b0bbd2fSMarshall Clow return false; 12300b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12310b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12320b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12330b0bbd2fSMarshall Clow} 12340b0bbd2fSMarshall Clow 12350b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12366538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12370b0bbd2fSMarshall Clowbool 12380b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12390b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12400b0bbd2fSMarshall Clow{ 12410b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12420b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12430b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12440b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12450b0bbd2fSMarshall Clow} 12460b0bbd2fSMarshall Clow 12470b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12486538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12490b0bbd2fSMarshall Clowbool 12500b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12510b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12520b0bbd2fSMarshall Clow{ 12530b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12540b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12550b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12560b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12570b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12580b0bbd2fSMarshall Clow} 12590b0bbd2fSMarshall Clow#endif 12600b0bbd2fSMarshall Clow 12613e519524SHoward Hinnant// is_permutation 12623e519524SHoward Hinnant 12633e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 126449c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 12653e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12663e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12673e519524SHoward Hinnant{ 126849c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1269910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12703e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 127149c7643cSMarshall Clow break; 127249c7643cSMarshall Clow if (__first1 == __last1) 12733e519524SHoward Hinnant return true; 127449c7643cSMarshall Clow 12753e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 12763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1277ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12783e519524SHoward Hinnant if (__l1 == _D1(1)) 12793e519524SHoward Hinnant return false; 1280ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12813e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12823e519524SHoward Hinnant // equal elements in [f2, l2) 12833e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12843e519524SHoward Hinnant { 12853e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1286939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1287939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1288939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1289939b1623SPeter Collingbourne break; 1290939b1623SPeter Collingbourne if (__match == __i) { 12913e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12923e519524SHoward Hinnant _D1 __c2 = 0; 12933e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12943e519524SHoward Hinnant if (__pred(*__i, *__j)) 12953e519524SHoward Hinnant ++__c2; 12963e519524SHoward Hinnant if (__c2 == 0) 12973e519524SHoward Hinnant return false; 12983e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12993e519524SHoward Hinnant _D1 __c1 = 1; 1300ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13013e519524SHoward Hinnant if (__pred(*__i, *__j)) 13023e519524SHoward Hinnant ++__c1; 13033e519524SHoward Hinnant if (__c1 != __c2) 13043e519524SHoward Hinnant return false; 13053e519524SHoward Hinnant } 13063e519524SHoward Hinnant } 13073e519524SHoward Hinnant return true; 13083e519524SHoward Hinnant} 13093e519524SHoward Hinnant 13103e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 131149c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13123e519524SHoward Hinnantbool 13133e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13143e519524SHoward Hinnant _ForwardIterator2 __first2) 13153e519524SHoward Hinnant{ 13163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13173e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1318ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13193e519524SHoward Hinnant} 13203e519524SHoward Hinnant 13210b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13220b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 132349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13240b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13250b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13260b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13270b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13280b0bbd2fSMarshall Clow{ 132949c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1330847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13310b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 133249c7643cSMarshall Clow break; 133349c7643cSMarshall Clow if (__first1 == __last1) 133449c7643cSMarshall Clow return __first2 == __last2; 133549c7643cSMarshall Clow else if (__first2 == __last2) 133649c7643cSMarshall Clow return false; 133749c7643cSMarshall Clow 13380b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13390b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13400b0bbd2fSMarshall Clow 13410b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1342fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13430b0bbd2fSMarshall Clow if (__l1 != __l2) 13440b0bbd2fSMarshall Clow return false; 13450b0bbd2fSMarshall Clow 13460b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13470b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13480b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13490b0bbd2fSMarshall Clow { 13500b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1351939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1352939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1353939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1354939b1623SPeter Collingbourne break; 1355939b1623SPeter Collingbourne if (__match == __i) { 13560b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13570b0bbd2fSMarshall Clow _D1 __c2 = 0; 13580b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13590b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13600b0bbd2fSMarshall Clow ++__c2; 13610b0bbd2fSMarshall Clow if (__c2 == 0) 13620b0bbd2fSMarshall Clow return false; 13630b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13640b0bbd2fSMarshall Clow _D1 __c1 = 1; 13650b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13660b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13670b0bbd2fSMarshall Clow ++__c1; 13680b0bbd2fSMarshall Clow if (__c1 != __c2) 13690b0bbd2fSMarshall Clow return false; 13700b0bbd2fSMarshall Clow } 13710b0bbd2fSMarshall Clow } 13720b0bbd2fSMarshall Clow return true; 13730b0bbd2fSMarshall Clow} 13740b0bbd2fSMarshall Clow 13750b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 137649c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13770b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13780b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13790b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13800b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13810b0bbd2fSMarshall Clow{ 13820b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13830b0bbd2fSMarshall Clow return false; 13840b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13850b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13860b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13870b0bbd2fSMarshall Clow} 13880b0bbd2fSMarshall Clow 13890b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 139049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13910b0bbd2fSMarshall Clowbool 13920b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13930b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13940b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13950b0bbd2fSMarshall Clow{ 13960b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13970b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13980b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13990b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14000b0bbd2fSMarshall Clow} 14010b0bbd2fSMarshall Clow 14020b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 140349c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14040b0bbd2fSMarshall Clowbool 14050b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14060b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14070b0bbd2fSMarshall Clow{ 14080b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14090b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14100b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14110b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14120b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14130b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14140b0bbd2fSMarshall Clow} 14150b0bbd2fSMarshall Clow#endif 14160b0bbd2fSMarshall Clow 14173e519524SHoward Hinnant// search 1418d835e592SMarshall Clow// __search is in <functional> 14193e519524SHoward Hinnant 14203e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 142112f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14223e519524SHoward Hinnant_ForwardIterator1 14233e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14243e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 14253e519524SHoward Hinnant{ 1426ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 14273e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 142828cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 142928cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 143028cc4ddeSMarshall Clow .first; 14313e519524SHoward Hinnant} 14323e519524SHoward Hinnant 14333e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 143412f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14353e519524SHoward Hinnant_ForwardIterator1 14363e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14373e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14383e519524SHoward Hinnant{ 143928cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 144028cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1441ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 14423e519524SHoward Hinnant} 14433e519524SHoward Hinnant 1444d835e592SMarshall Clow 1445d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1446d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 144712f0a779SMarshall Clow_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1448d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1449d835e592SMarshall Clow{ return __s(__f, __l).first; } 1450d835e592SMarshall Clow#endif 1451d835e592SMarshall Clow 14523e519524SHoward Hinnant// search_n 14533e519524SHoward Hinnant 14543e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 145512f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 14563e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1457e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 14583e519524SHoward Hinnant{ 14593e519524SHoward Hinnant if (__count <= 0) 14603e519524SHoward Hinnant return __first; 14613e519524SHoward Hinnant while (true) 14623e519524SHoward Hinnant { 1463e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 14643e519524SHoward Hinnant while (true) 14653e519524SHoward Hinnant { 1466e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 14673e519524SHoward Hinnant return __last; 1468e4383379SHoward Hinnant if (__pred(*__first, __value_)) 14693e519524SHoward Hinnant break; 14703e519524SHoward Hinnant ++__first; 14713e519524SHoward Hinnant } 1472e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 14733e519524SHoward Hinnant _ForwardIterator __m = __first; 14743e519524SHoward Hinnant _Size __c(0); 14753e519524SHoward Hinnant while (true) 14763e519524SHoward Hinnant { 14773e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 14783e519524SHoward Hinnant return __first; 14793e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 14803e519524SHoward Hinnant return __last; 1481e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 14823e519524SHoward Hinnant { 14833e519524SHoward Hinnant __first = __m; 14843e519524SHoward Hinnant ++__first; 14853e519524SHoward Hinnant break; 14863e519524SHoward Hinnant } // else there is a match, check next elements 14873e519524SHoward Hinnant } 14883e519524SHoward Hinnant } 14893e519524SHoward Hinnant} 14903e519524SHoward Hinnant 14913e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 149212f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 14933e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1494e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 14953e519524SHoward Hinnant{ 14963e519524SHoward Hinnant if (__count <= 0) 14973e519524SHoward Hinnant return __first; 14983e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 14993e519524SHoward Hinnant if (__len < __count) 15003e519524SHoward Hinnant return __last; 15013e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15023e519524SHoward Hinnant while (true) 15033e519524SHoward Hinnant { 1504e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15053e519524SHoward Hinnant while (true) 15063e519524SHoward Hinnant { 1507b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15083e519524SHoward Hinnant return __last; 1509e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15103e519524SHoward Hinnant break; 15113e519524SHoward Hinnant ++__first; 15123e519524SHoward Hinnant } 1513e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15143e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15153e519524SHoward Hinnant _Size __c(0); 15163e519524SHoward Hinnant while (true) 15173e519524SHoward Hinnant { 15183e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15193e519524SHoward Hinnant return __first; 15203e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1521e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15223e519524SHoward Hinnant { 15233e519524SHoward Hinnant __first = __m; 15243e519524SHoward Hinnant ++__first; 15253e519524SHoward Hinnant break; 15263e519524SHoward Hinnant } // else there is a match, check next elements 15273e519524SHoward Hinnant } 15283e519524SHoward Hinnant } 15293e519524SHoward Hinnant} 15303e519524SHoward Hinnant 15313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 153212f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15333e519524SHoward Hinnant_ForwardIterator 15343e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1535e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 15363e519524SHoward Hinnant{ 1537ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 153851544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 153951544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 15403e519524SHoward Hinnant} 15413e519524SHoward Hinnant 15423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 154312f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15443e519524SHoward Hinnant_ForwardIterator 1545e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 15463e519524SHoward Hinnant{ 15473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 154851544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 154951544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 15503e519524SHoward Hinnant} 15513e519524SHoward Hinnant 15523e519524SHoward Hinnant// copy 15533e519524SHoward Hinnanttemplate <class _Iter> 15543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15553e519524SHoward Hinnant_Iter 15563e519524SHoward Hinnant__unwrap_iter(_Iter __i) 15573e519524SHoward Hinnant{ 15583e519524SHoward Hinnant return __i; 15593e519524SHoward Hinnant} 15603e519524SHoward Hinnant 15613e519524SHoward Hinnanttemplate <class _Tp> 15625b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15633e519524SHoward Hinnanttypename enable_if 15643e519524SHoward Hinnant< 1565ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 15663e519524SHoward Hinnant _Tp* 15673e519524SHoward Hinnant>::type 15683e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 15693e519524SHoward Hinnant{ 15703e519524SHoward Hinnant return __i.base(); 15713e519524SHoward Hinnant} 15723e519524SHoward Hinnant 1573fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1574fc88dbd2SHoward Hinnant 15753e519524SHoward Hinnanttemplate <class _Tp> 15769cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 15773e519524SHoward Hinnanttypename enable_if 15783e519524SHoward Hinnant< 1579ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 15803e519524SHoward Hinnant _Tp* 15813e519524SHoward Hinnant>::type 15823e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant return __i.base(); 15853e519524SHoward Hinnant} 15863e519524SHoward Hinnant 158714bd0bf0SEric Fiselier#else 158814bd0bf0SEric Fiselier 158914bd0bf0SEric Fiseliertemplate <class _Tp> 15909cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 159114bd0bf0SEric Fiseliertypename enable_if 159214bd0bf0SEric Fiselier< 159314bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 159414bd0bf0SEric Fiselier __wrap_iter<_Tp*> 159514bd0bf0SEric Fiselier>::type 159614bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 159714bd0bf0SEric Fiselier{ 159814bd0bf0SEric Fiselier return __i; 159914bd0bf0SEric Fiselier} 160014bd0bf0SEric Fiselier 1601fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1602fc88dbd2SHoward Hinnant 16033e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16053e519524SHoward Hinnant_OutputIterator 16063e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16073e519524SHoward Hinnant{ 1608910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 16093e519524SHoward Hinnant *__result = *__first; 16103e519524SHoward Hinnant return __result; 16113e519524SHoward Hinnant} 16123e519524SHoward Hinnant 16133e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16153e519524SHoward Hinnanttypename enable_if 16163e519524SHoward Hinnant< 16173e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1618ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16193e519524SHoward Hinnant _Up* 16203e519524SHoward Hinnant>::type 16213e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 16223e519524SHoward Hinnant{ 16233e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16245b312052SMarshall Clow if (__n > 0) 1625ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16263e519524SHoward Hinnant return __result + __n; 16273e519524SHoward Hinnant} 16283e519524SHoward Hinnant 16293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16313e519524SHoward Hinnant_OutputIterator 16323e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16333e519524SHoward Hinnant{ 1634ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16353e519524SHoward Hinnant} 16363e519524SHoward Hinnant 16373e519524SHoward Hinnant// copy_backward 16383e519524SHoward Hinnant 1639d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 16403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16413e519524SHoward Hinnant_OutputIterator 1642d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 16433e519524SHoward Hinnant{ 16443e519524SHoward Hinnant while (__first != __last) 16453e519524SHoward Hinnant *--__result = *--__last; 16463e519524SHoward Hinnant return __result; 16473e519524SHoward Hinnant} 16483e519524SHoward Hinnant 16493e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16513e519524SHoward Hinnanttypename enable_if 16523e519524SHoward Hinnant< 16533e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1654ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16553e519524SHoward Hinnant _Up* 16563e519524SHoward Hinnant>::type 16573e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 16583e519524SHoward Hinnant{ 16593e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16605b312052SMarshall Clow if (__n > 0) 16615b312052SMarshall Clow { 16623e519524SHoward Hinnant __result -= __n; 1663ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16645b312052SMarshall Clow } 16653e519524SHoward Hinnant return __result; 16663e519524SHoward Hinnant} 16673e519524SHoward Hinnant 16683e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16703e519524SHoward Hinnant_BidirectionalIterator2 16713e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16723e519524SHoward Hinnant _BidirectionalIterator2 __result) 16733e519524SHoward Hinnant{ 1674fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1675fd838227SEric Fiselier __unwrap_iter(__last), 1676fd838227SEric Fiselier __unwrap_iter(__result)); 16773e519524SHoward Hinnant} 16783e519524SHoward Hinnant 16793e519524SHoward Hinnant// copy_if 16803e519524SHoward Hinnant 16813e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 16823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16833e519524SHoward Hinnant_OutputIterator 16843e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 16853e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 16863e519524SHoward Hinnant{ 16873e519524SHoward Hinnant for (; __first != __last; ++__first) 16883e519524SHoward Hinnant { 16893e519524SHoward Hinnant if (__pred(*__first)) 16903e519524SHoward Hinnant { 16913e519524SHoward Hinnant *__result = *__first; 16923e519524SHoward Hinnant ++__result; 16933e519524SHoward Hinnant } 16943e519524SHoward Hinnant } 16953e519524SHoward Hinnant return __result; 16963e519524SHoward Hinnant} 16973e519524SHoward Hinnant 16983e519524SHoward Hinnant// copy_n 16993e519524SHoward Hinnant 17003e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17023e519524SHoward Hinnanttypename enable_if 17033e519524SHoward Hinnant< 17043e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17053e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17063e519524SHoward Hinnant _OutputIterator 17073e519524SHoward Hinnant>::type 170851544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17093e519524SHoward Hinnant{ 171051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 171151544023SEric Fiselier _IntegralSize __n = __orig_n; 171299847d2bSHoward Hinnant if (__n > 0) 171399847d2bSHoward Hinnant { 17143e519524SHoward Hinnant *__result = *__first; 171599847d2bSHoward Hinnant ++__result; 171699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 171799847d2bSHoward Hinnant { 171899847d2bSHoward Hinnant ++__first; 171999847d2bSHoward Hinnant *__result = *__first; 172099847d2bSHoward Hinnant ++__result; 172199847d2bSHoward Hinnant } 172299847d2bSHoward Hinnant } 17233e519524SHoward Hinnant return __result; 17243e519524SHoward Hinnant} 17253e519524SHoward Hinnant 17263e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17283e519524SHoward Hinnanttypename enable_if 17293e519524SHoward Hinnant< 17303e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 17313e519524SHoward Hinnant _OutputIterator 17323e519524SHoward Hinnant>::type 173351544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17343e519524SHoward Hinnant{ 173551544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 173651544023SEric Fiselier _IntegralSize __n = __orig_n; 1737ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 17383e519524SHoward Hinnant} 17393e519524SHoward Hinnant 17403e519524SHoward Hinnant// move 17413e519524SHoward Hinnant 17423e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17443e519524SHoward Hinnant_OutputIterator 17453e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17463e519524SHoward Hinnant{ 1747910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1748ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 17493e519524SHoward Hinnant return __result; 17503e519524SHoward Hinnant} 17513e519524SHoward Hinnant 17523e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17543e519524SHoward Hinnanttypename enable_if 17553e519524SHoward Hinnant< 17563e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1757ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17583e519524SHoward Hinnant _Up* 17593e519524SHoward Hinnant>::type 17603e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 17613e519524SHoward Hinnant{ 17623e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17635b312052SMarshall Clow if (__n > 0) 1764ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17653e519524SHoward Hinnant return __result + __n; 17663e519524SHoward Hinnant} 17673e519524SHoward Hinnant 17683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17703e519524SHoward Hinnant_OutputIterator 17713e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17723e519524SHoward Hinnant{ 1773ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17743e519524SHoward Hinnant} 17753e519524SHoward Hinnant 17763e519524SHoward Hinnant// move_backward 17773e519524SHoward Hinnant 17783e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17803e519524SHoward Hinnant_OutputIterator 17813e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17823e519524SHoward Hinnant{ 17833e519524SHoward Hinnant while (__first != __last) 1784ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 17853e519524SHoward Hinnant return __result; 17863e519524SHoward Hinnant} 17873e519524SHoward Hinnant 17883e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17903e519524SHoward Hinnanttypename enable_if 17913e519524SHoward Hinnant< 17923e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1793ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17943e519524SHoward Hinnant _Up* 17953e519524SHoward Hinnant>::type 17963e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 17973e519524SHoward Hinnant{ 17983e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17995b312052SMarshall Clow if (__n > 0) 18005b312052SMarshall Clow { 18013e519524SHoward Hinnant __result -= __n; 1802ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18035b312052SMarshall Clow } 18043e519524SHoward Hinnant return __result; 18053e519524SHoward Hinnant} 18063e519524SHoward Hinnant 18073e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18093e519524SHoward Hinnant_BidirectionalIterator2 18103e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18113e519524SHoward Hinnant _BidirectionalIterator2 __result) 18123e519524SHoward Hinnant{ 1813ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18143e519524SHoward Hinnant} 18153e519524SHoward Hinnant 18163e519524SHoward Hinnant// iter_swap 18173e519524SHoward Hinnant 1818a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 18193e519524SHoward Hinnant 18203e519524SHoward Hinnant// transform 18213e519524SHoward Hinnant 18223e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 182399894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18243e519524SHoward Hinnant_OutputIterator 18253e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 18263e519524SHoward Hinnant{ 1827910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18283e519524SHoward Hinnant *__result = __op(*__first); 18293e519524SHoward Hinnant return __result; 18303e519524SHoward Hinnant} 18313e519524SHoward Hinnant 18323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 183399894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18343e519524SHoward Hinnant_OutputIterator 18353e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 18363e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 18373e519524SHoward Hinnant{ 1838910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 18393e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 18403e519524SHoward Hinnant return __result; 18413e519524SHoward Hinnant} 18423e519524SHoward Hinnant 18433e519524SHoward Hinnant// replace 18443e519524SHoward Hinnant 18453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 184612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18473e519524SHoward Hinnantvoid 18483e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 18493e519524SHoward Hinnant{ 18503e519524SHoward Hinnant for (; __first != __last; ++__first) 18513e519524SHoward Hinnant if (*__first == __old_value) 18523e519524SHoward Hinnant *__first = __new_value; 18533e519524SHoward Hinnant} 18543e519524SHoward Hinnant 18553e519524SHoward Hinnant// replace_if 18563e519524SHoward Hinnant 18573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 185812c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18593e519524SHoward Hinnantvoid 18603e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 18613e519524SHoward Hinnant{ 18623e519524SHoward Hinnant for (; __first != __last; ++__first) 18633e519524SHoward Hinnant if (__pred(*__first)) 18643e519524SHoward Hinnant *__first = __new_value; 18653e519524SHoward Hinnant} 18663e519524SHoward Hinnant 18673e519524SHoward Hinnant// replace_copy 18683e519524SHoward Hinnant 18693e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 187012c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18713e519524SHoward Hinnant_OutputIterator 18723e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 18733e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 18743e519524SHoward Hinnant{ 1875910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18763e519524SHoward Hinnant if (*__first == __old_value) 18773e519524SHoward Hinnant *__result = __new_value; 18783e519524SHoward Hinnant else 18793e519524SHoward Hinnant *__result = *__first; 18803e519524SHoward Hinnant return __result; 18813e519524SHoward Hinnant} 18823e519524SHoward Hinnant 18833e519524SHoward Hinnant// replace_copy_if 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 188612c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18873e519524SHoward Hinnant_OutputIterator 18883e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 18893e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 18903e519524SHoward Hinnant{ 1891910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18923e519524SHoward Hinnant if (__pred(*__first)) 18933e519524SHoward Hinnant *__result = __new_value; 18943e519524SHoward Hinnant else 18953e519524SHoward Hinnant *__result = *__first; 18963e519524SHoward Hinnant return __result; 18973e519524SHoward Hinnant} 18983e519524SHoward Hinnant 18993e519524SHoward Hinnant// fill_n 19003e519524SHoward Hinnant 19013e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19024bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19033e519524SHoward Hinnant_OutputIterator 19040f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19053e519524SHoward Hinnant{ 1906910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1907e4383379SHoward Hinnant *__first = __value_; 19083e519524SHoward Hinnant return __first; 19093e519524SHoward Hinnant} 19103e519524SHoward Hinnant 19113e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19124bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19133e519524SHoward Hinnant_OutputIterator 1914e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19153e519524SHoward Hinnant{ 191651544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 19173e519524SHoward Hinnant} 19183e519524SHoward Hinnant 19193e519524SHoward Hinnant// fill 19203e519524SHoward Hinnant 19213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19224bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19233e519524SHoward Hinnantvoid 1924e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 19253e519524SHoward Hinnant{ 19263e519524SHoward Hinnant for (; __first != __last; ++__first) 1927e4383379SHoward Hinnant *__first = __value_; 19283e519524SHoward Hinnant} 19293e519524SHoward Hinnant 19303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 19314bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19323e519524SHoward Hinnantvoid 1933e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 19343e519524SHoward Hinnant{ 1935e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 19363e519524SHoward Hinnant} 19373e519524SHoward Hinnant 19383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19394bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19403e519524SHoward Hinnantvoid 1941e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 19423e519524SHoward Hinnant{ 1943e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 19443e519524SHoward Hinnant} 19453e519524SHoward Hinnant 19463e519524SHoward Hinnant// generate 19473e519524SHoward Hinnant 19483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 19494bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19503e519524SHoward Hinnantvoid 19513e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 19523e519524SHoward Hinnant{ 19533e519524SHoward Hinnant for (; __first != __last; ++__first) 19543e519524SHoward Hinnant *__first = __gen(); 19553e519524SHoward Hinnant} 19563e519524SHoward Hinnant 19573e519524SHoward Hinnant// generate_n 19583e519524SHoward Hinnant 19593e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 19604bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19613e519524SHoward Hinnant_OutputIterator 196251544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 19633e519524SHoward Hinnant{ 196451544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 196551544023SEric Fiselier _IntegralSize __n = __orig_n; 1966910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 19673e519524SHoward Hinnant *__first = __gen(); 19683e519524SHoward Hinnant return __first; 19693e519524SHoward Hinnant} 19703e519524SHoward Hinnant 19713e519524SHoward Hinnant// remove 19723e519524SHoward Hinnant 19733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 1974e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 1975e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 19763e519524SHoward Hinnant{ 1977e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 19783e519524SHoward Hinnant if (__first != __last) 19793e519524SHoward Hinnant { 19803e519524SHoward Hinnant _ForwardIterator __i = __first; 19813e519524SHoward Hinnant while (++__i != __last) 19823e519524SHoward Hinnant { 1983e4383379SHoward Hinnant if (!(*__i == __value_)) 19843e519524SHoward Hinnant { 1985ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 19863e519524SHoward Hinnant ++__first; 19873e519524SHoward Hinnant } 19883e519524SHoward Hinnant } 19893e519524SHoward Hinnant } 19903e519524SHoward Hinnant return __first; 19913e519524SHoward Hinnant} 19923e519524SHoward Hinnant 19933e519524SHoward Hinnant// remove_if 19943e519524SHoward Hinnant 19953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 1996e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 19973e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 19983e519524SHoward Hinnant{ 1999ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20003e519524SHoward Hinnant (__first, __last, __pred); 20013e519524SHoward Hinnant if (__first != __last) 20023e519524SHoward Hinnant { 20033e519524SHoward Hinnant _ForwardIterator __i = __first; 20043e519524SHoward Hinnant while (++__i != __last) 20053e519524SHoward Hinnant { 20063e519524SHoward Hinnant if (!__pred(*__i)) 20073e519524SHoward Hinnant { 2008ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20093e519524SHoward Hinnant ++__first; 20103e519524SHoward Hinnant } 20113e519524SHoward Hinnant } 20123e519524SHoward Hinnant } 20133e519524SHoward Hinnant return __first; 20143e519524SHoward Hinnant} 20153e519524SHoward Hinnant 20163e519524SHoward Hinnant// remove_copy 20173e519524SHoward Hinnant 20183e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2019e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20203e519524SHoward Hinnant_OutputIterator 2021e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 20223e519524SHoward Hinnant{ 20233e519524SHoward Hinnant for (; __first != __last; ++__first) 20243e519524SHoward Hinnant { 2025e4383379SHoward Hinnant if (!(*__first == __value_)) 20263e519524SHoward Hinnant { 20273e519524SHoward Hinnant *__result = *__first; 20283e519524SHoward Hinnant ++__result; 20293e519524SHoward Hinnant } 20303e519524SHoward Hinnant } 20313e519524SHoward Hinnant return __result; 20323e519524SHoward Hinnant} 20333e519524SHoward Hinnant 20343e519524SHoward Hinnant// remove_copy_if 20353e519524SHoward Hinnant 20363e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2037e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20383e519524SHoward Hinnant_OutputIterator 20393e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 20403e519524SHoward Hinnant{ 20413e519524SHoward Hinnant for (; __first != __last; ++__first) 20423e519524SHoward Hinnant { 20433e519524SHoward Hinnant if (!__pred(*__first)) 20443e519524SHoward Hinnant { 20453e519524SHoward Hinnant *__result = *__first; 20463e519524SHoward Hinnant ++__result; 20473e519524SHoward Hinnant } 20483e519524SHoward Hinnant } 20493e519524SHoward Hinnant return __result; 20503e519524SHoward Hinnant} 20513e519524SHoward Hinnant 20523e519524SHoward Hinnant// unique 20533e519524SHoward Hinnant 20543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 20554bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20563e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 20573e519524SHoward Hinnant{ 2058ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 20593e519524SHoward Hinnant (__first, __last, __pred); 20603e519524SHoward Hinnant if (__first != __last) 20613e519524SHoward Hinnant { 20623e519524SHoward Hinnant // ... a a ? ... 20633e519524SHoward Hinnant // f i 20643e519524SHoward Hinnant _ForwardIterator __i = __first; 20653e519524SHoward Hinnant for (++__i; ++__i != __last;) 20663e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2067ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 20683e519524SHoward Hinnant ++__first; 20693e519524SHoward Hinnant } 20703e519524SHoward Hinnant return __first; 20713e519524SHoward Hinnant} 20723e519524SHoward Hinnant 20733e519524SHoward Hinnanttemplate <class _ForwardIterator> 20744bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20753e519524SHoward Hinnant_ForwardIterator 20763e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 20773e519524SHoward Hinnant{ 20783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2079ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 20803e519524SHoward Hinnant} 20813e519524SHoward Hinnant 20823e519524SHoward Hinnant// unique_copy 20833e519524SHoward Hinnant 20843e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 20854bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 20863e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 20873e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 20883e519524SHoward Hinnant{ 20893e519524SHoward Hinnant if (__first != __last) 20903e519524SHoward Hinnant { 20913e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 20923e519524SHoward Hinnant *__result = __t; 20933e519524SHoward Hinnant ++__result; 20943e519524SHoward Hinnant while (++__first != __last) 20953e519524SHoward Hinnant { 20963e519524SHoward Hinnant if (!__pred(__t, *__first)) 20973e519524SHoward Hinnant { 20983e519524SHoward Hinnant __t = *__first; 20993e519524SHoward Hinnant *__result = __t; 21003e519524SHoward Hinnant ++__result; 21013e519524SHoward Hinnant } 21023e519524SHoward Hinnant } 21033e519524SHoward Hinnant } 21043e519524SHoward Hinnant return __result; 21053e519524SHoward Hinnant} 21063e519524SHoward Hinnant 21073e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 21084bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21093e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21103e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 21113e519524SHoward Hinnant{ 21123e519524SHoward Hinnant if (__first != __last) 21133e519524SHoward Hinnant { 21143e519524SHoward Hinnant _ForwardIterator __i = __first; 21153e519524SHoward Hinnant *__result = *__i; 21163e519524SHoward Hinnant ++__result; 21173e519524SHoward Hinnant while (++__first != __last) 21183e519524SHoward Hinnant { 21193e519524SHoward Hinnant if (!__pred(*__i, *__first)) 21203e519524SHoward Hinnant { 21213e519524SHoward Hinnant *__result = *__first; 21223e519524SHoward Hinnant ++__result; 21233e519524SHoward Hinnant __i = __first; 21243e519524SHoward Hinnant } 21253e519524SHoward Hinnant } 21263e519524SHoward Hinnant } 21273e519524SHoward Hinnant return __result; 21283e519524SHoward Hinnant} 21293e519524SHoward Hinnant 21303e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 21314bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21323e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 21333e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 21343e519524SHoward Hinnant{ 21353e519524SHoward Hinnant if (__first != __last) 21363e519524SHoward Hinnant { 21373e519524SHoward Hinnant *__result = *__first; 21383e519524SHoward Hinnant while (++__first != __last) 21393e519524SHoward Hinnant if (!__pred(*__result, *__first)) 21403e519524SHoward Hinnant *++__result = *__first; 21413e519524SHoward Hinnant ++__result; 21423e519524SHoward Hinnant } 21433e519524SHoward Hinnant return __result; 21443e519524SHoward Hinnant} 21453e519524SHoward Hinnant 21463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 21474bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21483e519524SHoward Hinnant_OutputIterator 21493e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 21503e519524SHoward Hinnant{ 2151ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 21523e519524SHoward Hinnant (__first, __last, __result, __pred, 21533e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 21543e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 21553e519524SHoward Hinnant} 21563e519524SHoward Hinnant 21573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 21584bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21593e519524SHoward Hinnant_OutputIterator 21603e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 21613e519524SHoward Hinnant{ 21623e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2163ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 21643e519524SHoward Hinnant} 21653e519524SHoward Hinnant 21663e519524SHoward Hinnant// reverse 21673e519524SHoward Hinnant 21683e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 21693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21703e519524SHoward Hinnantvoid 21713e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 21723e519524SHoward Hinnant{ 21733e519524SHoward Hinnant while (__first != __last) 21743e519524SHoward Hinnant { 21753e519524SHoward Hinnant if (__first == --__last) 21763e519524SHoward Hinnant break; 2177def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 21783e519524SHoward Hinnant ++__first; 21793e519524SHoward Hinnant } 21803e519524SHoward Hinnant} 21813e519524SHoward Hinnant 21823e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 21833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21843e519524SHoward Hinnantvoid 21853e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 21863e519524SHoward Hinnant{ 21873e519524SHoward Hinnant if (__first != __last) 21883e519524SHoward Hinnant for (; __first < --__last; ++__first) 2189def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 21903e519524SHoward Hinnant} 21913e519524SHoward Hinnant 21923e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 21933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21943e519524SHoward Hinnantvoid 21953e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 21963e519524SHoward Hinnant{ 2197ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 21983e519524SHoward Hinnant} 21993e519524SHoward Hinnant 22003e519524SHoward Hinnant// reverse_copy 22013e519524SHoward Hinnant 22023e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2203e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22043e519524SHoward Hinnant_OutputIterator 22053e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 22063e519524SHoward Hinnant{ 22073e519524SHoward Hinnant for (; __first != __last; ++__result) 22083e519524SHoward Hinnant *__result = *--__last; 22093e519524SHoward Hinnant return __result; 22103e519524SHoward Hinnant} 22113e519524SHoward Hinnant 22123e519524SHoward Hinnant// rotate 22133e519524SHoward Hinnant 22143e519524SHoward Hinnanttemplate <class _ForwardIterator> 22153e519524SHoward Hinnant_ForwardIterator 2216aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 22173e519524SHoward Hinnant{ 2218aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2219aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2220aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2221aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2222aca09de3SHoward Hinnant return __lm1; 2223aca09de3SHoward Hinnant} 2224aca09de3SHoward Hinnant 2225aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2226aca09de3SHoward Hinnant_BidirectionalIterator 2227aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2228aca09de3SHoward Hinnant{ 2229aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2230aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2231aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2232aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2233aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2234aca09de3SHoward Hinnant return __fp1; 2235aca09de3SHoward Hinnant} 2236aca09de3SHoward Hinnant 2237aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2238aca09de3SHoward Hinnant_ForwardIterator 2239aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2240aca09de3SHoward Hinnant{ 22413e519524SHoward Hinnant _ForwardIterator __i = __middle; 22423e519524SHoward Hinnant while (true) 22433e519524SHoward Hinnant { 22443e519524SHoward Hinnant swap(*__first, *__i); 22453e519524SHoward Hinnant ++__first; 22463e519524SHoward Hinnant if (++__i == __last) 22473e519524SHoward Hinnant break; 22483e519524SHoward Hinnant if (__first == __middle) 22493e519524SHoward Hinnant __middle = __i; 22503e519524SHoward Hinnant } 22513e519524SHoward Hinnant _ForwardIterator __r = __first; 22523e519524SHoward Hinnant if (__first != __middle) 22533e519524SHoward Hinnant { 22543e519524SHoward Hinnant __i = __middle; 22553e519524SHoward Hinnant while (true) 22563e519524SHoward Hinnant { 22573e519524SHoward Hinnant swap(*__first, *__i); 22583e519524SHoward Hinnant ++__first; 22593e519524SHoward Hinnant if (++__i == __last) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant if (__first == __middle) 22623e519524SHoward Hinnant break; 22633e519524SHoward Hinnant __i = __middle; 22643e519524SHoward Hinnant } 22653e519524SHoward Hinnant else if (__first == __middle) 22663e519524SHoward Hinnant __middle = __i; 22673e519524SHoward Hinnant } 22683e519524SHoward Hinnant } 22693e519524SHoward Hinnant return __r; 22703e519524SHoward Hinnant} 22713e519524SHoward Hinnant 22723e519524SHoward Hinnanttemplate<typename _Integral> 22733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22743e519524SHoward Hinnant_Integral 227519b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 22763e519524SHoward Hinnant{ 22773e519524SHoward Hinnant do 22783e519524SHoward Hinnant { 22793e519524SHoward Hinnant _Integral __t = __x % __y; 22803e519524SHoward Hinnant __x = __y; 22813e519524SHoward Hinnant __y = __t; 22823e519524SHoward Hinnant } while (__y); 22833e519524SHoward Hinnant return __x; 22843e519524SHoward Hinnant} 22853e519524SHoward Hinnant 22863e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 22873e519524SHoward Hinnant_RandomAccessIterator 2288aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 22893e519524SHoward Hinnant{ 22903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 22913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 22923e519524SHoward Hinnant 22933e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 22943e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 22953e519524SHoward Hinnant if (__m1 == __m2) 22963e519524SHoward Hinnant { 2297ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 22983e519524SHoward Hinnant return __middle; 22993e519524SHoward Hinnant } 230019b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 23013e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23023e519524SHoward Hinnant { 2303aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 23043e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 23053e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 23063e519524SHoward Hinnant do 23073e519524SHoward Hinnant { 2308aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 23093e519524SHoward Hinnant __p1 = __p2; 23103e519524SHoward Hinnant const difference_type __d = __last - __p2; 23113e519524SHoward Hinnant if (__m1 < __d) 23123e519524SHoward Hinnant __p2 += __m1; 23133e519524SHoward Hinnant else 23143e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 23153e519524SHoward Hinnant } while (__p2 != __p); 2316aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 23173e519524SHoward Hinnant } 23183e519524SHoward Hinnant return __first + __m2; 23193e519524SHoward Hinnant} 23203e519524SHoward Hinnant 23213e519524SHoward Hinnanttemplate <class _ForwardIterator> 23223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23233e519524SHoward Hinnant_ForwardIterator 2324aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2325aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2326aca09de3SHoward Hinnant{ 2327aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2328aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2329aca09de3SHoward Hinnant { 2330aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2331aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2332aca09de3SHoward Hinnant } 2333aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2334aca09de3SHoward Hinnant} 2335aca09de3SHoward Hinnant 2336aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2337aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2338aca09de3SHoward Hinnant_BidirectionalIterator 2339aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2340aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2341aca09de3SHoward Hinnant{ 2342aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2343aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2344aca09de3SHoward Hinnant { 2345aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2346aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2347aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2348aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2349aca09de3SHoward Hinnant } 2350aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2351aca09de3SHoward Hinnant} 2352aca09de3SHoward Hinnant 2353aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2354aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2355aca09de3SHoward Hinnant_RandomAccessIterator 2356aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2357aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2358aca09de3SHoward Hinnant{ 2359aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2360aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2361aca09de3SHoward Hinnant { 2362aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2363aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2364aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2365aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2366aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2367aca09de3SHoward Hinnant } 2368aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2369aca09de3SHoward Hinnant} 2370aca09de3SHoward Hinnant 2371aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2372aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2373aca09de3SHoward Hinnant_ForwardIterator 23743e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 23753e519524SHoward Hinnant{ 2376aca09de3SHoward Hinnant if (__first == __middle) 2377aca09de3SHoward Hinnant return __last; 2378aca09de3SHoward Hinnant if (__middle == __last) 2379aca09de3SHoward Hinnant return __first; 2380ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2381aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 23823e519524SHoward Hinnant} 23833e519524SHoward Hinnant 23843e519524SHoward Hinnant// rotate_copy 23853e519524SHoward Hinnant 23863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 23873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23883e519524SHoward Hinnant_OutputIterator 23893e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 23903e519524SHoward Hinnant{ 2391ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 23923e519524SHoward Hinnant} 23933e519524SHoward Hinnant 23943e519524SHoward Hinnant// min_element 23953e519524SHoward Hinnant 23963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 23979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 23983e519524SHoward Hinnant_ForwardIterator 23990b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24003e519524SHoward Hinnant{ 2401*a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2402*a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 24033e519524SHoward Hinnant if (__first != __last) 24043e519524SHoward Hinnant { 24053e519524SHoward Hinnant _ForwardIterator __i = __first; 24063e519524SHoward Hinnant while (++__i != __last) 24073e519524SHoward Hinnant if (__comp(*__i, *__first)) 24083e519524SHoward Hinnant __first = __i; 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant return __first; 24113e519524SHoward Hinnant} 24123e519524SHoward Hinnant 24133e519524SHoward Hinnanttemplate <class _ForwardIterator> 24140b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24153e519524SHoward Hinnant_ForwardIterator 24163e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 24173e519524SHoward Hinnant{ 24180b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 24194eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24204eb27b79SHoward Hinnant} 24214eb27b79SHoward Hinnant 24224eb27b79SHoward Hinnant// min 24234eb27b79SHoward Hinnant 24244eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 24259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24264eb27b79SHoward Hinnantconst _Tp& 24274eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 24284eb27b79SHoward Hinnant{ 24294eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 24304eb27b79SHoward Hinnant} 24314eb27b79SHoward Hinnant 24324eb27b79SHoward Hinnanttemplate <class _Tp> 24339d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24344eb27b79SHoward Hinnantconst _Tp& 24354eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 24364eb27b79SHoward Hinnant{ 2437ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 24384eb27b79SHoward Hinnant} 24394eb27b79SHoward Hinnant 2440ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 244154976f26SHoward Hinnant 24424eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24439d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24444eb27b79SHoward Hinnant_Tp 24454eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 24464eb27b79SHoward Hinnant{ 24470b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 24484eb27b79SHoward Hinnant} 24494eb27b79SHoward Hinnant 24504eb27b79SHoward Hinnanttemplate<class _Tp> 24519d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24524eb27b79SHoward Hinnant_Tp 24534eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 24544eb27b79SHoward Hinnant{ 24550b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 24563e519524SHoward Hinnant} 24573e519524SHoward Hinnant 2458ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 245954976f26SHoward Hinnant 24603e519524SHoward Hinnant// max_element 24613e519524SHoward Hinnant 24623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24639d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24643e519524SHoward Hinnant_ForwardIterator 24650b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24663e519524SHoward Hinnant{ 2467*a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2468*a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 24693e519524SHoward Hinnant if (__first != __last) 24703e519524SHoward Hinnant { 24713e519524SHoward Hinnant _ForwardIterator __i = __first; 24723e519524SHoward Hinnant while (++__i != __last) 24733e519524SHoward Hinnant if (__comp(*__first, *__i)) 24743e519524SHoward Hinnant __first = __i; 24753e519524SHoward Hinnant } 24763e519524SHoward Hinnant return __first; 24773e519524SHoward Hinnant} 24783e519524SHoward Hinnant 24799d67c6d5SMarshall Clow 24803e519524SHoward Hinnanttemplate <class _ForwardIterator> 24810b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24823e519524SHoward Hinnant_ForwardIterator 24833e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 24843e519524SHoward Hinnant{ 24850b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 24864eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24874eb27b79SHoward Hinnant} 24884eb27b79SHoward Hinnant 24894eb27b79SHoward Hinnant// max 24904eb27b79SHoward Hinnant 24914eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 24929d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24934eb27b79SHoward Hinnantconst _Tp& 24944eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 24954eb27b79SHoward Hinnant{ 24964eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 24974eb27b79SHoward Hinnant} 24984eb27b79SHoward Hinnant 24994eb27b79SHoward Hinnanttemplate <class _Tp> 25009d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25014eb27b79SHoward Hinnantconst _Tp& 25024eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25034eb27b79SHoward Hinnant{ 2504ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 25054eb27b79SHoward Hinnant} 25064eb27b79SHoward Hinnant 2507ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 250854976f26SHoward Hinnant 25094eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25109d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25114eb27b79SHoward Hinnant_Tp 25124eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 25134eb27b79SHoward Hinnant{ 25140b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 25154eb27b79SHoward Hinnant} 25164eb27b79SHoward Hinnant 25174eb27b79SHoward Hinnanttemplate<class _Tp> 25189d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25194eb27b79SHoward Hinnant_Tp 25204eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 25214eb27b79SHoward Hinnant{ 25220b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 25233e519524SHoward Hinnant} 25243e519524SHoward Hinnant 2525ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 252654976f26SHoward Hinnant 2527146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2528146c14acSMarshall Clow// clamp 2529146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2530146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2531146c14acSMarshall Clowconst _Tp& 2532146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2533146c14acSMarshall Clow{ 2534146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2535146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2536146c14acSMarshall Clow 2537146c14acSMarshall Clow} 2538146c14acSMarshall Clow 2539146c14acSMarshall Clowtemplate<class _Tp> 2540146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2541146c14acSMarshall Clowconst _Tp& 2542146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2543146c14acSMarshall Clow{ 2544146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2545146c14acSMarshall Clow} 2546146c14acSMarshall Clow#endif 2547146c14acSMarshall Clow 25483e519524SHoward Hinnant// minmax_element 25493e519524SHoward Hinnant 25503e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25510b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 25523e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 25533e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25543e519524SHoward Hinnant{ 2555*a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2556*a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 25573e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 25583e519524SHoward Hinnant if (__first != __last) 25593e519524SHoward Hinnant { 25603e519524SHoward Hinnant if (++__first != __last) 25613e519524SHoward Hinnant { 25623e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 25633e519524SHoward Hinnant __result.first = __first; 25643e519524SHoward Hinnant else 25653e519524SHoward Hinnant __result.second = __first; 25663e519524SHoward Hinnant while (++__first != __last) 25673e519524SHoward Hinnant { 25683e519524SHoward Hinnant _ForwardIterator __i = __first; 25693e519524SHoward Hinnant if (++__first == __last) 25703e519524SHoward Hinnant { 25713e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 25723e519524SHoward Hinnant __result.first = __i; 25733e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 25743e519524SHoward Hinnant __result.second = __i; 25753e519524SHoward Hinnant break; 25763e519524SHoward Hinnant } 25773e519524SHoward Hinnant else 25783e519524SHoward Hinnant { 25793e519524SHoward Hinnant if (__comp(*__first, *__i)) 25803e519524SHoward Hinnant { 25813e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 25823e519524SHoward Hinnant __result.first = __first; 25833e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 25843e519524SHoward Hinnant __result.second = __i; 25853e519524SHoward Hinnant } 25863e519524SHoward Hinnant else 25873e519524SHoward Hinnant { 25883e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 25893e519524SHoward Hinnant __result.first = __i; 25903e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 25913e519524SHoward Hinnant __result.second = __first; 25923e519524SHoward Hinnant } 25933e519524SHoward Hinnant } 25943e519524SHoward Hinnant } 25953e519524SHoward Hinnant } 25963e519524SHoward Hinnant } 25973e519524SHoward Hinnant return __result; 25983e519524SHoward Hinnant} 25993e519524SHoward Hinnant 26003e519524SHoward Hinnanttemplate <class _ForwardIterator> 26010b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26023e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26033e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26043e519524SHoward Hinnant{ 26059d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 26069d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26073e519524SHoward Hinnant} 26083e519524SHoward Hinnant 26094eb27b79SHoward Hinnant// minmax 26104eb27b79SHoward Hinnant 26114eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26129d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26134eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26144eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26154eb27b79SHoward Hinnant{ 26164eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26174eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26184eb27b79SHoward Hinnant} 26194eb27b79SHoward Hinnant 26204eb27b79SHoward Hinnanttemplate<class _Tp> 26219d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26224eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26234eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26244eb27b79SHoward Hinnant{ 2625ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26264eb27b79SHoward Hinnant} 26274eb27b79SHoward Hinnant 2628ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 262954976f26SHoward Hinnant 26304eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26319d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26324eb27b79SHoward Hinnantpair<_Tp, _Tp> 26334eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 26344eb27b79SHoward Hinnant{ 26359d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 26369d67c6d5SMarshall Clow _Iter __first = __t.begin(); 26379d67c6d5SMarshall Clow _Iter __last = __t.end(); 26389d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 26399d67c6d5SMarshall Clow 26409d67c6d5SMarshall Clow ++__first; 26419d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 26429d67c6d5SMarshall Clow { 26439d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 26449d67c6d5SMarshall Clow __result.first = *__first; 26459d67c6d5SMarshall Clow else 26469d67c6d5SMarshall Clow __result.second = *__first; 26479d67c6d5SMarshall Clow ++__first; 26489d67c6d5SMarshall Clow } 26499d67c6d5SMarshall Clow 26509d67c6d5SMarshall Clow while (__first != __last) 26519d67c6d5SMarshall Clow { 26529d67c6d5SMarshall Clow _Tp __prev = *__first++; 2653002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2654002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2655002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 26569d67c6d5SMarshall Clow } 26579d67c6d5SMarshall Clow else { 2658002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2659002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 26609d67c6d5SMarshall Clow } 26619d67c6d5SMarshall Clow 26629d67c6d5SMarshall Clow __first++; 26639d67c6d5SMarshall Clow } 26649d67c6d5SMarshall Clow return __result; 26659d67c6d5SMarshall Clow} 26669d67c6d5SMarshall Clow 26679d67c6d5SMarshall Clowtemplate<class _Tp> 26689d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26699d67c6d5SMarshall Clowpair<_Tp, _Tp> 26709d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 26719d67c6d5SMarshall Clow{ 26729d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 26734eb27b79SHoward Hinnant} 26744eb27b79SHoward Hinnant 2675ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 267654976f26SHoward Hinnant 26773e519524SHoward Hinnant// random_shuffle 26783e519524SHoward Hinnant 2679f9d540b0SHoward Hinnant// __independent_bits_engine 2680f9d540b0SHoward Hinnant 2681c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2682f9d540b0SHoward Hinnantstruct __log2_imp 26833e519524SHoward Hinnant{ 2684c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2685c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 26863e519524SHoward Hinnant}; 26873e519524SHoward Hinnant 2688c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2689c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 26903e519524SHoward Hinnant{ 2691f9d540b0SHoward Hinnant static const size_t value = 0; 26923e519524SHoward Hinnant}; 26933e519524SHoward Hinnant 2694c003db1fSHoward Hinnanttemplate <size_t _Rp> 2695c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 26963e519524SHoward Hinnant{ 2697c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 26983e519524SHoward Hinnant}; 26993e519524SHoward Hinnant 270089918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2701f9d540b0SHoward Hinnantstruct __log2 27023e519524SHoward Hinnant{ 2703c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 270489918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 27053e519524SHoward Hinnant}; 27063e519524SHoward Hinnant 2707f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2708f9d540b0SHoward Hinnantclass __independent_bits_engine 27093e519524SHoward Hinnant{ 2710f9d540b0SHoward Hinnantpublic: 2711f9d540b0SHoward Hinnant // types 2712f9d540b0SHoward Hinnant typedef _UIntType result_type; 2713f9d540b0SHoward Hinnant 2714f9d540b0SHoward Hinnantprivate: 2715f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2716f9d540b0SHoward Hinnant typedef typename conditional 2717f9d540b0SHoward Hinnant < 2718f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2719f9d540b0SHoward Hinnant result_type, 2720f9d540b0SHoward Hinnant _Engine_result_type 2721f9d540b0SHoward Hinnant >::type _Working_result_type; 2722f9d540b0SHoward Hinnant 2723f9d540b0SHoward Hinnant _Engine& __e_; 2724f9d540b0SHoward Hinnant size_t __w_; 2725f9d540b0SHoward Hinnant size_t __w0_; 2726f9d540b0SHoward Hinnant size_t __n_; 2727f9d540b0SHoward Hinnant size_t __n0_; 2728f9d540b0SHoward Hinnant _Working_result_type __y0_; 2729f9d540b0SHoward Hinnant _Working_result_type __y1_; 2730f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2731f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2732f9d540b0SHoward Hinnant 2733ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2734c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2735f9d540b0SHoward Hinnant + _Working_result_type(1); 2736e386b7b3SHoward Hinnant#else 2737e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2738e386b7b3SHoward Hinnant + _Working_result_type(1); 2739e386b7b3SHoward Hinnant#endif 2740e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2741e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2742e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2743f9d540b0SHoward Hinnant 2744f9d540b0SHoward Hinnantpublic: 2745f9d540b0SHoward Hinnant // constructors and seeding functions 2746f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2747f9d540b0SHoward Hinnant 2748f9d540b0SHoward Hinnant // generating functions 2749c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2750f9d540b0SHoward Hinnant 2751f9d540b0SHoward Hinnantprivate: 275208bba64aSMarshall Clow result_type __eval(false_type); 275308bba64aSMarshall Clow result_type __eval(true_type); 2754f9d540b0SHoward Hinnant}; 2755f9d540b0SHoward Hinnant 2756f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2757f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2758f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2759f9d540b0SHoward Hinnant : __e_(__e), 2760f9d540b0SHoward Hinnant __w_(__w) 2761f9d540b0SHoward Hinnant{ 2762f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2763f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2764c003db1fSHoward Hinnant if (_Rp == 0) 2765c003db1fSHoward Hinnant __y0_ = _Rp; 2766f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2767c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2768f9d540b0SHoward Hinnant else 2769f9d540b0SHoward Hinnant __y0_ = 0; 2770c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2771f9d540b0SHoward Hinnant { 2772f9d540b0SHoward Hinnant ++__n_; 2773f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2774f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2775c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2776f9d540b0SHoward Hinnant else 2777f9d540b0SHoward Hinnant __y0_ = 0; 2778f9d540b0SHoward Hinnant } 2779f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2780f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2781c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2782f9d540b0SHoward Hinnant else 2783f9d540b0SHoward Hinnant __y1_ = 0; 2784f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2785f9d540b0SHoward Hinnant _Engine_result_type(0); 2786f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2787f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2788f9d540b0SHoward Hinnant _Engine_result_type(~0); 27893e519524SHoward Hinnant} 27903e519524SHoward Hinnant 2791f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2792f9d540b0SHoward Hinnantinline 2793f9d540b0SHoward Hinnant_UIntType 279408bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 27953e519524SHoward Hinnant{ 2796f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 27973e519524SHoward Hinnant} 27983e519524SHoward Hinnant 2799f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2800f9d540b0SHoward Hinnant_UIntType 280108bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28023e519524SHoward Hinnant{ 28035beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2804c003db1fSHoward Hinnant result_type _Sp = 0; 2805f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2806f9d540b0SHoward Hinnant { 2807f9d540b0SHoward Hinnant _Engine_result_type __u; 28083e519524SHoward Hinnant do 2809f9d540b0SHoward Hinnant { 2810f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2811f9d540b0SHoward Hinnant } while (__u >= __y0_); 28125beb2c3aSMarshall Clow if (__w0_ < _WRt) 2813c003db1fSHoward Hinnant _Sp <<= __w0_; 2814f9d540b0SHoward Hinnant else 2815c003db1fSHoward Hinnant _Sp = 0; 2816c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2817f9d540b0SHoward Hinnant } 2818f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2819f9d540b0SHoward Hinnant { 2820f9d540b0SHoward Hinnant _Engine_result_type __u; 2821f9d540b0SHoward Hinnant do 2822f9d540b0SHoward Hinnant { 2823f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2824f9d540b0SHoward Hinnant } while (__u >= __y1_); 28255beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2826c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2827f9d540b0SHoward Hinnant else 2828c003db1fSHoward Hinnant _Sp = 0; 2829c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2830f9d540b0SHoward Hinnant } 2831c003db1fSHoward Hinnant return _Sp; 28323e519524SHoward Hinnant} 28333e519524SHoward Hinnant 2834f9d540b0SHoward Hinnant// uniform_int_distribution 28353e519524SHoward Hinnant 2836f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2837f9d540b0SHoward Hinnantclass uniform_int_distribution 28383e519524SHoward Hinnant{ 2839f9d540b0SHoward Hinnantpublic: 2840f9d540b0SHoward Hinnant // types 2841f9d540b0SHoward Hinnant typedef _IntType result_type; 2842f9d540b0SHoward Hinnant 2843f9d540b0SHoward Hinnant class param_type 2844f9d540b0SHoward Hinnant { 2845f9d540b0SHoward Hinnant result_type __a_; 2846f9d540b0SHoward Hinnant result_type __b_; 2847f9d540b0SHoward Hinnant public: 2848f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2849f9d540b0SHoward Hinnant 2850f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2851f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2852f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2853f9d540b0SHoward Hinnant 2854f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2855f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2856f9d540b0SHoward Hinnant 2857f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2858f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2859f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2860f9d540b0SHoward Hinnant {return !(__x == __y);} 28613e519524SHoward Hinnant }; 28623e519524SHoward Hinnant 2863f9d540b0SHoward Hinnantprivate: 2864f9d540b0SHoward Hinnant param_type __p_; 28653e519524SHoward Hinnant 2866f9d540b0SHoward Hinnantpublic: 2867f9d540b0SHoward Hinnant // constructors and reset functions 2868f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2869f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2870f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2871f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2872f9d540b0SHoward Hinnant void reset() {} 2873f9d540b0SHoward Hinnant 2874f9d540b0SHoward Hinnant // generating functions 2875f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2876f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2877f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2878f9d540b0SHoward Hinnant 2879f9d540b0SHoward Hinnant // property functions 2880f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2881f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2882f9d540b0SHoward Hinnant 2883f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2884f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2885f9d540b0SHoward Hinnant 2886f9d540b0SHoward Hinnant result_type min() const {return a();} 2887f9d540b0SHoward Hinnant result_type max() const {return b();} 2888f9d540b0SHoward Hinnant 2889f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2890f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2891f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2892f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2893f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2894f9d540b0SHoward Hinnant {return !(__x == __y);} 28953e519524SHoward Hinnant}; 28963e519524SHoward Hinnant 2897f9d540b0SHoward Hinnanttemplate<class _IntType> 2898f9d540b0SHoward Hinnanttemplate<class _URNG> 2899f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2900f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29013e519524SHoward Hinnant{ 2902f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2903f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2904c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2905c003db1fSHoward Hinnant if (_Rp == 1) 2906f9d540b0SHoward Hinnant return __p.a(); 2907f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2908f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2909c003db1fSHoward Hinnant if (_Rp == 0) 2910f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2911c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2912a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 2913f9d540b0SHoward Hinnant ++__w; 2914f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2915f9d540b0SHoward Hinnant _UIntType __u; 2916f9d540b0SHoward Hinnant do 29173e519524SHoward Hinnant { 2918f9d540b0SHoward Hinnant __u = __e(); 2919c003db1fSHoward Hinnant } while (__u >= _Rp); 2920f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29213e519524SHoward Hinnant} 2922f9d540b0SHoward Hinnant 292366f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 292466f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 2925f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2926f9d540b0SHoward Hinnant 2927f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2928f9d540b0SHoward Hinnant 2929f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29303e519524SHoward Hinnant{ 2931f9d540b0SHoward Hinnant static unsigned __c_; 2932f9d540b0SHoward Hinnant 2933f9d540b0SHoward Hinnant __rs_default(); 2934f9d540b0SHoward Hinnantpublic: 2935b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2936f9d540b0SHoward Hinnant 2937f9d540b0SHoward Hinnant static const result_type _Min = 0; 2938f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2939f9d540b0SHoward Hinnant 2940f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2941f9d540b0SHoward Hinnant ~__rs_default(); 2942f9d540b0SHoward Hinnant 2943f9d540b0SHoward Hinnant result_type operator()(); 2944f9d540b0SHoward Hinnant 2945788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2946788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2947f9d540b0SHoward Hinnant 2948f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 2949f9d540b0SHoward Hinnant}; 2950f9d540b0SHoward Hinnant 2951f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 29523e519524SHoward Hinnant 29533e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 29543e519524SHoward Hinnantvoid 29553e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29563e519524SHoward Hinnant{ 29573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2958c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2959c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 29603e519524SHoward Hinnant difference_type __d = __last - __first; 29613e519524SHoward Hinnant if (__d > 1) 29623e519524SHoward Hinnant { 2963c003db1fSHoward Hinnant _Dp __uid; 2964f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2965f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2966007b26beSHoward Hinnant { 2967c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2968007b26beSHoward Hinnant if (__i != difference_type(0)) 2969007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2970007b26beSHoward Hinnant } 29713e519524SHoward Hinnant } 29723e519524SHoward Hinnant} 29733e519524SHoward Hinnant 29743e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 29753e519524SHoward Hinnantvoid 29763e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 2977ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 29783e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 29793e519524SHoward Hinnant#else 29803e519524SHoward Hinnant _RandomNumberGenerator& __rand) 29813e519524SHoward Hinnant#endif 29823e519524SHoward Hinnant{ 29833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 29843e519524SHoward Hinnant difference_type __d = __last - __first; 29853e519524SHoward Hinnant if (__d > 1) 29863e519524SHoward Hinnant { 29873e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 2988007b26beSHoward Hinnant { 2989007b26beSHoward Hinnant difference_type __i = __rand(__d); 2990007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2991007b26beSHoward Hinnant } 29923e519524SHoward Hinnant } 29933e519524SHoward Hinnant} 29940f37a410SMarshall Clow#endif 29953e519524SHoward Hinnant 2996e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 2997e7154709SEric Fiselier class _UniformRandomNumberGenerator> 2998e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 2999e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 300042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3001e7154709SEric Fiselier _Distance __n, 3002e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3003e7154709SEric Fiselier input_iterator_tag) { 3004e7154709SEric Fiselier 3005e7154709SEric Fiselier _Distance __k = 0; 3006e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 300742bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3008e7154709SEric Fiselier _Distance __sz = __k; 3009e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3010e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3011e7154709SEric Fiselier if (__r < __sz) 301242bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3013e7154709SEric Fiselier } 301442bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3015e7154709SEric Fiselier} 3016e7154709SEric Fiselier 3017e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3018e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3019e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3020e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 302142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3022e7154709SEric Fiselier _Distance __n, 3023e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3024e7154709SEric Fiselier forward_iterator_tag) { 3025e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3026e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3027e7154709SEric Fiselier _Distance __r = 3028e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3029e7154709SEric Fiselier if (__r < __n) { 303042bfedd9SAlexander Richardson *__output_iter++ = *__first; 3031e7154709SEric Fiselier --__n; 3032e7154709SEric Fiselier } 3033e7154709SEric Fiselier } 303442bfedd9SAlexander Richardson return __output_iter; 3035e7154709SEric Fiselier} 3036e7154709SEric Fiselier 3037e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3038e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3039e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3040e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 304142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3042e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3043e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3044e7154709SEric Fiselier _PopCategory; 3045e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3046e7154709SEric Fiselier _Difference; 3047e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3048e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3049e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3050e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3051e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3052e7154709SEric Fiselier return _VSTD::__sample( 305342bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3054e7154709SEric Fiselier __g, _PopCategory()); 3055e7154709SEric Fiselier} 3056e7154709SEric Fiselier 3057e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3058e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3059e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3060e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3061e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 306242bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3063e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 306442bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3065e7154709SEric Fiselier} 3066e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3067e7154709SEric Fiselier 3068f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3069f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3070ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3071fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3072fb340102SHoward Hinnant#else 3073f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3074fb340102SHoward Hinnant#endif 3075f9d540b0SHoward Hinnant{ 3076f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3077c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3078c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3079f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3080f9d540b0SHoward Hinnant if (__d > 1) 3081f9d540b0SHoward Hinnant { 3082c003db1fSHoward Hinnant _Dp __uid; 3083f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3084007b26beSHoward Hinnant { 3085c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3086007b26beSHoward Hinnant if (__i != difference_type(0)) 3087007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3088007b26beSHoward Hinnant } 3089f9d540b0SHoward Hinnant } 3090f9d540b0SHoward Hinnant} 3091f9d540b0SHoward Hinnant 30923e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 309349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 30943e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 30953e519524SHoward Hinnant{ 30963e519524SHoward Hinnant for (; __first != __last; ++__first) 30973e519524SHoward Hinnant if (!__pred(*__first)) 30983e519524SHoward Hinnant break; 3099b9595b79SMarshall Clow if ( __first == __last ) 3100b9595b79SMarshall Clow return true; 3101b9595b79SMarshall Clow ++__first; 31023e519524SHoward Hinnant for (; __first != __last; ++__first) 31033e519524SHoward Hinnant if (__pred(*__first)) 31043e519524SHoward Hinnant return false; 31053e519524SHoward Hinnant return true; 31063e519524SHoward Hinnant} 31073e519524SHoward Hinnant 31083e519524SHoward Hinnant// partition 31093e519524SHoward Hinnant 31103e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31113e519524SHoward Hinnant_ForwardIterator 31123e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31133e519524SHoward Hinnant{ 31143e519524SHoward Hinnant while (true) 31153e519524SHoward Hinnant { 31163e519524SHoward Hinnant if (__first == __last) 31173e519524SHoward Hinnant return __first; 31183e519524SHoward Hinnant if (!__pred(*__first)) 31193e519524SHoward Hinnant break; 31203e519524SHoward Hinnant ++__first; 31213e519524SHoward Hinnant } 31223e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31233e519524SHoward Hinnant { 31243e519524SHoward Hinnant if (__pred(*__p)) 31253e519524SHoward Hinnant { 31263e519524SHoward Hinnant swap(*__first, *__p); 31273e519524SHoward Hinnant ++__first; 31283e519524SHoward Hinnant } 31293e519524SHoward Hinnant } 31303e519524SHoward Hinnant return __first; 31313e519524SHoward Hinnant} 31323e519524SHoward Hinnant 31333e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31343e519524SHoward Hinnant_BidirectionalIterator 31353e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31363e519524SHoward Hinnant bidirectional_iterator_tag) 31373e519524SHoward Hinnant{ 31383e519524SHoward Hinnant while (true) 31393e519524SHoward Hinnant { 31403e519524SHoward Hinnant while (true) 31413e519524SHoward Hinnant { 31423e519524SHoward Hinnant if (__first == __last) 31433e519524SHoward Hinnant return __first; 31443e519524SHoward Hinnant if (!__pred(*__first)) 31453e519524SHoward Hinnant break; 31463e519524SHoward Hinnant ++__first; 31473e519524SHoward Hinnant } 31483e519524SHoward Hinnant do 31493e519524SHoward Hinnant { 31503e519524SHoward Hinnant if (__first == --__last) 31513e519524SHoward Hinnant return __first; 31523e519524SHoward Hinnant } while (!__pred(*__last)); 31533e519524SHoward Hinnant swap(*__first, *__last); 31543e519524SHoward Hinnant ++__first; 31553e519524SHoward Hinnant } 31563e519524SHoward Hinnant} 31573e519524SHoward Hinnant 31583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31603e519524SHoward Hinnant_ForwardIterator 31613e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31623e519524SHoward Hinnant{ 3163ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31643e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31653e519524SHoward Hinnant} 31663e519524SHoward Hinnant 31673e519524SHoward Hinnant// partition_copy 31683e519524SHoward Hinnant 31693e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31703e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 31711b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 31723e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 31733e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 31743e519524SHoward Hinnant _Predicate __pred) 31753e519524SHoward Hinnant{ 31763e519524SHoward Hinnant for (; __first != __last; ++__first) 31773e519524SHoward Hinnant { 31783e519524SHoward Hinnant if (__pred(*__first)) 31793e519524SHoward Hinnant { 31803e519524SHoward Hinnant *__out_true = *__first; 31813e519524SHoward Hinnant ++__out_true; 31823e519524SHoward Hinnant } 31833e519524SHoward Hinnant else 31843e519524SHoward Hinnant { 31853e519524SHoward Hinnant *__out_false = *__first; 31863e519524SHoward Hinnant ++__out_false; 31873e519524SHoward Hinnant } 31883e519524SHoward Hinnant } 31893e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 31903e519524SHoward Hinnant} 31913e519524SHoward Hinnant 31923e519524SHoward Hinnant// partition_point 31933e519524SHoward Hinnant 31943e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3195674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 31963e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31973e519524SHoward Hinnant{ 31983e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3199ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32003e519524SHoward Hinnant while (__len != 0) 32013e519524SHoward Hinnant { 32023e519524SHoward Hinnant difference_type __l2 = __len / 2; 32033e519524SHoward Hinnant _ForwardIterator __m = __first; 3204ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32053e519524SHoward Hinnant if (__pred(*__m)) 32063e519524SHoward Hinnant { 32073e519524SHoward Hinnant __first = ++__m; 32083e519524SHoward Hinnant __len -= __l2 + 1; 32093e519524SHoward Hinnant } 32103e519524SHoward Hinnant else 32113e519524SHoward Hinnant __len = __l2; 32123e519524SHoward Hinnant } 32133e519524SHoward Hinnant return __first; 32143e519524SHoward Hinnant} 32153e519524SHoward Hinnant 32163e519524SHoward Hinnant// stable_partition 32173e519524SHoward Hinnant 32183e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32193e519524SHoward Hinnant_ForwardIterator 32203e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32213e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32223e519524SHoward Hinnant{ 32233e519524SHoward Hinnant // *__first is known to be false 32243e519524SHoward Hinnant // __len >= 1 32253e519524SHoward Hinnant if (__len == 1) 32263e519524SHoward Hinnant return __first; 32273e519524SHoward Hinnant if (__len == 2) 32283e519524SHoward Hinnant { 32293e519524SHoward Hinnant _ForwardIterator __m = __first; 32303e519524SHoward Hinnant if (__pred(*++__m)) 32313e519524SHoward Hinnant { 32323e519524SHoward Hinnant swap(*__first, *__m); 32333e519524SHoward Hinnant return __m; 32343e519524SHoward Hinnant } 32353e519524SHoward Hinnant return __first; 32363e519524SHoward Hinnant } 32373e519524SHoward Hinnant if (__len <= __p.second) 32383e519524SHoward Hinnant { // The buffer is big enough to use 32393e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32403e519524SHoward Hinnant __destruct_n __d(0); 32413e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32423e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32433e519524SHoward Hinnant // Update __first to always point to the end of the trues 32443e519524SHoward Hinnant value_type* __t = __p.first; 3245ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32463e519524SHoward Hinnant __d.__incr((value_type*)0); 32473e519524SHoward Hinnant ++__t; 32483e519524SHoward Hinnant _ForwardIterator __i = __first; 32493e519524SHoward Hinnant while (++__i != __last) 32503e519524SHoward Hinnant { 32513e519524SHoward Hinnant if (__pred(*__i)) 32523e519524SHoward Hinnant { 3253ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32543e519524SHoward Hinnant ++__first; 32553e519524SHoward Hinnant } 32563e519524SHoward Hinnant else 32573e519524SHoward Hinnant { 3258ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32593e519524SHoward Hinnant __d.__incr((value_type*)0); 32603e519524SHoward Hinnant ++__t; 32613e519524SHoward Hinnant } 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32643e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32653e519524SHoward Hinnant __i = __first; 32663e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3267ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32683e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32693e519524SHoward Hinnant return __first; 32703e519524SHoward Hinnant } 32713e519524SHoward Hinnant // Else not enough buffer, do in place 32723e519524SHoward Hinnant // __len >= 3 32733e519524SHoward Hinnant _ForwardIterator __m = __first; 32743e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3275ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 32763e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 32773e519524SHoward Hinnant // F????????????????? 32783e519524SHoward Hinnant // f m l 32793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 32803e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 32813e519524SHoward Hinnant // TTTFFFFF?????????? 32823e519524SHoward Hinnant // f ff m l 32833e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 32843e519524SHoward Hinnant _ForwardIterator __m1 = __m; 32853e519524SHoward Hinnant _ForwardIterator __second_false = __last; 32863e519524SHoward Hinnant _Distance __len_half = __len - __len2; 32873e519524SHoward Hinnant while (__pred(*__m1)) 32883e519524SHoward Hinnant { 32893e519524SHoward Hinnant if (++__m1 == __last) 32903e519524SHoward Hinnant goto __second_half_done; 32913e519524SHoward Hinnant --__len_half; 32923e519524SHoward Hinnant } 32933e519524SHoward Hinnant // TTTFFFFFTTTF?????? 32943e519524SHoward Hinnant // f ff m m1 l 32953e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 32963e519524SHoward Hinnant__second_half_done: 32973e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 32983e519524SHoward Hinnant // f ff m sf l 3299ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33003e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33013e519524SHoward Hinnant // | 33023e519524SHoward Hinnant} 33033e519524SHoward Hinnant 33043e519524SHoward Hinnantstruct __return_temporary_buffer 33053e519524SHoward Hinnant{ 33063e519524SHoward Hinnant template <class _Tp> 3307ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33083e519524SHoward Hinnant}; 33093e519524SHoward Hinnant 33103e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33113e519524SHoward Hinnant_ForwardIterator 33123e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33133e519524SHoward Hinnant forward_iterator_tag) 33143e519524SHoward Hinnant{ 33153e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33163e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33173e519524SHoward Hinnant while (true) 33183e519524SHoward Hinnant { 33193e519524SHoward Hinnant if (__first == __last) 33203e519524SHoward Hinnant return __first; 33213e519524SHoward Hinnant if (!__pred(*__first)) 33223e519524SHoward Hinnant break; 33233e519524SHoward Hinnant ++__first; 33243e519524SHoward Hinnant } 33253e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33263e519524SHoward Hinnant // *__first is known to be false 33273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3329ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33303e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33313e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33323e519524SHoward Hinnant if (__len >= __alloc_limit) 33333e519524SHoward Hinnant { 3334ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33353e519524SHoward Hinnant __h.reset(__p.first); 33363e519524SHoward Hinnant } 33373e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33383e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33393e519524SHoward Hinnant} 33403e519524SHoward Hinnant 33413e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33423e519524SHoward Hinnant_BidirectionalIterator 33433e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33443e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33453e519524SHoward Hinnant{ 33463e519524SHoward Hinnant // *__first is known to be false 33473e519524SHoward Hinnant // *__last is known to be true 33483e519524SHoward Hinnant // __len >= 2 33493e519524SHoward Hinnant if (__len == 2) 33503e519524SHoward Hinnant { 33513e519524SHoward Hinnant swap(*__first, *__last); 33523e519524SHoward Hinnant return __last; 33533e519524SHoward Hinnant } 33543e519524SHoward Hinnant if (__len == 3) 33553e519524SHoward Hinnant { 33563e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33573e519524SHoward Hinnant if (__pred(*++__m)) 33583e519524SHoward Hinnant { 33593e519524SHoward Hinnant swap(*__first, *__m); 33603e519524SHoward Hinnant swap(*__m, *__last); 33613e519524SHoward Hinnant return __last; 33623e519524SHoward Hinnant } 33633e519524SHoward Hinnant swap(*__m, *__last); 33643e519524SHoward Hinnant swap(*__first, *__m); 33653e519524SHoward Hinnant return __m; 33663e519524SHoward Hinnant } 33673e519524SHoward Hinnant if (__len <= __p.second) 33683e519524SHoward Hinnant { // The buffer is big enough to use 33693e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33703e519524SHoward Hinnant __destruct_n __d(0); 33713e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33723e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33733e519524SHoward Hinnant // Update __first to always point to the end of the trues 33743e519524SHoward Hinnant value_type* __t = __p.first; 3375ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33763e519524SHoward Hinnant __d.__incr((value_type*)0); 33773e519524SHoward Hinnant ++__t; 33783e519524SHoward Hinnant _BidirectionalIterator __i = __first; 33793e519524SHoward Hinnant while (++__i != __last) 33803e519524SHoward Hinnant { 33813e519524SHoward Hinnant if (__pred(*__i)) 33823e519524SHoward Hinnant { 3383ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33843e519524SHoward Hinnant ++__first; 33853e519524SHoward Hinnant } 33863e519524SHoward Hinnant else 33873e519524SHoward Hinnant { 3388ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33893e519524SHoward Hinnant __d.__incr((value_type*)0); 33903e519524SHoward Hinnant ++__t; 33913e519524SHoward Hinnant } 33923e519524SHoward Hinnant } 33933e519524SHoward Hinnant // move *__last, known to be true 3394ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33953e519524SHoward Hinnant __i = ++__first; 33963e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33973e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33983e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3399ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34003e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34013e519524SHoward Hinnant return __first; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant // Else not enough buffer, do in place 34043e519524SHoward Hinnant // __len >= 4 34053e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34063e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3407ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34083e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34093e519524SHoward Hinnant // F????????????????T 34103e519524SHoward Hinnant // f m l 34113e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34123e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34133e519524SHoward Hinnant _Distance __len_half = __len2; 34143e519524SHoward Hinnant while (!__pred(*--__m1)) 34153e519524SHoward Hinnant { 34163e519524SHoward Hinnant if (__m1 == __first) 34173e519524SHoward Hinnant goto __first_half_done; 34183e519524SHoward Hinnant --__len_half; 34193e519524SHoward Hinnant } 34203e519524SHoward Hinnant // F???TFFF?????????T 34213e519524SHoward Hinnant // f m1 m l 34223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34233e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34243e519524SHoward Hinnant__first_half_done: 34253e519524SHoward Hinnant // TTTFFFFF?????????T 34263e519524SHoward Hinnant // f ff m l 34273e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34283e519524SHoward Hinnant __m1 = __m; 34293e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34303e519524SHoward Hinnant ++__second_false; 34313e519524SHoward Hinnant __len_half = __len - __len2; 34323e519524SHoward Hinnant while (__pred(*__m1)) 34333e519524SHoward Hinnant { 34343e519524SHoward Hinnant if (++__m1 == __last) 34353e519524SHoward Hinnant goto __second_half_done; 34363e519524SHoward Hinnant --__len_half; 34373e519524SHoward Hinnant } 34383e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34393e519524SHoward Hinnant // f ff m m1 l 34403e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34413e519524SHoward Hinnant__second_half_done: 34423e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34433e519524SHoward Hinnant // f ff m sf l 3444ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34453e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34463e519524SHoward Hinnant // | 34473e519524SHoward Hinnant} 34483e519524SHoward Hinnant 34493e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34503e519524SHoward Hinnant_BidirectionalIterator 34513e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34523e519524SHoward Hinnant bidirectional_iterator_tag) 34533e519524SHoward Hinnant{ 34543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34553e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34563e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34573e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34583e519524SHoward Hinnant while (true) 34593e519524SHoward Hinnant { 34603e519524SHoward Hinnant if (__first == __last) 34613e519524SHoward Hinnant return __first; 34623e519524SHoward Hinnant if (!__pred(*__first)) 34633e519524SHoward Hinnant break; 34643e519524SHoward Hinnant ++__first; 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34673e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34683e519524SHoward Hinnant do 34693e519524SHoward Hinnant { 34703e519524SHoward Hinnant if (__first == --__last) 34713e519524SHoward Hinnant return __first; 34723e519524SHoward Hinnant } while (!__pred(*__last)); 34733e519524SHoward Hinnant // We now have a reduced range [__first, __last] 34743e519524SHoward Hinnant // *__first is known to be false 34753e519524SHoward Hinnant // *__last is known to be true 34763e519524SHoward Hinnant // __len >= 2 3477ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 34783e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34793e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34803e519524SHoward Hinnant if (__len >= __alloc_limit) 34813e519524SHoward Hinnant { 3482ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34833e519524SHoward Hinnant __h.reset(__p.first); 34843e519524SHoward Hinnant } 34853e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34863e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 34873e519524SHoward Hinnant} 34883e519524SHoward Hinnant 34893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 34903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 34913e519524SHoward Hinnant_ForwardIterator 34923e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34933e519524SHoward Hinnant{ 34943e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34953e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 34963e519524SHoward Hinnant} 34973e519524SHoward Hinnant 34983e519524SHoward Hinnant// is_sorted_until 34993e519524SHoward Hinnant 35003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 350149c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 35023e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35033e519524SHoward Hinnant{ 35043e519524SHoward Hinnant if (__first != __last) 35053e519524SHoward Hinnant { 35063e519524SHoward Hinnant _ForwardIterator __i = __first; 35073e519524SHoward Hinnant while (++__i != __last) 35083e519524SHoward Hinnant { 35093e519524SHoward Hinnant if (__comp(*__i, *__first)) 35103e519524SHoward Hinnant return __i; 35113e519524SHoward Hinnant __first = __i; 35123e519524SHoward Hinnant } 35133e519524SHoward Hinnant } 35143e519524SHoward Hinnant return __last; 35153e519524SHoward Hinnant} 35163e519524SHoward Hinnant 35173e519524SHoward Hinnanttemplate<class _ForwardIterator> 351849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35193e519524SHoward Hinnant_ForwardIterator 35203e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35213e519524SHoward Hinnant{ 3522ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35233e519524SHoward Hinnant} 35243e519524SHoward Hinnant 35253e519524SHoward Hinnant// is_sorted 35263e519524SHoward Hinnant 35273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 352849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35293e519524SHoward Hinnantbool 35303e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35313e519524SHoward Hinnant{ 3532ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35333e519524SHoward Hinnant} 35343e519524SHoward Hinnant 35353e519524SHoward Hinnanttemplate<class _ForwardIterator> 353649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35373e519524SHoward Hinnantbool 35383e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35393e519524SHoward Hinnant{ 3540ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35413e519524SHoward Hinnant} 35423e519524SHoward Hinnant 35433e519524SHoward Hinnant// sort 35443e519524SHoward Hinnant 35453e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35463e519524SHoward Hinnant 35473e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35483e519524SHoward Hinnantunsigned 35493e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35503e519524SHoward Hinnant{ 35513e519524SHoward Hinnant unsigned __r = 0; 35523e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35533e519524SHoward Hinnant { 35543e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35553e519524SHoward Hinnant return __r; // x <= y && y <= z 35563e519524SHoward Hinnant // x <= y && y > z 35573e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35583e519524SHoward Hinnant __r = 1; 35593e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35603e519524SHoward Hinnant { 35613e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35623e519524SHoward Hinnant __r = 2; 35633e519524SHoward Hinnant } 35643e519524SHoward Hinnant return __r; // x <= y && y < z 35653e519524SHoward Hinnant } 35663e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35673e519524SHoward Hinnant { 35683e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35693e519524SHoward Hinnant __r = 1; 35703e519524SHoward Hinnant return __r; 35713e519524SHoward Hinnant } 35723e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 35733e519524SHoward Hinnant __r = 1; // x < y && x <= z 35743e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 35753e519524SHoward Hinnant { 35763e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 35773e519524SHoward Hinnant __r = 2; 35783e519524SHoward Hinnant } 35793e519524SHoward Hinnant return __r; 35803e519524SHoward Hinnant} // x <= y && y <= z 35813e519524SHoward Hinnant 35823e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 35833e519524SHoward Hinnant 35843e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35853e519524SHoward Hinnantunsigned 35863e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 35873e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 35883e519524SHoward Hinnant{ 35893e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 35903e519524SHoward Hinnant if (__c(*__x4, *__x3)) 35913e519524SHoward Hinnant { 35923e519524SHoward Hinnant swap(*__x3, *__x4); 35933e519524SHoward Hinnant ++__r; 35943e519524SHoward Hinnant if (__c(*__x3, *__x2)) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant swap(*__x2, *__x3); 35973e519524SHoward Hinnant ++__r; 35983e519524SHoward Hinnant if (__c(*__x2, *__x1)) 35993e519524SHoward Hinnant { 36003e519524SHoward Hinnant swap(*__x1, *__x2); 36013e519524SHoward Hinnant ++__r; 36023e519524SHoward Hinnant } 36033e519524SHoward Hinnant } 36043e519524SHoward Hinnant } 36053e519524SHoward Hinnant return __r; 36063e519524SHoward Hinnant} 36073e519524SHoward Hinnant 36083e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36093e519524SHoward Hinnant 36103e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36113e519524SHoward Hinnantunsigned 36123e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36133e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36143e519524SHoward Hinnant{ 36153e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36163e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36173e519524SHoward Hinnant { 36183e519524SHoward Hinnant swap(*__x4, *__x5); 36193e519524SHoward Hinnant ++__r; 36203e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36213e519524SHoward Hinnant { 36223e519524SHoward Hinnant swap(*__x3, *__x4); 36233e519524SHoward Hinnant ++__r; 36243e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36253e519524SHoward Hinnant { 36263e519524SHoward Hinnant swap(*__x2, *__x3); 36273e519524SHoward Hinnant ++__r; 36283e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36293e519524SHoward Hinnant { 36303e519524SHoward Hinnant swap(*__x1, *__x2); 36313e519524SHoward Hinnant ++__r; 36323e519524SHoward Hinnant } 36333e519524SHoward Hinnant } 36343e519524SHoward Hinnant } 36353e519524SHoward Hinnant } 36363e519524SHoward Hinnant return __r; 36373e519524SHoward Hinnant} 36383e519524SHoward Hinnant 36393e519524SHoward Hinnant// Assumes size > 0 36403e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36413e519524SHoward Hinnantvoid 36423e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36433e519524SHoward Hinnant{ 36443e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36453e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36463e519524SHoward Hinnant { 3647ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36483e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36493e519524SHoward Hinnant (__first, __last, __comp); 36503e519524SHoward Hinnant if (__i != __first) 36513e519524SHoward Hinnant swap(*__first, *__i); 36523e519524SHoward Hinnant } 36533e519524SHoward Hinnant} 36543e519524SHoward Hinnant 36553e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36563e519524SHoward Hinnantvoid 36573e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36583e519524SHoward Hinnant{ 36593e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36603e519524SHoward Hinnant if (__first != __last) 36613e519524SHoward Hinnant { 36623e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36633e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36643e519524SHoward Hinnant { 36653e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3666ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36673e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3668ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3669ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36703e519524SHoward Hinnant } 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant} 36733e519524SHoward Hinnant 36743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 36753e519524SHoward Hinnantvoid 36763e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 36773e519524SHoward Hinnant{ 36783e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 36793e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 36803e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 36813e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 36823e519524SHoward Hinnant { 36833e519524SHoward Hinnant if (__comp(*__i, *__j)) 36843e519524SHoward Hinnant { 3685ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 36863e519524SHoward Hinnant _RandomAccessIterator __k = __j; 36873e519524SHoward Hinnant __j = __i; 36883e519524SHoward Hinnant do 36893e519524SHoward Hinnant { 3690ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 36913e519524SHoward Hinnant __j = __k; 36923e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3693ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 36943e519524SHoward Hinnant } 36953e519524SHoward Hinnant __j = __i; 36963e519524SHoward Hinnant } 36973e519524SHoward Hinnant} 36983e519524SHoward Hinnant 36993e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37003e519524SHoward Hinnantbool 37013e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37023e519524SHoward Hinnant{ 37033e519524SHoward Hinnant switch (__last - __first) 37043e519524SHoward Hinnant { 37053e519524SHoward Hinnant case 0: 37063e519524SHoward Hinnant case 1: 37073e519524SHoward Hinnant return true; 37083e519524SHoward Hinnant case 2: 37093e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37103e519524SHoward Hinnant swap(*__first, *__last); 37113e519524SHoward Hinnant return true; 37123e519524SHoward Hinnant case 3: 3713ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37143e519524SHoward Hinnant return true; 37153e519524SHoward Hinnant case 4: 3716ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37173e519524SHoward Hinnant return true; 37183e519524SHoward Hinnant case 5: 3719ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37203e519524SHoward Hinnant return true; 37213e519524SHoward Hinnant } 37223e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37233e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37243e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37253e519524SHoward Hinnant const unsigned __limit = 8; 37263e519524SHoward Hinnant unsigned __count = 0; 37273e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37283e519524SHoward Hinnant { 37293e519524SHoward Hinnant if (__comp(*__i, *__j)) 37303e519524SHoward Hinnant { 3731ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37323e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37333e519524SHoward Hinnant __j = __i; 37343e519524SHoward Hinnant do 37353e519524SHoward Hinnant { 3736ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37373e519524SHoward Hinnant __j = __k; 37383e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3739ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37403e519524SHoward Hinnant if (++__count == __limit) 37413e519524SHoward Hinnant return ++__i == __last; 37423e519524SHoward Hinnant } 37433e519524SHoward Hinnant __j = __i; 37443e519524SHoward Hinnant } 37453e519524SHoward Hinnant return true; 37463e519524SHoward Hinnant} 37473e519524SHoward Hinnant 37483e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37493e519524SHoward Hinnantvoid 37503e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37513e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37523e519524SHoward Hinnant{ 37533e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37543e519524SHoward Hinnant if (__first1 != __last1) 37553e519524SHoward Hinnant { 37563e519524SHoward Hinnant __destruct_n __d(0); 37573e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37583e519524SHoward Hinnant value_type* __last2 = __first2; 3759ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37603e519524SHoward Hinnant __d.__incr((value_type*)0); 37613e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37623e519524SHoward Hinnant { 37633e519524SHoward Hinnant value_type* __j2 = __last2; 37643e519524SHoward Hinnant value_type* __i2 = __j2; 37653e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37663e519524SHoward Hinnant { 3767ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37683e519524SHoward Hinnant __d.__incr((value_type*)0); 37693e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3770ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3771ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 37723e519524SHoward Hinnant } 37733e519524SHoward Hinnant else 37743e519524SHoward Hinnant { 3775ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 37763e519524SHoward Hinnant __d.__incr((value_type*)0); 37773e519524SHoward Hinnant } 37783e519524SHoward Hinnant } 37793e519524SHoward Hinnant __h.release(); 37803e519524SHoward Hinnant } 37813e519524SHoward Hinnant} 37823e519524SHoward Hinnant 37833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37843e519524SHoward Hinnantvoid 37853e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37863e519524SHoward Hinnant{ 37873e519524SHoward Hinnant // _Compare is known to be a reference type 37883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 37893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3790ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3791ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 37923e519524SHoward Hinnant while (true) 37933e519524SHoward Hinnant { 37943e519524SHoward Hinnant __restart: 37953e519524SHoward Hinnant difference_type __len = __last - __first; 37963e519524SHoward Hinnant switch (__len) 37973e519524SHoward Hinnant { 37983e519524SHoward Hinnant case 0: 37993e519524SHoward Hinnant case 1: 38003e519524SHoward Hinnant return; 38013e519524SHoward Hinnant case 2: 38023e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38033e519524SHoward Hinnant swap(*__first, *__last); 38043e519524SHoward Hinnant return; 38053e519524SHoward Hinnant case 3: 3806ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38073e519524SHoward Hinnant return; 38083e519524SHoward Hinnant case 4: 3809ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38103e519524SHoward Hinnant return; 38113e519524SHoward Hinnant case 5: 3812ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38133e519524SHoward Hinnant return; 38143e519524SHoward Hinnant } 38153e519524SHoward Hinnant if (__len <= __limit) 38163e519524SHoward Hinnant { 3817ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38183e519524SHoward Hinnant return; 38193e519524SHoward Hinnant } 38203e519524SHoward Hinnant // __len > 5 38213e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38223e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38233e519524SHoward Hinnant --__lm1; 38243e519524SHoward Hinnant unsigned __n_swaps; 38253e519524SHoward Hinnant { 38263e519524SHoward Hinnant difference_type __delta; 38273e519524SHoward Hinnant if (__len >= 1000) 38283e519524SHoward Hinnant { 38293e519524SHoward Hinnant __delta = __len/2; 38303e519524SHoward Hinnant __m += __delta; 38313e519524SHoward Hinnant __delta /= 2; 3832ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38333e519524SHoward Hinnant } 38343e519524SHoward Hinnant else 38353e519524SHoward Hinnant { 38363e519524SHoward Hinnant __delta = __len/2; 38373e519524SHoward Hinnant __m += __delta; 3838ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38393e519524SHoward Hinnant } 38403e519524SHoward Hinnant } 38413e519524SHoward Hinnant // *__m is median 38423e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38433e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38443e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38453e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38463e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38473e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38483e519524SHoward Hinnant // Prime the downward search with a guard. 38493e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38503e519524SHoward Hinnant { 38513e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38523e519524SHoward Hinnant // manually guard downward moving __j against __i 38533e519524SHoward Hinnant while (true) 38543e519524SHoward Hinnant { 38553e519524SHoward Hinnant if (__i == --__j) 38563e519524SHoward Hinnant { 38573e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38583e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38593e519524SHoward Hinnant ++__i; // __first + 1 38603e519524SHoward Hinnant __j = __last; 38613e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38623e519524SHoward Hinnant { 38633e519524SHoward Hinnant while (true) 38643e519524SHoward Hinnant { 38653e519524SHoward Hinnant if (__i == __j) 38663e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38673e519524SHoward Hinnant if (__comp(*__first, *__i)) 38683e519524SHoward Hinnant { 38693e519524SHoward Hinnant swap(*__i, *__j); 38703e519524SHoward Hinnant ++__n_swaps; 38713e519524SHoward Hinnant ++__i; 38723e519524SHoward Hinnant break; 38733e519524SHoward Hinnant } 38743e519524SHoward Hinnant ++__i; 38753e519524SHoward Hinnant } 38763e519524SHoward Hinnant } 38773e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 38783e519524SHoward Hinnant if (__i == __j) 38793e519524SHoward Hinnant return; 38803e519524SHoward Hinnant while (true) 38813e519524SHoward Hinnant { 38823e519524SHoward Hinnant while (!__comp(*__first, *__i)) 38833e519524SHoward Hinnant ++__i; 38843e519524SHoward Hinnant while (__comp(*__first, *--__j)) 38853e519524SHoward Hinnant ; 38863e519524SHoward Hinnant if (__i >= __j) 38873e519524SHoward Hinnant break; 38883e519524SHoward Hinnant swap(*__i, *__j); 38893e519524SHoward Hinnant ++__n_swaps; 38903e519524SHoward Hinnant ++__i; 38913e519524SHoward Hinnant } 38923e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 38933e519524SHoward Hinnant // The first part is sorted, sort the secod part 3894ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 38953e519524SHoward Hinnant __first = __i; 38963e519524SHoward Hinnant goto __restart; 38973e519524SHoward Hinnant } 38983e519524SHoward Hinnant if (__comp(*__j, *__m)) 38993e519524SHoward Hinnant { 39003e519524SHoward Hinnant swap(*__i, *__j); 39013e519524SHoward Hinnant ++__n_swaps; 39023e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39033e519524SHoward Hinnant } 39043e519524SHoward Hinnant } 39053e519524SHoward Hinnant } 39063e519524SHoward Hinnant // It is known that *__i < *__m 39073e519524SHoward Hinnant ++__i; 39083e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39093e519524SHoward Hinnant // if not yet partitioned... 39103e519524SHoward Hinnant if (__i < __j) 39113e519524SHoward Hinnant { 39123e519524SHoward Hinnant // known that *(__i - 1) < *__m 39133e519524SHoward Hinnant // known that __i <= __m 39143e519524SHoward Hinnant while (true) 39153e519524SHoward Hinnant { 39163e519524SHoward Hinnant // __m still guards upward moving __i 39173e519524SHoward Hinnant while (__comp(*__i, *__m)) 39183e519524SHoward Hinnant ++__i; 39193e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39203e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39213e519524SHoward Hinnant ; 39223e519524SHoward Hinnant if (__i > __j) 39233e519524SHoward Hinnant break; 39243e519524SHoward Hinnant swap(*__i, *__j); 39253e519524SHoward Hinnant ++__n_swaps; 39263e519524SHoward Hinnant // It is known that __m != __j 39273e519524SHoward Hinnant // If __m just moved, follow it 39283e519524SHoward Hinnant if (__m == __i) 39293e519524SHoward Hinnant __m = __j; 39303e519524SHoward Hinnant ++__i; 39313e519524SHoward Hinnant } 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39343e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39353e519524SHoward Hinnant { 39363e519524SHoward Hinnant swap(*__i, *__m); 39373e519524SHoward Hinnant ++__n_swaps; 39383e519524SHoward Hinnant } 39393e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39403e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39413e519524SHoward Hinnant if (__n_swaps == 0) 39423e519524SHoward Hinnant { 3943ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3944ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39453e519524SHoward Hinnant { 39463e519524SHoward Hinnant if (__fs) 39473e519524SHoward Hinnant return; 39483e519524SHoward Hinnant __last = __i; 39493e519524SHoward Hinnant continue; 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant else 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant if (__fs) 39543e519524SHoward Hinnant { 39553e519524SHoward Hinnant __first = ++__i; 39563e519524SHoward Hinnant continue; 39573e519524SHoward Hinnant } 39583e519524SHoward Hinnant } 39593e519524SHoward Hinnant } 39603e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39613e519524SHoward Hinnant if (__i - __first < __last - __i) 39623e519524SHoward Hinnant { 3963ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3964ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39653e519524SHoward Hinnant __first = ++__i; 39663e519524SHoward Hinnant } 39673e519524SHoward Hinnant else 39683e519524SHoward Hinnant { 3969ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 3970ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 39713e519524SHoward Hinnant __last = __i; 39723e519524SHoward Hinnant } 39733e519524SHoward Hinnant } 39743e519524SHoward Hinnant} 39753e519524SHoward Hinnant 39763e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 39773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 39783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39793e519524SHoward Hinnantvoid 39803e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39813e519524SHoward Hinnant{ 3982145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 39833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 39843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 39853e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 3986145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 39873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 39883e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 3989145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 39903e519524SHoward Hinnant} 39913e519524SHoward Hinnant 39923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 39933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 39943e519524SHoward Hinnantvoid 39953e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 39963e519524SHoward Hinnant{ 3997ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 39983e519524SHoward Hinnant} 39993e519524SHoward Hinnant 40003e519524SHoward Hinnanttemplate <class _Tp> 40013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40023e519524SHoward Hinnantvoid 40033e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40043e519524SHoward Hinnant{ 4005ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40063e519524SHoward Hinnant} 40073e519524SHoward Hinnant 40083e519524SHoward Hinnanttemplate <class _Tp> 40093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40103e519524SHoward Hinnantvoid 40113e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40123e519524SHoward Hinnant{ 4013ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40143e519524SHoward Hinnant} 40153e519524SHoward Hinnant 4016f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4017f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4018f554add5SHoward Hinnantvoid 4019f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4020f554add5SHoward Hinnant{ 4021f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4022f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4023f554add5SHoward Hinnant} 4024f554add5SHoward Hinnant 4025f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4026f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4027f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4028f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4029f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4030f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4031f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4032f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4033f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4034f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4035f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4036f0544c20SHoward 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>&)) 4037f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4038f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4039f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40403e519524SHoward Hinnant 4041f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4042f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4043f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4044f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4045f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4046f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4047f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4048f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4049f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4050f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4051f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4052f0544c20SHoward 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>&)) 4053f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4054f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4055f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40563e519524SHoward Hinnant 4057f0544c20SHoward 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>&)) 40583e519524SHoward Hinnant 40593e519524SHoward Hinnant// lower_bound 40603e519524SHoward Hinnant 40613e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4062d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4063e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40643e519524SHoward Hinnant{ 40653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4066ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40673e519524SHoward Hinnant while (__len != 0) 40683e519524SHoward Hinnant { 40693e519524SHoward Hinnant difference_type __l2 = __len / 2; 40703e519524SHoward Hinnant _ForwardIterator __m = __first; 4071ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4072e4383379SHoward Hinnant if (__comp(*__m, __value_)) 40733e519524SHoward Hinnant { 40743e519524SHoward Hinnant __first = ++__m; 40753e519524SHoward Hinnant __len -= __l2 + 1; 40763e519524SHoward Hinnant } 40773e519524SHoward Hinnant else 40783e519524SHoward Hinnant __len = __l2; 40793e519524SHoward Hinnant } 40803e519524SHoward Hinnant return __first; 40813e519524SHoward Hinnant} 40823e519524SHoward Hinnant 40833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4084d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 40853e519524SHoward Hinnant_ForwardIterator 4086e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40873e519524SHoward Hinnant{ 4088145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4091e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4092145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4094e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4095145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40963e519524SHoward Hinnant} 40973e519524SHoward Hinnant 40983e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4099d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41003e519524SHoward Hinnant_ForwardIterator 4101e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41023e519524SHoward Hinnant{ 4103e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41043e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41053e519524SHoward Hinnant} 41063e519524SHoward Hinnant 41073e519524SHoward Hinnant// upper_bound 41083e519524SHoward Hinnant 41093e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4110d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4111e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41123e519524SHoward Hinnant{ 41133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4114ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41153e519524SHoward Hinnant while (__len != 0) 41163e519524SHoward Hinnant { 41173e519524SHoward Hinnant difference_type __l2 = __len / 2; 41183e519524SHoward Hinnant _ForwardIterator __m = __first; 4119ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4120e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41213e519524SHoward Hinnant __len = __l2; 41223e519524SHoward Hinnant else 41233e519524SHoward Hinnant { 41243e519524SHoward Hinnant __first = ++__m; 41253e519524SHoward Hinnant __len -= __l2 + 1; 41263e519524SHoward Hinnant } 41273e519524SHoward Hinnant } 41283e519524SHoward Hinnant return __first; 41293e519524SHoward Hinnant} 41303e519524SHoward Hinnant 41313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4132d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41333e519524SHoward Hinnant_ForwardIterator 4134e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41353e519524SHoward Hinnant{ 4136145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4139e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4140145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41413e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4142e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4143145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41443e519524SHoward Hinnant} 41453e519524SHoward Hinnant 41463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4147d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41483e519524SHoward Hinnant_ForwardIterator 4149e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41503e519524SHoward Hinnant{ 4151e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41523e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41533e519524SHoward Hinnant} 41543e519524SHoward Hinnant 41553e519524SHoward Hinnant// equal_range 41563e519524SHoward Hinnant 41573e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4158d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4159e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41603e519524SHoward Hinnant{ 41613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4162ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41633e519524SHoward Hinnant while (__len != 0) 41643e519524SHoward Hinnant { 41653e519524SHoward Hinnant difference_type __l2 = __len / 2; 41663e519524SHoward Hinnant _ForwardIterator __m = __first; 4167ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4168e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41693e519524SHoward Hinnant { 41703e519524SHoward Hinnant __first = ++__m; 41713e519524SHoward Hinnant __len -= __l2 + 1; 41723e519524SHoward Hinnant } 4173e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41743e519524SHoward Hinnant { 41753e519524SHoward Hinnant __last = __m; 41763e519524SHoward Hinnant __len = __l2; 41773e519524SHoward Hinnant } 41783e519524SHoward Hinnant else 41793e519524SHoward Hinnant { 41803e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41813e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 41823e519524SHoward Hinnant ( 4183e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4184e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 41853e519524SHoward Hinnant ); 41863e519524SHoward Hinnant } 41873e519524SHoward Hinnant } 41883e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 41893e519524SHoward Hinnant} 41903e519524SHoward Hinnant 41913e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4192d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41933e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4194e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41953e519524SHoward Hinnant{ 4196145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4199e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4200145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42013e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4202e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4203145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42043e519524SHoward Hinnant} 42053e519524SHoward Hinnant 42063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4207d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42083e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4209e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42103e519524SHoward Hinnant{ 4211e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42123e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42133e519524SHoward Hinnant} 42143e519524SHoward Hinnant 42153e519524SHoward Hinnant// binary_search 42163e519524SHoward Hinnant 42173e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4218d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42193e519524SHoward Hinnantbool 4220e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42213e519524SHoward Hinnant{ 4222e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4223e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42243e519524SHoward Hinnant} 42253e519524SHoward Hinnant 42263e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4227d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42283e519524SHoward Hinnantbool 4229e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42303e519524SHoward Hinnant{ 4231145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42323e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42333e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4234e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4235145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42363e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4237e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4238145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42393e519524SHoward Hinnant} 42403e519524SHoward Hinnant 42413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4242d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42433e519524SHoward Hinnantbool 4244e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42453e519524SHoward Hinnant{ 4246e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42473e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42483e519524SHoward Hinnant} 42493e519524SHoward Hinnant 42503e519524SHoward Hinnant// merge 42513e519524SHoward Hinnant 42523e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42533e519524SHoward Hinnant_OutputIterator 42543e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42563e519524SHoward Hinnant{ 42573e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42583e519524SHoward Hinnant { 42593e519524SHoward Hinnant if (__first2 == __last2) 4260ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42613e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42623e519524SHoward Hinnant { 42633e519524SHoward Hinnant *__result = *__first2; 42643e519524SHoward Hinnant ++__first2; 42653e519524SHoward Hinnant } 42663e519524SHoward Hinnant else 42673e519524SHoward Hinnant { 42683e519524SHoward Hinnant *__result = *__first1; 42693e519524SHoward Hinnant ++__first1; 42703e519524SHoward Hinnant } 42713e519524SHoward Hinnant } 4272ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42773e519524SHoward Hinnant_OutputIterator 42783e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42803e519524SHoward Hinnant{ 4281145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4284ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4285145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42863e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4287ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4288145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42893e519524SHoward Hinnant} 42903e519524SHoward Hinnant 42913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 42923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42933e519524SHoward Hinnant_OutputIterator 42943e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 42963e519524SHoward Hinnant{ 42973e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 42983e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 42993e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43003e519524SHoward Hinnant} 43013e519524SHoward Hinnant 43023e519524SHoward Hinnant// inplace_merge 43033e519524SHoward Hinnant 4304adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4305adfdae18SMarshall Clow class _OutputIterator> 4306adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4307adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4308adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4309adfdae18SMarshall Clow{ 4310adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4311adfdae18SMarshall Clow { 4312adfdae18SMarshall Clow if (__first2 == __last2) 4313adfdae18SMarshall Clow { 4314adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4315adfdae18SMarshall Clow return; 4316adfdae18SMarshall Clow } 4317adfdae18SMarshall Clow 4318adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4319adfdae18SMarshall Clow { 4320adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4321adfdae18SMarshall Clow ++__first2; 4322adfdae18SMarshall Clow } 4323adfdae18SMarshall Clow else 4324adfdae18SMarshall Clow { 4325adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4326adfdae18SMarshall Clow ++__first1; 4327adfdae18SMarshall Clow } 4328adfdae18SMarshall Clow } 4329adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4330adfdae18SMarshall Clow} 4331adfdae18SMarshall Clow 43323e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43333e519524SHoward Hinnantvoid 43343e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43353e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43363e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43373e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43383e519524SHoward Hinnant{ 43393e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43403e519524SHoward Hinnant __destruct_n __d(0); 43413e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43423e519524SHoward Hinnant if (__len1 <= __len2) 43433e519524SHoward Hinnant { 43443e519524SHoward Hinnant value_type* __p = __buff; 4345910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4346ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4347adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 43483e519524SHoward Hinnant } 43493e519524SHoward Hinnant else 43503e519524SHoward Hinnant { 43513e519524SHoward Hinnant value_type* __p = __buff; 4352910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4353ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43543e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43553e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4356adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4357adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4358a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 43593e519524SHoward Hinnant } 43603e519524SHoward Hinnant} 43613e519524SHoward Hinnant 43623e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43633e519524SHoward Hinnantvoid 43643e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43653e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43663e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43673e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43683e519524SHoward Hinnant{ 43693e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43703e519524SHoward Hinnant while (true) 43713e519524SHoward Hinnant { 43723e519524SHoward Hinnant // if __middle == __last, we're done 43733e519524SHoward Hinnant if (__len2 == 0) 43743e519524SHoward Hinnant return; 4375526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4376526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4377526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 43783e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4379910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 43803e519524SHoward Hinnant { 43813e519524SHoward Hinnant if (__len1 == 0) 43823e519524SHoward Hinnant return; 43833e519524SHoward Hinnant if (__comp(*__middle, *__first)) 43843e519524SHoward Hinnant break; 43853e519524SHoward Hinnant } 43863e519524SHoward Hinnant // __first < __middle < __last 43873e519524SHoward Hinnant // *__first > *__middle 43883e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 43893e519524SHoward Hinnant // all elements in: 43903e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 43913e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 43923e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 43933e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 43943e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 43953e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 43963e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 43973e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 43983e519524SHoward Hinnant // binary search smaller range 43993e519524SHoward Hinnant if (__len1 < __len2) 44003e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44013e519524SHoward Hinnant __len21 = __len2 / 2; 44023e519524SHoward Hinnant __m2 = __middle; 4403ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44043e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4405ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44063e519524SHoward Hinnant } 44073e519524SHoward Hinnant else 44083e519524SHoward Hinnant { 44093e519524SHoward Hinnant if (__len1 == 1) 44103e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44113e519524SHoward Hinnant // It is known *__first > *__middle 44123e519524SHoward Hinnant swap(*__first, *__middle); 44133e519524SHoward Hinnant return; 44143e519524SHoward Hinnant } 44153e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44163e519524SHoward Hinnant __len11 = __len1 / 2; 44173e519524SHoward Hinnant __m1 = __first; 4418ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44193e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4420ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44213e519524SHoward Hinnant } 44223e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44233e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44243e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44253e519524SHoward Hinnant // swap middle two partitions 4426ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44273e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44283e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44293e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44303e519524SHoward Hinnant { 44313e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44323e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44333e519524SHoward Hinnant __first = __middle; 44343e519524SHoward Hinnant __middle = __m2; 44353e519524SHoward Hinnant __len1 = __len12; 44363e519524SHoward Hinnant __len2 = __len22; 44373e519524SHoward Hinnant } 44383e519524SHoward Hinnant else 44393e519524SHoward Hinnant { 44403e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44413e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44423e519524SHoward Hinnant __last = __middle; 44433e519524SHoward Hinnant __middle = __m1; 44443e519524SHoward Hinnant __len1 = __len11; 44453e519524SHoward Hinnant __len2 = __len21; 44463e519524SHoward Hinnant } 44473e519524SHoward Hinnant } 44483e519524SHoward Hinnant} 44493e519524SHoward Hinnant 44503e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44523e519524SHoward Hinnantvoid 44533e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44543e519524SHoward Hinnant _Compare __comp) 44553e519524SHoward Hinnant{ 44563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44573e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4458ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4459ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4460ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44610b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44620b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 44630b48cf9aSMarshall Clow 4464145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44653e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44663e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4467ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44683e519524SHoward Hinnant __buf.first, __buf.second); 4469145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4471ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44723e519524SHoward Hinnant __buf.first, __buf.second); 4473145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44743e519524SHoward Hinnant} 44753e519524SHoward Hinnant 44763e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44783e519524SHoward Hinnantvoid 44793e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44803e519524SHoward Hinnant{ 4481ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 44823e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 44833e519524SHoward Hinnant} 44843e519524SHoward Hinnant 44853e519524SHoward Hinnant// stable_sort 44863e519524SHoward Hinnant 44873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 44883e519524SHoward Hinnantvoid 44893e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 44903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 44913e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 44923e519524SHoward Hinnant{ 44933e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 44943e519524SHoward Hinnant __destruct_n __d(0); 44953e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 44963e519524SHoward Hinnant for (; true; ++__result) 44973e519524SHoward Hinnant { 44983e519524SHoward Hinnant if (__first1 == __last1) 44993e519524SHoward Hinnant { 45003e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4501ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45023e519524SHoward Hinnant __h.release(); 45033e519524SHoward Hinnant return; 45043e519524SHoward Hinnant } 45053e519524SHoward Hinnant if (__first2 == __last2) 45063e519524SHoward Hinnant { 45073e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4508ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45093e519524SHoward Hinnant __h.release(); 45103e519524SHoward Hinnant return; 45113e519524SHoward Hinnant } 45123e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45133e519524SHoward Hinnant { 4514ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45153e519524SHoward Hinnant __d.__incr((value_type*)0); 45163e519524SHoward Hinnant ++__first2; 45173e519524SHoward Hinnant } 45183e519524SHoward Hinnant else 45193e519524SHoward Hinnant { 4520ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45213e519524SHoward Hinnant __d.__incr((value_type*)0); 45223e519524SHoward Hinnant ++__first1; 45233e519524SHoward Hinnant } 45243e519524SHoward Hinnant } 45253e519524SHoward Hinnant} 45263e519524SHoward Hinnant 45273e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45283e519524SHoward Hinnantvoid 45293e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45303e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45313e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45323e519524SHoward Hinnant{ 45333e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45343e519524SHoward Hinnant { 45353e519524SHoward Hinnant if (__first2 == __last2) 45363e519524SHoward Hinnant { 45373e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4538ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45393e519524SHoward Hinnant return; 45403e519524SHoward Hinnant } 45413e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45423e519524SHoward Hinnant { 4543ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45443e519524SHoward Hinnant ++__first2; 45453e519524SHoward Hinnant } 45463e519524SHoward Hinnant else 45473e519524SHoward Hinnant { 4548ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45493e519524SHoward Hinnant ++__first1; 45503e519524SHoward Hinnant } 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4553ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45543e519524SHoward Hinnant} 45553e519524SHoward Hinnant 45563e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45573e519524SHoward Hinnantvoid 45583e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45603e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45613e519524SHoward Hinnant 45623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45633e519524SHoward Hinnantvoid 45643e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45653e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45673e519524SHoward Hinnant{ 45683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45693e519524SHoward Hinnant switch (__len) 45703e519524SHoward Hinnant { 45713e519524SHoward Hinnant case 0: 45723e519524SHoward Hinnant return; 45733e519524SHoward Hinnant case 1: 4574ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45753e519524SHoward Hinnant return; 45763e519524SHoward Hinnant case 2: 45773e519524SHoward Hinnant __destruct_n __d(0); 45783e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45793e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45803e519524SHoward Hinnant { 4581ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45823e519524SHoward Hinnant __d.__incr((value_type*)0); 45833e519524SHoward Hinnant ++__first2; 4584ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45853e519524SHoward Hinnant } 45863e519524SHoward Hinnant else 45873e519524SHoward Hinnant { 4588ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45893e519524SHoward Hinnant __d.__incr((value_type*)0); 45903e519524SHoward Hinnant ++__first2; 4591ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 45923e519524SHoward Hinnant } 45933e519524SHoward Hinnant __h2.release(); 45943e519524SHoward Hinnant return; 45953e519524SHoward Hinnant } 45963e519524SHoward Hinnant if (__len <= 8) 45973e519524SHoward Hinnant { 45983e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 45993e519524SHoward Hinnant return; 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46023e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46033e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46043e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46053e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46063e519524SHoward Hinnant} 46073e519524SHoward Hinnant 46083e519524SHoward Hinnanttemplate <class _Tp> 46093e519524SHoward Hinnantstruct __stable_sort_switch 46103e519524SHoward Hinnant{ 4611ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46123e519524SHoward Hinnant}; 46133e519524SHoward Hinnant 46143e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46153e519524SHoward Hinnantvoid 46163e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46173e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46193e519524SHoward Hinnant{ 46203e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46213e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46223e519524SHoward Hinnant switch (__len) 46233e519524SHoward Hinnant { 46243e519524SHoward Hinnant case 0: 46253e519524SHoward Hinnant case 1: 46263e519524SHoward Hinnant return; 46273e519524SHoward Hinnant case 2: 46283e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46293e519524SHoward Hinnant swap(*__first, *__last); 46303e519524SHoward Hinnant return; 46313e519524SHoward Hinnant } 46323e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46333e519524SHoward Hinnant { 46343e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46353e519524SHoward Hinnant return; 46363e519524SHoward Hinnant } 46373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46383e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46393e519524SHoward Hinnant if (__len <= __buff_size) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant __destruct_n __d(0); 46423e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46433e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46443e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46453e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46463e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46473e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46483e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46493e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46503e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46513e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46523e519524SHoward Hinnant// __first, __comp); 46533e519524SHoward Hinnant return; 46543e519524SHoward Hinnant } 46553e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46563e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46573e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46583e519524SHoward Hinnant} 46593e519524SHoward Hinnant 46603e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46623e519524SHoward Hinnantvoid 46633e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46643e519524SHoward Hinnant{ 46653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46663e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46673e519524SHoward Hinnant difference_type __len = __last - __first; 46683e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46693e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46703e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46713e519524SHoward Hinnant { 4672ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46733e519524SHoward Hinnant __h.reset(__buf.first); 46743e519524SHoward Hinnant } 4675145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46783e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4679145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46813e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4682145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46833e519524SHoward Hinnant} 46843e519524SHoward Hinnant 46853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 46863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46873e519524SHoward Hinnantvoid 46883e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 46893e519524SHoward Hinnant{ 4690ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 46913e519524SHoward Hinnant} 46923e519524SHoward Hinnant 46933e519524SHoward Hinnant// is_heap_until 46943e519524SHoward Hinnant 46953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 469649c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 46973e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46983e519524SHoward Hinnant{ 4699ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47003e519524SHoward Hinnant difference_type __len = __last - __first; 47013e519524SHoward Hinnant difference_type __p = 0; 47023e519524SHoward Hinnant difference_type __c = 1; 47033e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47043e519524SHoward Hinnant while (__c < __len) 47053e519524SHoward Hinnant { 47063e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47073e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47083e519524SHoward Hinnant return __cp; 47093e519524SHoward Hinnant ++__c; 47103e519524SHoward Hinnant ++__cp; 47113e519524SHoward Hinnant if (__c == __len) 47123e519524SHoward Hinnant return __last; 47133e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47143e519524SHoward Hinnant return __cp; 47153e519524SHoward Hinnant ++__p; 47163e519524SHoward Hinnant ++__pp; 47173e519524SHoward Hinnant __c = 2 * __p + 1; 47183e519524SHoward Hinnant } 47193e519524SHoward Hinnant return __last; 47203e519524SHoward Hinnant} 47213e519524SHoward Hinnant 47223e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 472349c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47243e519524SHoward Hinnant_RandomAccessIterator 47253e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47263e519524SHoward Hinnant{ 4727ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47283e519524SHoward Hinnant} 47293e519524SHoward Hinnant 47303e519524SHoward Hinnant// is_heap 47313e519524SHoward Hinnant 47323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 473349c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47343e519524SHoward Hinnantbool 47353e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47363e519524SHoward Hinnant{ 4737ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47383e519524SHoward Hinnant} 47393e519524SHoward Hinnant 47403e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 474149c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47423e519524SHoward Hinnantbool 47433e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47443e519524SHoward Hinnant{ 4745ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47463e519524SHoward Hinnant} 47473e519524SHoward Hinnant 47483e519524SHoward Hinnant// push_heap 47493e519524SHoward Hinnant 47503e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47513e519524SHoward Hinnantvoid 47528b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47533e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47543e519524SHoward Hinnant{ 47553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47563e519524SHoward Hinnant if (__len > 1) 47573e519524SHoward Hinnant { 47583e519524SHoward Hinnant __len = (__len - 2) / 2; 47593e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47603e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47613e519524SHoward Hinnant { 4762ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47633e519524SHoward Hinnant do 47643e519524SHoward Hinnant { 4765ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47663e519524SHoward Hinnant __last = __ptr; 47673e519524SHoward Hinnant if (__len == 0) 47683e519524SHoward Hinnant break; 47693e519524SHoward Hinnant __len = (__len - 1) / 2; 47703e519524SHoward Hinnant __ptr = __first + __len; 47713e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4772ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47733e519524SHoward Hinnant } 47743e519524SHoward Hinnant } 47753e519524SHoward Hinnant} 47763e519524SHoward Hinnant 47773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47793e519524SHoward Hinnantvoid 47803e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47813e519524SHoward Hinnant{ 4782145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47858b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4786145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47888b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4789145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47903e519524SHoward Hinnant} 47913e519524SHoward Hinnant 47923e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47943e519524SHoward Hinnantvoid 47953e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47963e519524SHoward Hinnant{ 4797ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47983e519524SHoward Hinnant} 47993e519524SHoward Hinnant 48003e519524SHoward Hinnant// pop_heap 48013e519524SHoward Hinnant 48023e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48038b512602SDavid Majnemervoid 4804fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4805fd838227SEric Fiselier _Compare __comp, 48068b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48078b512602SDavid Majnemer _RandomAccessIterator __start) 48088b512602SDavid Majnemer{ 48098b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48108b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48118b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48128b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48138b512602SDavid Majnemer difference_type __child = __start - __first; 48148b512602SDavid Majnemer 48158b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48168b512602SDavid Majnemer return; 48178b512602SDavid Majnemer 48188b512602SDavid Majnemer __child = 2 * __child + 1; 48198b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48208b512602SDavid Majnemer 48218b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48228b512602SDavid Majnemer // right-child exists and is greater than left-child 48238b512602SDavid Majnemer ++__child_i; 48248b512602SDavid Majnemer ++__child; 48258b512602SDavid Majnemer } 48268b512602SDavid Majnemer 48278b512602SDavid Majnemer // check if we are in heap-order 48288b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48298b512602SDavid Majnemer // we are, __start is larger than it's largest child 48308b512602SDavid Majnemer return; 48318b512602SDavid Majnemer 48328b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48338b512602SDavid Majnemer do 48348b512602SDavid Majnemer { 48358b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48368b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48378b512602SDavid Majnemer __start = __child_i; 48388b512602SDavid Majnemer 48398b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48408b512602SDavid Majnemer break; 48418b512602SDavid Majnemer 48428b512602SDavid Majnemer // recompute the child based off of the updated parent 48438b512602SDavid Majnemer __child = 2 * __child + 1; 48448b512602SDavid Majnemer __child_i = __first + __child; 48458b512602SDavid Majnemer 48468b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48478b512602SDavid Majnemer // right-child exists and is greater than left-child 48488b512602SDavid Majnemer ++__child_i; 48498b512602SDavid Majnemer ++__child; 48508b512602SDavid Majnemer } 48518b512602SDavid Majnemer 48528b512602SDavid Majnemer // check if we are in heap-order 48538b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 48548b512602SDavid Majnemer *__start = _VSTD::move(__top); 48558b512602SDavid Majnemer} 48568b512602SDavid Majnemer 48578b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 48583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48593e519524SHoward Hinnantvoid 48603e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48613e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48623e519524SHoward Hinnant{ 48633e519524SHoward Hinnant if (__len > 1) 48643e519524SHoward Hinnant { 48653e519524SHoward Hinnant swap(*__first, *--__last); 48668b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 48673e519524SHoward Hinnant } 48683e519524SHoward Hinnant} 48693e519524SHoward Hinnant 48703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48723e519524SHoward Hinnantvoid 48733e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48743e519524SHoward Hinnant{ 4875145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48783e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4879145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48813e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4882145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48833e519524SHoward Hinnant} 48843e519524SHoward Hinnant 48853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48873e519524SHoward Hinnantvoid 48883e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48893e519524SHoward Hinnant{ 4890ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48913e519524SHoward Hinnant} 48923e519524SHoward Hinnant 48933e519524SHoward Hinnant// make_heap 48943e519524SHoward Hinnant 48953e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48963e519524SHoward Hinnantvoid 48973e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48983e519524SHoward Hinnant{ 48993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49003e519524SHoward Hinnant difference_type __n = __last - __first; 49013e519524SHoward Hinnant if (__n > 1) 49023e519524SHoward Hinnant { 49038b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49048b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49058b512602SDavid Majnemer { 49068b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49078b512602SDavid Majnemer } 49083e519524SHoward Hinnant } 49093e519524SHoward Hinnant} 49103e519524SHoward Hinnant 49113e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49133e519524SHoward Hinnantvoid 49143e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49153e519524SHoward Hinnant{ 4916145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49193e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4920145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49223e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4923145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49243e519524SHoward Hinnant} 49253e519524SHoward Hinnant 49263e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49283e519524SHoward Hinnantvoid 49293e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49303e519524SHoward Hinnant{ 4931ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49323e519524SHoward Hinnant} 49333e519524SHoward Hinnant 49343e519524SHoward Hinnant// sort_heap 49353e519524SHoward Hinnant 49363e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49373e519524SHoward Hinnantvoid 49383e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49393e519524SHoward Hinnant{ 49403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49413e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49423e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49433e519524SHoward Hinnant} 49443e519524SHoward Hinnant 49453e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49473e519524SHoward Hinnantvoid 49483e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49493e519524SHoward Hinnant{ 4950145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49513e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49523e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49533e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4954145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49553e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49563e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4957145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49583e519524SHoward Hinnant} 49593e519524SHoward Hinnant 49603e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49623e519524SHoward Hinnantvoid 49633e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49643e519524SHoward Hinnant{ 4965ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49663e519524SHoward Hinnant} 49673e519524SHoward Hinnant 49683e519524SHoward Hinnant// partial_sort 49693e519524SHoward Hinnant 49703e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49713e519524SHoward Hinnantvoid 49723e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49733e519524SHoward Hinnant _Compare __comp) 49743e519524SHoward Hinnant{ 49753e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49773e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49783e519524SHoward Hinnant { 49793e519524SHoward Hinnant if (__comp(*__i, *__first)) 49803e519524SHoward Hinnant { 49813e519524SHoward Hinnant swap(*__i, *__first); 49828b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 49833e519524SHoward Hinnant } 49843e519524SHoward Hinnant } 49853e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 49863e519524SHoward Hinnant} 49873e519524SHoward Hinnant 49883e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49903e519524SHoward Hinnantvoid 49913e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49923e519524SHoward Hinnant _Compare __comp) 49933e519524SHoward Hinnant{ 4994145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49973e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 4998145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50003e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5001145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50023e519524SHoward Hinnant} 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50063e519524SHoward Hinnantvoid 50073e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50083e519524SHoward Hinnant{ 5009ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50103e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50113e519524SHoward Hinnant} 50123e519524SHoward Hinnant 50133e519524SHoward Hinnant// partial_sort_copy 50143e519524SHoward Hinnant 50153e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50163e519524SHoward Hinnant_RandomAccessIterator 50173e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50183e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50193e519524SHoward Hinnant{ 50203e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50213e519524SHoward Hinnant if (__r != __result_last) 50223e519524SHoward Hinnant { 5023910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50243e519524SHoward Hinnant *__r = *__first; 50253e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50268b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50273e519524SHoward Hinnant for (; __first != __last; ++__first) 50283e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50293e519524SHoward Hinnant { 50303e519524SHoward Hinnant *__result_first = *__first; 50318b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50323e519524SHoward Hinnant } 50333e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50343e519524SHoward Hinnant } 50353e519524SHoward Hinnant return __r; 50363e519524SHoward Hinnant} 50373e519524SHoward Hinnant 50383e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50403e519524SHoward Hinnant_RandomAccessIterator 50413e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50423e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50433e519524SHoward Hinnant{ 5044145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50473e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5048145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50503e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5051145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50523e519524SHoward Hinnant} 50533e519524SHoward Hinnant 50543e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50563e519524SHoward Hinnant_RandomAccessIterator 50573e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50583e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50593e519524SHoward Hinnant{ 5060ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50613e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50623e519524SHoward Hinnant} 50633e519524SHoward Hinnant 50643e519524SHoward Hinnant// nth_element 50653e519524SHoward Hinnant 50663e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50673e519524SHoward Hinnantvoid 50683e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50693e519524SHoward Hinnant{ 50703e519524SHoward Hinnant // _Compare is known to be a reference type 50713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50723e519524SHoward Hinnant const difference_type __limit = 7; 50733e519524SHoward Hinnant while (true) 50743e519524SHoward Hinnant { 50753e519524SHoward Hinnant __restart: 5076b34b4819SHoward Hinnant if (__nth == __last) 5077b34b4819SHoward Hinnant return; 50783e519524SHoward Hinnant difference_type __len = __last - __first; 50793e519524SHoward Hinnant switch (__len) 50803e519524SHoward Hinnant { 50813e519524SHoward Hinnant case 0: 50823e519524SHoward Hinnant case 1: 50833e519524SHoward Hinnant return; 50843e519524SHoward Hinnant case 2: 50853e519524SHoward Hinnant if (__comp(*--__last, *__first)) 50863e519524SHoward Hinnant swap(*__first, *__last); 50873e519524SHoward Hinnant return; 50883e519524SHoward Hinnant case 3: 50893e519524SHoward Hinnant { 50903e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5091ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 50923e519524SHoward Hinnant return; 50933e519524SHoward Hinnant } 50943e519524SHoward Hinnant } 50953e519524SHoward Hinnant if (__len <= __limit) 50963e519524SHoward Hinnant { 50973e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 50983e519524SHoward Hinnant return; 50993e519524SHoward Hinnant } 51003e519524SHoward Hinnant // __len > __limit >= 3 51013e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51023e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5103ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51043e519524SHoward Hinnant // *__m is median 51053e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51063e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51073e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51083e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51093e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51103e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51113e519524SHoward Hinnant // Prime the downward search with a guard. 51123e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51133e519524SHoward Hinnant { 51143e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51153e519524SHoward Hinnant // manually guard downward moving __j against __i 51163e519524SHoward Hinnant while (true) 51173e519524SHoward Hinnant { 51183e519524SHoward Hinnant if (__i == --__j) 51193e519524SHoward Hinnant { 51203e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51213e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51223e519524SHoward Hinnant ++__i; // __first + 1 51233e519524SHoward Hinnant __j = __last; 51243e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51253e519524SHoward Hinnant { 51263e519524SHoward Hinnant while (true) 51273e519524SHoward Hinnant { 51283e519524SHoward Hinnant if (__i == __j) 51293e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51303e519524SHoward Hinnant if (__comp(*__first, *__i)) 51313e519524SHoward Hinnant { 51323e519524SHoward Hinnant swap(*__i, *__j); 51333e519524SHoward Hinnant ++__n_swaps; 51343e519524SHoward Hinnant ++__i; 51353e519524SHoward Hinnant break; 51363e519524SHoward Hinnant } 51373e519524SHoward Hinnant ++__i; 51383e519524SHoward Hinnant } 51393e519524SHoward Hinnant } 51403e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51413e519524SHoward Hinnant if (__i == __j) 51423e519524SHoward Hinnant return; 51433e519524SHoward Hinnant while (true) 51443e519524SHoward Hinnant { 51453e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51463e519524SHoward Hinnant ++__i; 51473e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51483e519524SHoward Hinnant ; 51493e519524SHoward Hinnant if (__i >= __j) 51503e519524SHoward Hinnant break; 51513e519524SHoward Hinnant swap(*__i, *__j); 51523e519524SHoward Hinnant ++__n_swaps; 51533e519524SHoward Hinnant ++__i; 51543e519524SHoward Hinnant } 51553e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51563e519524SHoward Hinnant // The first part is sorted, 51573e519524SHoward Hinnant if (__nth < __i) 51583e519524SHoward Hinnant return; 51593e519524SHoward Hinnant // __nth_element the secod part 51603e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51613e519524SHoward Hinnant __first = __i; 51623e519524SHoward Hinnant goto __restart; 51633e519524SHoward Hinnant } 51643e519524SHoward Hinnant if (__comp(*__j, *__m)) 51653e519524SHoward Hinnant { 51663e519524SHoward Hinnant swap(*__i, *__j); 51673e519524SHoward Hinnant ++__n_swaps; 51683e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51693e519524SHoward Hinnant } 51703e519524SHoward Hinnant } 51713e519524SHoward Hinnant } 51723e519524SHoward Hinnant ++__i; 51733e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51743e519524SHoward Hinnant // if not yet partitioned... 51753e519524SHoward Hinnant if (__i < __j) 51763e519524SHoward Hinnant { 51773e519524SHoward Hinnant // known that *(__i - 1) < *__m 51783e519524SHoward Hinnant while (true) 51793e519524SHoward Hinnant { 51803e519524SHoward Hinnant // __m still guards upward moving __i 51813e519524SHoward Hinnant while (__comp(*__i, *__m)) 51823e519524SHoward Hinnant ++__i; 51833e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 51843e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 51853e519524SHoward Hinnant ; 51863e519524SHoward Hinnant if (__i >= __j) 51873e519524SHoward Hinnant break; 51883e519524SHoward Hinnant swap(*__i, *__j); 51893e519524SHoward Hinnant ++__n_swaps; 51903e519524SHoward Hinnant // It is known that __m != __j 51913e519524SHoward Hinnant // If __m just moved, follow it 51923e519524SHoward Hinnant if (__m == __i) 51933e519524SHoward Hinnant __m = __j; 51943e519524SHoward Hinnant ++__i; 51953e519524SHoward Hinnant } 51963e519524SHoward Hinnant } 51973e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 51983e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 51993e519524SHoward Hinnant { 52003e519524SHoward Hinnant swap(*__i, *__m); 52013e519524SHoward Hinnant ++__n_swaps; 52023e519524SHoward Hinnant } 52033e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52043e519524SHoward Hinnant if (__nth == __i) 52053e519524SHoward Hinnant return; 52063e519524SHoward Hinnant if (__n_swaps == 0) 52073e519524SHoward Hinnant { 52083e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52093e519524SHoward Hinnant if (__nth < __i) 52103e519524SHoward Hinnant { 52113e519524SHoward Hinnant // Check for [__first, __i) already sorted 52123e519524SHoward Hinnant __j = __m = __first; 52133e519524SHoward Hinnant while (++__j != __i) 52143e519524SHoward Hinnant { 52153e519524SHoward Hinnant if (__comp(*__j, *__m)) 52163e519524SHoward Hinnant // not yet sorted, so sort 52173e519524SHoward Hinnant goto not_sorted; 52183e519524SHoward Hinnant __m = __j; 52193e519524SHoward Hinnant } 52203e519524SHoward Hinnant // [__first, __i) sorted 52213e519524SHoward Hinnant return; 52223e519524SHoward Hinnant } 52233e519524SHoward Hinnant else 52243e519524SHoward Hinnant { 52253e519524SHoward Hinnant // Check for [__i, __last) already sorted 52263e519524SHoward Hinnant __j = __m = __i; 52273e519524SHoward Hinnant while (++__j != __last) 52283e519524SHoward Hinnant { 52293e519524SHoward Hinnant if (__comp(*__j, *__m)) 52303e519524SHoward Hinnant // not yet sorted, so sort 52313e519524SHoward Hinnant goto not_sorted; 52323e519524SHoward Hinnant __m = __j; 52333e519524SHoward Hinnant } 52343e519524SHoward Hinnant // [__i, __last) sorted 52353e519524SHoward Hinnant return; 52363e519524SHoward Hinnant } 52373e519524SHoward Hinnant } 52383e519524SHoward Hinnantnot_sorted: 52393e519524SHoward Hinnant // __nth_element on range containing __nth 52403e519524SHoward Hinnant if (__nth < __i) 52413e519524SHoward Hinnant { 52423e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52433e519524SHoward Hinnant __last = __i; 52443e519524SHoward Hinnant } 52453e519524SHoward Hinnant else 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52483e519524SHoward Hinnant __first = ++__i; 52493e519524SHoward Hinnant } 52503e519524SHoward Hinnant } 52513e519524SHoward Hinnant} 52523e519524SHoward Hinnant 52533e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52553e519524SHoward Hinnantvoid 52563e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52573e519524SHoward Hinnant{ 5258145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52613e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5262145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52643e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5265145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52663e519524SHoward Hinnant} 52673e519524SHoward Hinnant 52683e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52703e519524SHoward Hinnantvoid 52713e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52723e519524SHoward Hinnant{ 5273ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52743e519524SHoward Hinnant} 52753e519524SHoward Hinnant 52763e519524SHoward Hinnant// includes 52773e519524SHoward Hinnant 52783e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52798da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 52803e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52813e519524SHoward Hinnant _Compare __comp) 52823e519524SHoward Hinnant{ 52833e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 52843e519524SHoward Hinnant { 52853e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 52863e519524SHoward Hinnant return false; 52873e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 52883e519524SHoward Hinnant ++__first2; 52893e519524SHoward Hinnant } 52903e519524SHoward Hinnant return true; 52913e519524SHoward Hinnant} 52923e519524SHoward Hinnant 52933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 52948da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 52953e519524SHoward Hinnantbool 52963e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52973e519524SHoward Hinnant _Compare __comp) 52983e519524SHoward Hinnant{ 5299145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53023e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5303145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53053e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5306145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53073e519524SHoward Hinnant} 53083e519524SHoward Hinnant 53093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53108da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53113e519524SHoward Hinnantbool 53123e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53133e519524SHoward Hinnant{ 5314ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53153e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53163e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53173e519524SHoward Hinnant} 53183e519524SHoward Hinnant 53193e519524SHoward Hinnant// set_union 53203e519524SHoward Hinnant 53213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53223e519524SHoward Hinnant_OutputIterator 53233e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53253e519524SHoward Hinnant{ 53263e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53273e519524SHoward Hinnant { 53283e519524SHoward Hinnant if (__first2 == __last2) 5329ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53303e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53313e519524SHoward Hinnant { 53323e519524SHoward Hinnant *__result = *__first2; 53333e519524SHoward Hinnant ++__first2; 53343e519524SHoward Hinnant } 53353e519524SHoward Hinnant else 53363e519524SHoward Hinnant { 53373e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53383e519524SHoward Hinnant ++__first2; 533905da5b02SMarshall Clow *__result = *__first1; 53403e519524SHoward Hinnant ++__first1; 53413e519524SHoward Hinnant } 53423e519524SHoward Hinnant } 5343ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53443e519524SHoward Hinnant} 53453e519524SHoward Hinnant 53463e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53483e519524SHoward Hinnant_OutputIterator 53493e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53513e519524SHoward Hinnant{ 5352145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53553e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5356145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53583e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5359145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53603e519524SHoward Hinnant} 53613e519524SHoward Hinnant 53623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53643e519524SHoward Hinnant_OutputIterator 53653e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53673e519524SHoward Hinnant{ 5368ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53693e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53703e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53713e519524SHoward Hinnant} 53723e519524SHoward Hinnant 53733e519524SHoward Hinnant// set_intersection 53743e519524SHoward Hinnant 53753e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53768da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 53773e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53783e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53793e519524SHoward Hinnant{ 53803e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53813e519524SHoward Hinnant { 53823e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 53833e519524SHoward Hinnant ++__first1; 53843e519524SHoward Hinnant else 53853e519524SHoward Hinnant { 53863e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 53873e519524SHoward Hinnant { 53883e519524SHoward Hinnant *__result = *__first1; 53893e519524SHoward Hinnant ++__result; 53903e519524SHoward Hinnant ++__first1; 53913e519524SHoward Hinnant } 53923e519524SHoward Hinnant ++__first2; 53933e519524SHoward Hinnant } 53943e519524SHoward Hinnant } 53953e519524SHoward Hinnant return __result; 53963e519524SHoward Hinnant} 53973e519524SHoward Hinnant 53983e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53998da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54003e519524SHoward Hinnant_OutputIterator 54013e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54033e519524SHoward Hinnant{ 5404145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54073e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5408145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54103e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5411145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54123e519524SHoward Hinnant} 54133e519524SHoward Hinnant 54143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54158da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54163e519524SHoward Hinnant_OutputIterator 54173e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54183e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54193e519524SHoward Hinnant{ 5420ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54213e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54223e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54233e519524SHoward Hinnant} 54243e519524SHoward Hinnant 54253e519524SHoward Hinnant// set_difference 54263e519524SHoward Hinnant 54273e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54283e519524SHoward Hinnant_OutputIterator 54293e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54303e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54313e519524SHoward Hinnant{ 54323e519524SHoward Hinnant while (__first1 != __last1) 54333e519524SHoward Hinnant { 54343e519524SHoward Hinnant if (__first2 == __last2) 5435ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54363e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54373e519524SHoward Hinnant { 54383e519524SHoward Hinnant *__result = *__first1; 54393e519524SHoward Hinnant ++__result; 54403e519524SHoward Hinnant ++__first1; 54413e519524SHoward Hinnant } 54423e519524SHoward Hinnant else 54433e519524SHoward Hinnant { 54443e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54453e519524SHoward Hinnant ++__first1; 54463e519524SHoward Hinnant ++__first2; 54473e519524SHoward Hinnant } 54483e519524SHoward Hinnant } 54493e519524SHoward Hinnant return __result; 54503e519524SHoward Hinnant} 54513e519524SHoward Hinnant 54523e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54543e519524SHoward Hinnant_OutputIterator 54553e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54563e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54573e519524SHoward Hinnant{ 5458145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54613e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5462145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54643e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5465145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54663e519524SHoward Hinnant} 54673e519524SHoward Hinnant 54683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54703e519524SHoward Hinnant_OutputIterator 54713e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54733e519524SHoward Hinnant{ 5474ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54753e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54763e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54773e519524SHoward Hinnant} 54783e519524SHoward Hinnant 54793e519524SHoward Hinnant// set_symmetric_difference 54803e519524SHoward Hinnant 54813e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54823e519524SHoward Hinnant_OutputIterator 54833e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54853e519524SHoward Hinnant{ 54863e519524SHoward Hinnant while (__first1 != __last1) 54873e519524SHoward Hinnant { 54883e519524SHoward Hinnant if (__first2 == __last2) 5489ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54903e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54913e519524SHoward Hinnant { 54923e519524SHoward Hinnant *__result = *__first1; 54933e519524SHoward Hinnant ++__result; 54943e519524SHoward Hinnant ++__first1; 54953e519524SHoward Hinnant } 54963e519524SHoward Hinnant else 54973e519524SHoward Hinnant { 54983e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54993e519524SHoward Hinnant { 55003e519524SHoward Hinnant *__result = *__first2; 55013e519524SHoward Hinnant ++__result; 55023e519524SHoward Hinnant } 55033e519524SHoward Hinnant else 55043e519524SHoward Hinnant ++__first1; 55053e519524SHoward Hinnant ++__first2; 55063e519524SHoward Hinnant } 55073e519524SHoward Hinnant } 5508ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55093e519524SHoward Hinnant} 55103e519524SHoward Hinnant 55113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55133e519524SHoward Hinnant_OutputIterator 55143e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55163e519524SHoward Hinnant{ 5517145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55203e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5521145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55233e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5524145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55253e519524SHoward Hinnant} 55263e519524SHoward Hinnant 55273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55293e519524SHoward Hinnant_OutputIterator 55303e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55323e519524SHoward Hinnant{ 5533ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55343e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55353e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55363e519524SHoward Hinnant} 55373e519524SHoward Hinnant 55383e519524SHoward Hinnant// lexicographical_compare 55393e519524SHoward Hinnant 55403e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55411b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55423e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55433e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55443e519524SHoward Hinnant{ 5545910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55463e519524SHoward Hinnant { 55473e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55483e519524SHoward Hinnant return true; 55493e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55503e519524SHoward Hinnant return false; 55513e519524SHoward Hinnant } 55523e519524SHoward Hinnant return false; 55533e519524SHoward Hinnant} 55543e519524SHoward Hinnant 55553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55561b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55573e519524SHoward Hinnantbool 55583e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55603e519524SHoward Hinnant{ 5561145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55623e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55633e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55643e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5565145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55673e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5568145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55693e519524SHoward Hinnant} 55703e519524SHoward Hinnant 55713e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55721b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55733e519524SHoward Hinnantbool 55743e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55753e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55763e519524SHoward Hinnant{ 5577ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55783e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55793e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55803e519524SHoward Hinnant} 55813e519524SHoward Hinnant 55823e519524SHoward Hinnant// next_permutation 55833e519524SHoward Hinnant 55843e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 55853e519524SHoward Hinnantbool 55863e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 55873e519524SHoward Hinnant{ 55883e519524SHoward Hinnant _BidirectionalIterator __i = __last; 55893e519524SHoward Hinnant if (__first == __last || __first == --__i) 55903e519524SHoward Hinnant return false; 55913e519524SHoward Hinnant while (true) 55923e519524SHoward Hinnant { 55933e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 55943e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 55953e519524SHoward Hinnant { 55963e519524SHoward Hinnant _BidirectionalIterator __j = __last; 55973e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 55983e519524SHoward Hinnant ; 55993e519524SHoward Hinnant swap(*__i, *__j); 5600ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56013e519524SHoward Hinnant return true; 56023e519524SHoward Hinnant } 56033e519524SHoward Hinnant if (__i == __first) 56043e519524SHoward Hinnant { 5605ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56063e519524SHoward Hinnant return false; 56073e519524SHoward Hinnant } 56083e519524SHoward Hinnant } 56093e519524SHoward Hinnant} 56103e519524SHoward Hinnant 56113e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56133e519524SHoward Hinnantbool 56143e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56153e519524SHoward Hinnant{ 5616145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56193e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5620145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56223e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5623145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56243e519524SHoward Hinnant} 56253e519524SHoward Hinnant 56263e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56283e519524SHoward Hinnantbool 56293e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56303e519524SHoward Hinnant{ 5631ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56323e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56333e519524SHoward Hinnant} 56343e519524SHoward Hinnant 56353e519524SHoward Hinnant// prev_permutation 56363e519524SHoward Hinnant 56373e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56383e519524SHoward Hinnantbool 56393e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56403e519524SHoward Hinnant{ 56413e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56423e519524SHoward Hinnant if (__first == __last || __first == --__i) 56433e519524SHoward Hinnant return false; 56443e519524SHoward Hinnant while (true) 56453e519524SHoward Hinnant { 56463e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56473e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56483e519524SHoward Hinnant { 56493e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56503e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56513e519524SHoward Hinnant ; 56523e519524SHoward Hinnant swap(*__i, *__j); 5653ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56543e519524SHoward Hinnant return true; 56553e519524SHoward Hinnant } 56563e519524SHoward Hinnant if (__i == __first) 56573e519524SHoward Hinnant { 5658ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56593e519524SHoward Hinnant return false; 56603e519524SHoward Hinnant } 56613e519524SHoward Hinnant } 56623e519524SHoward Hinnant} 56633e519524SHoward Hinnant 56643e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56663e519524SHoward Hinnantbool 56673e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56683e519524SHoward Hinnant{ 5669145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56723e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5673145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56753e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5676145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56773e519524SHoward Hinnant} 56783e519524SHoward Hinnant 56793e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56813e519524SHoward Hinnantbool 56823e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56833e519524SHoward Hinnant{ 5684ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 56853e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56863e519524SHoward Hinnant} 56873e519524SHoward Hinnant 56883e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 56893e519524SHoward Hinnant 5690a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5691a016efb1SEric Fiselier 56923e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5693