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> 649f56972e2SMarshall Clow#include <version> 6505d1a701dSHoward Hinnant 651c1bd9197SEric Fiselier#include <__debug> 652c1bd9197SEric Fiselier 653073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6543e519524SHoward Hinnant#pragma GCC system_header 655073458b1SHoward Hinnant#endif 6563e519524SHoward Hinnant 657a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 658a016efb1SEric Fiselier#include <__undef_macros> 659a016efb1SEric Fiselier 660a016efb1SEric Fiselier 6613e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6623e519524SHoward Hinnant 6639d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6649d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6659d67c6d5SMarshall Clow// * We haven't included <functional> here. 6663e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6673e519524SHoward Hinnantstruct __equal_to 6683e519524SHoward Hinnant{ 669d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 670d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 671d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 672d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6733e519524SHoward Hinnant}; 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class _T1> 6763e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6773e519524SHoward Hinnant{ 6789d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6799d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6803e519524SHoward Hinnant}; 6813e519524SHoward Hinnant 6823e519524SHoward Hinnanttemplate <class _T1> 6833e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6843e519524SHoward Hinnant{ 6859d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6869d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6873e519524SHoward Hinnant}; 6883e519524SHoward Hinnant 6893e519524SHoward Hinnanttemplate <class _T1> 6903e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6913e519524SHoward Hinnant{ 6929d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6939d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6943e519524SHoward Hinnant}; 6953e519524SHoward Hinnant 6963e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6973e519524SHoward Hinnantstruct __less 6983e519524SHoward Hinnant{ 6999d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7009d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7019d67c6d5SMarshall Clow 7029d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7039d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7049d67c6d5SMarshall Clow 7059d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7069d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7079d67c6d5SMarshall Clow 7089d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7099d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7103e519524SHoward Hinnant}; 7113e519524SHoward Hinnant 7123e519524SHoward Hinnanttemplate <class _T1> 7133e519524SHoward Hinnantstruct __less<_T1, _T1> 7143e519524SHoward Hinnant{ 7159d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7169d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7173e519524SHoward Hinnant}; 7183e519524SHoward Hinnant 7193e519524SHoward Hinnanttemplate <class _T1> 7203e519524SHoward Hinnantstruct __less<const _T1, _T1> 7213e519524SHoward Hinnant{ 7229d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7239d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7243e519524SHoward Hinnant}; 7253e519524SHoward Hinnant 7263e519524SHoward Hinnanttemplate <class _T1> 7273e519524SHoward Hinnantstruct __less<_T1, const _T1> 7283e519524SHoward Hinnant{ 7299d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7309d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7313e519524SHoward Hinnant}; 7323e519524SHoward Hinnant 7333e519524SHoward Hinnanttemplate <class _Predicate> 734a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7353e519524SHoward Hinnant{ 7363e519524SHoward Hinnantprivate: 7373e519524SHoward Hinnant _Predicate __p_; 7383e519524SHoward Hinnantpublic: 739a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7403e519524SHoward Hinnant 7413e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 742a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7433e519524SHoward Hinnant 7443e519524SHoward Hinnant template <class _T1> 7453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7463e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7473e519524SHoward Hinnant 7483e519524SHoward Hinnant template <class _T1, class _T2> 7493e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 750a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7513e519524SHoward Hinnant}; 7523e519524SHoward Hinnant 753*04695a75SLouis Dionne// Perform division by two quickly for positive integers (llvm.org/PR39129) 754*04695a75SLouis Dionne 755*04695a75SLouis Dionnetemplate <typename _Integral> 756*04695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 757*04695a75SLouis Dionnetypename enable_if 758*04695a75SLouis Dionne< 759*04695a75SLouis Dionne is_integral<_Integral>::value, 760*04695a75SLouis Dionne _Integral 761*04695a75SLouis Dionne>::type 762*04695a75SLouis Dionne__half_positive(_Integral __value) 763*04695a75SLouis Dionne{ 764*04695a75SLouis Dionne return static_cast<_Integral>(static_cast<typename make_unsigned<_Integral>::type>(__value) / 2); 765*04695a75SLouis Dionne} 766*04695a75SLouis Dionne 767*04695a75SLouis Dionnetemplate <typename _Tp> 768*04695a75SLouis Dionne_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 769*04695a75SLouis Dionnetypename enable_if 770*04695a75SLouis Dionne< 771*04695a75SLouis Dionne !is_integral<_Tp>::value, 772*04695a75SLouis Dionne _Tp 773*04695a75SLouis Dionne>::type 774*04695a75SLouis Dionne__half_positive(_Tp __value) 775*04695a75SLouis Dionne{ 776*04695a75SLouis Dionne return __value / 2; 777*04695a75SLouis Dionne} 778*04695a75SLouis Dionne 779145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7803e519524SHoward Hinnant 7813e519524SHoward Hinnanttemplate <class _Compare> 7823e519524SHoward Hinnantstruct __debug_less 7833e519524SHoward Hinnant{ 7843e519524SHoward Hinnant _Compare __comp_; 7853e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 786331d2159SEric Fiselier 7873e519524SHoward Hinnant template <class _Tp, class _Up> 7883e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7893e519524SHoward Hinnant { 7903e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7913e519524SHoward Hinnant if (__r) 792331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7933e519524SHoward Hinnant return __r; 7943e519524SHoward Hinnant } 795331d2159SEric Fiselier 796331d2159SEric Fiselier template <class _LHS, class _RHS> 797331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 798331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 799331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 800331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 801331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 802331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 803331d2159SEric Fiselier } 804331d2159SEric Fiselier 805331d2159SEric Fiselier template <class _LHS, class _RHS> 806331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 807331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 8083e519524SHoward Hinnant}; 8093e519524SHoward Hinnant 810145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 8113e519524SHoward Hinnant 8123e519524SHoward Hinnant// all_of 8133e519524SHoward Hinnant 8143e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 815706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8163e519524SHoward Hinnantbool 8173e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8183e519524SHoward Hinnant{ 8193e519524SHoward Hinnant for (; __first != __last; ++__first) 8203e519524SHoward Hinnant if (!__pred(*__first)) 8213e519524SHoward Hinnant return false; 8223e519524SHoward Hinnant return true; 8233e519524SHoward Hinnant} 8243e519524SHoward Hinnant 8253e519524SHoward Hinnant// any_of 8263e519524SHoward Hinnant 8273e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 828706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8293e519524SHoward Hinnantbool 8303e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8313e519524SHoward Hinnant{ 8323e519524SHoward Hinnant for (; __first != __last; ++__first) 8333e519524SHoward Hinnant if (__pred(*__first)) 8343e519524SHoward Hinnant return true; 8353e519524SHoward Hinnant return false; 8363e519524SHoward Hinnant} 8373e519524SHoward Hinnant 8383e519524SHoward Hinnant// none_of 8393e519524SHoward Hinnant 8403e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 841706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8423e519524SHoward Hinnantbool 8433e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8443e519524SHoward Hinnant{ 8453e519524SHoward Hinnant for (; __first != __last; ++__first) 8463e519524SHoward Hinnant if (__pred(*__first)) 8473e519524SHoward Hinnant return false; 8483e519524SHoward Hinnant return true; 8493e519524SHoward Hinnant} 8503e519524SHoward Hinnant 8513e519524SHoward Hinnant// for_each 8523e519524SHoward Hinnant 8533e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8541b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8553e519524SHoward Hinnant_Function 8563e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8573e519524SHoward Hinnant{ 8583e519524SHoward Hinnant for (; __first != __last; ++__first) 8593e519524SHoward Hinnant __f(*__first); 8601c7fe126SMarshall Clow return __f; 8613e519524SHoward Hinnant} 8623e519524SHoward Hinnant 8631d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 864d5c65ffaSMarshall Clow// for_each_n 865d5c65ffaSMarshall Clow 866d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 8671b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 868d5c65ffaSMarshall Clow_InputIterator 869d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 870d5c65ffaSMarshall Clow{ 871d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 872d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 873d5c65ffaSMarshall Clow while (__n > 0) 874d5c65ffaSMarshall Clow { 875d5c65ffaSMarshall Clow __f(*__first); 876d5c65ffaSMarshall Clow ++__first; 877d5c65ffaSMarshall Clow --__n; 878d5c65ffaSMarshall Clow } 879d5c65ffaSMarshall Clow return __first; 880d5c65ffaSMarshall Clow} 8811d02996dSMarshall Clow#endif 882d5c65ffaSMarshall Clow 8833e519524SHoward Hinnant// find 8843e519524SHoward Hinnant 8853e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 88649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 8873e519524SHoward Hinnant_InputIterator 888e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8893e519524SHoward Hinnant{ 8903e519524SHoward Hinnant for (; __first != __last; ++__first) 891e4383379SHoward Hinnant if (*__first == __value_) 8923e519524SHoward Hinnant break; 8933e519524SHoward Hinnant return __first; 8943e519524SHoward Hinnant} 8953e519524SHoward Hinnant 8963e519524SHoward Hinnant// find_if 8973e519524SHoward Hinnant 8983e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 89949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9003e519524SHoward Hinnant_InputIterator 9013e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9023e519524SHoward Hinnant{ 9033e519524SHoward Hinnant for (; __first != __last; ++__first) 9043e519524SHoward Hinnant if (__pred(*__first)) 9053e519524SHoward Hinnant break; 9063e519524SHoward Hinnant return __first; 9073e519524SHoward Hinnant} 9083e519524SHoward Hinnant 9093e519524SHoward Hinnant// find_if_not 9103e519524SHoward Hinnant 9113e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9128694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9133e519524SHoward Hinnant_InputIterator 9143e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9153e519524SHoward Hinnant{ 9163e519524SHoward Hinnant for (; __first != __last; ++__first) 9173e519524SHoward Hinnant if (!__pred(*__first)) 9183e519524SHoward Hinnant break; 9193e519524SHoward Hinnant return __first; 9203e519524SHoward Hinnant} 9213e519524SHoward Hinnant 9223e519524SHoward Hinnant// find_end 9233e519524SHoward Hinnant 9243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9258694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 9263e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9273e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9283e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9293e519524SHoward Hinnant{ 9303e519524SHoward Hinnant // modeled after search algorithm 9313e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9323e519524SHoward Hinnant if (__first2 == __last2) 9333e519524SHoward Hinnant return __r; 9343e519524SHoward Hinnant while (true) 9353e519524SHoward Hinnant { 9363e519524SHoward Hinnant while (true) 9373e519524SHoward Hinnant { 9383e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9393e519524SHoward Hinnant return __r; // (or __last1 if never found) 9403e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9413e519524SHoward Hinnant break; 9423e519524SHoward Hinnant ++__first1; 9433e519524SHoward Hinnant } 9443e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9453e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9463e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9473e519524SHoward Hinnant while (true) 9483e519524SHoward Hinnant { 9493e519524SHoward Hinnant if (++__m2 == __last2) 9503e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9513e519524SHoward Hinnant __r = __first1; 9523e519524SHoward Hinnant ++__first1; 9533e519524SHoward Hinnant break; 9543e519524SHoward Hinnant } 9553e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9563e519524SHoward Hinnant return __r; 9573e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9583e519524SHoward Hinnant { 9593e519524SHoward Hinnant ++__first1; 9603e519524SHoward Hinnant break; 9613e519524SHoward Hinnant } // else there is a match, check next elements 9623e519524SHoward Hinnant } 9633e519524SHoward Hinnant } 9643e519524SHoward Hinnant} 9653e519524SHoward Hinnant 9663e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9678694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 9683e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9693e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9703e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9713e519524SHoward Hinnant{ 9723e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9733e519524SHoward Hinnant if (__first2 == __last2) 9743e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9753e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9763e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9773e519524SHoward Hinnant --__l2; 9783e519524SHoward Hinnant while (true) 9793e519524SHoward Hinnant { 9803e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9813e519524SHoward Hinnant while (true) 9823e519524SHoward Hinnant { 9833e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9843e519524SHoward Hinnant return __last1; 9853e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9863e519524SHoward Hinnant break; 9873e519524SHoward Hinnant } 9883e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9893e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9903e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9913e519524SHoward Hinnant while (true) 9923e519524SHoward Hinnant { 9933e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9943e519524SHoward Hinnant return __m1; 9953e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9963e519524SHoward Hinnant return __last1; 9973e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9983e519524SHoward Hinnant { 9993e519524SHoward Hinnant break; 10003e519524SHoward Hinnant } // else there is a match, check next elements 10013e519524SHoward Hinnant } 10023e519524SHoward Hinnant } 10033e519524SHoward Hinnant} 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10069b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10073e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10083e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10093e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10103e519524SHoward Hinnant{ 10113e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10133e519524SHoward Hinnant if (__len2 == 0) 10143e519524SHoward Hinnant return __last1; 10153e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10163e519524SHoward Hinnant if (__len1 < __len2) 10173e519524SHoward Hinnant return __last1; 10183e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10193e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10203e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10213e519524SHoward Hinnant --__l2; 10223e519524SHoward Hinnant while (true) 10233e519524SHoward Hinnant { 10243e519524SHoward Hinnant while (true) 10253e519524SHoward Hinnant { 10263e519524SHoward Hinnant if (__s == __l1) 10273e519524SHoward Hinnant return __last1; 10283e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10293e519524SHoward Hinnant break; 10303e519524SHoward Hinnant } 10313e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10323e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10333e519524SHoward Hinnant while (true) 10343e519524SHoward Hinnant { 10353e519524SHoward Hinnant if (__m2 == __first2) 10363e519524SHoward Hinnant return __m1; 10373e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10383e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10393e519524SHoward Hinnant { 10403e519524SHoward Hinnant break; 10413e519524SHoward Hinnant } 10423e519524SHoward Hinnant } 10433e519524SHoward Hinnant } 10443e519524SHoward Hinnant} 10453e519524SHoward Hinnant 10463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10478694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10483e519524SHoward Hinnant_ForwardIterator1 10493e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10513e519524SHoward Hinnant{ 1052ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10533e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10543e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10553e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10563e519524SHoward Hinnant} 10573e519524SHoward Hinnant 10583e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10598694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10603e519524SHoward Hinnant_ForwardIterator1 10613e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10623e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10633e519524SHoward Hinnant{ 10643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1066ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10673e519524SHoward Hinnant} 10683e519524SHoward Hinnant 10693e519524SHoward Hinnant// find_first_of 10703e519524SHoward Hinnant 10713e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10729b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10739b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10743e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10753e519524SHoward Hinnant{ 10763e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10773e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10783e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10793e519524SHoward Hinnant return __first1; 10803e519524SHoward Hinnant return __last1; 10813e519524SHoward Hinnant} 10823e519524SHoward Hinnant 10839b0af34dSMarshall Clow 10849b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10858694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10869b0af34dSMarshall Clow_ForwardIterator1 10879b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10889b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10899b0af34dSMarshall Clow{ 10909b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10919b0af34dSMarshall Clow} 10929b0af34dSMarshall Clow 10933e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10948694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10953e519524SHoward Hinnant_ForwardIterator1 10963e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10973e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10983e519524SHoward Hinnant{ 10993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11003e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11019b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11023e519524SHoward Hinnant} 11033e519524SHoward Hinnant 11043e519524SHoward Hinnant// adjacent_find 11053e519524SHoward Hinnant 11063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11078694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11083e519524SHoward Hinnant_ForwardIterator 11093e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11103e519524SHoward Hinnant{ 11113e519524SHoward Hinnant if (__first != __last) 11123e519524SHoward Hinnant { 11133e519524SHoward Hinnant _ForwardIterator __i = __first; 11143e519524SHoward Hinnant while (++__i != __last) 11153e519524SHoward Hinnant { 11163e519524SHoward Hinnant if (__pred(*__first, *__i)) 11173e519524SHoward Hinnant return __first; 11183e519524SHoward Hinnant __first = __i; 11193e519524SHoward Hinnant } 11203e519524SHoward Hinnant } 11213e519524SHoward Hinnant return __last; 11223e519524SHoward Hinnant} 11233e519524SHoward Hinnant 11243e519524SHoward Hinnanttemplate <class _ForwardIterator> 11258694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11263e519524SHoward Hinnant_ForwardIterator 11273e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11283e519524SHoward Hinnant{ 11293e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1130ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11313e519524SHoward Hinnant} 11323e519524SHoward Hinnant 11333e519524SHoward Hinnant// count 11343e519524SHoward Hinnant 11353e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 1136056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11373e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1138e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11393e519524SHoward Hinnant{ 11403e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11413e519524SHoward Hinnant for (; __first != __last; ++__first) 1142e4383379SHoward Hinnant if (*__first == __value_) 11433e519524SHoward Hinnant ++__r; 11443e519524SHoward Hinnant return __r; 11453e519524SHoward Hinnant} 11463e519524SHoward Hinnant 11473e519524SHoward Hinnant// count_if 11483e519524SHoward Hinnant 11493e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 1150056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11513e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11523e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11533e519524SHoward Hinnant{ 11543e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11553e519524SHoward Hinnant for (; __first != __last; ++__first) 11563e519524SHoward Hinnant if (__pred(*__first)) 11573e519524SHoward Hinnant ++__r; 11583e519524SHoward Hinnant return __r; 11593e519524SHoward Hinnant} 11603e519524SHoward Hinnant 11613e519524SHoward Hinnant// mismatch 11623e519524SHoward Hinnant 11633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11646538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11653e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11663e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11673e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11683e519524SHoward Hinnant{ 1169bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11703e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11713e519524SHoward Hinnant break; 11723e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11733e519524SHoward Hinnant} 11743e519524SHoward Hinnant 11753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11766538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11773e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11783e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11813e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1182ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11833e519524SHoward Hinnant} 11843e519524SHoward Hinnant 11850b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11860b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11876538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11880b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11890b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11900b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11910b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11920b0bbd2fSMarshall Clow{ 1193bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11940b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11950b0bbd2fSMarshall Clow break; 11960b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11970b0bbd2fSMarshall Clow} 11980b0bbd2fSMarshall Clow 11990b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12006538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12010b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12020b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12030b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12040b0bbd2fSMarshall Clow{ 12050b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12060b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12070b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12080b0bbd2fSMarshall Clow} 12090b0bbd2fSMarshall Clow#endif 12100b0bbd2fSMarshall Clow 12113e519524SHoward Hinnant// equal 12123e519524SHoward Hinnant 12133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12146538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12153e519524SHoward Hinnantbool 12163e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12173e519524SHoward Hinnant{ 1218910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12193e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12203e519524SHoward Hinnant return false; 12213e519524SHoward Hinnant return true; 12223e519524SHoward Hinnant} 12233e519524SHoward Hinnant 12243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12256538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12263e519524SHoward Hinnantbool 12273e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12283e519524SHoward Hinnant{ 12293e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12303e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1231ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12323e519524SHoward Hinnant} 12333e519524SHoward Hinnant 12340b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12350b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12366538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12370b0bbd2fSMarshall Clowbool 12380b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12390b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12400b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12410b0bbd2fSMarshall Clow{ 1242910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12430b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12440b0bbd2fSMarshall Clow return false; 12450b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12460b0bbd2fSMarshall Clow} 12470b0bbd2fSMarshall Clow 12480b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12496538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12500b0bbd2fSMarshall Clowbool 12510b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12520b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12530b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12540b0bbd2fSMarshall Clow{ 12550b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12560b0bbd2fSMarshall Clow return false; 12570b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12580b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12590b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12600b0bbd2fSMarshall Clow} 12610b0bbd2fSMarshall Clow 12620b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12636538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12640b0bbd2fSMarshall Clowbool 12650b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12660b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12670b0bbd2fSMarshall Clow{ 12680b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12690b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12700b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12710b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12720b0bbd2fSMarshall Clow} 12730b0bbd2fSMarshall Clow 12740b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12756538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12760b0bbd2fSMarshall Clowbool 12770b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12780b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12790b0bbd2fSMarshall Clow{ 12800b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12810b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12820b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12830b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12840b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12850b0bbd2fSMarshall Clow} 12860b0bbd2fSMarshall Clow#endif 12870b0bbd2fSMarshall Clow 12883e519524SHoward Hinnant// is_permutation 12893e519524SHoward Hinnant 12903e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 129149c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 12923e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12933e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12943e519524SHoward Hinnant{ 129549c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1296910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12973e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 129849c7643cSMarshall Clow break; 129949c7643cSMarshall Clow if (__first1 == __last1) 13003e519524SHoward Hinnant return true; 130149c7643cSMarshall Clow 13023e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 13033e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1304ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13053e519524SHoward Hinnant if (__l1 == _D1(1)) 13063e519524SHoward Hinnant return false; 1307ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13083e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13093e519524SHoward Hinnant // equal elements in [f2, l2) 13103e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13113e519524SHoward Hinnant { 13123e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1313939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1314939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1315939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1316939b1623SPeter Collingbourne break; 1317939b1623SPeter Collingbourne if (__match == __i) { 13183e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13193e519524SHoward Hinnant _D1 __c2 = 0; 13203e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13213e519524SHoward Hinnant if (__pred(*__i, *__j)) 13223e519524SHoward Hinnant ++__c2; 13233e519524SHoward Hinnant if (__c2 == 0) 13243e519524SHoward Hinnant return false; 13253e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13263e519524SHoward Hinnant _D1 __c1 = 1; 1327ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13283e519524SHoward Hinnant if (__pred(*__i, *__j)) 13293e519524SHoward Hinnant ++__c1; 13303e519524SHoward Hinnant if (__c1 != __c2) 13313e519524SHoward Hinnant return false; 13323e519524SHoward Hinnant } 13333e519524SHoward Hinnant } 13343e519524SHoward Hinnant return true; 13353e519524SHoward Hinnant} 13363e519524SHoward Hinnant 13373e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 133849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13393e519524SHoward Hinnantbool 13403e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13413e519524SHoward Hinnant _ForwardIterator2 __first2) 13423e519524SHoward Hinnant{ 13433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1345ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13463e519524SHoward Hinnant} 13473e519524SHoward Hinnant 13480b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13490b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 135049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13510b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13520b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13530b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13540b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13550b0bbd2fSMarshall Clow{ 135649c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1357847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13580b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 135949c7643cSMarshall Clow break; 136049c7643cSMarshall Clow if (__first1 == __last1) 136149c7643cSMarshall Clow return __first2 == __last2; 136249c7643cSMarshall Clow else if (__first2 == __last2) 136349c7643cSMarshall Clow return false; 136449c7643cSMarshall Clow 13650b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13660b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13670b0bbd2fSMarshall Clow 13680b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1369fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13700b0bbd2fSMarshall Clow if (__l1 != __l2) 13710b0bbd2fSMarshall Clow return false; 13720b0bbd2fSMarshall Clow 13730b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13740b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13750b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13760b0bbd2fSMarshall Clow { 13770b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1378939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1379939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1380939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1381939b1623SPeter Collingbourne break; 1382939b1623SPeter Collingbourne if (__match == __i) { 13830b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13840b0bbd2fSMarshall Clow _D1 __c2 = 0; 13850b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13860b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13870b0bbd2fSMarshall Clow ++__c2; 13880b0bbd2fSMarshall Clow if (__c2 == 0) 13890b0bbd2fSMarshall Clow return false; 13900b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13910b0bbd2fSMarshall Clow _D1 __c1 = 1; 13920b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13930b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13940b0bbd2fSMarshall Clow ++__c1; 13950b0bbd2fSMarshall Clow if (__c1 != __c2) 13960b0bbd2fSMarshall Clow return false; 13970b0bbd2fSMarshall Clow } 13980b0bbd2fSMarshall Clow } 13990b0bbd2fSMarshall Clow return true; 14000b0bbd2fSMarshall Clow} 14010b0bbd2fSMarshall Clow 14020b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 140349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14040b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14050b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14060b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14070b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14080b0bbd2fSMarshall Clow{ 14090b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14100b0bbd2fSMarshall Clow return false; 14110b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14120b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14130b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14140b0bbd2fSMarshall Clow} 14150b0bbd2fSMarshall Clow 14160b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 141749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14180b0bbd2fSMarshall Clowbool 14190b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14200b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14210b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14220b0bbd2fSMarshall Clow{ 14230b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14240b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14250b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14260b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14270b0bbd2fSMarshall Clow} 14280b0bbd2fSMarshall Clow 14290b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 143049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14310b0bbd2fSMarshall Clowbool 14320b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14330b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14340b0bbd2fSMarshall Clow{ 14350b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14360b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14370b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14380b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14390b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14400b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14410b0bbd2fSMarshall Clow} 14420b0bbd2fSMarshall Clow#endif 14430b0bbd2fSMarshall Clow 14443e519524SHoward Hinnant// search 1445d835e592SMarshall Clow// __search is in <functional> 14463e519524SHoward Hinnant 14473e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 144812f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14493e519524SHoward Hinnant_ForwardIterator1 14503e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14513e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 14523e519524SHoward Hinnant{ 1453ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 14543e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 145528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 145628cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 145728cc4ddeSMarshall Clow .first; 14583e519524SHoward Hinnant} 14593e519524SHoward Hinnant 14603e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 146112f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14623e519524SHoward Hinnant_ForwardIterator1 14633e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14643e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14653e519524SHoward Hinnant{ 146628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 146728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1468ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 14693e519524SHoward Hinnant} 14703e519524SHoward Hinnant 1471d835e592SMarshall Clow 1472d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1473d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 147412f0a779SMarshall Clow_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1475d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1476d835e592SMarshall Clow{ return __s(__f, __l).first; } 1477d835e592SMarshall Clow#endif 1478d835e592SMarshall Clow 14793e519524SHoward Hinnant// search_n 14803e519524SHoward Hinnant 14813e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 148212f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 14833e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1484e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 14853e519524SHoward Hinnant{ 14863e519524SHoward Hinnant if (__count <= 0) 14873e519524SHoward Hinnant return __first; 14883e519524SHoward Hinnant while (true) 14893e519524SHoward Hinnant { 1490e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 14913e519524SHoward Hinnant while (true) 14923e519524SHoward Hinnant { 1493e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 14943e519524SHoward Hinnant return __last; 1495e4383379SHoward Hinnant if (__pred(*__first, __value_)) 14963e519524SHoward Hinnant break; 14973e519524SHoward Hinnant ++__first; 14983e519524SHoward Hinnant } 1499e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15003e519524SHoward Hinnant _ForwardIterator __m = __first; 15013e519524SHoward Hinnant _Size __c(0); 15023e519524SHoward Hinnant while (true) 15033e519524SHoward Hinnant { 15043e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15053e519524SHoward Hinnant return __first; 15063e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15073e519524SHoward Hinnant return __last; 1508e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15093e519524SHoward Hinnant { 15103e519524SHoward Hinnant __first = __m; 15113e519524SHoward Hinnant ++__first; 15123e519524SHoward Hinnant break; 15133e519524SHoward Hinnant } // else there is a match, check next elements 15143e519524SHoward Hinnant } 15153e519524SHoward Hinnant } 15163e519524SHoward Hinnant} 15173e519524SHoward Hinnant 15183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 151912f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 15203e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1521e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15223e519524SHoward Hinnant{ 15233e519524SHoward Hinnant if (__count <= 0) 15243e519524SHoward Hinnant return __first; 15253e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15263e519524SHoward Hinnant if (__len < __count) 15273e519524SHoward Hinnant return __last; 15283e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15293e519524SHoward Hinnant while (true) 15303e519524SHoward Hinnant { 1531e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15323e519524SHoward Hinnant while (true) 15333e519524SHoward Hinnant { 1534b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 15353e519524SHoward Hinnant return __last; 1536e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15373e519524SHoward Hinnant break; 15383e519524SHoward Hinnant ++__first; 15393e519524SHoward Hinnant } 1540e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15413e519524SHoward Hinnant _RandomAccessIterator __m = __first; 15423e519524SHoward Hinnant _Size __c(0); 15433e519524SHoward Hinnant while (true) 15443e519524SHoward Hinnant { 15453e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15463e519524SHoward Hinnant return __first; 15473e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1548e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15493e519524SHoward Hinnant { 15503e519524SHoward Hinnant __first = __m; 15513e519524SHoward Hinnant ++__first; 15523e519524SHoward Hinnant break; 15533e519524SHoward Hinnant } // else there is a match, check next elements 15543e519524SHoward Hinnant } 15553e519524SHoward Hinnant } 15563e519524SHoward Hinnant} 15573e519524SHoward Hinnant 15583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 155912f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15603e519524SHoward Hinnant_ForwardIterator 15613e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1562e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 15633e519524SHoward Hinnant{ 1564ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 156551544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 156651544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 15673e519524SHoward Hinnant} 15683e519524SHoward Hinnant 15693e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 157012f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15713e519524SHoward Hinnant_ForwardIterator 1572e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 15733e519524SHoward Hinnant{ 15743e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 157551544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 157651544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 15773e519524SHoward Hinnant} 15783e519524SHoward Hinnant 15793e519524SHoward Hinnant// copy 15803e519524SHoward Hinnanttemplate <class _Iter> 15813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15823e519524SHoward Hinnant_Iter 15833e519524SHoward Hinnant__unwrap_iter(_Iter __i) 15843e519524SHoward Hinnant{ 15853e519524SHoward Hinnant return __i; 15863e519524SHoward Hinnant} 15873e519524SHoward Hinnant 15883e519524SHoward Hinnanttemplate <class _Tp> 15895b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15903e519524SHoward Hinnanttypename enable_if 15913e519524SHoward Hinnant< 1592ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 15933e519524SHoward Hinnant _Tp* 15943e519524SHoward Hinnant>::type 15953e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 15963e519524SHoward Hinnant{ 15973e519524SHoward Hinnant return __i.base(); 15983e519524SHoward Hinnant} 15993e519524SHoward Hinnant 1600fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1601fc88dbd2SHoward Hinnant 16023e519524SHoward Hinnanttemplate <class _Tp> 16039cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 16043e519524SHoward Hinnanttypename enable_if 16053e519524SHoward Hinnant< 1606ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16073e519524SHoward Hinnant _Tp* 16083e519524SHoward Hinnant>::type 16093e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16103e519524SHoward Hinnant{ 16113e519524SHoward Hinnant return __i.base(); 16123e519524SHoward Hinnant} 16133e519524SHoward Hinnant 161414bd0bf0SEric Fiselier#else 161514bd0bf0SEric Fiselier 161614bd0bf0SEric Fiseliertemplate <class _Tp> 16179cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 161814bd0bf0SEric Fiseliertypename enable_if 161914bd0bf0SEric Fiselier< 162014bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 162114bd0bf0SEric Fiselier __wrap_iter<_Tp*> 162214bd0bf0SEric Fiselier>::type 162314bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 162414bd0bf0SEric Fiselier{ 162514bd0bf0SEric Fiselier return __i; 162614bd0bf0SEric Fiselier} 162714bd0bf0SEric Fiselier 1628fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1629fc88dbd2SHoward Hinnant 16303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16323e519524SHoward Hinnant_OutputIterator 16333e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16343e519524SHoward Hinnant{ 1635910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 16363e519524SHoward Hinnant *__result = *__first; 16373e519524SHoward Hinnant return __result; 16383e519524SHoward Hinnant} 16393e519524SHoward Hinnant 16403e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16423e519524SHoward Hinnanttypename enable_if 16433e519524SHoward Hinnant< 16443e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1645ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16463e519524SHoward Hinnant _Up* 16473e519524SHoward Hinnant>::type 16483e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 16493e519524SHoward Hinnant{ 16503e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16515b312052SMarshall Clow if (__n > 0) 1652ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16533e519524SHoward Hinnant return __result + __n; 16543e519524SHoward Hinnant} 16553e519524SHoward Hinnant 16563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16583e519524SHoward Hinnant_OutputIterator 16593e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16603e519524SHoward Hinnant{ 1661ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 16623e519524SHoward Hinnant} 16633e519524SHoward Hinnant 16643e519524SHoward Hinnant// copy_backward 16653e519524SHoward Hinnant 1666d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 16673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16683e519524SHoward Hinnant_OutputIterator 1669d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 16703e519524SHoward Hinnant{ 16713e519524SHoward Hinnant while (__first != __last) 16723e519524SHoward Hinnant *--__result = *--__last; 16733e519524SHoward Hinnant return __result; 16743e519524SHoward Hinnant} 16753e519524SHoward Hinnant 16763e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16783e519524SHoward Hinnanttypename enable_if 16793e519524SHoward Hinnant< 16803e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1681ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 16823e519524SHoward Hinnant _Up* 16833e519524SHoward Hinnant>::type 16843e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 16853e519524SHoward Hinnant{ 16863e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 16875b312052SMarshall Clow if (__n > 0) 16885b312052SMarshall Clow { 16893e519524SHoward Hinnant __result -= __n; 1690ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 16915b312052SMarshall Clow } 16923e519524SHoward Hinnant return __result; 16933e519524SHoward Hinnant} 16943e519524SHoward Hinnant 16953e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 16963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16973e519524SHoward Hinnant_BidirectionalIterator2 16983e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 16993e519524SHoward Hinnant _BidirectionalIterator2 __result) 17003e519524SHoward Hinnant{ 1701fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1702fd838227SEric Fiselier __unwrap_iter(__last), 1703fd838227SEric Fiselier __unwrap_iter(__result)); 17043e519524SHoward Hinnant} 17053e519524SHoward Hinnant 17063e519524SHoward Hinnant// copy_if 17073e519524SHoward Hinnant 17083e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17103e519524SHoward Hinnant_OutputIterator 17113e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17123e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17133e519524SHoward Hinnant{ 17143e519524SHoward Hinnant for (; __first != __last; ++__first) 17153e519524SHoward Hinnant { 17163e519524SHoward Hinnant if (__pred(*__first)) 17173e519524SHoward Hinnant { 17183e519524SHoward Hinnant *__result = *__first; 17193e519524SHoward Hinnant ++__result; 17203e519524SHoward Hinnant } 17213e519524SHoward Hinnant } 17223e519524SHoward Hinnant return __result; 17233e519524SHoward Hinnant} 17243e519524SHoward Hinnant 17253e519524SHoward Hinnant// copy_n 17263e519524SHoward Hinnant 17273e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17293e519524SHoward Hinnanttypename enable_if 17303e519524SHoward Hinnant< 17313e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17323e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17333e519524SHoward Hinnant _OutputIterator 17343e519524SHoward Hinnant>::type 173551544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17363e519524SHoward Hinnant{ 173751544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 173851544023SEric Fiselier _IntegralSize __n = __orig_n; 173999847d2bSHoward Hinnant if (__n > 0) 174099847d2bSHoward Hinnant { 17413e519524SHoward Hinnant *__result = *__first; 174299847d2bSHoward Hinnant ++__result; 174399847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 174499847d2bSHoward Hinnant { 174599847d2bSHoward Hinnant ++__first; 174699847d2bSHoward Hinnant *__result = *__first; 174799847d2bSHoward Hinnant ++__result; 174899847d2bSHoward Hinnant } 174999847d2bSHoward Hinnant } 17503e519524SHoward Hinnant return __result; 17513e519524SHoward Hinnant} 17523e519524SHoward Hinnant 17533e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17553e519524SHoward Hinnanttypename enable_if 17563e519524SHoward Hinnant< 17573e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 17583e519524SHoward Hinnant _OutputIterator 17593e519524SHoward Hinnant>::type 176051544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17613e519524SHoward Hinnant{ 176251544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 176351544023SEric Fiselier _IntegralSize __n = __orig_n; 1764ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 17653e519524SHoward Hinnant} 17663e519524SHoward Hinnant 17673e519524SHoward Hinnant// move 17683e519524SHoward Hinnant 17693e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17713e519524SHoward Hinnant_OutputIterator 17723e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17733e519524SHoward Hinnant{ 1774910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1775ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 17763e519524SHoward Hinnant return __result; 17773e519524SHoward Hinnant} 17783e519524SHoward Hinnant 17793e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17813e519524SHoward Hinnanttypename enable_if 17823e519524SHoward Hinnant< 17833e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1784ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17853e519524SHoward Hinnant _Up* 17863e519524SHoward Hinnant>::type 17873e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 17883e519524SHoward Hinnant{ 17893e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17905b312052SMarshall Clow if (__n > 0) 1791ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17923e519524SHoward Hinnant return __result + __n; 17933e519524SHoward Hinnant} 17943e519524SHoward Hinnant 17953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17973e519524SHoward Hinnant_OutputIterator 17983e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17993e519524SHoward Hinnant{ 1800ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18013e519524SHoward Hinnant} 18023e519524SHoward Hinnant 18033e519524SHoward Hinnant// move_backward 18043e519524SHoward Hinnant 18053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18073e519524SHoward Hinnant_OutputIterator 18083e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18093e519524SHoward Hinnant{ 18103e519524SHoward Hinnant while (__first != __last) 1811ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18123e519524SHoward Hinnant return __result; 18133e519524SHoward Hinnant} 18143e519524SHoward Hinnant 18153e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18173e519524SHoward Hinnanttypename enable_if 18183e519524SHoward Hinnant< 18193e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1820ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18213e519524SHoward Hinnant _Up* 18223e519524SHoward Hinnant>::type 18233e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18243e519524SHoward Hinnant{ 18253e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18265b312052SMarshall Clow if (__n > 0) 18275b312052SMarshall Clow { 18283e519524SHoward Hinnant __result -= __n; 1829ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18305b312052SMarshall Clow } 18313e519524SHoward Hinnant return __result; 18323e519524SHoward Hinnant} 18333e519524SHoward Hinnant 18343e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18363e519524SHoward Hinnant_BidirectionalIterator2 18373e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18383e519524SHoward Hinnant _BidirectionalIterator2 __result) 18393e519524SHoward Hinnant{ 1840ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18413e519524SHoward Hinnant} 18423e519524SHoward Hinnant 18433e519524SHoward Hinnant// iter_swap 18443e519524SHoward Hinnant 1845a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 18463e519524SHoward Hinnant 18473e519524SHoward Hinnant// transform 18483e519524SHoward Hinnant 18493e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 185099894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18513e519524SHoward Hinnant_OutputIterator 18523e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 18533e519524SHoward Hinnant{ 1854910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18553e519524SHoward Hinnant *__result = __op(*__first); 18563e519524SHoward Hinnant return __result; 18573e519524SHoward Hinnant} 18583e519524SHoward Hinnant 18593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 186099894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18613e519524SHoward Hinnant_OutputIterator 18623e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 18633e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 18643e519524SHoward Hinnant{ 1865910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 18663e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 18673e519524SHoward Hinnant return __result; 18683e519524SHoward Hinnant} 18693e519524SHoward Hinnant 18703e519524SHoward Hinnant// replace 18713e519524SHoward Hinnant 18723e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 187312c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18743e519524SHoward Hinnantvoid 18753e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 18763e519524SHoward Hinnant{ 18773e519524SHoward Hinnant for (; __first != __last; ++__first) 18783e519524SHoward Hinnant if (*__first == __old_value) 18793e519524SHoward Hinnant *__first = __new_value; 18803e519524SHoward Hinnant} 18813e519524SHoward Hinnant 18823e519524SHoward Hinnant// replace_if 18833e519524SHoward Hinnant 18843e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 188512c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18863e519524SHoward Hinnantvoid 18873e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 18883e519524SHoward Hinnant{ 18893e519524SHoward Hinnant for (; __first != __last; ++__first) 18903e519524SHoward Hinnant if (__pred(*__first)) 18913e519524SHoward Hinnant *__first = __new_value; 18923e519524SHoward Hinnant} 18933e519524SHoward Hinnant 18943e519524SHoward Hinnant// replace_copy 18953e519524SHoward Hinnant 18963e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 189712c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 18983e519524SHoward Hinnant_OutputIterator 18993e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19003e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19013e519524SHoward Hinnant{ 1902910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19033e519524SHoward Hinnant if (*__first == __old_value) 19043e519524SHoward Hinnant *__result = __new_value; 19053e519524SHoward Hinnant else 19063e519524SHoward Hinnant *__result = *__first; 19073e519524SHoward Hinnant return __result; 19083e519524SHoward Hinnant} 19093e519524SHoward Hinnant 19103e519524SHoward Hinnant// replace_copy_if 19113e519524SHoward Hinnant 19123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 191312c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19143e519524SHoward Hinnant_OutputIterator 19153e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19163e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19173e519524SHoward Hinnant{ 1918910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19193e519524SHoward Hinnant if (__pred(*__first)) 19203e519524SHoward Hinnant *__result = __new_value; 19213e519524SHoward Hinnant else 19223e519524SHoward Hinnant *__result = *__first; 19233e519524SHoward Hinnant return __result; 19243e519524SHoward Hinnant} 19253e519524SHoward Hinnant 19263e519524SHoward Hinnant// fill_n 19273e519524SHoward Hinnant 19283e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19294bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19303e519524SHoward Hinnant_OutputIterator 19310f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19323e519524SHoward Hinnant{ 1933910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1934e4383379SHoward Hinnant *__first = __value_; 19353e519524SHoward Hinnant return __first; 19363e519524SHoward Hinnant} 19373e519524SHoward Hinnant 19383e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19394bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19403e519524SHoward Hinnant_OutputIterator 1941e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19423e519524SHoward Hinnant{ 194351544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 19443e519524SHoward Hinnant} 19453e519524SHoward Hinnant 19463e519524SHoward Hinnant// fill 19473e519524SHoward Hinnant 19483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19494bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19503e519524SHoward Hinnantvoid 1951e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 19523e519524SHoward Hinnant{ 19533e519524SHoward Hinnant for (; __first != __last; ++__first) 1954e4383379SHoward Hinnant *__first = __value_; 19553e519524SHoward Hinnant} 19563e519524SHoward Hinnant 19573e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 19584bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19593e519524SHoward Hinnantvoid 1960e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 19613e519524SHoward Hinnant{ 1962e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 19633e519524SHoward Hinnant} 19643e519524SHoward Hinnant 19653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19664bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19673e519524SHoward Hinnantvoid 1968e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 19693e519524SHoward Hinnant{ 1970e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 19713e519524SHoward Hinnant} 19723e519524SHoward Hinnant 19733e519524SHoward Hinnant// generate 19743e519524SHoward Hinnant 19753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 19764bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19773e519524SHoward Hinnantvoid 19783e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 19793e519524SHoward Hinnant{ 19803e519524SHoward Hinnant for (; __first != __last; ++__first) 19813e519524SHoward Hinnant *__first = __gen(); 19823e519524SHoward Hinnant} 19833e519524SHoward Hinnant 19843e519524SHoward Hinnant// generate_n 19853e519524SHoward Hinnant 19863e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 19874bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19883e519524SHoward Hinnant_OutputIterator 198951544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 19903e519524SHoward Hinnant{ 199151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 199251544023SEric Fiselier _IntegralSize __n = __orig_n; 1993910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 19943e519524SHoward Hinnant *__first = __gen(); 19953e519524SHoward Hinnant return __first; 19963e519524SHoward Hinnant} 19973e519524SHoward Hinnant 19983e519524SHoward Hinnant// remove 19993e519524SHoward Hinnant 20003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 2001e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2002e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20033e519524SHoward Hinnant{ 2004e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20053e519524SHoward Hinnant if (__first != __last) 20063e519524SHoward Hinnant { 20073e519524SHoward Hinnant _ForwardIterator __i = __first; 20083e519524SHoward Hinnant while (++__i != __last) 20093e519524SHoward Hinnant { 2010e4383379SHoward Hinnant if (!(*__i == __value_)) 20113e519524SHoward Hinnant { 2012ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20133e519524SHoward Hinnant ++__first; 20143e519524SHoward Hinnant } 20153e519524SHoward Hinnant } 20163e519524SHoward Hinnant } 20173e519524SHoward Hinnant return __first; 20183e519524SHoward Hinnant} 20193e519524SHoward Hinnant 20203e519524SHoward Hinnant// remove_if 20213e519524SHoward Hinnant 20223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 2023e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20243e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20253e519524SHoward Hinnant{ 2026ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20273e519524SHoward Hinnant (__first, __last, __pred); 20283e519524SHoward Hinnant if (__first != __last) 20293e519524SHoward Hinnant { 20303e519524SHoward Hinnant _ForwardIterator __i = __first; 20313e519524SHoward Hinnant while (++__i != __last) 20323e519524SHoward Hinnant { 20333e519524SHoward Hinnant if (!__pred(*__i)) 20343e519524SHoward Hinnant { 2035ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20363e519524SHoward Hinnant ++__first; 20373e519524SHoward Hinnant } 20383e519524SHoward Hinnant } 20393e519524SHoward Hinnant } 20403e519524SHoward Hinnant return __first; 20413e519524SHoward Hinnant} 20423e519524SHoward Hinnant 20433e519524SHoward Hinnant// remove_copy 20443e519524SHoward Hinnant 20453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2046e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20473e519524SHoward Hinnant_OutputIterator 2048e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 20493e519524SHoward Hinnant{ 20503e519524SHoward Hinnant for (; __first != __last; ++__first) 20513e519524SHoward Hinnant { 2052e4383379SHoward Hinnant if (!(*__first == __value_)) 20533e519524SHoward Hinnant { 20543e519524SHoward Hinnant *__result = *__first; 20553e519524SHoward Hinnant ++__result; 20563e519524SHoward Hinnant } 20573e519524SHoward Hinnant } 20583e519524SHoward Hinnant return __result; 20593e519524SHoward Hinnant} 20603e519524SHoward Hinnant 20613e519524SHoward Hinnant// remove_copy_if 20623e519524SHoward Hinnant 20633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2064e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20653e519524SHoward Hinnant_OutputIterator 20663e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 20673e519524SHoward Hinnant{ 20683e519524SHoward Hinnant for (; __first != __last; ++__first) 20693e519524SHoward Hinnant { 20703e519524SHoward Hinnant if (!__pred(*__first)) 20713e519524SHoward Hinnant { 20723e519524SHoward Hinnant *__result = *__first; 20733e519524SHoward Hinnant ++__result; 20743e519524SHoward Hinnant } 20753e519524SHoward Hinnant } 20763e519524SHoward Hinnant return __result; 20773e519524SHoward Hinnant} 20783e519524SHoward Hinnant 20793e519524SHoward Hinnant// unique 20803e519524SHoward Hinnant 20813e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 20824bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 20833e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 20843e519524SHoward Hinnant{ 2085ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 20863e519524SHoward Hinnant (__first, __last, __pred); 20873e519524SHoward Hinnant if (__first != __last) 20883e519524SHoward Hinnant { 20893e519524SHoward Hinnant // ... a a ? ... 20903e519524SHoward Hinnant // f i 20913e519524SHoward Hinnant _ForwardIterator __i = __first; 20923e519524SHoward Hinnant for (++__i; ++__i != __last;) 20933e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2094ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 20953e519524SHoward Hinnant ++__first; 20963e519524SHoward Hinnant } 20973e519524SHoward Hinnant return __first; 20983e519524SHoward Hinnant} 20993e519524SHoward Hinnant 21003e519524SHoward Hinnanttemplate <class _ForwardIterator> 21014bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21023e519524SHoward Hinnant_ForwardIterator 21033e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21043e519524SHoward Hinnant{ 21053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2106ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21073e519524SHoward Hinnant} 21083e519524SHoward Hinnant 21093e519524SHoward Hinnant// unique_copy 21103e519524SHoward Hinnant 21113e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21124bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21133e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21143e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21153e519524SHoward Hinnant{ 21163e519524SHoward Hinnant if (__first != __last) 21173e519524SHoward Hinnant { 21183e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21193e519524SHoward Hinnant *__result = __t; 21203e519524SHoward Hinnant ++__result; 21213e519524SHoward Hinnant while (++__first != __last) 21223e519524SHoward Hinnant { 21233e519524SHoward Hinnant if (!__pred(__t, *__first)) 21243e519524SHoward Hinnant { 21253e519524SHoward Hinnant __t = *__first; 21263e519524SHoward Hinnant *__result = __t; 21273e519524SHoward Hinnant ++__result; 21283e519524SHoward Hinnant } 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant } 21313e519524SHoward Hinnant return __result; 21323e519524SHoward Hinnant} 21333e519524SHoward Hinnant 21343e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 21354bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 21363e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21373e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 21383e519524SHoward Hinnant{ 21393e519524SHoward Hinnant if (__first != __last) 21403e519524SHoward Hinnant { 21413e519524SHoward Hinnant _ForwardIterator __i = __first; 21423e519524SHoward Hinnant *__result = *__i; 21433e519524SHoward Hinnant ++__result; 21443e519524SHoward Hinnant while (++__first != __last) 21453e519524SHoward Hinnant { 21463e519524SHoward Hinnant if (!__pred(*__i, *__first)) 21473e519524SHoward Hinnant { 21483e519524SHoward Hinnant *__result = *__first; 21493e519524SHoward Hinnant ++__result; 21503e519524SHoward Hinnant __i = __first; 21513e519524SHoward Hinnant } 21523e519524SHoward Hinnant } 21533e519524SHoward Hinnant } 21543e519524SHoward Hinnant return __result; 21553e519524SHoward Hinnant} 21563e519524SHoward Hinnant 21573e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 21584bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21593e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 21603e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 21613e519524SHoward Hinnant{ 21623e519524SHoward Hinnant if (__first != __last) 21633e519524SHoward Hinnant { 21643e519524SHoward Hinnant *__result = *__first; 21653e519524SHoward Hinnant while (++__first != __last) 21663e519524SHoward Hinnant if (!__pred(*__result, *__first)) 21673e519524SHoward Hinnant *++__result = *__first; 21683e519524SHoward Hinnant ++__result; 21693e519524SHoward Hinnant } 21703e519524SHoward Hinnant return __result; 21713e519524SHoward Hinnant} 21723e519524SHoward Hinnant 21733e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 21744bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21753e519524SHoward Hinnant_OutputIterator 21763e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 21773e519524SHoward Hinnant{ 2178ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 21793e519524SHoward Hinnant (__first, __last, __result, __pred, 21803e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 21813e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 21823e519524SHoward Hinnant} 21833e519524SHoward Hinnant 21843e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 21854bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21863e519524SHoward Hinnant_OutputIterator 21873e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 21883e519524SHoward Hinnant{ 21893e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2190ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 21913e519524SHoward Hinnant} 21923e519524SHoward Hinnant 21933e519524SHoward Hinnant// reverse 21943e519524SHoward Hinnant 21953e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 21963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21973e519524SHoward Hinnantvoid 21983e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 21993e519524SHoward Hinnant{ 22003e519524SHoward Hinnant while (__first != __last) 22013e519524SHoward Hinnant { 22023e519524SHoward Hinnant if (__first == --__last) 22033e519524SHoward Hinnant break; 2204def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22053e519524SHoward Hinnant ++__first; 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant} 22083e519524SHoward Hinnant 22093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22113e519524SHoward Hinnantvoid 22123e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22133e519524SHoward Hinnant{ 22143e519524SHoward Hinnant if (__first != __last) 22153e519524SHoward Hinnant for (; __first < --__last; ++__first) 2216def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22173e519524SHoward Hinnant} 22183e519524SHoward Hinnant 22193e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22213e519524SHoward Hinnantvoid 22223e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22233e519524SHoward Hinnant{ 2224ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22253e519524SHoward Hinnant} 22263e519524SHoward Hinnant 22273e519524SHoward Hinnant// reverse_copy 22283e519524SHoward Hinnant 22293e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2230e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22313e519524SHoward Hinnant_OutputIterator 22323e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 22333e519524SHoward Hinnant{ 22343e519524SHoward Hinnant for (; __first != __last; ++__result) 22353e519524SHoward Hinnant *__result = *--__last; 22363e519524SHoward Hinnant return __result; 22373e519524SHoward Hinnant} 22383e519524SHoward Hinnant 22393e519524SHoward Hinnant// rotate 22403e519524SHoward Hinnant 22413e519524SHoward Hinnanttemplate <class _ForwardIterator> 22423e519524SHoward Hinnant_ForwardIterator 2243aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 22443e519524SHoward Hinnant{ 2245aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2246aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2247aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2248aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2249aca09de3SHoward Hinnant return __lm1; 2250aca09de3SHoward Hinnant} 2251aca09de3SHoward Hinnant 2252aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2253aca09de3SHoward Hinnant_BidirectionalIterator 2254aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2255aca09de3SHoward Hinnant{ 2256aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2257aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2258aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2259aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2260aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2261aca09de3SHoward Hinnant return __fp1; 2262aca09de3SHoward Hinnant} 2263aca09de3SHoward Hinnant 2264aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2265aca09de3SHoward Hinnant_ForwardIterator 2266aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2267aca09de3SHoward Hinnant{ 22683e519524SHoward Hinnant _ForwardIterator __i = __middle; 22693e519524SHoward Hinnant while (true) 22703e519524SHoward Hinnant { 22713e519524SHoward Hinnant swap(*__first, *__i); 22723e519524SHoward Hinnant ++__first; 22733e519524SHoward Hinnant if (++__i == __last) 22743e519524SHoward Hinnant break; 22753e519524SHoward Hinnant if (__first == __middle) 22763e519524SHoward Hinnant __middle = __i; 22773e519524SHoward Hinnant } 22783e519524SHoward Hinnant _ForwardIterator __r = __first; 22793e519524SHoward Hinnant if (__first != __middle) 22803e519524SHoward Hinnant { 22813e519524SHoward Hinnant __i = __middle; 22823e519524SHoward Hinnant while (true) 22833e519524SHoward Hinnant { 22843e519524SHoward Hinnant swap(*__first, *__i); 22853e519524SHoward Hinnant ++__first; 22863e519524SHoward Hinnant if (++__i == __last) 22873e519524SHoward Hinnant { 22883e519524SHoward Hinnant if (__first == __middle) 22893e519524SHoward Hinnant break; 22903e519524SHoward Hinnant __i = __middle; 22913e519524SHoward Hinnant } 22923e519524SHoward Hinnant else if (__first == __middle) 22933e519524SHoward Hinnant __middle = __i; 22943e519524SHoward Hinnant } 22953e519524SHoward Hinnant } 22963e519524SHoward Hinnant return __r; 22973e519524SHoward Hinnant} 22983e519524SHoward Hinnant 22993e519524SHoward Hinnanttemplate<typename _Integral> 23003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23013e519524SHoward Hinnant_Integral 230219b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23033e519524SHoward Hinnant{ 23043e519524SHoward Hinnant do 23053e519524SHoward Hinnant { 23063e519524SHoward Hinnant _Integral __t = __x % __y; 23073e519524SHoward Hinnant __x = __y; 23083e519524SHoward Hinnant __y = __t; 23093e519524SHoward Hinnant } while (__y); 23103e519524SHoward Hinnant return __x; 23113e519524SHoward Hinnant} 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23143e519524SHoward Hinnant_RandomAccessIterator 2315aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23163e519524SHoward Hinnant{ 23173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23193e519524SHoward Hinnant 23203e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23213e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23223e519524SHoward Hinnant if (__m1 == __m2) 23233e519524SHoward Hinnant { 2324ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23253e519524SHoward Hinnant return __middle; 23263e519524SHoward Hinnant } 232719b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 23283e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 23293e519524SHoward Hinnant { 2330aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 23313e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 23323e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 23333e519524SHoward Hinnant do 23343e519524SHoward Hinnant { 2335aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 23363e519524SHoward Hinnant __p1 = __p2; 23373e519524SHoward Hinnant const difference_type __d = __last - __p2; 23383e519524SHoward Hinnant if (__m1 < __d) 23393e519524SHoward Hinnant __p2 += __m1; 23403e519524SHoward Hinnant else 23413e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 23423e519524SHoward Hinnant } while (__p2 != __p); 2343aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 23443e519524SHoward Hinnant } 23453e519524SHoward Hinnant return __first + __m2; 23463e519524SHoward Hinnant} 23473e519524SHoward Hinnant 23483e519524SHoward Hinnanttemplate <class _ForwardIterator> 23493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23503e519524SHoward Hinnant_ForwardIterator 2351aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2352aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2353aca09de3SHoward Hinnant{ 2354aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2355aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2356aca09de3SHoward Hinnant { 2357aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2358aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2359aca09de3SHoward Hinnant } 2360aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2361aca09de3SHoward Hinnant} 2362aca09de3SHoward Hinnant 2363aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2364aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2365aca09de3SHoward Hinnant_BidirectionalIterator 2366aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2367aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2368aca09de3SHoward Hinnant{ 2369aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2370aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2371aca09de3SHoward Hinnant { 2372aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2373aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2374aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2375aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2376aca09de3SHoward Hinnant } 2377aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2378aca09de3SHoward Hinnant} 2379aca09de3SHoward Hinnant 2380aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2381aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2382aca09de3SHoward Hinnant_RandomAccessIterator 2383aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2384aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2385aca09de3SHoward Hinnant{ 2386aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2387aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2388aca09de3SHoward Hinnant { 2389aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2390aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2391aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2392aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2393aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2394aca09de3SHoward Hinnant } 2395aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2396aca09de3SHoward Hinnant} 2397aca09de3SHoward Hinnant 2398aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2399aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2400aca09de3SHoward Hinnant_ForwardIterator 24013e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24023e519524SHoward Hinnant{ 2403aca09de3SHoward Hinnant if (__first == __middle) 2404aca09de3SHoward Hinnant return __last; 2405aca09de3SHoward Hinnant if (__middle == __last) 2406aca09de3SHoward Hinnant return __first; 2407ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2408aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24093e519524SHoward Hinnant} 24103e519524SHoward Hinnant 24113e519524SHoward Hinnant// rotate_copy 24123e519524SHoward Hinnant 24133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24153e519524SHoward Hinnant_OutputIterator 24163e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24173e519524SHoward Hinnant{ 2418ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24193e519524SHoward Hinnant} 24203e519524SHoward Hinnant 24213e519524SHoward Hinnant// min_element 24223e519524SHoward Hinnant 24233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24249d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24253e519524SHoward Hinnant_ForwardIterator 24260b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24273e519524SHoward Hinnant{ 2428a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2429a60d7facSEric Fiselier "std::min_element requires a ForwardIterator"); 24303e519524SHoward Hinnant if (__first != __last) 24313e519524SHoward Hinnant { 24323e519524SHoward Hinnant _ForwardIterator __i = __first; 24333e519524SHoward Hinnant while (++__i != __last) 24343e519524SHoward Hinnant if (__comp(*__i, *__first)) 24353e519524SHoward Hinnant __first = __i; 24363e519524SHoward Hinnant } 24373e519524SHoward Hinnant return __first; 24383e519524SHoward Hinnant} 24393e519524SHoward Hinnant 24403e519524SHoward Hinnanttemplate <class _ForwardIterator> 24410b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24423e519524SHoward Hinnant_ForwardIterator 24433e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 24443e519524SHoward Hinnant{ 24450b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 24464eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 24474eb27b79SHoward Hinnant} 24484eb27b79SHoward Hinnant 24494eb27b79SHoward Hinnant// min 24504eb27b79SHoward Hinnant 24514eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 24529d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24534eb27b79SHoward Hinnantconst _Tp& 24544eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 24554eb27b79SHoward Hinnant{ 24564eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 24574eb27b79SHoward Hinnant} 24584eb27b79SHoward Hinnant 24594eb27b79SHoward Hinnanttemplate <class _Tp> 24609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24614eb27b79SHoward Hinnantconst _Tp& 24624eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 24634eb27b79SHoward Hinnant{ 2464ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 24654eb27b79SHoward Hinnant} 24664eb27b79SHoward Hinnant 2467ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 246854976f26SHoward Hinnant 24694eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 24709d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24714eb27b79SHoward Hinnant_Tp 24724eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 24734eb27b79SHoward Hinnant{ 24740b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 24754eb27b79SHoward Hinnant} 24764eb27b79SHoward Hinnant 24774eb27b79SHoward Hinnanttemplate<class _Tp> 24789d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24794eb27b79SHoward Hinnant_Tp 24804eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 24814eb27b79SHoward Hinnant{ 24820b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 24833e519524SHoward Hinnant} 24843e519524SHoward Hinnant 2485ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 248654976f26SHoward Hinnant 24873e519524SHoward Hinnant// max_element 24883e519524SHoward Hinnant 24893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24909d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24913e519524SHoward Hinnant_ForwardIterator 24920b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24933e519524SHoward Hinnant{ 2494a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2495a60d7facSEric Fiselier "std::max_element requires a ForwardIterator"); 24963e519524SHoward Hinnant if (__first != __last) 24973e519524SHoward Hinnant { 24983e519524SHoward Hinnant _ForwardIterator __i = __first; 24993e519524SHoward Hinnant while (++__i != __last) 25003e519524SHoward Hinnant if (__comp(*__first, *__i)) 25013e519524SHoward Hinnant __first = __i; 25023e519524SHoward Hinnant } 25033e519524SHoward Hinnant return __first; 25043e519524SHoward Hinnant} 25053e519524SHoward Hinnant 25069d67c6d5SMarshall Clow 25073e519524SHoward Hinnanttemplate <class _ForwardIterator> 25080b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25093e519524SHoward Hinnant_ForwardIterator 25103e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25113e519524SHoward Hinnant{ 25120b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 25134eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25144eb27b79SHoward Hinnant} 25154eb27b79SHoward Hinnant 25164eb27b79SHoward Hinnant// max 25174eb27b79SHoward Hinnant 25184eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25199d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25204eb27b79SHoward Hinnantconst _Tp& 25214eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25224eb27b79SHoward Hinnant{ 25234eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25244eb27b79SHoward Hinnant} 25254eb27b79SHoward Hinnant 25264eb27b79SHoward Hinnanttemplate <class _Tp> 25279d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25284eb27b79SHoward Hinnantconst _Tp& 25294eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25304eb27b79SHoward Hinnant{ 2531ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 25324eb27b79SHoward Hinnant} 25334eb27b79SHoward Hinnant 2534ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 253554976f26SHoward Hinnant 25364eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25379d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25384eb27b79SHoward Hinnant_Tp 25394eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 25404eb27b79SHoward Hinnant{ 25410b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 25424eb27b79SHoward Hinnant} 25434eb27b79SHoward Hinnant 25444eb27b79SHoward Hinnanttemplate<class _Tp> 25459d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25464eb27b79SHoward Hinnant_Tp 25474eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 25484eb27b79SHoward Hinnant{ 25490b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 25503e519524SHoward Hinnant} 25513e519524SHoward Hinnant 2552ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 255354976f26SHoward Hinnant 2554146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2555146c14acSMarshall Clow// clamp 2556146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2557146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2558146c14acSMarshall Clowconst _Tp& 2559146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2560146c14acSMarshall Clow{ 2561146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2562146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2563146c14acSMarshall Clow 2564146c14acSMarshall Clow} 2565146c14acSMarshall Clow 2566146c14acSMarshall Clowtemplate<class _Tp> 2567146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2568146c14acSMarshall Clowconst _Tp& 2569146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2570146c14acSMarshall Clow{ 2571146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2572146c14acSMarshall Clow} 2573146c14acSMarshall Clow#endif 2574146c14acSMarshall Clow 25753e519524SHoward Hinnant// minmax_element 25763e519524SHoward Hinnant 25773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25780b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 25793e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 25803e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25813e519524SHoward Hinnant{ 2582a60d7facSEric Fiselier static_assert(__is_forward_iterator<_ForwardIterator>::value, 2583a60d7facSEric Fiselier "std::minmax_element requires a ForwardIterator"); 25843e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 25853e519524SHoward Hinnant if (__first != __last) 25863e519524SHoward Hinnant { 25873e519524SHoward Hinnant if (++__first != __last) 25883e519524SHoward Hinnant { 25893e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 25903e519524SHoward Hinnant __result.first = __first; 25913e519524SHoward Hinnant else 25923e519524SHoward Hinnant __result.second = __first; 25933e519524SHoward Hinnant while (++__first != __last) 25943e519524SHoward Hinnant { 25953e519524SHoward Hinnant _ForwardIterator __i = __first; 25963e519524SHoward Hinnant if (++__first == __last) 25973e519524SHoward Hinnant { 25983e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 25993e519524SHoward Hinnant __result.first = __i; 26003e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26013e519524SHoward Hinnant __result.second = __i; 26023e519524SHoward Hinnant break; 26033e519524SHoward Hinnant } 26043e519524SHoward Hinnant else 26053e519524SHoward Hinnant { 26063e519524SHoward Hinnant if (__comp(*__first, *__i)) 26073e519524SHoward Hinnant { 26083e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26093e519524SHoward Hinnant __result.first = __first; 26103e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26113e519524SHoward Hinnant __result.second = __i; 26123e519524SHoward Hinnant } 26133e519524SHoward Hinnant else 26143e519524SHoward Hinnant { 26153e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26163e519524SHoward Hinnant __result.first = __i; 26173e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26183e519524SHoward Hinnant __result.second = __first; 26193e519524SHoward Hinnant } 26203e519524SHoward Hinnant } 26213e519524SHoward Hinnant } 26223e519524SHoward Hinnant } 26233e519524SHoward Hinnant } 26243e519524SHoward Hinnant return __result; 26253e519524SHoward Hinnant} 26263e519524SHoward Hinnant 26273e519524SHoward Hinnanttemplate <class _ForwardIterator> 26280b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26293e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26303e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26313e519524SHoward Hinnant{ 26329d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 26339d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26343e519524SHoward Hinnant} 26353e519524SHoward Hinnant 26364eb27b79SHoward Hinnant// minmax 26374eb27b79SHoward Hinnant 26384eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26399d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26404eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26414eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26424eb27b79SHoward Hinnant{ 26434eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 26444eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 26454eb27b79SHoward Hinnant} 26464eb27b79SHoward Hinnant 26474eb27b79SHoward Hinnanttemplate<class _Tp> 26489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26494eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 26504eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 26514eb27b79SHoward Hinnant{ 2652ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 26534eb27b79SHoward Hinnant} 26544eb27b79SHoward Hinnant 2655ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265654976f26SHoward Hinnant 26574eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26589d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26594eb27b79SHoward Hinnantpair<_Tp, _Tp> 26604eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 26614eb27b79SHoward Hinnant{ 26629d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 26639d67c6d5SMarshall Clow _Iter __first = __t.begin(); 26649d67c6d5SMarshall Clow _Iter __last = __t.end(); 26659d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 26669d67c6d5SMarshall Clow 26679d67c6d5SMarshall Clow ++__first; 26689d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 26699d67c6d5SMarshall Clow { 26709d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 26719d67c6d5SMarshall Clow __result.first = *__first; 26729d67c6d5SMarshall Clow else 26739d67c6d5SMarshall Clow __result.second = *__first; 26749d67c6d5SMarshall Clow ++__first; 26759d67c6d5SMarshall Clow } 26769d67c6d5SMarshall Clow 26779d67c6d5SMarshall Clow while (__first != __last) 26789d67c6d5SMarshall Clow { 26799d67c6d5SMarshall Clow _Tp __prev = *__first++; 2680002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2681002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2682002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 26839d67c6d5SMarshall Clow } 26849d67c6d5SMarshall Clow else { 2685002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2686002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 26879d67c6d5SMarshall Clow } 26889d67c6d5SMarshall Clow 26899d67c6d5SMarshall Clow __first++; 26909d67c6d5SMarshall Clow } 26919d67c6d5SMarshall Clow return __result; 26929d67c6d5SMarshall Clow} 26939d67c6d5SMarshall Clow 26949d67c6d5SMarshall Clowtemplate<class _Tp> 26959d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26969d67c6d5SMarshall Clowpair<_Tp, _Tp> 26979d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 26989d67c6d5SMarshall Clow{ 26999d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27004eb27b79SHoward Hinnant} 27014eb27b79SHoward Hinnant 2702ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 270354976f26SHoward Hinnant 27043e519524SHoward Hinnant// random_shuffle 27053e519524SHoward Hinnant 2706f9d540b0SHoward Hinnant// __independent_bits_engine 2707f9d540b0SHoward Hinnant 2708c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2709f9d540b0SHoward Hinnantstruct __log2_imp 27103e519524SHoward Hinnant{ 2711c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2712c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27133e519524SHoward Hinnant}; 27143e519524SHoward Hinnant 2715c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2716c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27173e519524SHoward Hinnant{ 2718f9d540b0SHoward Hinnant static const size_t value = 0; 27193e519524SHoward Hinnant}; 27203e519524SHoward Hinnant 2721c003db1fSHoward Hinnanttemplate <size_t _Rp> 2722c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27233e519524SHoward Hinnant{ 2724c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27253e519524SHoward Hinnant}; 27263e519524SHoward Hinnant 272789918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2728f9d540b0SHoward Hinnantstruct __log2 27293e519524SHoward Hinnant{ 2730c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 273189918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 27323e519524SHoward Hinnant}; 27333e519524SHoward Hinnant 2734f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2735f9d540b0SHoward Hinnantclass __independent_bits_engine 27363e519524SHoward Hinnant{ 2737f9d540b0SHoward Hinnantpublic: 2738f9d540b0SHoward Hinnant // types 2739f9d540b0SHoward Hinnant typedef _UIntType result_type; 2740f9d540b0SHoward Hinnant 2741f9d540b0SHoward Hinnantprivate: 2742f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2743f9d540b0SHoward Hinnant typedef typename conditional 2744f9d540b0SHoward Hinnant < 2745f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2746f9d540b0SHoward Hinnant result_type, 2747f9d540b0SHoward Hinnant _Engine_result_type 2748f9d540b0SHoward Hinnant >::type _Working_result_type; 2749f9d540b0SHoward Hinnant 2750f9d540b0SHoward Hinnant _Engine& __e_; 2751f9d540b0SHoward Hinnant size_t __w_; 2752f9d540b0SHoward Hinnant size_t __w0_; 2753f9d540b0SHoward Hinnant size_t __n_; 2754f9d540b0SHoward Hinnant size_t __n0_; 2755f9d540b0SHoward Hinnant _Working_result_type __y0_; 2756f9d540b0SHoward Hinnant _Working_result_type __y1_; 2757f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2758f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2759f9d540b0SHoward Hinnant 2760ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2761c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2762f9d540b0SHoward Hinnant + _Working_result_type(1); 2763e386b7b3SHoward Hinnant#else 2764e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2765e386b7b3SHoward Hinnant + _Working_result_type(1); 2766e386b7b3SHoward Hinnant#endif 2767e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2768e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2769e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2770f9d540b0SHoward Hinnant 2771f9d540b0SHoward Hinnantpublic: 2772f9d540b0SHoward Hinnant // constructors and seeding functions 2773f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2774f9d540b0SHoward Hinnant 2775f9d540b0SHoward Hinnant // generating functions 2776c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2777f9d540b0SHoward Hinnant 2778f9d540b0SHoward Hinnantprivate: 277908bba64aSMarshall Clow result_type __eval(false_type); 278008bba64aSMarshall Clow result_type __eval(true_type); 2781f9d540b0SHoward Hinnant}; 2782f9d540b0SHoward Hinnant 2783f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2784f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2785f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2786f9d540b0SHoward Hinnant : __e_(__e), 2787f9d540b0SHoward Hinnant __w_(__w) 2788f9d540b0SHoward Hinnant{ 2789f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2790f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2791c003db1fSHoward Hinnant if (_Rp == 0) 2792c003db1fSHoward Hinnant __y0_ = _Rp; 2793f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2794c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2795f9d540b0SHoward Hinnant else 2796f9d540b0SHoward Hinnant __y0_ = 0; 2797c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2798f9d540b0SHoward Hinnant { 2799f9d540b0SHoward Hinnant ++__n_; 2800f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2801f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2802c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2803f9d540b0SHoward Hinnant else 2804f9d540b0SHoward Hinnant __y0_ = 0; 2805f9d540b0SHoward Hinnant } 2806f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2807f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2808c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2809f9d540b0SHoward Hinnant else 2810f9d540b0SHoward Hinnant __y1_ = 0; 2811f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2812f9d540b0SHoward Hinnant _Engine_result_type(0); 2813f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2814f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2815f9d540b0SHoward Hinnant _Engine_result_type(~0); 28163e519524SHoward Hinnant} 28173e519524SHoward Hinnant 2818f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2819f9d540b0SHoward Hinnantinline 2820f9d540b0SHoward Hinnant_UIntType 282108bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28223e519524SHoward Hinnant{ 2823f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28243e519524SHoward Hinnant} 28253e519524SHoward Hinnant 2826f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2827f9d540b0SHoward Hinnant_UIntType 282808bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28293e519524SHoward Hinnant{ 28305beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2831c003db1fSHoward Hinnant result_type _Sp = 0; 2832f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2833f9d540b0SHoward Hinnant { 2834f9d540b0SHoward Hinnant _Engine_result_type __u; 28353e519524SHoward Hinnant do 2836f9d540b0SHoward Hinnant { 2837f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2838f9d540b0SHoward Hinnant } while (__u >= __y0_); 28395beb2c3aSMarshall Clow if (__w0_ < _WRt) 2840c003db1fSHoward Hinnant _Sp <<= __w0_; 2841f9d540b0SHoward Hinnant else 2842c003db1fSHoward Hinnant _Sp = 0; 2843c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2844f9d540b0SHoward Hinnant } 2845f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2846f9d540b0SHoward Hinnant { 2847f9d540b0SHoward Hinnant _Engine_result_type __u; 2848f9d540b0SHoward Hinnant do 2849f9d540b0SHoward Hinnant { 2850f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2851f9d540b0SHoward Hinnant } while (__u >= __y1_); 28525beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2853c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2854f9d540b0SHoward Hinnant else 2855c003db1fSHoward Hinnant _Sp = 0; 2856c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2857f9d540b0SHoward Hinnant } 2858c003db1fSHoward Hinnant return _Sp; 28593e519524SHoward Hinnant} 28603e519524SHoward Hinnant 2861f9d540b0SHoward Hinnant// uniform_int_distribution 28623e519524SHoward Hinnant 2863f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2864f9d540b0SHoward Hinnantclass uniform_int_distribution 28653e519524SHoward Hinnant{ 2866f9d540b0SHoward Hinnantpublic: 2867f9d540b0SHoward Hinnant // types 2868f9d540b0SHoward Hinnant typedef _IntType result_type; 2869f9d540b0SHoward Hinnant 2870f9d540b0SHoward Hinnant class param_type 2871f9d540b0SHoward Hinnant { 2872f9d540b0SHoward Hinnant result_type __a_; 2873f9d540b0SHoward Hinnant result_type __b_; 2874f9d540b0SHoward Hinnant public: 2875f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2876f9d540b0SHoward Hinnant 2877f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2878f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2879f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2880f9d540b0SHoward Hinnant 2881f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2882f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2883f9d540b0SHoward Hinnant 2884f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2885f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2886f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2887f9d540b0SHoward Hinnant {return !(__x == __y);} 28883e519524SHoward Hinnant }; 28893e519524SHoward Hinnant 2890f9d540b0SHoward Hinnantprivate: 2891f9d540b0SHoward Hinnant param_type __p_; 28923e519524SHoward Hinnant 2893f9d540b0SHoward Hinnantpublic: 2894f9d540b0SHoward Hinnant // constructors and reset functions 2895f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2896f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2897f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2898f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2899f9d540b0SHoward Hinnant void reset() {} 2900f9d540b0SHoward Hinnant 2901f9d540b0SHoward Hinnant // generating functions 2902f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2903f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2904f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2905f9d540b0SHoward Hinnant 2906f9d540b0SHoward Hinnant // property functions 2907f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2908f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2909f9d540b0SHoward Hinnant 2910f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2911f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2912f9d540b0SHoward Hinnant 2913f9d540b0SHoward Hinnant result_type min() const {return a();} 2914f9d540b0SHoward Hinnant result_type max() const {return b();} 2915f9d540b0SHoward Hinnant 2916f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2917f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2918f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2919f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2920f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2921f9d540b0SHoward Hinnant {return !(__x == __y);} 29223e519524SHoward Hinnant}; 29233e519524SHoward Hinnant 2924f9d540b0SHoward Hinnanttemplate<class _IntType> 2925f9d540b0SHoward Hinnanttemplate<class _URNG> 2926f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2927f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29282dd53352SMarshall Clow_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK 29293e519524SHoward Hinnant{ 2930f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2931f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 29322dd53352SMarshall Clow const _UIntType _Rp = _UIntType(__p.b()) - _UIntType(__p.a()) + _UIntType(1); 2933c003db1fSHoward Hinnant if (_Rp == 1) 2934f9d540b0SHoward Hinnant return __p.a(); 2935f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 2936f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 2937c003db1fSHoward Hinnant if (_Rp == 0) 2938f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 2939c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 2940a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 2941f9d540b0SHoward Hinnant ++__w; 2942f9d540b0SHoward Hinnant _Eng __e(__g, __w); 2943f9d540b0SHoward Hinnant _UIntType __u; 2944f9d540b0SHoward Hinnant do 29453e519524SHoward Hinnant { 2946f9d540b0SHoward Hinnant __u = __e(); 2947c003db1fSHoward Hinnant } while (__u >= _Rp); 2948f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 29493e519524SHoward Hinnant} 2950f9d540b0SHoward Hinnant 295166f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 295266f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 2953f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 2954f9d540b0SHoward Hinnant 2955f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 2956f9d540b0SHoward Hinnant 2957f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 29583e519524SHoward Hinnant{ 2959f9d540b0SHoward Hinnant static unsigned __c_; 2960f9d540b0SHoward Hinnant 2961f9d540b0SHoward Hinnant __rs_default(); 2962f9d540b0SHoward Hinnantpublic: 2963b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 2964f9d540b0SHoward Hinnant 2965f9d540b0SHoward Hinnant static const result_type _Min = 0; 2966f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 2967f9d540b0SHoward Hinnant 2968f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 2969f9d540b0SHoward Hinnant ~__rs_default(); 2970f9d540b0SHoward Hinnant 2971f9d540b0SHoward Hinnant result_type operator()(); 2972f9d540b0SHoward Hinnant 2973788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 2974788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 2975f9d540b0SHoward Hinnant 2976f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 2977f9d540b0SHoward Hinnant}; 2978f9d540b0SHoward Hinnant 2979f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 29803e519524SHoward Hinnant 29813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 2982ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 29833e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 29843e519524SHoward Hinnant{ 29853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 2986c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 2987c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 29883e519524SHoward Hinnant difference_type __d = __last - __first; 29893e519524SHoward Hinnant if (__d > 1) 29903e519524SHoward Hinnant { 2991c003db1fSHoward Hinnant _Dp __uid; 2992f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 2993f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 2994007b26beSHoward Hinnant { 2995c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 2996007b26beSHoward Hinnant if (__i != difference_type(0)) 2997007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 2998007b26beSHoward Hinnant } 29993e519524SHoward Hinnant } 30003e519524SHoward Hinnant} 30013e519524SHoward Hinnant 30023e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 3003ea5cd3b4SLouis Dionne_LIBCPP_DEPRECATED_IN_CXX14 void 30043e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3005ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 30063e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30073e519524SHoward Hinnant#else 30083e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30093e519524SHoward Hinnant#endif 30103e519524SHoward Hinnant{ 30113e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30123e519524SHoward Hinnant difference_type __d = __last - __first; 30133e519524SHoward Hinnant if (__d > 1) 30143e519524SHoward Hinnant { 30153e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3016007b26beSHoward Hinnant { 3017007b26beSHoward Hinnant difference_type __i = __rand(__d); 3018e9cc5451SMarshall Clow if (__i != difference_type(0)) 3019007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3020007b26beSHoward Hinnant } 30213e519524SHoward Hinnant } 30223e519524SHoward Hinnant} 30230f37a410SMarshall Clow#endif 30243e519524SHoward Hinnant 3025e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3026e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3027e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3028e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 302942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3030e7154709SEric Fiselier _Distance __n, 3031e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3032e7154709SEric Fiselier input_iterator_tag) { 3033e7154709SEric Fiselier 3034e7154709SEric Fiselier _Distance __k = 0; 3035e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 303642bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3037e7154709SEric Fiselier _Distance __sz = __k; 3038e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3039e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3040e7154709SEric Fiselier if (__r < __sz) 304142bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3042e7154709SEric Fiselier } 304342bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3044e7154709SEric Fiselier} 3045e7154709SEric Fiselier 3046e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3047e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3048e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3049e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 305042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3051e7154709SEric Fiselier _Distance __n, 3052e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3053e7154709SEric Fiselier forward_iterator_tag) { 3054e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3055e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3056e7154709SEric Fiselier _Distance __r = 3057e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3058e7154709SEric Fiselier if (__r < __n) { 305942bfedd9SAlexander Richardson *__output_iter++ = *__first; 3060e7154709SEric Fiselier --__n; 3061e7154709SEric Fiselier } 3062e7154709SEric Fiselier } 306342bfedd9SAlexander Richardson return __output_iter; 3064e7154709SEric Fiselier} 3065e7154709SEric Fiselier 3066e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3067e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3068e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3069e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 307042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3071e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3072e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3073e7154709SEric Fiselier _PopCategory; 3074e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3075e7154709SEric Fiselier _Difference; 3076e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3077e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3078e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3079e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3080e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3081e7154709SEric Fiselier return _VSTD::__sample( 308242bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3083e7154709SEric Fiselier __g, _PopCategory()); 3084e7154709SEric Fiselier} 3085e7154709SEric Fiselier 3086e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3087e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3088e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3089e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3090e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 309142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3092e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 309342bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3094e7154709SEric Fiselier} 3095e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3096e7154709SEric Fiselier 3097f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3098f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3099ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3100fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3101fb340102SHoward Hinnant#else 3102f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3103fb340102SHoward Hinnant#endif 3104f9d540b0SHoward Hinnant{ 3105f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3106c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3107c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3108f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3109f9d540b0SHoward Hinnant if (__d > 1) 3110f9d540b0SHoward Hinnant { 3111c003db1fSHoward Hinnant _Dp __uid; 3112f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3113007b26beSHoward Hinnant { 3114c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3115007b26beSHoward Hinnant if (__i != difference_type(0)) 3116007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3117007b26beSHoward Hinnant } 3118f9d540b0SHoward Hinnant } 3119f9d540b0SHoward Hinnant} 3120f9d540b0SHoward Hinnant 31213e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 312249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 31233e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31243e519524SHoward Hinnant{ 31253e519524SHoward Hinnant for (; __first != __last; ++__first) 31263e519524SHoward Hinnant if (!__pred(*__first)) 31273e519524SHoward Hinnant break; 3128b9595b79SMarshall Clow if ( __first == __last ) 3129b9595b79SMarshall Clow return true; 3130b9595b79SMarshall Clow ++__first; 31313e519524SHoward Hinnant for (; __first != __last; ++__first) 31323e519524SHoward Hinnant if (__pred(*__first)) 31333e519524SHoward Hinnant return false; 31343e519524SHoward Hinnant return true; 31353e519524SHoward Hinnant} 31363e519524SHoward Hinnant 31373e519524SHoward Hinnant// partition 31383e519524SHoward Hinnant 31393e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31403e519524SHoward Hinnant_ForwardIterator 31413e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31423e519524SHoward Hinnant{ 31433e519524SHoward Hinnant while (true) 31443e519524SHoward Hinnant { 31453e519524SHoward Hinnant if (__first == __last) 31463e519524SHoward Hinnant return __first; 31473e519524SHoward Hinnant if (!__pred(*__first)) 31483e519524SHoward Hinnant break; 31493e519524SHoward Hinnant ++__first; 31503e519524SHoward Hinnant } 31513e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31523e519524SHoward Hinnant { 31533e519524SHoward Hinnant if (__pred(*__p)) 31543e519524SHoward Hinnant { 31553e519524SHoward Hinnant swap(*__first, *__p); 31563e519524SHoward Hinnant ++__first; 31573e519524SHoward Hinnant } 31583e519524SHoward Hinnant } 31593e519524SHoward Hinnant return __first; 31603e519524SHoward Hinnant} 31613e519524SHoward Hinnant 31623e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31633e519524SHoward Hinnant_BidirectionalIterator 31643e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31653e519524SHoward Hinnant bidirectional_iterator_tag) 31663e519524SHoward Hinnant{ 31673e519524SHoward Hinnant while (true) 31683e519524SHoward Hinnant { 31693e519524SHoward Hinnant while (true) 31703e519524SHoward Hinnant { 31713e519524SHoward Hinnant if (__first == __last) 31723e519524SHoward Hinnant return __first; 31733e519524SHoward Hinnant if (!__pred(*__first)) 31743e519524SHoward Hinnant break; 31753e519524SHoward Hinnant ++__first; 31763e519524SHoward Hinnant } 31773e519524SHoward Hinnant do 31783e519524SHoward Hinnant { 31793e519524SHoward Hinnant if (__first == --__last) 31803e519524SHoward Hinnant return __first; 31813e519524SHoward Hinnant } while (!__pred(*__last)); 31823e519524SHoward Hinnant swap(*__first, *__last); 31833e519524SHoward Hinnant ++__first; 31843e519524SHoward Hinnant } 31853e519524SHoward Hinnant} 31863e519524SHoward Hinnant 31873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 31883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 31893e519524SHoward Hinnant_ForwardIterator 31903e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 31913e519524SHoward Hinnant{ 3192ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 31933e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 31943e519524SHoward Hinnant} 31953e519524SHoward Hinnant 31963e519524SHoward Hinnant// partition_copy 31973e519524SHoward Hinnant 31983e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 31993e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32001b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 32013e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32023e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32033e519524SHoward Hinnant _Predicate __pred) 32043e519524SHoward Hinnant{ 32053e519524SHoward Hinnant for (; __first != __last; ++__first) 32063e519524SHoward Hinnant { 32073e519524SHoward Hinnant if (__pred(*__first)) 32083e519524SHoward Hinnant { 32093e519524SHoward Hinnant *__out_true = *__first; 32103e519524SHoward Hinnant ++__out_true; 32113e519524SHoward Hinnant } 32123e519524SHoward Hinnant else 32133e519524SHoward Hinnant { 32143e519524SHoward Hinnant *__out_false = *__first; 32153e519524SHoward Hinnant ++__out_false; 32163e519524SHoward Hinnant } 32173e519524SHoward Hinnant } 32183e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32193e519524SHoward Hinnant} 32203e519524SHoward Hinnant 32213e519524SHoward Hinnant// partition_point 32223e519524SHoward Hinnant 32233e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3224674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 32253e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32263e519524SHoward Hinnant{ 32273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3228ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32293e519524SHoward Hinnant while (__len != 0) 32303e519524SHoward Hinnant { 3231*04695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 32323e519524SHoward Hinnant _ForwardIterator __m = __first; 3233ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32343e519524SHoward Hinnant if (__pred(*__m)) 32353e519524SHoward Hinnant { 32363e519524SHoward Hinnant __first = ++__m; 32373e519524SHoward Hinnant __len -= __l2 + 1; 32383e519524SHoward Hinnant } 32393e519524SHoward Hinnant else 32403e519524SHoward Hinnant __len = __l2; 32413e519524SHoward Hinnant } 32423e519524SHoward Hinnant return __first; 32433e519524SHoward Hinnant} 32443e519524SHoward Hinnant 32453e519524SHoward Hinnant// stable_partition 32463e519524SHoward Hinnant 32473e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32483e519524SHoward Hinnant_ForwardIterator 32493e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32503e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32513e519524SHoward Hinnant{ 32523e519524SHoward Hinnant // *__first is known to be false 32533e519524SHoward Hinnant // __len >= 1 32543e519524SHoward Hinnant if (__len == 1) 32553e519524SHoward Hinnant return __first; 32563e519524SHoward Hinnant if (__len == 2) 32573e519524SHoward Hinnant { 32583e519524SHoward Hinnant _ForwardIterator __m = __first; 32593e519524SHoward Hinnant if (__pred(*++__m)) 32603e519524SHoward Hinnant { 32613e519524SHoward Hinnant swap(*__first, *__m); 32623e519524SHoward Hinnant return __m; 32633e519524SHoward Hinnant } 32643e519524SHoward Hinnant return __first; 32653e519524SHoward Hinnant } 32663e519524SHoward Hinnant if (__len <= __p.second) 32673e519524SHoward Hinnant { // The buffer is big enough to use 32683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32693e519524SHoward Hinnant __destruct_n __d(0); 32703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32713e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32723e519524SHoward Hinnant // Update __first to always point to the end of the trues 32733e519524SHoward Hinnant value_type* __t = __p.first; 3274ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32753e519524SHoward Hinnant __d.__incr((value_type*)0); 32763e519524SHoward Hinnant ++__t; 32773e519524SHoward Hinnant _ForwardIterator __i = __first; 32783e519524SHoward Hinnant while (++__i != __last) 32793e519524SHoward Hinnant { 32803e519524SHoward Hinnant if (__pred(*__i)) 32813e519524SHoward Hinnant { 3282ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 32833e519524SHoward Hinnant ++__first; 32843e519524SHoward Hinnant } 32853e519524SHoward Hinnant else 32863e519524SHoward Hinnant { 3287ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 32883e519524SHoward Hinnant __d.__incr((value_type*)0); 32893e519524SHoward Hinnant ++__t; 32903e519524SHoward Hinnant } 32913e519524SHoward Hinnant } 32923e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 32933e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 32943e519524SHoward Hinnant __i = __first; 32953e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3296ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 32973e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 32983e519524SHoward Hinnant return __first; 32993e519524SHoward Hinnant } 33003e519524SHoward Hinnant // Else not enough buffer, do in place 33013e519524SHoward Hinnant // __len >= 3 33023e519524SHoward Hinnant _ForwardIterator __m = __first; 33033e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3304ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33053e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33063e519524SHoward Hinnant // F????????????????? 33073e519524SHoward Hinnant // f m l 33083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33093e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33103e519524SHoward Hinnant // TTTFFFFF?????????? 33113e519524SHoward Hinnant // f ff m l 33123e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33133e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33143e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33153e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33163e519524SHoward Hinnant while (__pred(*__m1)) 33173e519524SHoward Hinnant { 33183e519524SHoward Hinnant if (++__m1 == __last) 33193e519524SHoward Hinnant goto __second_half_done; 33203e519524SHoward Hinnant --__len_half; 33213e519524SHoward Hinnant } 33223e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33233e519524SHoward Hinnant // f ff m m1 l 33243e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33253e519524SHoward Hinnant__second_half_done: 33263e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33273e519524SHoward Hinnant // f ff m sf l 3328ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33293e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33303e519524SHoward Hinnant // | 33313e519524SHoward Hinnant} 33323e519524SHoward Hinnant 33333e519524SHoward Hinnantstruct __return_temporary_buffer 33343e519524SHoward Hinnant{ 33353e519524SHoward Hinnant template <class _Tp> 3336ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33373e519524SHoward Hinnant}; 33383e519524SHoward Hinnant 33393e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33403e519524SHoward Hinnant_ForwardIterator 33413e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33423e519524SHoward Hinnant forward_iterator_tag) 33433e519524SHoward Hinnant{ 33443e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33453e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33463e519524SHoward Hinnant while (true) 33473e519524SHoward Hinnant { 33483e519524SHoward Hinnant if (__first == __last) 33493e519524SHoward Hinnant return __first; 33503e519524SHoward Hinnant if (!__pred(*__first)) 33513e519524SHoward Hinnant break; 33523e519524SHoward Hinnant ++__first; 33533e519524SHoward Hinnant } 33543e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33553e519524SHoward Hinnant // *__first is known to be false 33563e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33573e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3358ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33593e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33603e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33613e519524SHoward Hinnant if (__len >= __alloc_limit) 33623e519524SHoward Hinnant { 3363ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33643e519524SHoward Hinnant __h.reset(__p.first); 33653e519524SHoward Hinnant } 33663e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33673e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33683e519524SHoward Hinnant} 33693e519524SHoward Hinnant 33703e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33713e519524SHoward Hinnant_BidirectionalIterator 33723e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33733e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33743e519524SHoward Hinnant{ 33753e519524SHoward Hinnant // *__first is known to be false 33763e519524SHoward Hinnant // *__last is known to be true 33773e519524SHoward Hinnant // __len >= 2 33783e519524SHoward Hinnant if (__len == 2) 33793e519524SHoward Hinnant { 33803e519524SHoward Hinnant swap(*__first, *__last); 33813e519524SHoward Hinnant return __last; 33823e519524SHoward Hinnant } 33833e519524SHoward Hinnant if (__len == 3) 33843e519524SHoward Hinnant { 33853e519524SHoward Hinnant _BidirectionalIterator __m = __first; 33863e519524SHoward Hinnant if (__pred(*++__m)) 33873e519524SHoward Hinnant { 33883e519524SHoward Hinnant swap(*__first, *__m); 33893e519524SHoward Hinnant swap(*__m, *__last); 33903e519524SHoward Hinnant return __last; 33913e519524SHoward Hinnant } 33923e519524SHoward Hinnant swap(*__m, *__last); 33933e519524SHoward Hinnant swap(*__first, *__m); 33943e519524SHoward Hinnant return __m; 33953e519524SHoward Hinnant } 33963e519524SHoward Hinnant if (__len <= __p.second) 33973e519524SHoward Hinnant { // The buffer is big enough to use 33983e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 33993e519524SHoward Hinnant __destruct_n __d(0); 34003e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34013e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34023e519524SHoward Hinnant // Update __first to always point to the end of the trues 34033e519524SHoward Hinnant value_type* __t = __p.first; 3404ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34053e519524SHoward Hinnant __d.__incr((value_type*)0); 34063e519524SHoward Hinnant ++__t; 34073e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34083e519524SHoward Hinnant while (++__i != __last) 34093e519524SHoward Hinnant { 34103e519524SHoward Hinnant if (__pred(*__i)) 34113e519524SHoward Hinnant { 3412ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34133e519524SHoward Hinnant ++__first; 34143e519524SHoward Hinnant } 34153e519524SHoward Hinnant else 34163e519524SHoward Hinnant { 3417ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34183e519524SHoward Hinnant __d.__incr((value_type*)0); 34193e519524SHoward Hinnant ++__t; 34203e519524SHoward Hinnant } 34213e519524SHoward Hinnant } 34223e519524SHoward Hinnant // move *__last, known to be true 3423ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34243e519524SHoward Hinnant __i = ++__first; 34253e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34263e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34273e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3428ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34293e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34303e519524SHoward Hinnant return __first; 34313e519524SHoward Hinnant } 34323e519524SHoward Hinnant // Else not enough buffer, do in place 34333e519524SHoward Hinnant // __len >= 4 34343e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34353e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3436ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34373e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34383e519524SHoward Hinnant // F????????????????T 34393e519524SHoward Hinnant // f m l 34403e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34413e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34423e519524SHoward Hinnant _Distance __len_half = __len2; 34433e519524SHoward Hinnant while (!__pred(*--__m1)) 34443e519524SHoward Hinnant { 34453e519524SHoward Hinnant if (__m1 == __first) 34463e519524SHoward Hinnant goto __first_half_done; 34473e519524SHoward Hinnant --__len_half; 34483e519524SHoward Hinnant } 34493e519524SHoward Hinnant // F???TFFF?????????T 34503e519524SHoward Hinnant // f m1 m l 34513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34523e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34533e519524SHoward Hinnant__first_half_done: 34543e519524SHoward Hinnant // TTTFFFFF?????????T 34553e519524SHoward Hinnant // f ff m l 34563e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34573e519524SHoward Hinnant __m1 = __m; 34583e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34593e519524SHoward Hinnant ++__second_false; 34603e519524SHoward Hinnant __len_half = __len - __len2; 34613e519524SHoward Hinnant while (__pred(*__m1)) 34623e519524SHoward Hinnant { 34633e519524SHoward Hinnant if (++__m1 == __last) 34643e519524SHoward Hinnant goto __second_half_done; 34653e519524SHoward Hinnant --__len_half; 34663e519524SHoward Hinnant } 34673e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34683e519524SHoward Hinnant // f ff m m1 l 34693e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34703e519524SHoward Hinnant__second_half_done: 34713e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34723e519524SHoward Hinnant // f ff m sf l 3473ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34743e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34753e519524SHoward Hinnant // | 34763e519524SHoward Hinnant} 34773e519524SHoward Hinnant 34783e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34793e519524SHoward Hinnant_BidirectionalIterator 34803e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34813e519524SHoward Hinnant bidirectional_iterator_tag) 34823e519524SHoward Hinnant{ 34833e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 34843e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34853e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 34863e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34873e519524SHoward Hinnant while (true) 34883e519524SHoward Hinnant { 34893e519524SHoward Hinnant if (__first == __last) 34903e519524SHoward Hinnant return __first; 34913e519524SHoward Hinnant if (!__pred(*__first)) 34923e519524SHoward Hinnant break; 34933e519524SHoward Hinnant ++__first; 34943e519524SHoward Hinnant } 34953e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 34963e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 34973e519524SHoward Hinnant do 34983e519524SHoward Hinnant { 34993e519524SHoward Hinnant if (__first == --__last) 35003e519524SHoward Hinnant return __first; 35013e519524SHoward Hinnant } while (!__pred(*__last)); 35023e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35033e519524SHoward Hinnant // *__first is known to be false 35043e519524SHoward Hinnant // *__last is known to be true 35053e519524SHoward Hinnant // __len >= 2 3506ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35073e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35083e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35093e519524SHoward Hinnant if (__len >= __alloc_limit) 35103e519524SHoward Hinnant { 3511ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35123e519524SHoward Hinnant __h.reset(__p.first); 35133e519524SHoward Hinnant } 35143e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35153e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35163e519524SHoward Hinnant} 35173e519524SHoward Hinnant 35183e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35203e519524SHoward Hinnant_ForwardIterator 35213e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35223e519524SHoward Hinnant{ 35233e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35243e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35253e519524SHoward Hinnant} 35263e519524SHoward Hinnant 35273e519524SHoward Hinnant// is_sorted_until 35283e519524SHoward Hinnant 35293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 353049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 35313e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35323e519524SHoward Hinnant{ 35333e519524SHoward Hinnant if (__first != __last) 35343e519524SHoward Hinnant { 35353e519524SHoward Hinnant _ForwardIterator __i = __first; 35363e519524SHoward Hinnant while (++__i != __last) 35373e519524SHoward Hinnant { 35383e519524SHoward Hinnant if (__comp(*__i, *__first)) 35393e519524SHoward Hinnant return __i; 35403e519524SHoward Hinnant __first = __i; 35413e519524SHoward Hinnant } 35423e519524SHoward Hinnant } 35433e519524SHoward Hinnant return __last; 35443e519524SHoward Hinnant} 35453e519524SHoward Hinnant 35463e519524SHoward Hinnanttemplate<class _ForwardIterator> 354749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35483e519524SHoward Hinnant_ForwardIterator 35493e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35503e519524SHoward Hinnant{ 3551ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35523e519524SHoward Hinnant} 35533e519524SHoward Hinnant 35543e519524SHoward Hinnant// is_sorted 35553e519524SHoward Hinnant 35563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 355749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35583e519524SHoward Hinnantbool 35593e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35603e519524SHoward Hinnant{ 3561ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35623e519524SHoward Hinnant} 35633e519524SHoward Hinnant 35643e519524SHoward Hinnanttemplate<class _ForwardIterator> 356549c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 35663e519524SHoward Hinnantbool 35673e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35683e519524SHoward Hinnant{ 3569ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35703e519524SHoward Hinnant} 35713e519524SHoward Hinnant 35723e519524SHoward Hinnant// sort 35733e519524SHoward Hinnant 35743e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35753e519524SHoward Hinnant 35763e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35773e519524SHoward Hinnantunsigned 35783e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35793e519524SHoward Hinnant{ 35803e519524SHoward Hinnant unsigned __r = 0; 35813e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 35823e519524SHoward Hinnant { 35833e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 35843e519524SHoward Hinnant return __r; // x <= y && y <= z 35853e519524SHoward Hinnant // x <= y && y > z 35863e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 35873e519524SHoward Hinnant __r = 1; 35883e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 35893e519524SHoward Hinnant { 35903e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 35913e519524SHoward Hinnant __r = 2; 35923e519524SHoward Hinnant } 35933e519524SHoward Hinnant return __r; // x <= y && y < z 35943e519524SHoward Hinnant } 35953e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 35963e519524SHoward Hinnant { 35973e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 35983e519524SHoward Hinnant __r = 1; 35993e519524SHoward Hinnant return __r; 36003e519524SHoward Hinnant } 36013e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36023e519524SHoward Hinnant __r = 1; // x < y && x <= z 36033e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36043e519524SHoward Hinnant { 36053e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36063e519524SHoward Hinnant __r = 2; 36073e519524SHoward Hinnant } 36083e519524SHoward Hinnant return __r; 36093e519524SHoward Hinnant} // x <= y && y <= z 36103e519524SHoward Hinnant 36113e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36123e519524SHoward Hinnant 36133e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36143e519524SHoward Hinnantunsigned 36153e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36163e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36173e519524SHoward Hinnant{ 36183e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36193e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36203e519524SHoward Hinnant { 36213e519524SHoward Hinnant swap(*__x3, *__x4); 36223e519524SHoward Hinnant ++__r; 36233e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36243e519524SHoward Hinnant { 36253e519524SHoward Hinnant swap(*__x2, *__x3); 36263e519524SHoward Hinnant ++__r; 36273e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36283e519524SHoward Hinnant { 36293e519524SHoward Hinnant swap(*__x1, *__x2); 36303e519524SHoward Hinnant ++__r; 36313e519524SHoward Hinnant } 36323e519524SHoward Hinnant } 36333e519524SHoward Hinnant } 36343e519524SHoward Hinnant return __r; 36353e519524SHoward Hinnant} 36363e519524SHoward Hinnant 36373e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36383e519524SHoward Hinnant 36393e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 3640835140a4SLouis Dionne_LIBCPP_HIDDEN 36413e519524SHoward Hinnantunsigned 36423e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36433e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36443e519524SHoward Hinnant{ 36453e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36463e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36473e519524SHoward Hinnant { 36483e519524SHoward Hinnant swap(*__x4, *__x5); 36493e519524SHoward Hinnant ++__r; 36503e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36513e519524SHoward Hinnant { 36523e519524SHoward Hinnant swap(*__x3, *__x4); 36533e519524SHoward Hinnant ++__r; 36543e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36553e519524SHoward Hinnant { 36563e519524SHoward Hinnant swap(*__x2, *__x3); 36573e519524SHoward Hinnant ++__r; 36583e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36593e519524SHoward Hinnant { 36603e519524SHoward Hinnant swap(*__x1, *__x2); 36613e519524SHoward Hinnant ++__r; 36623e519524SHoward Hinnant } 36633e519524SHoward Hinnant } 36643e519524SHoward Hinnant } 36653e519524SHoward Hinnant } 36663e519524SHoward Hinnant return __r; 36673e519524SHoward Hinnant} 36683e519524SHoward Hinnant 36693e519524SHoward Hinnant// Assumes size > 0 36703e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36713e519524SHoward Hinnantvoid 36723e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36733e519524SHoward Hinnant{ 36743e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36753e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36763e519524SHoward Hinnant { 3677ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36783e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36793e519524SHoward Hinnant (__first, __last, __comp); 36803e519524SHoward Hinnant if (__i != __first) 36813e519524SHoward Hinnant swap(*__first, *__i); 36823e519524SHoward Hinnant } 36833e519524SHoward Hinnant} 36843e519524SHoward Hinnant 36853e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36863e519524SHoward Hinnantvoid 36873e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36883e519524SHoward Hinnant{ 36893e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 36903e519524SHoward Hinnant if (__first != __last) 36913e519524SHoward Hinnant { 36923e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 36933e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 36943e519524SHoward Hinnant { 36953e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3696ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 36973e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3698ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3699ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37003e519524SHoward Hinnant } 37013e519524SHoward Hinnant } 37023e519524SHoward Hinnant} 37033e519524SHoward Hinnant 37043e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37053e519524SHoward Hinnantvoid 37063e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37073e519524SHoward Hinnant{ 37083e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37093e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37103e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37113e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37123e519524SHoward Hinnant { 37133e519524SHoward Hinnant if (__comp(*__i, *__j)) 37143e519524SHoward Hinnant { 3715ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37163e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37173e519524SHoward Hinnant __j = __i; 37183e519524SHoward Hinnant do 37193e519524SHoward Hinnant { 3720ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37213e519524SHoward Hinnant __j = __k; 37223e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3723ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37243e519524SHoward Hinnant } 37253e519524SHoward Hinnant __j = __i; 37263e519524SHoward Hinnant } 37273e519524SHoward Hinnant} 37283e519524SHoward Hinnant 37293e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37303e519524SHoward Hinnantbool 37313e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37323e519524SHoward Hinnant{ 37333e519524SHoward Hinnant switch (__last - __first) 37343e519524SHoward Hinnant { 37353e519524SHoward Hinnant case 0: 37363e519524SHoward Hinnant case 1: 37373e519524SHoward Hinnant return true; 37383e519524SHoward Hinnant case 2: 37393e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37403e519524SHoward Hinnant swap(*__first, *__last); 37413e519524SHoward Hinnant return true; 37423e519524SHoward Hinnant case 3: 3743ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37443e519524SHoward Hinnant return true; 37453e519524SHoward Hinnant case 4: 3746ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37473e519524SHoward Hinnant return true; 37483e519524SHoward Hinnant case 5: 3749ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37503e519524SHoward Hinnant return true; 37513e519524SHoward Hinnant } 37523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37533e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37543e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37553e519524SHoward Hinnant const unsigned __limit = 8; 37563e519524SHoward Hinnant unsigned __count = 0; 37573e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37583e519524SHoward Hinnant { 37593e519524SHoward Hinnant if (__comp(*__i, *__j)) 37603e519524SHoward Hinnant { 3761ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37623e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37633e519524SHoward Hinnant __j = __i; 37643e519524SHoward Hinnant do 37653e519524SHoward Hinnant { 3766ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37673e519524SHoward Hinnant __j = __k; 37683e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3769ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37703e519524SHoward Hinnant if (++__count == __limit) 37713e519524SHoward Hinnant return ++__i == __last; 37723e519524SHoward Hinnant } 37733e519524SHoward Hinnant __j = __i; 37743e519524SHoward Hinnant } 37753e519524SHoward Hinnant return true; 37763e519524SHoward Hinnant} 37773e519524SHoward Hinnant 37783e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37793e519524SHoward Hinnantvoid 37803e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 37813e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 37823e519524SHoward Hinnant{ 37833e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37843e519524SHoward Hinnant if (__first1 != __last1) 37853e519524SHoward Hinnant { 37863e519524SHoward Hinnant __destruct_n __d(0); 37873e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 37883e519524SHoward Hinnant value_type* __last2 = __first2; 3789ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 37903e519524SHoward Hinnant __d.__incr((value_type*)0); 37913e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 37923e519524SHoward Hinnant { 37933e519524SHoward Hinnant value_type* __j2 = __last2; 37943e519524SHoward Hinnant value_type* __i2 = __j2; 37953e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 37963e519524SHoward Hinnant { 3797ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 37983e519524SHoward Hinnant __d.__incr((value_type*)0); 37993e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3800ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3801ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38023e519524SHoward Hinnant } 38033e519524SHoward Hinnant else 38043e519524SHoward Hinnant { 3805ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38063e519524SHoward Hinnant __d.__incr((value_type*)0); 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant } 38093e519524SHoward Hinnant __h.release(); 38103e519524SHoward Hinnant } 38113e519524SHoward Hinnant} 38123e519524SHoward Hinnant 38133e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38143e519524SHoward Hinnantvoid 38153e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38163e519524SHoward Hinnant{ 38173e519524SHoward Hinnant // _Compare is known to be a reference type 38183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3820ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3821ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38223e519524SHoward Hinnant while (true) 38233e519524SHoward Hinnant { 38243e519524SHoward Hinnant __restart: 38253e519524SHoward Hinnant difference_type __len = __last - __first; 38263e519524SHoward Hinnant switch (__len) 38273e519524SHoward Hinnant { 38283e519524SHoward Hinnant case 0: 38293e519524SHoward Hinnant case 1: 38303e519524SHoward Hinnant return; 38313e519524SHoward Hinnant case 2: 38323e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38333e519524SHoward Hinnant swap(*__first, *__last); 38343e519524SHoward Hinnant return; 38353e519524SHoward Hinnant case 3: 3836ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38373e519524SHoward Hinnant return; 38383e519524SHoward Hinnant case 4: 3839ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38403e519524SHoward Hinnant return; 38413e519524SHoward Hinnant case 5: 3842ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38433e519524SHoward Hinnant return; 38443e519524SHoward Hinnant } 38453e519524SHoward Hinnant if (__len <= __limit) 38463e519524SHoward Hinnant { 3847ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38483e519524SHoward Hinnant return; 38493e519524SHoward Hinnant } 38503e519524SHoward Hinnant // __len > 5 38513e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38523e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38533e519524SHoward Hinnant --__lm1; 38543e519524SHoward Hinnant unsigned __n_swaps; 38553e519524SHoward Hinnant { 38563e519524SHoward Hinnant difference_type __delta; 38573e519524SHoward Hinnant if (__len >= 1000) 38583e519524SHoward Hinnant { 38593e519524SHoward Hinnant __delta = __len/2; 38603e519524SHoward Hinnant __m += __delta; 38613e519524SHoward Hinnant __delta /= 2; 3862ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38633e519524SHoward Hinnant } 38643e519524SHoward Hinnant else 38653e519524SHoward Hinnant { 38663e519524SHoward Hinnant __delta = __len/2; 38673e519524SHoward Hinnant __m += __delta; 3868ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant } 38713e519524SHoward Hinnant // *__m is median 38723e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38733e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38743e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38753e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38763e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38773e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38783e519524SHoward Hinnant // Prime the downward search with a guard. 38793e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38803e519524SHoward Hinnant { 38813e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 38823e519524SHoward Hinnant // manually guard downward moving __j against __i 38833e519524SHoward Hinnant while (true) 38843e519524SHoward Hinnant { 38853e519524SHoward Hinnant if (__i == --__j) 38863e519524SHoward Hinnant { 38873e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 38883e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 38893e519524SHoward Hinnant ++__i; // __first + 1 38903e519524SHoward Hinnant __j = __last; 38913e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 38923e519524SHoward Hinnant { 38933e519524SHoward Hinnant while (true) 38943e519524SHoward Hinnant { 38953e519524SHoward Hinnant if (__i == __j) 38963e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 38973e519524SHoward Hinnant if (__comp(*__first, *__i)) 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant swap(*__i, *__j); 39003e519524SHoward Hinnant ++__n_swaps; 39013e519524SHoward Hinnant ++__i; 39023e519524SHoward Hinnant break; 39033e519524SHoward Hinnant } 39043e519524SHoward Hinnant ++__i; 39053e519524SHoward Hinnant } 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39083e519524SHoward Hinnant if (__i == __j) 39093e519524SHoward Hinnant return; 39103e519524SHoward Hinnant while (true) 39113e519524SHoward Hinnant { 39123e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39133e519524SHoward Hinnant ++__i; 39143e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39153e519524SHoward Hinnant ; 39163e519524SHoward Hinnant if (__i >= __j) 39173e519524SHoward Hinnant break; 39183e519524SHoward Hinnant swap(*__i, *__j); 39193e519524SHoward Hinnant ++__n_swaps; 39203e519524SHoward Hinnant ++__i; 39213e519524SHoward Hinnant } 39223e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39233e519524SHoward Hinnant // The first part is sorted, sort the secod part 3924ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39253e519524SHoward Hinnant __first = __i; 39263e519524SHoward Hinnant goto __restart; 39273e519524SHoward Hinnant } 39283e519524SHoward Hinnant if (__comp(*__j, *__m)) 39293e519524SHoward Hinnant { 39303e519524SHoward Hinnant swap(*__i, *__j); 39313e519524SHoward Hinnant ++__n_swaps; 39323e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39333e519524SHoward Hinnant } 39343e519524SHoward Hinnant } 39353e519524SHoward Hinnant } 39363e519524SHoward Hinnant // It is known that *__i < *__m 39373e519524SHoward Hinnant ++__i; 39383e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39393e519524SHoward Hinnant // if not yet partitioned... 39403e519524SHoward Hinnant if (__i < __j) 39413e519524SHoward Hinnant { 39423e519524SHoward Hinnant // known that *(__i - 1) < *__m 39433e519524SHoward Hinnant // known that __i <= __m 39443e519524SHoward Hinnant while (true) 39453e519524SHoward Hinnant { 39463e519524SHoward Hinnant // __m still guards upward moving __i 39473e519524SHoward Hinnant while (__comp(*__i, *__m)) 39483e519524SHoward Hinnant ++__i; 39493e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39503e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39513e519524SHoward Hinnant ; 39523e519524SHoward Hinnant if (__i > __j) 39533e519524SHoward Hinnant break; 39543e519524SHoward Hinnant swap(*__i, *__j); 39553e519524SHoward Hinnant ++__n_swaps; 39563e519524SHoward Hinnant // It is known that __m != __j 39573e519524SHoward Hinnant // If __m just moved, follow it 39583e519524SHoward Hinnant if (__m == __i) 39593e519524SHoward Hinnant __m = __j; 39603e519524SHoward Hinnant ++__i; 39613e519524SHoward Hinnant } 39623e519524SHoward Hinnant } 39633e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39643e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39653e519524SHoward Hinnant { 39663e519524SHoward Hinnant swap(*__i, *__m); 39673e519524SHoward Hinnant ++__n_swaps; 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39703e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39713e519524SHoward Hinnant if (__n_swaps == 0) 39723e519524SHoward Hinnant { 3973ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3974ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39753e519524SHoward Hinnant { 39763e519524SHoward Hinnant if (__fs) 39773e519524SHoward Hinnant return; 39783e519524SHoward Hinnant __last = __i; 39793e519524SHoward Hinnant continue; 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant else 39823e519524SHoward Hinnant { 39833e519524SHoward Hinnant if (__fs) 39843e519524SHoward Hinnant { 39853e519524SHoward Hinnant __first = ++__i; 39863e519524SHoward Hinnant continue; 39873e519524SHoward Hinnant } 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant } 39903e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 39913e519524SHoward Hinnant if (__i - __first < __last - __i) 39923e519524SHoward Hinnant { 3993ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 3994ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 39953e519524SHoward Hinnant __first = ++__i; 39963e519524SHoward Hinnant } 39973e519524SHoward Hinnant else 39983e519524SHoward Hinnant { 3999ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4000ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40013e519524SHoward Hinnant __last = __i; 40023e519524SHoward Hinnant } 40033e519524SHoward Hinnant } 40043e519524SHoward Hinnant} 40053e519524SHoward Hinnant 40063e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40073e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40093e519524SHoward Hinnantvoid 40103e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40113e519524SHoward Hinnant{ 4012145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40153e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4016145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40183e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4019145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40203e519524SHoward Hinnant} 40213e519524SHoward Hinnant 40223e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40243e519524SHoward Hinnantvoid 40253e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40263e519524SHoward Hinnant{ 4027ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40283e519524SHoward Hinnant} 40293e519524SHoward Hinnant 40303e519524SHoward Hinnanttemplate <class _Tp> 40313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40323e519524SHoward Hinnantvoid 40333e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40343e519524SHoward Hinnant{ 4035ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40363e519524SHoward Hinnant} 40373e519524SHoward Hinnant 40383e519524SHoward Hinnanttemplate <class _Tp> 40393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40403e519524SHoward Hinnantvoid 40413e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40423e519524SHoward Hinnant{ 4043ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40443e519524SHoward Hinnant} 40453e519524SHoward Hinnant 4046f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4047f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4048f554add5SHoward Hinnantvoid 4049f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4050f554add5SHoward Hinnant{ 4051f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4052f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4053f554add5SHoward Hinnant} 4054f554add5SHoward Hinnant 4055f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4056f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4057f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4058f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4059f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4060f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4061f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4062f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4063f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4064f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4065f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4066f0544c20SHoward 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>&)) 4067f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4068f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4069f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40703e519524SHoward Hinnant 4071f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4072f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4073f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4074f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4075f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4076f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4077f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4080f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4081f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4082f0544c20SHoward 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>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40863e519524SHoward Hinnant 4087f0544c20SHoward 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>&)) 40883e519524SHoward Hinnant 40893e519524SHoward Hinnant// lower_bound 40903e519524SHoward Hinnant 40913e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4092d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4093e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 40943e519524SHoward Hinnant{ 40953e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4096ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 40973e519524SHoward Hinnant while (__len != 0) 40983e519524SHoward Hinnant { 4099*04695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41003e519524SHoward Hinnant _ForwardIterator __m = __first; 4101ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4102e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41033e519524SHoward Hinnant { 41043e519524SHoward Hinnant __first = ++__m; 41053e519524SHoward Hinnant __len -= __l2 + 1; 41063e519524SHoward Hinnant } 41073e519524SHoward Hinnant else 41083e519524SHoward Hinnant __len = __l2; 41093e519524SHoward Hinnant } 41103e519524SHoward Hinnant return __first; 41113e519524SHoward Hinnant} 41123e519524SHoward Hinnant 41133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4114d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41153e519524SHoward Hinnant_ForwardIterator 4116e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41173e519524SHoward Hinnant{ 41183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4119e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 41203e519524SHoward Hinnant} 41213e519524SHoward Hinnant 41223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4123d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41243e519524SHoward Hinnant_ForwardIterator 4125e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41263e519524SHoward Hinnant{ 4127e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41283e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41293e519524SHoward Hinnant} 41303e519524SHoward Hinnant 41313e519524SHoward Hinnant// upper_bound 41323e519524SHoward Hinnant 41333e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4134d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4135e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41363e519524SHoward Hinnant{ 41373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4138ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41393e519524SHoward Hinnant while (__len != 0) 41403e519524SHoward Hinnant { 4141*04695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41423e519524SHoward Hinnant _ForwardIterator __m = __first; 4143ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4144e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41453e519524SHoward Hinnant __len = __l2; 41463e519524SHoward Hinnant else 41473e519524SHoward Hinnant { 41483e519524SHoward Hinnant __first = ++__m; 41493e519524SHoward Hinnant __len -= __l2 + 1; 41503e519524SHoward Hinnant } 41513e519524SHoward Hinnant } 41523e519524SHoward Hinnant return __first; 41533e519524SHoward Hinnant} 41543e519524SHoward Hinnant 41553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4156d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41573e519524SHoward Hinnant_ForwardIterator 4158e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41593e519524SHoward Hinnant{ 41603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4161e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 41623e519524SHoward Hinnant} 41633e519524SHoward Hinnant 41643e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4165d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 41663e519524SHoward Hinnant_ForwardIterator 4167e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41683e519524SHoward Hinnant{ 4169e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 41703e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 41713e519524SHoward Hinnant} 41723e519524SHoward Hinnant 41733e519524SHoward Hinnant// equal_range 41743e519524SHoward Hinnant 41753e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4176d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4177e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41783e519524SHoward Hinnant{ 41793e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4180ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41813e519524SHoward Hinnant while (__len != 0) 41823e519524SHoward Hinnant { 4183*04695a75SLouis Dionne difference_type __l2 = _VSTD::__half_positive(__len); 41843e519524SHoward Hinnant _ForwardIterator __m = __first; 4185ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4186e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41873e519524SHoward Hinnant { 41883e519524SHoward Hinnant __first = ++__m; 41893e519524SHoward Hinnant __len -= __l2 + 1; 41903e519524SHoward Hinnant } 4191e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 41923e519524SHoward Hinnant { 41933e519524SHoward Hinnant __last = __m; 41943e519524SHoward Hinnant __len = __l2; 41953e519524SHoward Hinnant } 41963e519524SHoward Hinnant else 41973e519524SHoward Hinnant { 41983e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 41993e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42003e519524SHoward Hinnant ( 4201e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4202e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42033e519524SHoward Hinnant ); 42043e519524SHoward Hinnant } 42053e519524SHoward Hinnant } 42063e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42073e519524SHoward Hinnant} 42083e519524SHoward Hinnant 42093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4210d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42113e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4212e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42133e519524SHoward Hinnant{ 4214145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42153e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42163e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4217e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4218145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42193e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4220e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4221145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42223e519524SHoward Hinnant} 42233e519524SHoward Hinnant 42243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4225d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42263e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4227e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42283e519524SHoward Hinnant{ 4229e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42303e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42313e519524SHoward Hinnant} 42323e519524SHoward Hinnant 42333e519524SHoward Hinnant// binary_search 42343e519524SHoward Hinnant 42353e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4236d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42373e519524SHoward Hinnantbool 4238e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42393e519524SHoward Hinnant{ 4240e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4241e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42423e519524SHoward Hinnant} 42433e519524SHoward Hinnant 42443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4245d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42463e519524SHoward Hinnantbool 4247e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42483e519524SHoward Hinnant{ 4249145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42503e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42513e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4252e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4253145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42543e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4255e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4256145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42573e519524SHoward Hinnant} 42583e519524SHoward Hinnant 42593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4260d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42613e519524SHoward Hinnantbool 4262e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42633e519524SHoward Hinnant{ 4264e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 42653e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42663e519524SHoward Hinnant} 42673e519524SHoward Hinnant 42683e519524SHoward Hinnant// merge 42693e519524SHoward Hinnant 42703e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 42713e519524SHoward Hinnant_OutputIterator 42723e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 42733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42743e519524SHoward Hinnant{ 42753e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 42763e519524SHoward Hinnant { 42773e519524SHoward Hinnant if (__first2 == __last2) 4278ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 42793e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 42803e519524SHoward Hinnant { 42813e519524SHoward Hinnant *__result = *__first2; 42823e519524SHoward Hinnant ++__first2; 42833e519524SHoward Hinnant } 42843e519524SHoward Hinnant else 42853e519524SHoward Hinnant { 42863e519524SHoward Hinnant *__result = *__first1; 42873e519524SHoward Hinnant ++__first1; 42883e519524SHoward Hinnant } 42893e519524SHoward Hinnant } 4290ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 42913e519524SHoward Hinnant} 42923e519524SHoward Hinnant 42933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 42943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42953e519524SHoward Hinnant_OutputIterator 42963e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 42973e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 42983e519524SHoward Hinnant{ 4299145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4302ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4303145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4305ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4306145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43073e519524SHoward Hinnant} 43083e519524SHoward Hinnant 43093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43113e519524SHoward Hinnant_OutputIterator 43123e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43143e519524SHoward Hinnant{ 43153e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43163e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43173e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43183e519524SHoward Hinnant} 43193e519524SHoward Hinnant 43203e519524SHoward Hinnant// inplace_merge 43213e519524SHoward Hinnant 4322adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4323adfdae18SMarshall Clow class _OutputIterator> 4324adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4325adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4326adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4327adfdae18SMarshall Clow{ 4328adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4329adfdae18SMarshall Clow { 4330adfdae18SMarshall Clow if (__first2 == __last2) 4331adfdae18SMarshall Clow { 4332adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4333adfdae18SMarshall Clow return; 4334adfdae18SMarshall Clow } 4335adfdae18SMarshall Clow 4336adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4337adfdae18SMarshall Clow { 4338adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4339adfdae18SMarshall Clow ++__first2; 4340adfdae18SMarshall Clow } 4341adfdae18SMarshall Clow else 4342adfdae18SMarshall Clow { 4343adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4344adfdae18SMarshall Clow ++__first1; 4345adfdae18SMarshall Clow } 4346adfdae18SMarshall Clow } 4347adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4348adfdae18SMarshall Clow} 4349adfdae18SMarshall Clow 43503e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43513e519524SHoward Hinnantvoid 43523e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43533e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43543e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43553e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43563e519524SHoward Hinnant{ 43573e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43583e519524SHoward Hinnant __destruct_n __d(0); 43593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43603e519524SHoward Hinnant if (__len1 <= __len2) 43613e519524SHoward Hinnant { 43623e519524SHoward Hinnant value_type* __p = __buff; 4363910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4364ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4365adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 43663e519524SHoward Hinnant } 43673e519524SHoward Hinnant else 43683e519524SHoward Hinnant { 43693e519524SHoward Hinnant value_type* __p = __buff; 4370910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4371ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43723e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43733e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4374adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4375adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4376a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 43773e519524SHoward Hinnant } 43783e519524SHoward Hinnant} 43793e519524SHoward Hinnant 43803e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43813e519524SHoward Hinnantvoid 43823e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43833e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43843e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43853e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 43863e519524SHoward Hinnant{ 43873e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43883e519524SHoward Hinnant while (true) 43893e519524SHoward Hinnant { 43903e519524SHoward Hinnant // if __middle == __last, we're done 43913e519524SHoward Hinnant if (__len2 == 0) 43923e519524SHoward Hinnant return; 4393526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4394526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4395526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 43963e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4397910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 43983e519524SHoward Hinnant { 43993e519524SHoward Hinnant if (__len1 == 0) 44003e519524SHoward Hinnant return; 44013e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44023e519524SHoward Hinnant break; 44033e519524SHoward Hinnant } 44043e519524SHoward Hinnant // __first < __middle < __last 44053e519524SHoward Hinnant // *__first > *__middle 44063e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44073e519524SHoward Hinnant // all elements in: 44083e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44093e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44103e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44113e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44123e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44133e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44143e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44153e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44163e519524SHoward Hinnant // binary search smaller range 44173e519524SHoward Hinnant if (__len1 < __len2) 44183e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44193e519524SHoward Hinnant __len21 = __len2 / 2; 44203e519524SHoward Hinnant __m2 = __middle; 4421ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44223e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4423ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44243e519524SHoward Hinnant } 44253e519524SHoward Hinnant else 44263e519524SHoward Hinnant { 44273e519524SHoward Hinnant if (__len1 == 1) 44283e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44293e519524SHoward Hinnant // It is known *__first > *__middle 44303e519524SHoward Hinnant swap(*__first, *__middle); 44313e519524SHoward Hinnant return; 44323e519524SHoward Hinnant } 44333e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44343e519524SHoward Hinnant __len11 = __len1 / 2; 44353e519524SHoward Hinnant __m1 = __first; 4436ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44373e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4438ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44393e519524SHoward Hinnant } 44403e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44413e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44423e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44433e519524SHoward Hinnant // swap middle two partitions 4444ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44453e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44463e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44473e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44483e519524SHoward Hinnant { 44493e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44503e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44513e519524SHoward Hinnant __first = __middle; 44523e519524SHoward Hinnant __middle = __m2; 44533e519524SHoward Hinnant __len1 = __len12; 44543e519524SHoward Hinnant __len2 = __len22; 44553e519524SHoward Hinnant } 44563e519524SHoward Hinnant else 44573e519524SHoward Hinnant { 44583e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44593e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44603e519524SHoward Hinnant __last = __middle; 44613e519524SHoward Hinnant __middle = __m1; 44623e519524SHoward Hinnant __len1 = __len11; 44633e519524SHoward Hinnant __len2 = __len21; 44643e519524SHoward Hinnant } 44653e519524SHoward Hinnant } 44663e519524SHoward Hinnant} 44673e519524SHoward Hinnant 44683e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44703e519524SHoward Hinnantvoid 44713e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44723e519524SHoward Hinnant _Compare __comp) 44733e519524SHoward Hinnant{ 44743e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44753e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4476ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4477ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4478ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 44790b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 44800b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 44810b48cf9aSMarshall Clow 4482145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4485ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 44863e519524SHoward Hinnant __buf.first, __buf.second); 4487145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44883e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4489ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 44903e519524SHoward Hinnant __buf.first, __buf.second); 4491145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44923e519524SHoward Hinnant} 44933e519524SHoward Hinnant 44943e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 44953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44963e519524SHoward Hinnantvoid 44973e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 44983e519524SHoward Hinnant{ 4499ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45003e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45013e519524SHoward Hinnant} 45023e519524SHoward Hinnant 45033e519524SHoward Hinnant// stable_sort 45043e519524SHoward Hinnant 45053e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45063e519524SHoward Hinnantvoid 45073e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45093e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45103e519524SHoward Hinnant{ 45113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45123e519524SHoward Hinnant __destruct_n __d(0); 45133e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45143e519524SHoward Hinnant for (; true; ++__result) 45153e519524SHoward Hinnant { 45163e519524SHoward Hinnant if (__first1 == __last1) 45173e519524SHoward Hinnant { 45183e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4519ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45203e519524SHoward Hinnant __h.release(); 45213e519524SHoward Hinnant return; 45223e519524SHoward Hinnant } 45233e519524SHoward Hinnant if (__first2 == __last2) 45243e519524SHoward Hinnant { 45253e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4526ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45273e519524SHoward Hinnant __h.release(); 45283e519524SHoward Hinnant return; 45293e519524SHoward Hinnant } 45303e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45313e519524SHoward Hinnant { 4532ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45333e519524SHoward Hinnant __d.__incr((value_type*)0); 45343e519524SHoward Hinnant ++__first2; 45353e519524SHoward Hinnant } 45363e519524SHoward Hinnant else 45373e519524SHoward Hinnant { 4538ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45393e519524SHoward Hinnant __d.__incr((value_type*)0); 45403e519524SHoward Hinnant ++__first1; 45413e519524SHoward Hinnant } 45423e519524SHoward Hinnant } 45433e519524SHoward Hinnant} 45443e519524SHoward Hinnant 45453e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45463e519524SHoward Hinnantvoid 45473e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45493e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45503e519524SHoward Hinnant{ 45513e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45523e519524SHoward Hinnant { 45533e519524SHoward Hinnant if (__first2 == __last2) 45543e519524SHoward Hinnant { 45553e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4556ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45573e519524SHoward Hinnant return; 45583e519524SHoward Hinnant } 45593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45603e519524SHoward Hinnant { 4561ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45623e519524SHoward Hinnant ++__first2; 45633e519524SHoward Hinnant } 45643e519524SHoward Hinnant else 45653e519524SHoward Hinnant { 4566ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45673e519524SHoward Hinnant ++__first1; 45683e519524SHoward Hinnant } 45693e519524SHoward Hinnant } 45703e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4571ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45723e519524SHoward Hinnant} 45733e519524SHoward Hinnant 45743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45753e519524SHoward Hinnantvoid 45763e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 45773e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 45793e519524SHoward Hinnant 45803e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 45813e519524SHoward Hinnantvoid 45823e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 45833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 45843e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 45853e519524SHoward Hinnant{ 45863e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 45873e519524SHoward Hinnant switch (__len) 45883e519524SHoward Hinnant { 45893e519524SHoward Hinnant case 0: 45903e519524SHoward Hinnant return; 45913e519524SHoward Hinnant case 1: 4592ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 45933e519524SHoward Hinnant return; 45943e519524SHoward Hinnant case 2: 45953e519524SHoward Hinnant __destruct_n __d(0); 45963e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 45973e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 45983e519524SHoward Hinnant { 4599ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46003e519524SHoward Hinnant __d.__incr((value_type*)0); 46013e519524SHoward Hinnant ++__first2; 4602ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46033e519524SHoward Hinnant } 46043e519524SHoward Hinnant else 46053e519524SHoward Hinnant { 4606ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46073e519524SHoward Hinnant __d.__incr((value_type*)0); 46083e519524SHoward Hinnant ++__first2; 4609ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46103e519524SHoward Hinnant } 46113e519524SHoward Hinnant __h2.release(); 46123e519524SHoward Hinnant return; 46133e519524SHoward Hinnant } 46143e519524SHoward Hinnant if (__len <= 8) 46153e519524SHoward Hinnant { 46163e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46173e519524SHoward Hinnant return; 46183e519524SHoward Hinnant } 46193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46203e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46213e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46223e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46233e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46243e519524SHoward Hinnant} 46253e519524SHoward Hinnant 46263e519524SHoward Hinnanttemplate <class _Tp> 46273e519524SHoward Hinnantstruct __stable_sort_switch 46283e519524SHoward Hinnant{ 4629ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46303e519524SHoward Hinnant}; 46313e519524SHoward Hinnant 46323e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46333e519524SHoward Hinnantvoid 46343e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46363e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46373e519524SHoward Hinnant{ 46383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46403e519524SHoward Hinnant switch (__len) 46413e519524SHoward Hinnant { 46423e519524SHoward Hinnant case 0: 46433e519524SHoward Hinnant case 1: 46443e519524SHoward Hinnant return; 46453e519524SHoward Hinnant case 2: 46463e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46473e519524SHoward Hinnant swap(*__first, *__last); 46483e519524SHoward Hinnant return; 46493e519524SHoward Hinnant } 46503e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46513e519524SHoward Hinnant { 46523e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46533e519524SHoward Hinnant return; 46543e519524SHoward Hinnant } 46553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46563e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46573e519524SHoward Hinnant if (__len <= __buff_size) 46583e519524SHoward Hinnant { 46593e519524SHoward Hinnant __destruct_n __d(0); 46603e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46613e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46623e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46633e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46643e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46653e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46663e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46673e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46683e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46693e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46703e519524SHoward Hinnant// __first, __comp); 46713e519524SHoward Hinnant return; 46723e519524SHoward Hinnant } 46733e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 46743e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 46753e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 46763e519524SHoward Hinnant} 46773e519524SHoward Hinnant 46783e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 46793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46803e519524SHoward Hinnantvoid 46813e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 46823e519524SHoward Hinnant{ 46833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46853e519524SHoward Hinnant difference_type __len = __last - __first; 46863e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 46873e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 46883e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46893e519524SHoward Hinnant { 4690ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 46913e519524SHoward Hinnant __h.reset(__buf.first); 46923e519524SHoward Hinnant } 4693145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 46963e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4697145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 46993e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4700145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47013e519524SHoward Hinnant} 47023e519524SHoward Hinnant 47033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47053e519524SHoward Hinnantvoid 47063e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47073e519524SHoward Hinnant{ 4708ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47093e519524SHoward Hinnant} 47103e519524SHoward Hinnant 47113e519524SHoward Hinnant// is_heap_until 47123e519524SHoward Hinnant 47133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 471449c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 47153e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47163e519524SHoward Hinnant{ 4717ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47183e519524SHoward Hinnant difference_type __len = __last - __first; 47193e519524SHoward Hinnant difference_type __p = 0; 47203e519524SHoward Hinnant difference_type __c = 1; 47213e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47223e519524SHoward Hinnant while (__c < __len) 47233e519524SHoward Hinnant { 47243e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47253e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47263e519524SHoward Hinnant return __cp; 47273e519524SHoward Hinnant ++__c; 47283e519524SHoward Hinnant ++__cp; 47293e519524SHoward Hinnant if (__c == __len) 47303e519524SHoward Hinnant return __last; 47313e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47323e519524SHoward Hinnant return __cp; 47333e519524SHoward Hinnant ++__p; 47343e519524SHoward Hinnant ++__pp; 47353e519524SHoward Hinnant __c = 2 * __p + 1; 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant return __last; 47383e519524SHoward Hinnant} 47393e519524SHoward Hinnant 47403e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 474149c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47423e519524SHoward Hinnant_RandomAccessIterator 47433e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47443e519524SHoward Hinnant{ 4745ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47463e519524SHoward Hinnant} 47473e519524SHoward Hinnant 47483e519524SHoward Hinnant// is_heap 47493e519524SHoward Hinnant 47503e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 475149c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47523e519524SHoward Hinnantbool 47533e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47543e519524SHoward Hinnant{ 4755ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47563e519524SHoward Hinnant} 47573e519524SHoward Hinnant 47583e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 475949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 47603e519524SHoward Hinnantbool 47613e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47623e519524SHoward Hinnant{ 4763ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47643e519524SHoward Hinnant} 47653e519524SHoward Hinnant 47663e519524SHoward Hinnant// push_heap 47673e519524SHoward Hinnant 47683e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47693e519524SHoward Hinnantvoid 47708b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47713e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 47723e519524SHoward Hinnant{ 47733e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47743e519524SHoward Hinnant if (__len > 1) 47753e519524SHoward Hinnant { 47763e519524SHoward Hinnant __len = (__len - 2) / 2; 47773e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 47783e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 47793e519524SHoward Hinnant { 4780ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 47813e519524SHoward Hinnant do 47823e519524SHoward Hinnant { 4783ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 47843e519524SHoward Hinnant __last = __ptr; 47853e519524SHoward Hinnant if (__len == 0) 47863e519524SHoward Hinnant break; 47873e519524SHoward Hinnant __len = (__len - 1) / 2; 47883e519524SHoward Hinnant __ptr = __first + __len; 47893e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4790ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 47913e519524SHoward Hinnant } 47923e519524SHoward Hinnant } 47933e519524SHoward Hinnant} 47943e519524SHoward Hinnant 47953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47973e519524SHoward Hinnantvoid 47983e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47993e519524SHoward Hinnant{ 4800145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48038b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4804145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48068b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4807145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48083e519524SHoward Hinnant} 48093e519524SHoward Hinnant 48103e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48123e519524SHoward Hinnantvoid 48133e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48143e519524SHoward Hinnant{ 4815ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48163e519524SHoward Hinnant} 48173e519524SHoward Hinnant 48183e519524SHoward Hinnant// pop_heap 48193e519524SHoward Hinnant 48203e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48218b512602SDavid Majnemervoid 4822fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4823fd838227SEric Fiselier _Compare __comp, 48248b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48258b512602SDavid Majnemer _RandomAccessIterator __start) 48268b512602SDavid Majnemer{ 48278b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48288b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48298b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48308b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48318b512602SDavid Majnemer difference_type __child = __start - __first; 48328b512602SDavid Majnemer 48338b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48348b512602SDavid Majnemer return; 48358b512602SDavid Majnemer 48368b512602SDavid Majnemer __child = 2 * __child + 1; 48378b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48388b512602SDavid Majnemer 48398b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48408b512602SDavid Majnemer // right-child exists and is greater than left-child 48418b512602SDavid Majnemer ++__child_i; 48428b512602SDavid Majnemer ++__child; 48438b512602SDavid Majnemer } 48448b512602SDavid Majnemer 48458b512602SDavid Majnemer // check if we are in heap-order 48468b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48478b512602SDavid Majnemer // we are, __start is larger than it's largest child 48488b512602SDavid Majnemer return; 48498b512602SDavid Majnemer 48508b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48518b512602SDavid Majnemer do 48528b512602SDavid Majnemer { 48538b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48548b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48558b512602SDavid Majnemer __start = __child_i; 48568b512602SDavid Majnemer 48578b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48588b512602SDavid Majnemer break; 48598b512602SDavid Majnemer 48608b512602SDavid Majnemer // recompute the child based off of the updated parent 48618b512602SDavid Majnemer __child = 2 * __child + 1; 48628b512602SDavid Majnemer __child_i = __first + __child; 48638b512602SDavid Majnemer 48648b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48658b512602SDavid Majnemer // right-child exists and is greater than left-child 48668b512602SDavid Majnemer ++__child_i; 48678b512602SDavid Majnemer ++__child; 48688b512602SDavid Majnemer } 48698b512602SDavid Majnemer 48708b512602SDavid Majnemer // check if we are in heap-order 48718b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 48728b512602SDavid Majnemer *__start = _VSTD::move(__top); 48738b512602SDavid Majnemer} 48748b512602SDavid Majnemer 48758b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 48763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48773e519524SHoward Hinnantvoid 48783e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48793e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48803e519524SHoward Hinnant{ 48813e519524SHoward Hinnant if (__len > 1) 48823e519524SHoward Hinnant { 48833e519524SHoward Hinnant swap(*__first, *--__last); 48848b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 48853e519524SHoward Hinnant } 48863e519524SHoward Hinnant} 48873e519524SHoward Hinnant 48883e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48903e519524SHoward Hinnantvoid 48913e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48923e519524SHoward Hinnant{ 4893145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48963e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4897145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48993e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4900145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49013e519524SHoward Hinnant} 49023e519524SHoward Hinnant 49033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49053e519524SHoward Hinnantvoid 49063e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49073e519524SHoward Hinnant{ 4908ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49093e519524SHoward Hinnant} 49103e519524SHoward Hinnant 49113e519524SHoward Hinnant// make_heap 49123e519524SHoward Hinnant 49133e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49143e519524SHoward Hinnantvoid 49153e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49163e519524SHoward Hinnant{ 49173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49183e519524SHoward Hinnant difference_type __n = __last - __first; 49193e519524SHoward Hinnant if (__n > 1) 49203e519524SHoward Hinnant { 49218b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49228b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49238b512602SDavid Majnemer { 49248b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49258b512602SDavid Majnemer } 49263e519524SHoward Hinnant } 49273e519524SHoward Hinnant} 49283e519524SHoward Hinnant 49293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49313e519524SHoward Hinnantvoid 49323e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49333e519524SHoward Hinnant{ 4934145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49373e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4938145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49403e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4941145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49423e519524SHoward Hinnant} 49433e519524SHoward Hinnant 49443e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49463e519524SHoward Hinnantvoid 49473e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49483e519524SHoward Hinnant{ 4949ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49503e519524SHoward Hinnant} 49513e519524SHoward Hinnant 49523e519524SHoward Hinnant// sort_heap 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49553e519524SHoward Hinnantvoid 49563e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49573e519524SHoward Hinnant{ 49583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49593e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49603e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49613e519524SHoward Hinnant} 49623e519524SHoward Hinnant 49633e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49653e519524SHoward Hinnantvoid 49663e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49673e519524SHoward Hinnant{ 4968145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49693e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49703e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49713e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 4972145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49733e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49743e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 4975145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49763e519524SHoward Hinnant} 49773e519524SHoward Hinnant 49783e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49803e519524SHoward Hinnantvoid 49813e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49823e519524SHoward Hinnant{ 4983ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49843e519524SHoward Hinnant} 49853e519524SHoward Hinnant 49863e519524SHoward Hinnant// partial_sort 49873e519524SHoward Hinnant 49883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49893e519524SHoward Hinnantvoid 49903e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 49913e519524SHoward Hinnant _Compare __comp) 49923e519524SHoward Hinnant{ 49933e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 49943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 49953e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 49963e519524SHoward Hinnant { 49973e519524SHoward Hinnant if (__comp(*__i, *__first)) 49983e519524SHoward Hinnant { 49993e519524SHoward Hinnant swap(*__i, *__first); 50008b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50013e519524SHoward Hinnant } 50023e519524SHoward Hinnant } 50033e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50043e519524SHoward Hinnant} 50053e519524SHoward Hinnant 50063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50083e519524SHoward Hinnantvoid 50093e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50103e519524SHoward Hinnant _Compare __comp) 50113e519524SHoward Hinnant{ 5012145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50153e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5016145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50183e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5019145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50203e519524SHoward Hinnant} 50213e519524SHoward Hinnant 50223e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50243e519524SHoward Hinnantvoid 50253e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50263e519524SHoward Hinnant{ 5027ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50283e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50293e519524SHoward Hinnant} 50303e519524SHoward Hinnant 50313e519524SHoward Hinnant// partial_sort_copy 50323e519524SHoward Hinnant 50333e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50343e519524SHoward Hinnant_RandomAccessIterator 50353e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50363e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50373e519524SHoward Hinnant{ 50383e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50393e519524SHoward Hinnant if (__r != __result_last) 50403e519524SHoward Hinnant { 5041910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50423e519524SHoward Hinnant *__r = *__first; 50433e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50448b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50453e519524SHoward Hinnant for (; __first != __last; ++__first) 50463e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50473e519524SHoward Hinnant { 50483e519524SHoward Hinnant *__result_first = *__first; 50498b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50503e519524SHoward Hinnant } 50513e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50523e519524SHoward Hinnant } 50533e519524SHoward Hinnant return __r; 50543e519524SHoward Hinnant} 50553e519524SHoward Hinnant 50563e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50583e519524SHoward Hinnant_RandomAccessIterator 50593e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50603e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50613e519524SHoward Hinnant{ 5062145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50633e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50643e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50653e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5066145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50673e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50683e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5069145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50703e519524SHoward Hinnant} 50713e519524SHoward Hinnant 50723e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 50733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50743e519524SHoward Hinnant_RandomAccessIterator 50753e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50763e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 50773e519524SHoward Hinnant{ 5078ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 50793e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50803e519524SHoward Hinnant} 50813e519524SHoward Hinnant 50823e519524SHoward Hinnant// nth_element 50833e519524SHoward Hinnant 50843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50853e519524SHoward Hinnantvoid 50863e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 50873e519524SHoward Hinnant{ 50883e519524SHoward Hinnant // _Compare is known to be a reference type 50893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50903e519524SHoward Hinnant const difference_type __limit = 7; 50913e519524SHoward Hinnant while (true) 50923e519524SHoward Hinnant { 50933e519524SHoward Hinnant __restart: 5094b34b4819SHoward Hinnant if (__nth == __last) 5095b34b4819SHoward Hinnant return; 50963e519524SHoward Hinnant difference_type __len = __last - __first; 50973e519524SHoward Hinnant switch (__len) 50983e519524SHoward Hinnant { 50993e519524SHoward Hinnant case 0: 51003e519524SHoward Hinnant case 1: 51013e519524SHoward Hinnant return; 51023e519524SHoward Hinnant case 2: 51033e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51043e519524SHoward Hinnant swap(*__first, *__last); 51053e519524SHoward Hinnant return; 51063e519524SHoward Hinnant case 3: 51073e519524SHoward Hinnant { 51083e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5109ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51103e519524SHoward Hinnant return; 51113e519524SHoward Hinnant } 51123e519524SHoward Hinnant } 51133e519524SHoward Hinnant if (__len <= __limit) 51143e519524SHoward Hinnant { 51153e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51163e519524SHoward Hinnant return; 51173e519524SHoward Hinnant } 51183e519524SHoward Hinnant // __len > __limit >= 3 51193e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51203e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5121ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51223e519524SHoward Hinnant // *__m is median 51233e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51243e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51253e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51263e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51273e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51283e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51293e519524SHoward Hinnant // Prime the downward search with a guard. 51303e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51313e519524SHoward Hinnant { 51323e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51333e519524SHoward Hinnant // manually guard downward moving __j against __i 51343e519524SHoward Hinnant while (true) 51353e519524SHoward Hinnant { 51363e519524SHoward Hinnant if (__i == --__j) 51373e519524SHoward Hinnant { 51383e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51393e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51403e519524SHoward Hinnant ++__i; // __first + 1 51413e519524SHoward Hinnant __j = __last; 51423e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51433e519524SHoward Hinnant { 51443e519524SHoward Hinnant while (true) 51453e519524SHoward Hinnant { 51463e519524SHoward Hinnant if (__i == __j) 51473e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51483e519524SHoward Hinnant if (__comp(*__first, *__i)) 51493e519524SHoward Hinnant { 51503e519524SHoward Hinnant swap(*__i, *__j); 51513e519524SHoward Hinnant ++__n_swaps; 51523e519524SHoward Hinnant ++__i; 51533e519524SHoward Hinnant break; 51543e519524SHoward Hinnant } 51553e519524SHoward Hinnant ++__i; 51563e519524SHoward Hinnant } 51573e519524SHoward Hinnant } 51583e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51593e519524SHoward Hinnant if (__i == __j) 51603e519524SHoward Hinnant return; 51613e519524SHoward Hinnant while (true) 51623e519524SHoward Hinnant { 51633e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51643e519524SHoward Hinnant ++__i; 51653e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51663e519524SHoward Hinnant ; 51673e519524SHoward Hinnant if (__i >= __j) 51683e519524SHoward Hinnant break; 51693e519524SHoward Hinnant swap(*__i, *__j); 51703e519524SHoward Hinnant ++__n_swaps; 51713e519524SHoward Hinnant ++__i; 51723e519524SHoward Hinnant } 51733e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 51743e519524SHoward Hinnant // The first part is sorted, 51753e519524SHoward Hinnant if (__nth < __i) 51763e519524SHoward Hinnant return; 51773e519524SHoward Hinnant // __nth_element the secod part 51783e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 51793e519524SHoward Hinnant __first = __i; 51803e519524SHoward Hinnant goto __restart; 51813e519524SHoward Hinnant } 51823e519524SHoward Hinnant if (__comp(*__j, *__m)) 51833e519524SHoward Hinnant { 51843e519524SHoward Hinnant swap(*__i, *__j); 51853e519524SHoward Hinnant ++__n_swaps; 51863e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 51873e519524SHoward Hinnant } 51883e519524SHoward Hinnant } 51893e519524SHoward Hinnant } 51903e519524SHoward Hinnant ++__i; 51913e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51923e519524SHoward Hinnant // if not yet partitioned... 51933e519524SHoward Hinnant if (__i < __j) 51943e519524SHoward Hinnant { 51953e519524SHoward Hinnant // known that *(__i - 1) < *__m 51963e519524SHoward Hinnant while (true) 51973e519524SHoward Hinnant { 51983e519524SHoward Hinnant // __m still guards upward moving __i 51993e519524SHoward Hinnant while (__comp(*__i, *__m)) 52003e519524SHoward Hinnant ++__i; 52013e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52023e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52033e519524SHoward Hinnant ; 52043e519524SHoward Hinnant if (__i >= __j) 52053e519524SHoward Hinnant break; 52063e519524SHoward Hinnant swap(*__i, *__j); 52073e519524SHoward Hinnant ++__n_swaps; 52083e519524SHoward Hinnant // It is known that __m != __j 52093e519524SHoward Hinnant // If __m just moved, follow it 52103e519524SHoward Hinnant if (__m == __i) 52113e519524SHoward Hinnant __m = __j; 52123e519524SHoward Hinnant ++__i; 52133e519524SHoward Hinnant } 52143e519524SHoward Hinnant } 52153e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52163e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52173e519524SHoward Hinnant { 52183e519524SHoward Hinnant swap(*__i, *__m); 52193e519524SHoward Hinnant ++__n_swaps; 52203e519524SHoward Hinnant } 52213e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52223e519524SHoward Hinnant if (__nth == __i) 52233e519524SHoward Hinnant return; 52243e519524SHoward Hinnant if (__n_swaps == 0) 52253e519524SHoward Hinnant { 52263e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52273e519524SHoward Hinnant if (__nth < __i) 52283e519524SHoward Hinnant { 52293e519524SHoward Hinnant // Check for [__first, __i) already sorted 52303e519524SHoward Hinnant __j = __m = __first; 52313e519524SHoward Hinnant while (++__j != __i) 52323e519524SHoward Hinnant { 52333e519524SHoward Hinnant if (__comp(*__j, *__m)) 52343e519524SHoward Hinnant // not yet sorted, so sort 52353e519524SHoward Hinnant goto not_sorted; 52363e519524SHoward Hinnant __m = __j; 52373e519524SHoward Hinnant } 52383e519524SHoward Hinnant // [__first, __i) sorted 52393e519524SHoward Hinnant return; 52403e519524SHoward Hinnant } 52413e519524SHoward Hinnant else 52423e519524SHoward Hinnant { 52433e519524SHoward Hinnant // Check for [__i, __last) already sorted 52443e519524SHoward Hinnant __j = __m = __i; 52453e519524SHoward Hinnant while (++__j != __last) 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant if (__comp(*__j, *__m)) 52483e519524SHoward Hinnant // not yet sorted, so sort 52493e519524SHoward Hinnant goto not_sorted; 52503e519524SHoward Hinnant __m = __j; 52513e519524SHoward Hinnant } 52523e519524SHoward Hinnant // [__i, __last) sorted 52533e519524SHoward Hinnant return; 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnant } 52563e519524SHoward Hinnantnot_sorted: 52573e519524SHoward Hinnant // __nth_element on range containing __nth 52583e519524SHoward Hinnant if (__nth < __i) 52593e519524SHoward Hinnant { 52603e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52613e519524SHoward Hinnant __last = __i; 52623e519524SHoward Hinnant } 52633e519524SHoward Hinnant else 52643e519524SHoward Hinnant { 52653e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52663e519524SHoward Hinnant __first = ++__i; 52673e519524SHoward Hinnant } 52683e519524SHoward Hinnant } 52693e519524SHoward Hinnant} 52703e519524SHoward Hinnant 52713e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52733e519524SHoward Hinnantvoid 52743e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52753e519524SHoward Hinnant{ 5276145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52773e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52783e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52793e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5280145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52813e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52823e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5283145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52843e519524SHoward Hinnant} 52853e519524SHoward Hinnant 52863e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52883e519524SHoward Hinnantvoid 52893e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 52903e519524SHoward Hinnant{ 5291ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52923e519524SHoward Hinnant} 52933e519524SHoward Hinnant 52943e519524SHoward Hinnant// includes 52953e519524SHoward Hinnant 52963e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 52978da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 52983e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 52993e519524SHoward Hinnant _Compare __comp) 53003e519524SHoward Hinnant{ 53013e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53023e519524SHoward Hinnant { 53033e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53043e519524SHoward Hinnant return false; 53053e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53063e519524SHoward Hinnant ++__first2; 53073e519524SHoward Hinnant } 53083e519524SHoward Hinnant return true; 53093e519524SHoward Hinnant} 53103e519524SHoward Hinnant 53113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53128da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53133e519524SHoward Hinnantbool 53143e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53153e519524SHoward Hinnant _Compare __comp) 53163e519524SHoward Hinnant{ 5317145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53203e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5321145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53233e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5324145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53253e519524SHoward Hinnant} 53263e519524SHoward Hinnant 53273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53288da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 53293e519524SHoward Hinnantbool 53303e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53313e519524SHoward Hinnant{ 5332ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53333e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53343e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53353e519524SHoward Hinnant} 53363e519524SHoward Hinnant 53373e519524SHoward Hinnant// set_union 53383e519524SHoward Hinnant 53393e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53403e519524SHoward Hinnant_OutputIterator 53413e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53433e519524SHoward Hinnant{ 53443e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53453e519524SHoward Hinnant { 53463e519524SHoward Hinnant if (__first2 == __last2) 5347ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53483e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53493e519524SHoward Hinnant { 53503e519524SHoward Hinnant *__result = *__first2; 53513e519524SHoward Hinnant ++__first2; 53523e519524SHoward Hinnant } 53533e519524SHoward Hinnant else 53543e519524SHoward Hinnant { 53553e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53563e519524SHoward Hinnant ++__first2; 535705da5b02SMarshall Clow *__result = *__first1; 53583e519524SHoward Hinnant ++__first1; 53593e519524SHoward Hinnant } 53603e519524SHoward Hinnant } 5361ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53623e519524SHoward Hinnant} 53633e519524SHoward Hinnant 53643e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53663e519524SHoward Hinnant_OutputIterator 53673e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53693e519524SHoward Hinnant{ 5370145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53713e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53723e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53733e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5374145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53753e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53763e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5377145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53783e519524SHoward Hinnant} 53793e519524SHoward Hinnant 53803e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 53813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53823e519524SHoward Hinnant_OutputIterator 53833e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 53853e519524SHoward Hinnant{ 5386ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 53873e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53883e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53893e519524SHoward Hinnant} 53903e519524SHoward Hinnant 53913e519524SHoward Hinnant// set_intersection 53923e519524SHoward Hinnant 53933e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53948da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 53953e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 53963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53973e519524SHoward Hinnant{ 53983e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 53993e519524SHoward Hinnant { 54003e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54013e519524SHoward Hinnant ++__first1; 54023e519524SHoward Hinnant else 54033e519524SHoward Hinnant { 54043e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54053e519524SHoward Hinnant { 54063e519524SHoward Hinnant *__result = *__first1; 54073e519524SHoward Hinnant ++__result; 54083e519524SHoward Hinnant ++__first1; 54093e519524SHoward Hinnant } 54103e519524SHoward Hinnant ++__first2; 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant } 54133e519524SHoward Hinnant return __result; 54143e519524SHoward Hinnant} 54153e519524SHoward Hinnant 54163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54178da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54183e519524SHoward Hinnant_OutputIterator 54193e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54213e519524SHoward Hinnant{ 5422145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54253e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5426145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54283e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5429145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54303e519524SHoward Hinnant} 54313e519524SHoward Hinnant 54323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54338da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54343e519524SHoward Hinnant_OutputIterator 54353e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54373e519524SHoward Hinnant{ 5438ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54393e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54403e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54413e519524SHoward Hinnant} 54423e519524SHoward Hinnant 54433e519524SHoward Hinnant// set_difference 54443e519524SHoward Hinnant 54453e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54463e519524SHoward Hinnant_OutputIterator 54473e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54493e519524SHoward Hinnant{ 54503e519524SHoward Hinnant while (__first1 != __last1) 54513e519524SHoward Hinnant { 54523e519524SHoward Hinnant if (__first2 == __last2) 5453ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54543e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54553e519524SHoward Hinnant { 54563e519524SHoward Hinnant *__result = *__first1; 54573e519524SHoward Hinnant ++__result; 54583e519524SHoward Hinnant ++__first1; 54593e519524SHoward Hinnant } 54603e519524SHoward Hinnant else 54613e519524SHoward Hinnant { 54623e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54633e519524SHoward Hinnant ++__first1; 54643e519524SHoward Hinnant ++__first2; 54653e519524SHoward Hinnant } 54663e519524SHoward Hinnant } 54673e519524SHoward Hinnant return __result; 54683e519524SHoward Hinnant} 54693e519524SHoward Hinnant 54703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54723e519524SHoward Hinnant_OutputIterator 54733e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54753e519524SHoward Hinnant{ 5476145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54773e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54783e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54793e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5480145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54813e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54823e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5483145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54843e519524SHoward Hinnant} 54853e519524SHoward Hinnant 54863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54883e519524SHoward Hinnant_OutputIterator 54893e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54913e519524SHoward Hinnant{ 5492ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 54933e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54943e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54953e519524SHoward Hinnant} 54963e519524SHoward Hinnant 54973e519524SHoward Hinnant// set_symmetric_difference 54983e519524SHoward Hinnant 54993e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55003e519524SHoward Hinnant_OutputIterator 55013e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55033e519524SHoward Hinnant{ 55043e519524SHoward Hinnant while (__first1 != __last1) 55053e519524SHoward Hinnant { 55063e519524SHoward Hinnant if (__first2 == __last2) 5507ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55083e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55093e519524SHoward Hinnant { 55103e519524SHoward Hinnant *__result = *__first1; 55113e519524SHoward Hinnant ++__result; 55123e519524SHoward Hinnant ++__first1; 55133e519524SHoward Hinnant } 55143e519524SHoward Hinnant else 55153e519524SHoward Hinnant { 55163e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55173e519524SHoward Hinnant { 55183e519524SHoward Hinnant *__result = *__first2; 55193e519524SHoward Hinnant ++__result; 55203e519524SHoward Hinnant } 55213e519524SHoward Hinnant else 55223e519524SHoward Hinnant ++__first1; 55233e519524SHoward Hinnant ++__first2; 55243e519524SHoward Hinnant } 55253e519524SHoward Hinnant } 5526ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55273e519524SHoward Hinnant} 55283e519524SHoward Hinnant 55293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55313e519524SHoward Hinnant_OutputIterator 55323e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55343e519524SHoward Hinnant{ 5535145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55383e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5539145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55413e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5542145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55433e519524SHoward Hinnant} 55443e519524SHoward Hinnant 55453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55473e519524SHoward Hinnant_OutputIterator 55483e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55503e519524SHoward Hinnant{ 5551ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55523e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55533e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55543e519524SHoward Hinnant} 55553e519524SHoward Hinnant 55563e519524SHoward Hinnant// lexicographical_compare 55573e519524SHoward Hinnant 55583e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55591b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 55603e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55623e519524SHoward Hinnant{ 5563910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55643e519524SHoward Hinnant { 55653e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55663e519524SHoward Hinnant return true; 55673e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55683e519524SHoward Hinnant return false; 55693e519524SHoward Hinnant } 55703e519524SHoward Hinnant return false; 55713e519524SHoward Hinnant} 55723e519524SHoward Hinnant 55733e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55741b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55753e519524SHoward Hinnantbool 55763e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55783e519524SHoward Hinnant{ 5579145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55823e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5583145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55853e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5586145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55873e519524SHoward Hinnant} 55883e519524SHoward Hinnant 55893e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55901b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55913e519524SHoward Hinnantbool 55923e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 55943e519524SHoward Hinnant{ 5595ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 55963e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55973e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55983e519524SHoward Hinnant} 55993e519524SHoward Hinnant 56003e519524SHoward Hinnant// next_permutation 56013e519524SHoward Hinnant 56023e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56033e519524SHoward Hinnantbool 56043e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56053e519524SHoward Hinnant{ 56063e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56073e519524SHoward Hinnant if (__first == __last || __first == --__i) 56083e519524SHoward Hinnant return false; 56093e519524SHoward Hinnant while (true) 56103e519524SHoward Hinnant { 56113e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56123e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56133e519524SHoward Hinnant { 56143e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56153e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56163e519524SHoward Hinnant ; 56173e519524SHoward Hinnant swap(*__i, *__j); 5618ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56193e519524SHoward Hinnant return true; 56203e519524SHoward Hinnant } 56213e519524SHoward Hinnant if (__i == __first) 56223e519524SHoward Hinnant { 5623ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56243e519524SHoward Hinnant return false; 56253e519524SHoward Hinnant } 56263e519524SHoward Hinnant } 56273e519524SHoward Hinnant} 56283e519524SHoward Hinnant 56293e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56313e519524SHoward Hinnantbool 56323e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56333e519524SHoward Hinnant{ 5634145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56373e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5638145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56403e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5641145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56423e519524SHoward Hinnant} 56433e519524SHoward Hinnant 56443e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56463e519524SHoward Hinnantbool 56473e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56483e519524SHoward Hinnant{ 5649ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56503e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56513e519524SHoward Hinnant} 56523e519524SHoward Hinnant 56533e519524SHoward Hinnant// prev_permutation 56543e519524SHoward Hinnant 56553e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56563e519524SHoward Hinnantbool 56573e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56583e519524SHoward Hinnant{ 56593e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56603e519524SHoward Hinnant if (__first == __last || __first == --__i) 56613e519524SHoward Hinnant return false; 56623e519524SHoward Hinnant while (true) 56633e519524SHoward Hinnant { 56643e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56653e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56663e519524SHoward Hinnant { 56673e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56683e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56693e519524SHoward Hinnant ; 56703e519524SHoward Hinnant swap(*__i, *__j); 5671ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56723e519524SHoward Hinnant return true; 56733e519524SHoward Hinnant } 56743e519524SHoward Hinnant if (__i == __first) 56753e519524SHoward Hinnant { 5676ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56773e519524SHoward Hinnant return false; 56783e519524SHoward Hinnant } 56793e519524SHoward Hinnant } 56803e519524SHoward Hinnant} 56813e519524SHoward Hinnant 56823e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56843e519524SHoward Hinnantbool 56853e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56863e519524SHoward Hinnant{ 5687145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56903e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5691145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56933e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5694145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56953e519524SHoward Hinnant} 56963e519524SHoward Hinnant 56973e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56993e519524SHoward Hinnantbool 57003e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57013e519524SHoward Hinnant{ 5702ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57033e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57043e519524SHoward Hinnant} 57053e519524SHoward Hinnant 57063e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57073e519524SHoward Hinnant 5708a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5709a016efb1SEric Fiselier 57103e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5711