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> 6483e519524SHoward Hinnant 6495d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6505d1a701dSHoward Hinnant#include "support/ibm/support.h" 6515d1a701dSHoward Hinnant#endif 6525d50aa32SEric Fiselier#if defined(_LIBCPP_COMPILER_MSVC) 65380f8cfb3SEric Fiselier#include <intrin.h> 6545f878d4bSHoward Hinnant#endif 6555d1a701dSHoward Hinnant 656c1bd9197SEric Fiselier#include <__debug> 657c1bd9197SEric Fiselier 658073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6593e519524SHoward Hinnant#pragma GCC system_header 660073458b1SHoward Hinnant#endif 6613e519524SHoward Hinnant 662a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 663a016efb1SEric Fiselier#include <__undef_macros> 664a016efb1SEric Fiselier 665a016efb1SEric Fiselier 6663e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6673e519524SHoward Hinnant 6689d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6699d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6709d67c6d5SMarshall Clow// * We haven't included <functional> here. 6713e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6723e519524SHoward Hinnantstruct __equal_to 6733e519524SHoward Hinnant{ 674*d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 675*d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 676*d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 677*d8098f97SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6783e519524SHoward Hinnant}; 6793e519524SHoward Hinnant 6803e519524SHoward Hinnanttemplate <class _T1> 6813e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6823e519524SHoward Hinnant{ 6839d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6849d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6853e519524SHoward Hinnant}; 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class _T1> 6883e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6893e519524SHoward Hinnant{ 6909d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6919d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6923e519524SHoward Hinnant}; 6933e519524SHoward Hinnant 6943e519524SHoward Hinnanttemplate <class _T1> 6953e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6963e519524SHoward Hinnant{ 6979d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6989d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6993e519524SHoward Hinnant}; 7003e519524SHoward Hinnant 7013e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 7023e519524SHoward Hinnantstruct __less 7033e519524SHoward Hinnant{ 7049d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7059d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7069d67c6d5SMarshall Clow 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7099d67c6d5SMarshall Clow 7109d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7119d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7129d67c6d5SMarshall Clow 7139d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7149d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7153e519524SHoward Hinnant}; 7163e519524SHoward Hinnant 7173e519524SHoward Hinnanttemplate <class _T1> 7183e519524SHoward Hinnantstruct __less<_T1, _T1> 7193e519524SHoward Hinnant{ 7209d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7219d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7223e519524SHoward Hinnant}; 7233e519524SHoward Hinnant 7243e519524SHoward Hinnanttemplate <class _T1> 7253e519524SHoward Hinnantstruct __less<const _T1, _T1> 7263e519524SHoward Hinnant{ 7279d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7289d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7293e519524SHoward Hinnant}; 7303e519524SHoward Hinnant 7313e519524SHoward Hinnanttemplate <class _T1> 7323e519524SHoward Hinnantstruct __less<_T1, const _T1> 7333e519524SHoward Hinnant{ 7349d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7359d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7363e519524SHoward Hinnant}; 7373e519524SHoward Hinnant 7383e519524SHoward Hinnanttemplate <class _Predicate> 739a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7403e519524SHoward Hinnant{ 7413e519524SHoward Hinnantprivate: 7423e519524SHoward Hinnant _Predicate __p_; 7433e519524SHoward Hinnantpublic: 744a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7453e519524SHoward Hinnant 7463e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 747a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7483e519524SHoward Hinnant 7493e519524SHoward Hinnant template <class _T1> 7503e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7513e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7523e519524SHoward Hinnant 7533e519524SHoward Hinnant template <class _T1, class _T2> 7543e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 755a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7563e519524SHoward Hinnant}; 7573e519524SHoward Hinnant 758145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7593e519524SHoward Hinnant 7603e519524SHoward Hinnanttemplate <class _Compare> 7613e519524SHoward Hinnantstruct __debug_less 7623e519524SHoward Hinnant{ 7633e519524SHoward Hinnant _Compare __comp_; 7643e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 765331d2159SEric Fiselier 7663e519524SHoward Hinnant template <class _Tp, class _Up> 7673e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7683e519524SHoward Hinnant { 7693e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7703e519524SHoward Hinnant if (__r) 771331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7723e519524SHoward Hinnant return __r; 7733e519524SHoward Hinnant } 774331d2159SEric Fiselier 775331d2159SEric Fiselier template <class _LHS, class _RHS> 776331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 777331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 778331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 779331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 780331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 781331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 782331d2159SEric Fiselier } 783331d2159SEric Fiselier 784331d2159SEric Fiselier template <class _LHS, class _RHS> 785331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 786331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7873e519524SHoward Hinnant}; 7883e519524SHoward Hinnant 789145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7903e519524SHoward Hinnant 791c8edcb36SHoward Hinnant// Precondition: __x != 0 792c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 79380f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 79480f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 795c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 79680f8cfb3SEric Fiselier#else 79780f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 79880f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 79980f8cfb3SEric Fiselier unsigned long where; 80080f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 80180f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8029a0a0045SShoaib Meenai if (_BitScanForward(&where, __x)) 80380f8cfb3SEric Fiselier return where; 80480f8cfb3SEric Fiselier return 32; 80580f8cfb3SEric Fiselier#endif 806c206366fSHoward Hinnant} 807c206366fSHoward Hinnant 808c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 80980f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 81080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 811c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 81280f8cfb3SEric Fiselier#else 81380f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 81480f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 81580f8cfb3SEric Fiselier#endif 816c206366fSHoward Hinnant} 817c206366fSHoward Hinnant 818c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 81980f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 82080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 821c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 82280f8cfb3SEric Fiselier#else 82380f8cfb3SEric Fiselier unsigned long where; 82480f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 82580f8cfb3SEric Fiselier// Returns zero if no set bit is found. 82680f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 82780f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 8289a0a0045SShoaib Meenai if (_BitScanForward64(&where, __x)) 82980f8cfb3SEric Fiselier return static_cast<int>(where); 83080f8cfb3SEric Fiselier#else 83180f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 83280f8cfb3SEric Fiselier // Scan the Low Word. 8339a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x))) 83480f8cfb3SEric Fiselier return where; 83580f8cfb3SEric Fiselier // Scan the High Word. 8369a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x >> 32))) 83780f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 83880f8cfb3SEric Fiselier#endif 83980f8cfb3SEric Fiselier return 64; 84080f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 841c206366fSHoward Hinnant} 842c8edcb36SHoward Hinnant 843c8edcb36SHoward Hinnant// Precondition: __x != 0 844c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 84580f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 84680f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 847c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 84880f8cfb3SEric Fiselier#else 84980f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 85080f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 85180f8cfb3SEric Fiselier unsigned long where; 85280f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 85380f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8549a0a0045SShoaib Meenai if (_BitScanReverse(&where, __x)) 85580f8cfb3SEric Fiselier return 31 - where; 85680f8cfb3SEric Fiselier return 32; // Undefined Behavior. 85780f8cfb3SEric Fiselier#endif 858c206366fSHoward Hinnant} 859c206366fSHoward Hinnant 860c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 86180f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 86280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 863c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 86480f8cfb3SEric Fiselier#else 86580f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 86680f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 86780f8cfb3SEric Fiselier#endif 868c206366fSHoward Hinnant} 869c206366fSHoward Hinnant 870c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 87180f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 87280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 873c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 87480f8cfb3SEric Fiselier#else 87580f8cfb3SEric Fiselier unsigned long where; 87680f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 87780f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 87880f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 8799a0a0045SShoaib Meenai if (_BitScanReverse64(&where, __x)) 88080f8cfb3SEric Fiselier return static_cast<int>(63 - where); 88180f8cfb3SEric Fiselier#else 88280f8cfb3SEric Fiselier // Scan the high 32 bits. 8839a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x >> 32))) 88480f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 88580f8cfb3SEric Fiselier // Scan the low 32 bits. 8869a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x))) 88780f8cfb3SEric Fiselier return 63 - where; 88880f8cfb3SEric Fiselier#endif 88980f8cfb3SEric Fiselier return 64; // Undefined Behavior. 89080f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 891c206366fSHoward Hinnant} 892c8edcb36SHoward Hinnant 89380f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 89480f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 89580f8cfb3SEric Fiselier return __builtin_popcount (__x); 89680f8cfb3SEric Fiselier#else 89780f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 89880f8cfb3SEric Fiselier return __popcnt(__x); 89980f8cfb3SEric Fiselier#endif 90080f8cfb3SEric Fiselier} 90180f8cfb3SEric Fiselier 90280f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 90380f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90480f8cfb3SEric Fiselier return __builtin_popcountl (__x); 90580f8cfb3SEric Fiselier#else 90680f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 90780f8cfb3SEric Fiselier return __popcnt(__x); 90880f8cfb3SEric Fiselier#endif 90980f8cfb3SEric Fiselier} 91080f8cfb3SEric Fiselier 91180f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 91280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 91380f8cfb3SEric Fiselier return __builtin_popcountll(__x); 91480f8cfb3SEric Fiselier#else 91580f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 91680f8cfb3SEric Fiselier return __popcnt64(__x); 91780f8cfb3SEric Fiselier#endif 91880f8cfb3SEric Fiselier} 919c8edcb36SHoward Hinnant 9203e519524SHoward Hinnant// all_of 9213e519524SHoward Hinnant 9223e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 923706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9243e519524SHoward Hinnantbool 9253e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9263e519524SHoward Hinnant{ 9273e519524SHoward Hinnant for (; __first != __last; ++__first) 9283e519524SHoward Hinnant if (!__pred(*__first)) 9293e519524SHoward Hinnant return false; 9303e519524SHoward Hinnant return true; 9313e519524SHoward Hinnant} 9323e519524SHoward Hinnant 9333e519524SHoward Hinnant// any_of 9343e519524SHoward Hinnant 9353e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 936706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9373e519524SHoward Hinnantbool 9383e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9393e519524SHoward Hinnant{ 9403e519524SHoward Hinnant for (; __first != __last; ++__first) 9413e519524SHoward Hinnant if (__pred(*__first)) 9423e519524SHoward Hinnant return true; 9433e519524SHoward Hinnant return false; 9443e519524SHoward Hinnant} 9453e519524SHoward Hinnant 9463e519524SHoward Hinnant// none_of 9473e519524SHoward Hinnant 9483e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 949706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9503e519524SHoward Hinnantbool 9513e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9523e519524SHoward Hinnant{ 9533e519524SHoward Hinnant for (; __first != __last; ++__first) 9543e519524SHoward Hinnant if (__pred(*__first)) 9553e519524SHoward Hinnant return false; 9563e519524SHoward Hinnant return true; 9573e519524SHoward Hinnant} 9583e519524SHoward Hinnant 9593e519524SHoward Hinnant// for_each 9603e519524SHoward Hinnant 9613e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9621b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9633e519524SHoward Hinnant_Function 9643e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9653e519524SHoward Hinnant{ 9663e519524SHoward Hinnant for (; __first != __last; ++__first) 9673e519524SHoward Hinnant __f(*__first); 9681c7fe126SMarshall Clow return __f; 9693e519524SHoward Hinnant} 9703e519524SHoward Hinnant 9711d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 972d5c65ffaSMarshall Clow// for_each_n 973d5c65ffaSMarshall Clow 974d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 9751b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 976d5c65ffaSMarshall Clow_InputIterator 977d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 978d5c65ffaSMarshall Clow{ 979d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 980d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 981d5c65ffaSMarshall Clow while (__n > 0) 982d5c65ffaSMarshall Clow { 983d5c65ffaSMarshall Clow __f(*__first); 984d5c65ffaSMarshall Clow ++__first; 985d5c65ffaSMarshall Clow --__n; 986d5c65ffaSMarshall Clow } 987d5c65ffaSMarshall Clow return __first; 988d5c65ffaSMarshall Clow} 9891d02996dSMarshall Clow#endif 990d5c65ffaSMarshall Clow 9913e519524SHoward Hinnant// find 9923e519524SHoward Hinnant 9933e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 99449c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9953e519524SHoward Hinnant_InputIterator 996e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9973e519524SHoward Hinnant{ 9983e519524SHoward Hinnant for (; __first != __last; ++__first) 999e4383379SHoward Hinnant if (*__first == __value_) 10003e519524SHoward Hinnant break; 10013e519524SHoward Hinnant return __first; 10023e519524SHoward Hinnant} 10033e519524SHoward Hinnant 10043e519524SHoward Hinnant// find_if 10053e519524SHoward Hinnant 10063e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 100749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10083e519524SHoward Hinnant_InputIterator 10093e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10103e519524SHoward Hinnant{ 10113e519524SHoward Hinnant for (; __first != __last; ++__first) 10123e519524SHoward Hinnant if (__pred(*__first)) 10133e519524SHoward Hinnant break; 10143e519524SHoward Hinnant return __first; 10153e519524SHoward Hinnant} 10163e519524SHoward Hinnant 10173e519524SHoward Hinnant// find_if_not 10183e519524SHoward Hinnant 10193e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10208694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10213e519524SHoward Hinnant_InputIterator 10223e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10233e519524SHoward Hinnant{ 10243e519524SHoward Hinnant for (; __first != __last; ++__first) 10253e519524SHoward Hinnant if (!__pred(*__first)) 10263e519524SHoward Hinnant break; 10273e519524SHoward Hinnant return __first; 10283e519524SHoward Hinnant} 10293e519524SHoward Hinnant 10303e519524SHoward Hinnant// find_end 10313e519524SHoward Hinnant 10323e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10338694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator1 10343e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10353e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10363e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10373e519524SHoward Hinnant{ 10383e519524SHoward Hinnant // modeled after search algorithm 10393e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10403e519524SHoward Hinnant if (__first2 == __last2) 10413e519524SHoward Hinnant return __r; 10423e519524SHoward Hinnant while (true) 10433e519524SHoward Hinnant { 10443e519524SHoward Hinnant while (true) 10453e519524SHoward Hinnant { 10463e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10473e519524SHoward Hinnant return __r; // (or __last1 if never found) 10483e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10493e519524SHoward Hinnant break; 10503e519524SHoward Hinnant ++__first1; 10513e519524SHoward Hinnant } 10523e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10533e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10543e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10553e519524SHoward Hinnant while (true) 10563e519524SHoward Hinnant { 10573e519524SHoward Hinnant if (++__m2 == __last2) 10583e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10593e519524SHoward Hinnant __r = __first1; 10603e519524SHoward Hinnant ++__first1; 10613e519524SHoward Hinnant break; 10623e519524SHoward Hinnant } 10633e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10643e519524SHoward Hinnant return __r; 10653e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10663e519524SHoward Hinnant { 10673e519524SHoward Hinnant ++__first1; 10683e519524SHoward Hinnant break; 10693e519524SHoward Hinnant } // else there is a match, check next elements 10703e519524SHoward Hinnant } 10713e519524SHoward Hinnant } 10723e519524SHoward Hinnant} 10733e519524SHoward Hinnant 10743e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10758694428eSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _BidirectionalIterator1 10763e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10773e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10783e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10793e519524SHoward Hinnant{ 10803e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10813e519524SHoward Hinnant if (__first2 == __last2) 10823e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10833e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10843e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10853e519524SHoward Hinnant --__l2; 10863e519524SHoward Hinnant while (true) 10873e519524SHoward Hinnant { 10883e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10893e519524SHoward Hinnant while (true) 10903e519524SHoward Hinnant { 10913e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10923e519524SHoward Hinnant return __last1; 10933e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10943e519524SHoward Hinnant break; 10953e519524SHoward Hinnant } 10963e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10973e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10983e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10993e519524SHoward Hinnant while (true) 11003e519524SHoward Hinnant { 11013e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 11023e519524SHoward Hinnant return __m1; 11033e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 11043e519524SHoward Hinnant return __last1; 11053e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11063e519524SHoward Hinnant { 11073e519524SHoward Hinnant break; 11083e519524SHoward Hinnant } // else there is a match, check next elements 11093e519524SHoward Hinnant } 11103e519524SHoward Hinnant } 11113e519524SHoward Hinnant} 11123e519524SHoward Hinnant 11133e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11149b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11153e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11163e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11173e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11183e519524SHoward Hinnant{ 11193e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11213e519524SHoward Hinnant if (__len2 == 0) 11223e519524SHoward Hinnant return __last1; 11233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11243e519524SHoward Hinnant if (__len1 < __len2) 11253e519524SHoward Hinnant return __last1; 11263e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11273e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11283e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11293e519524SHoward Hinnant --__l2; 11303e519524SHoward Hinnant while (true) 11313e519524SHoward Hinnant { 11323e519524SHoward Hinnant while (true) 11333e519524SHoward Hinnant { 11343e519524SHoward Hinnant if (__s == __l1) 11353e519524SHoward Hinnant return __last1; 11363e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11373e519524SHoward Hinnant break; 11383e519524SHoward Hinnant } 11393e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11403e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11413e519524SHoward Hinnant while (true) 11423e519524SHoward Hinnant { 11433e519524SHoward Hinnant if (__m2 == __first2) 11443e519524SHoward Hinnant return __m1; 11453e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11463e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11473e519524SHoward Hinnant { 11483e519524SHoward Hinnant break; 11493e519524SHoward Hinnant } 11503e519524SHoward Hinnant } 11513e519524SHoward Hinnant } 11523e519524SHoward Hinnant} 11533e519524SHoward Hinnant 11543e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11558694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11563e519524SHoward Hinnant_ForwardIterator1 11573e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11583e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11593e519524SHoward Hinnant{ 1160ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11613e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11623e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11633e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11643e519524SHoward Hinnant} 11653e519524SHoward Hinnant 11663e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11678694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11683e519524SHoward Hinnant_ForwardIterator1 11693e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11703e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11713e519524SHoward Hinnant{ 11723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1174ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11753e519524SHoward Hinnant} 11763e519524SHoward Hinnant 11773e519524SHoward Hinnant// find_first_of 11783e519524SHoward Hinnant 11793e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11809b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11819b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11823e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11833e519524SHoward Hinnant{ 11843e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11853e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11863e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11873e519524SHoward Hinnant return __first1; 11883e519524SHoward Hinnant return __last1; 11893e519524SHoward Hinnant} 11903e519524SHoward Hinnant 11919b0af34dSMarshall Clow 11929b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11938694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 11949b0af34dSMarshall Clow_ForwardIterator1 11959b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11969b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11979b0af34dSMarshall Clow{ 11989b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11999b0af34dSMarshall Clow} 12009b0af34dSMarshall Clow 12013e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12028694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12033e519524SHoward Hinnant_ForwardIterator1 12043e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12053e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12063e519524SHoward Hinnant{ 12073e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12083e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12099b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12103e519524SHoward Hinnant} 12113e519524SHoward Hinnant 12123e519524SHoward Hinnant// adjacent_find 12133e519524SHoward Hinnant 12143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12158694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12163e519524SHoward Hinnant_ForwardIterator 12173e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12183e519524SHoward Hinnant{ 12193e519524SHoward Hinnant if (__first != __last) 12203e519524SHoward Hinnant { 12213e519524SHoward Hinnant _ForwardIterator __i = __first; 12223e519524SHoward Hinnant while (++__i != __last) 12233e519524SHoward Hinnant { 12243e519524SHoward Hinnant if (__pred(*__first, *__i)) 12253e519524SHoward Hinnant return __first; 12263e519524SHoward Hinnant __first = __i; 12273e519524SHoward Hinnant } 12283e519524SHoward Hinnant } 12293e519524SHoward Hinnant return __last; 12303e519524SHoward Hinnant} 12313e519524SHoward Hinnant 12323e519524SHoward Hinnanttemplate <class _ForwardIterator> 12338694428eSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12343e519524SHoward Hinnant_ForwardIterator 12353e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12363e519524SHoward Hinnant{ 12373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1238ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12393e519524SHoward Hinnant} 12403e519524SHoward Hinnant 12413e519524SHoward Hinnant// count 12423e519524SHoward Hinnant 12433e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 1244056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12453e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1246e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12473e519524SHoward Hinnant{ 12483e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12493e519524SHoward Hinnant for (; __first != __last; ++__first) 1250e4383379SHoward Hinnant if (*__first == __value_) 12513e519524SHoward Hinnant ++__r; 12523e519524SHoward Hinnant return __r; 12533e519524SHoward Hinnant} 12543e519524SHoward Hinnant 12553e519524SHoward Hinnant// count_if 12563e519524SHoward Hinnant 12573e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 1258056f15e3SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12593e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12603e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12613e519524SHoward Hinnant{ 12623e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12633e519524SHoward Hinnant for (; __first != __last; ++__first) 12643e519524SHoward Hinnant if (__pred(*__first)) 12653e519524SHoward Hinnant ++__r; 12663e519524SHoward Hinnant return __r; 12673e519524SHoward Hinnant} 12683e519524SHoward Hinnant 12693e519524SHoward Hinnant// mismatch 12703e519524SHoward Hinnant 12713e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12726538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12733e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12743e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12753e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12763e519524SHoward Hinnant{ 1277bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12783e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12793e519524SHoward Hinnant break; 12803e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12813e519524SHoward Hinnant} 12823e519524SHoward Hinnant 12833e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12846538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12853e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12863e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12873e519524SHoward Hinnant{ 12883e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12893e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1290ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12913e519524SHoward Hinnant} 12923e519524SHoward Hinnant 12930b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12940b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12956538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 12960b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12970b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12980b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12990b0bbd2fSMarshall Clow _BinaryPredicate __pred) 13000b0bbd2fSMarshall Clow{ 1301bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13020b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13030b0bbd2fSMarshall Clow break; 13040b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 13050b0bbd2fSMarshall Clow} 13060b0bbd2fSMarshall Clow 13070b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13086538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13090b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13100b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13110b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13120b0bbd2fSMarshall Clow{ 13130b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13140b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13150b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13160b0bbd2fSMarshall Clow} 13170b0bbd2fSMarshall Clow#endif 13180b0bbd2fSMarshall Clow 13193e519524SHoward Hinnant// equal 13203e519524SHoward Hinnant 13213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13226538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13233e519524SHoward Hinnantbool 13243e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13253e519524SHoward Hinnant{ 1326910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13273e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13283e519524SHoward Hinnant return false; 13293e519524SHoward Hinnant return true; 13303e519524SHoward Hinnant} 13313e519524SHoward Hinnant 13323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13336538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13343e519524SHoward Hinnantbool 13353e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13363e519524SHoward Hinnant{ 13373e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13383e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1339ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13403e519524SHoward Hinnant} 13413e519524SHoward Hinnant 13420b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13430b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13446538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13450b0bbd2fSMarshall Clowbool 13460b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13470b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13480b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13490b0bbd2fSMarshall Clow{ 1350910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13510b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13520b0bbd2fSMarshall Clow return false; 13530b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13540b0bbd2fSMarshall Clow} 13550b0bbd2fSMarshall Clow 13560b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13576538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13580b0bbd2fSMarshall Clowbool 13590b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13600b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13610b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13620b0bbd2fSMarshall Clow{ 13630b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13640b0bbd2fSMarshall Clow return false; 13650b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13660b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13670b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13680b0bbd2fSMarshall Clow} 13690b0bbd2fSMarshall Clow 13700b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13716538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13720b0bbd2fSMarshall Clowbool 13730b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13740b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13750b0bbd2fSMarshall Clow{ 13760b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13770b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13780b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13790b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13800b0bbd2fSMarshall Clow} 13810b0bbd2fSMarshall Clow 13820b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13836538e28dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 13840b0bbd2fSMarshall Clowbool 13850b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13860b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13870b0bbd2fSMarshall Clow{ 13880b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13890b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13900b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13910b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13920b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13930b0bbd2fSMarshall Clow} 13940b0bbd2fSMarshall Clow#endif 13950b0bbd2fSMarshall Clow 13963e519524SHoward Hinnant// is_permutation 13973e519524SHoward Hinnant 13983e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 139949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14003e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14013e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 14023e519524SHoward Hinnant{ 140349c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1404910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 14053e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 140649c7643cSMarshall Clow break; 140749c7643cSMarshall Clow if (__first1 == __last1) 14083e519524SHoward Hinnant return true; 140949c7643cSMarshall Clow 14103e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 14113e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1412ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14133e519524SHoward Hinnant if (__l1 == _D1(1)) 14143e519524SHoward Hinnant return false; 1415ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14163e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14173e519524SHoward Hinnant // equal elements in [f2, l2) 14183e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14193e519524SHoward Hinnant { 14203e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 1421939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1422939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1423939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1424939b1623SPeter Collingbourne break; 1425939b1623SPeter Collingbourne if (__match == __i) { 14263e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14273e519524SHoward Hinnant _D1 __c2 = 0; 14283e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14293e519524SHoward Hinnant if (__pred(*__i, *__j)) 14303e519524SHoward Hinnant ++__c2; 14313e519524SHoward Hinnant if (__c2 == 0) 14323e519524SHoward Hinnant return false; 14333e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14343e519524SHoward Hinnant _D1 __c1 = 1; 1435ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14363e519524SHoward Hinnant if (__pred(*__i, *__j)) 14373e519524SHoward Hinnant ++__c1; 14383e519524SHoward Hinnant if (__c1 != __c2) 14393e519524SHoward Hinnant return false; 14403e519524SHoward Hinnant } 14413e519524SHoward Hinnant } 14423e519524SHoward Hinnant return true; 14433e519524SHoward Hinnant} 14443e519524SHoward Hinnant 14453e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 144649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14473e519524SHoward Hinnantbool 14483e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14493e519524SHoward Hinnant _ForwardIterator2 __first2) 14503e519524SHoward Hinnant{ 14513e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14523e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1453ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14543e519524SHoward Hinnant} 14553e519524SHoward Hinnant 14560b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14570b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 145849c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14590b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14600b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14610b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14620b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14630b0bbd2fSMarshall Clow{ 146449c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1465847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14660b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 146749c7643cSMarshall Clow break; 146849c7643cSMarshall Clow if (__first1 == __last1) 146949c7643cSMarshall Clow return __first2 == __last2; 147049c7643cSMarshall Clow else if (__first2 == __last2) 147149c7643cSMarshall Clow return false; 147249c7643cSMarshall Clow 14730b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14740b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14750b0bbd2fSMarshall Clow 14760b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1477fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14780b0bbd2fSMarshall Clow if (__l1 != __l2) 14790b0bbd2fSMarshall Clow return false; 14800b0bbd2fSMarshall Clow 14810b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14820b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14830b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14840b0bbd2fSMarshall Clow { 14850b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 1486939b1623SPeter Collingbourne _ForwardIterator1 __match = __first1; 1487939b1623SPeter Collingbourne for (; __match != __i; ++__match) 1488939b1623SPeter Collingbourne if (__pred(*__match, *__i)) 1489939b1623SPeter Collingbourne break; 1490939b1623SPeter Collingbourne if (__match == __i) { 14910b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14920b0bbd2fSMarshall Clow _D1 __c2 = 0; 14930b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14940b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14950b0bbd2fSMarshall Clow ++__c2; 14960b0bbd2fSMarshall Clow if (__c2 == 0) 14970b0bbd2fSMarshall Clow return false; 14980b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14990b0bbd2fSMarshall Clow _D1 __c1 = 1; 15000b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 15010b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 15020b0bbd2fSMarshall Clow ++__c1; 15030b0bbd2fSMarshall Clow if (__c1 != __c2) 15040b0bbd2fSMarshall Clow return false; 15050b0bbd2fSMarshall Clow } 15060b0bbd2fSMarshall Clow } 15070b0bbd2fSMarshall Clow return true; 15080b0bbd2fSMarshall Clow} 15090b0bbd2fSMarshall Clow 15100b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 151149c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 15120b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 15130b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 15140b0bbd2fSMarshall Clow _BinaryPredicate __pred, 15150b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 15160b0bbd2fSMarshall Clow{ 15170b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 15180b0bbd2fSMarshall Clow return false; 15190b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 15200b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 15210b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 15220b0bbd2fSMarshall Clow} 15230b0bbd2fSMarshall Clow 15240b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 152549c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15260b0bbd2fSMarshall Clowbool 15270b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15280b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 15290b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15300b0bbd2fSMarshall Clow{ 15310b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15320b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15330b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15340b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15350b0bbd2fSMarshall Clow} 15360b0bbd2fSMarshall Clow 15370b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 153849c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15390b0bbd2fSMarshall Clowbool 15400b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15410b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15420b0bbd2fSMarshall Clow{ 15430b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15440b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15450b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15460b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15470b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15480b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15490b0bbd2fSMarshall Clow} 15500b0bbd2fSMarshall Clow#endif 15510b0bbd2fSMarshall Clow 15523e519524SHoward Hinnant// search 1553d835e592SMarshall Clow// __search is in <functional> 15543e519524SHoward Hinnant 15553e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 155612f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15573e519524SHoward Hinnant_ForwardIterator1 15583e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15593e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15603e519524SHoward Hinnant{ 1561ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15623e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 156328cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 156428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 156528cc4ddeSMarshall Clow .first; 15663e519524SHoward Hinnant} 15673e519524SHoward Hinnant 15683e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 156912f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15703e519524SHoward Hinnant_ForwardIterator1 15713e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15723e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15733e519524SHoward Hinnant{ 157428cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 157528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1576ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15773e519524SHoward Hinnant} 15783e519524SHoward Hinnant 1579d835e592SMarshall Clow 1580d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1581d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 158212f0a779SMarshall Clow_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 1583d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1584d835e592SMarshall Clow{ return __s(__f, __l).first; } 1585d835e592SMarshall Clow#endif 1586d835e592SMarshall Clow 15873e519524SHoward Hinnant// search_n 15883e519524SHoward Hinnant 15893e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 159012f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 15913e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1592e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15933e519524SHoward Hinnant{ 15943e519524SHoward Hinnant if (__count <= 0) 15953e519524SHoward Hinnant return __first; 15963e519524SHoward Hinnant while (true) 15973e519524SHoward Hinnant { 1598e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15993e519524SHoward Hinnant while (true) 16003e519524SHoward Hinnant { 1601e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16023e519524SHoward Hinnant return __last; 1603e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16043e519524SHoward Hinnant break; 16053e519524SHoward Hinnant ++__first; 16063e519524SHoward Hinnant } 1607e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16083e519524SHoward Hinnant _ForwardIterator __m = __first; 16093e519524SHoward Hinnant _Size __c(0); 16103e519524SHoward Hinnant while (true) 16113e519524SHoward Hinnant { 16123e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16133e519524SHoward Hinnant return __first; 16143e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16153e519524SHoward Hinnant return __last; 1616e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16173e519524SHoward Hinnant { 16183e519524SHoward Hinnant __first = __m; 16193e519524SHoward Hinnant ++__first; 16203e519524SHoward Hinnant break; 16213e519524SHoward Hinnant } // else there is a match, check next elements 16223e519524SHoward Hinnant } 16233e519524SHoward Hinnant } 16243e519524SHoward Hinnant} 16253e519524SHoward Hinnant 16263e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 162712f0a779SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 16283e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1629e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16303e519524SHoward Hinnant{ 16313e519524SHoward Hinnant if (__count <= 0) 16323e519524SHoward Hinnant return __first; 16333e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16343e519524SHoward Hinnant if (__len < __count) 16353e519524SHoward Hinnant return __last; 16363e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16373e519524SHoward Hinnant while (true) 16383e519524SHoward Hinnant { 1639e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16403e519524SHoward Hinnant while (true) 16413e519524SHoward Hinnant { 1642b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16433e519524SHoward Hinnant return __last; 1644e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16453e519524SHoward Hinnant break; 16463e519524SHoward Hinnant ++__first; 16473e519524SHoward Hinnant } 1648e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16493e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16503e519524SHoward Hinnant _Size __c(0); 16513e519524SHoward Hinnant while (true) 16523e519524SHoward Hinnant { 16533e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16543e519524SHoward Hinnant return __first; 16553e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1656e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16573e519524SHoward Hinnant { 16583e519524SHoward Hinnant __first = __m; 16593e519524SHoward Hinnant ++__first; 16603e519524SHoward Hinnant break; 16613e519524SHoward Hinnant } // else there is a match, check next elements 16623e519524SHoward Hinnant } 16633e519524SHoward Hinnant } 16643e519524SHoward Hinnant} 16653e519524SHoward Hinnant 16663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 166712f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16683e519524SHoward Hinnant_ForwardIterator 16693e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1670e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16713e519524SHoward Hinnant{ 1672ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 167351544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 167451544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16753e519524SHoward Hinnant} 16763e519524SHoward Hinnant 16773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 167812f0a779SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 16793e519524SHoward Hinnant_ForwardIterator 1680e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16813e519524SHoward Hinnant{ 16823e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 168351544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 168451544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnant// copy 16883e519524SHoward Hinnanttemplate <class _Iter> 16893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16903e519524SHoward Hinnant_Iter 16913e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16923e519524SHoward Hinnant{ 16933e519524SHoward Hinnant return __i; 16943e519524SHoward Hinnant} 16953e519524SHoward Hinnant 16963e519524SHoward Hinnanttemplate <class _Tp> 16975b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 16983e519524SHoward Hinnanttypename enable_if 16993e519524SHoward Hinnant< 1700ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17013e519524SHoward Hinnant _Tp* 17023e519524SHoward Hinnant>::type 17033e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17043e519524SHoward Hinnant{ 17053e519524SHoward Hinnant return __i.base(); 17063e519524SHoward Hinnant} 17073e519524SHoward Hinnant 1708fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1709fc88dbd2SHoward Hinnant 17103e519524SHoward Hinnanttemplate <class _Tp> 17119cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 17123e519524SHoward Hinnanttypename enable_if 17133e519524SHoward Hinnant< 1714ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17153e519524SHoward Hinnant _Tp* 17163e519524SHoward Hinnant>::type 17173e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17183e519524SHoward Hinnant{ 17193e519524SHoward Hinnant return __i.base(); 17203e519524SHoward Hinnant} 17213e519524SHoward Hinnant 172214bd0bf0SEric Fiselier#else 172314bd0bf0SEric Fiselier 172414bd0bf0SEric Fiseliertemplate <class _Tp> 17259cad5025SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_IF_NODEBUG 172614bd0bf0SEric Fiseliertypename enable_if 172714bd0bf0SEric Fiselier< 172814bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 172914bd0bf0SEric Fiselier __wrap_iter<_Tp*> 173014bd0bf0SEric Fiselier>::type 173114bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 173214bd0bf0SEric Fiselier{ 173314bd0bf0SEric Fiselier return __i; 173414bd0bf0SEric Fiselier} 173514bd0bf0SEric Fiselier 1736fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1737fc88dbd2SHoward Hinnant 17383e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17403e519524SHoward Hinnant_OutputIterator 17413e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17423e519524SHoward Hinnant{ 1743910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17443e519524SHoward Hinnant *__result = *__first; 17453e519524SHoward Hinnant return __result; 17463e519524SHoward Hinnant} 17473e519524SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnanttypename enable_if 17513e519524SHoward Hinnant< 17523e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1753ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17543e519524SHoward Hinnant _Up* 17553e519524SHoward Hinnant>::type 17563e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17573e519524SHoward Hinnant{ 17583e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17595b312052SMarshall Clow if (__n > 0) 1760ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17613e519524SHoward Hinnant return __result + __n; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_OutputIterator 17673e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17683e519524SHoward Hinnant{ 1769ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17703e519524SHoward Hinnant} 17713e519524SHoward Hinnant 17723e519524SHoward Hinnant// copy_backward 17733e519524SHoward Hinnant 1774d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17763e519524SHoward Hinnant_OutputIterator 1777d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17783e519524SHoward Hinnant{ 17793e519524SHoward Hinnant while (__first != __last) 17803e519524SHoward Hinnant *--__result = *--__last; 17813e519524SHoward Hinnant return __result; 17823e519524SHoward Hinnant} 17833e519524SHoward Hinnant 17843e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17863e519524SHoward Hinnanttypename enable_if 17873e519524SHoward Hinnant< 17883e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1789ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17903e519524SHoward Hinnant _Up* 17913e519524SHoward Hinnant>::type 17923e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17933e519524SHoward Hinnant{ 17943e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17955b312052SMarshall Clow if (__n > 0) 17965b312052SMarshall Clow { 17973e519524SHoward Hinnant __result -= __n; 1798ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17995b312052SMarshall Clow } 18003e519524SHoward Hinnant return __result; 18013e519524SHoward Hinnant} 18023e519524SHoward Hinnant 18033e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18053e519524SHoward Hinnant_BidirectionalIterator2 18063e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18073e519524SHoward Hinnant _BidirectionalIterator2 __result) 18083e519524SHoward Hinnant{ 1809fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1810fd838227SEric Fiselier __unwrap_iter(__last), 1811fd838227SEric Fiselier __unwrap_iter(__result)); 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnant// copy_if 18153e519524SHoward Hinnant 18163e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18183e519524SHoward Hinnant_OutputIterator 18193e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18203e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18213e519524SHoward Hinnant{ 18223e519524SHoward Hinnant for (; __first != __last; ++__first) 18233e519524SHoward Hinnant { 18243e519524SHoward Hinnant if (__pred(*__first)) 18253e519524SHoward Hinnant { 18263e519524SHoward Hinnant *__result = *__first; 18273e519524SHoward Hinnant ++__result; 18283e519524SHoward Hinnant } 18293e519524SHoward Hinnant } 18303e519524SHoward Hinnant return __result; 18313e519524SHoward Hinnant} 18323e519524SHoward Hinnant 18333e519524SHoward Hinnant// copy_n 18343e519524SHoward Hinnant 18353e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18373e519524SHoward Hinnanttypename enable_if 18383e519524SHoward Hinnant< 18393e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18403e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18413e519524SHoward Hinnant _OutputIterator 18423e519524SHoward Hinnant>::type 184351544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18443e519524SHoward Hinnant{ 184551544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 184651544023SEric Fiselier _IntegralSize __n = __orig_n; 184799847d2bSHoward Hinnant if (__n > 0) 184899847d2bSHoward Hinnant { 18493e519524SHoward Hinnant *__result = *__first; 185099847d2bSHoward Hinnant ++__result; 185199847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 185299847d2bSHoward Hinnant { 185399847d2bSHoward Hinnant ++__first; 185499847d2bSHoward Hinnant *__result = *__first; 185599847d2bSHoward Hinnant ++__result; 185699847d2bSHoward Hinnant } 185799847d2bSHoward Hinnant } 18583e519524SHoward Hinnant return __result; 18593e519524SHoward Hinnant} 18603e519524SHoward Hinnant 18613e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18633e519524SHoward Hinnanttypename enable_if 18643e519524SHoward Hinnant< 18653e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18663e519524SHoward Hinnant _OutputIterator 18673e519524SHoward Hinnant>::type 186851544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18693e519524SHoward Hinnant{ 187051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 187151544023SEric Fiselier _IntegralSize __n = __orig_n; 1872ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18733e519524SHoward Hinnant} 18743e519524SHoward Hinnant 18753e519524SHoward Hinnant// move 18763e519524SHoward Hinnant 18773e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18793e519524SHoward Hinnant_OutputIterator 18803e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18813e519524SHoward Hinnant{ 1882910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1883ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18843e519524SHoward Hinnant return __result; 18853e519524SHoward Hinnant} 18863e519524SHoward Hinnant 18873e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18893e519524SHoward Hinnanttypename enable_if 18903e519524SHoward Hinnant< 18913e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1892ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18933e519524SHoward Hinnant _Up* 18943e519524SHoward Hinnant>::type 18953e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18963e519524SHoward Hinnant{ 18973e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18985b312052SMarshall Clow if (__n > 0) 1899ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19003e519524SHoward Hinnant return __result + __n; 19013e519524SHoward Hinnant} 19023e519524SHoward Hinnant 19033e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19053e519524SHoward Hinnant_OutputIterator 19063e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19073e519524SHoward Hinnant{ 1908ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19093e519524SHoward Hinnant} 19103e519524SHoward Hinnant 19113e519524SHoward Hinnant// move_backward 19123e519524SHoward Hinnant 19133e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19153e519524SHoward Hinnant_OutputIterator 19163e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19173e519524SHoward Hinnant{ 19183e519524SHoward Hinnant while (__first != __last) 1919ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19203e519524SHoward Hinnant return __result; 19213e519524SHoward Hinnant} 19223e519524SHoward Hinnant 19233e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19253e519524SHoward Hinnanttypename enable_if 19263e519524SHoward Hinnant< 19273e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1928ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19293e519524SHoward Hinnant _Up* 19303e519524SHoward Hinnant>::type 19313e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19323e519524SHoward Hinnant{ 19333e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19345b312052SMarshall Clow if (__n > 0) 19355b312052SMarshall Clow { 19363e519524SHoward Hinnant __result -= __n; 1937ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19385b312052SMarshall Clow } 19393e519524SHoward Hinnant return __result; 19403e519524SHoward Hinnant} 19413e519524SHoward Hinnant 19423e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19443e519524SHoward Hinnant_BidirectionalIterator2 19453e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19463e519524SHoward Hinnant _BidirectionalIterator2 __result) 19473e519524SHoward Hinnant{ 1948ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19493e519524SHoward Hinnant} 19503e519524SHoward Hinnant 19513e519524SHoward Hinnant// iter_swap 19523e519524SHoward Hinnant 1953a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19543e519524SHoward Hinnant 19553e519524SHoward Hinnant// transform 19563e519524SHoward Hinnant 19573e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 195899894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19593e519524SHoward Hinnant_OutputIterator 19603e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19613e519524SHoward Hinnant{ 1962910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19633e519524SHoward Hinnant *__result = __op(*__first); 19643e519524SHoward Hinnant return __result; 19653e519524SHoward Hinnant} 19663e519524SHoward Hinnant 19673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 196899894b61SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19693e519524SHoward Hinnant_OutputIterator 19703e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19713e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19723e519524SHoward Hinnant{ 1973910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19743e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19753e519524SHoward Hinnant return __result; 19763e519524SHoward Hinnant} 19773e519524SHoward Hinnant 19783e519524SHoward Hinnant// replace 19793e519524SHoward Hinnant 19803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 198112c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19823e519524SHoward Hinnantvoid 19833e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19843e519524SHoward Hinnant{ 19853e519524SHoward Hinnant for (; __first != __last; ++__first) 19863e519524SHoward Hinnant if (*__first == __old_value) 19873e519524SHoward Hinnant *__first = __new_value; 19883e519524SHoward Hinnant} 19893e519524SHoward Hinnant 19903e519524SHoward Hinnant// replace_if 19913e519524SHoward Hinnant 19923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 199312c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 19943e519524SHoward Hinnantvoid 19953e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19963e519524SHoward Hinnant{ 19973e519524SHoward Hinnant for (; __first != __last; ++__first) 19983e519524SHoward Hinnant if (__pred(*__first)) 19993e519524SHoward Hinnant *__first = __new_value; 20003e519524SHoward Hinnant} 20013e519524SHoward Hinnant 20023e519524SHoward Hinnant// replace_copy 20033e519524SHoward Hinnant 20043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 200512c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20063e519524SHoward Hinnant_OutputIterator 20073e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20083e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20093e519524SHoward Hinnant{ 2010910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20113e519524SHoward Hinnant if (*__first == __old_value) 20123e519524SHoward Hinnant *__result = __new_value; 20133e519524SHoward Hinnant else 20143e519524SHoward Hinnant *__result = *__first; 20153e519524SHoward Hinnant return __result; 20163e519524SHoward Hinnant} 20173e519524SHoward Hinnant 20183e519524SHoward Hinnant// replace_copy_if 20193e519524SHoward Hinnant 20203e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 202112c7423fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20223e519524SHoward Hinnant_OutputIterator 20233e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20243e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20253e519524SHoward Hinnant{ 2026910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20273e519524SHoward Hinnant if (__pred(*__first)) 20283e519524SHoward Hinnant *__result = __new_value; 20293e519524SHoward Hinnant else 20303e519524SHoward Hinnant *__result = *__first; 20313e519524SHoward Hinnant return __result; 20323e519524SHoward Hinnant} 20333e519524SHoward Hinnant 20343e519524SHoward Hinnant// fill_n 20353e519524SHoward Hinnant 20363e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20374bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20383e519524SHoward Hinnant_OutputIterator 20390f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20403e519524SHoward Hinnant{ 2041910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2042e4383379SHoward Hinnant *__first = __value_; 20433e519524SHoward Hinnant return __first; 20443e519524SHoward Hinnant} 20453e519524SHoward Hinnant 20463e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20474bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20483e519524SHoward Hinnant_OutputIterator 2049e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20503e519524SHoward Hinnant{ 205151544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20523e519524SHoward Hinnant} 20533e519524SHoward Hinnant 20543e519524SHoward Hinnant// fill 20553e519524SHoward Hinnant 20563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20574bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20583e519524SHoward Hinnantvoid 2059e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20603e519524SHoward Hinnant{ 20613e519524SHoward Hinnant for (; __first != __last; ++__first) 2062e4383379SHoward Hinnant *__first = __value_; 20633e519524SHoward Hinnant} 20643e519524SHoward Hinnant 20653e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20664bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20673e519524SHoward Hinnantvoid 2068e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20693e519524SHoward Hinnant{ 2070e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20713e519524SHoward Hinnant} 20723e519524SHoward Hinnant 20733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20744bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20753e519524SHoward Hinnantvoid 2076e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20773e519524SHoward Hinnant{ 2078e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20793e519524SHoward Hinnant} 20803e519524SHoward Hinnant 20813e519524SHoward Hinnant// generate 20823e519524SHoward Hinnant 20833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20844bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20853e519524SHoward Hinnantvoid 20863e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20873e519524SHoward Hinnant{ 20883e519524SHoward Hinnant for (; __first != __last; ++__first) 20893e519524SHoward Hinnant *__first = __gen(); 20903e519524SHoward Hinnant} 20913e519524SHoward Hinnant 20923e519524SHoward Hinnant// generate_n 20933e519524SHoward Hinnant 20943e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20954bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 20963e519524SHoward Hinnant_OutputIterator 209751544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 20983e519524SHoward Hinnant{ 209951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 210051544023SEric Fiselier _IntegralSize __n = __orig_n; 2101910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21023e519524SHoward Hinnant *__first = __gen(); 21033e519524SHoward Hinnant return __first; 21043e519524SHoward Hinnant} 21053e519524SHoward Hinnant 21063e519524SHoward Hinnant// remove 21073e519524SHoward Hinnant 21083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 2109e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 2110e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21113e519524SHoward Hinnant{ 2112e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21133e519524SHoward Hinnant if (__first != __last) 21143e519524SHoward Hinnant { 21153e519524SHoward Hinnant _ForwardIterator __i = __first; 21163e519524SHoward Hinnant while (++__i != __last) 21173e519524SHoward Hinnant { 2118e4383379SHoward Hinnant if (!(*__i == __value_)) 21193e519524SHoward Hinnant { 2120ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21213e519524SHoward Hinnant ++__first; 21223e519524SHoward Hinnant } 21233e519524SHoward Hinnant } 21243e519524SHoward Hinnant } 21253e519524SHoward Hinnant return __first; 21263e519524SHoward Hinnant} 21273e519524SHoward Hinnant 21283e519524SHoward Hinnant// remove_if 21293e519524SHoward Hinnant 21303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 2131e8ea8296SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21323e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21333e519524SHoward Hinnant{ 2134ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21353e519524SHoward Hinnant (__first, __last, __pred); 21363e519524SHoward Hinnant if (__first != __last) 21373e519524SHoward Hinnant { 21383e519524SHoward Hinnant _ForwardIterator __i = __first; 21393e519524SHoward Hinnant while (++__i != __last) 21403e519524SHoward Hinnant { 21413e519524SHoward Hinnant if (!__pred(*__i)) 21423e519524SHoward Hinnant { 2143ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21443e519524SHoward Hinnant ++__first; 21453e519524SHoward Hinnant } 21463e519524SHoward Hinnant } 21473e519524SHoward Hinnant } 21483e519524SHoward Hinnant return __first; 21493e519524SHoward Hinnant} 21503e519524SHoward Hinnant 21513e519524SHoward Hinnant// remove_copy 21523e519524SHoward Hinnant 21533e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 2154e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21553e519524SHoward Hinnant_OutputIterator 2156e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21573e519524SHoward Hinnant{ 21583e519524SHoward Hinnant for (; __first != __last; ++__first) 21593e519524SHoward Hinnant { 2160e4383379SHoward Hinnant if (!(*__first == __value_)) 21613e519524SHoward Hinnant { 21623e519524SHoward Hinnant *__result = *__first; 21633e519524SHoward Hinnant ++__result; 21643e519524SHoward Hinnant } 21653e519524SHoward Hinnant } 21663e519524SHoward Hinnant return __result; 21673e519524SHoward Hinnant} 21683e519524SHoward Hinnant 21693e519524SHoward Hinnant// remove_copy_if 21703e519524SHoward Hinnant 21713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 2172e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 21733e519524SHoward Hinnant_OutputIterator 21743e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21753e519524SHoward Hinnant{ 21763e519524SHoward Hinnant for (; __first != __last; ++__first) 21773e519524SHoward Hinnant { 21783e519524SHoward Hinnant if (!__pred(*__first)) 21793e519524SHoward Hinnant { 21803e519524SHoward Hinnant *__result = *__first; 21813e519524SHoward Hinnant ++__result; 21823e519524SHoward Hinnant } 21833e519524SHoward Hinnant } 21843e519524SHoward Hinnant return __result; 21853e519524SHoward Hinnant} 21863e519524SHoward Hinnant 21873e519524SHoward Hinnant// unique 21883e519524SHoward Hinnant 21893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21904bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 21913e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21923e519524SHoward Hinnant{ 2193ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21943e519524SHoward Hinnant (__first, __last, __pred); 21953e519524SHoward Hinnant if (__first != __last) 21963e519524SHoward Hinnant { 21973e519524SHoward Hinnant // ... a a ? ... 21983e519524SHoward Hinnant // f i 21993e519524SHoward Hinnant _ForwardIterator __i = __first; 22003e519524SHoward Hinnant for (++__i; ++__i != __last;) 22013e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2202ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22033e519524SHoward Hinnant ++__first; 22043e519524SHoward Hinnant } 22053e519524SHoward Hinnant return __first; 22063e519524SHoward Hinnant} 22073e519524SHoward Hinnant 22083e519524SHoward Hinnanttemplate <class _ForwardIterator> 22094bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22103e519524SHoward Hinnant_ForwardIterator 22113e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22123e519524SHoward Hinnant{ 22133e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2214ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22153e519524SHoward Hinnant} 22163e519524SHoward Hinnant 22173e519524SHoward Hinnant// unique_copy 22183e519524SHoward Hinnant 22193e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22204bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22213e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22223e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22233e519524SHoward Hinnant{ 22243e519524SHoward Hinnant if (__first != __last) 22253e519524SHoward Hinnant { 22263e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22273e519524SHoward Hinnant *__result = __t; 22283e519524SHoward Hinnant ++__result; 22293e519524SHoward Hinnant while (++__first != __last) 22303e519524SHoward Hinnant { 22313e519524SHoward Hinnant if (!__pred(__t, *__first)) 22323e519524SHoward Hinnant { 22333e519524SHoward Hinnant __t = *__first; 22343e519524SHoward Hinnant *__result = __t; 22353e519524SHoward Hinnant ++__result; 22363e519524SHoward Hinnant } 22373e519524SHoward Hinnant } 22383e519524SHoward Hinnant } 22393e519524SHoward Hinnant return __result; 22403e519524SHoward Hinnant} 22413e519524SHoward Hinnant 22423e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22434bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 22443e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22453e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22463e519524SHoward Hinnant{ 22473e519524SHoward Hinnant if (__first != __last) 22483e519524SHoward Hinnant { 22493e519524SHoward Hinnant _ForwardIterator __i = __first; 22503e519524SHoward Hinnant *__result = *__i; 22513e519524SHoward Hinnant ++__result; 22523e519524SHoward Hinnant while (++__first != __last) 22533e519524SHoward Hinnant { 22543e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22553e519524SHoward Hinnant { 22563e519524SHoward Hinnant *__result = *__first; 22573e519524SHoward Hinnant ++__result; 22583e519524SHoward Hinnant __i = __first; 22593e519524SHoward Hinnant } 22603e519524SHoward Hinnant } 22613e519524SHoward Hinnant } 22623e519524SHoward Hinnant return __result; 22633e519524SHoward Hinnant} 22643e519524SHoward Hinnant 22653e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22664bfb9313SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 22673e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22683e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22693e519524SHoward Hinnant{ 22703e519524SHoward Hinnant if (__first != __last) 22713e519524SHoward Hinnant { 22723e519524SHoward Hinnant *__result = *__first; 22733e519524SHoward Hinnant while (++__first != __last) 22743e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22753e519524SHoward Hinnant *++__result = *__first; 22763e519524SHoward Hinnant ++__result; 22773e519524SHoward Hinnant } 22783e519524SHoward Hinnant return __result; 22793e519524SHoward Hinnant} 22803e519524SHoward Hinnant 22813e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22824bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22833e519524SHoward Hinnant_OutputIterator 22843e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22853e519524SHoward Hinnant{ 2286ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22873e519524SHoward Hinnant (__first, __last, __result, __pred, 22883e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22893e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22903e519524SHoward Hinnant} 22913e519524SHoward Hinnant 22923e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22934bfb9313SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 22943e519524SHoward Hinnant_OutputIterator 22953e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22963e519524SHoward Hinnant{ 22973e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2298ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22993e519524SHoward Hinnant} 23003e519524SHoward Hinnant 23013e519524SHoward Hinnant// reverse 23023e519524SHoward Hinnant 23033e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23053e519524SHoward Hinnantvoid 23063e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23073e519524SHoward Hinnant{ 23083e519524SHoward Hinnant while (__first != __last) 23093e519524SHoward Hinnant { 23103e519524SHoward Hinnant if (__first == --__last) 23113e519524SHoward Hinnant break; 2312def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23133e519524SHoward Hinnant ++__first; 23143e519524SHoward Hinnant } 23153e519524SHoward Hinnant} 23163e519524SHoward Hinnant 23173e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23193e519524SHoward Hinnantvoid 23203e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23213e519524SHoward Hinnant{ 23223e519524SHoward Hinnant if (__first != __last) 23233e519524SHoward Hinnant for (; __first < --__last; ++__first) 2324def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23253e519524SHoward Hinnant} 23263e519524SHoward Hinnant 23273e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23293e519524SHoward Hinnantvoid 23303e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23313e519524SHoward Hinnant{ 2332ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23333e519524SHoward Hinnant} 23343e519524SHoward Hinnant 23353e519524SHoward Hinnant// reverse_copy 23363e519524SHoward Hinnant 23373e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 2338e8ea8296SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 23393e519524SHoward Hinnant_OutputIterator 23403e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23413e519524SHoward Hinnant{ 23423e519524SHoward Hinnant for (; __first != __last; ++__result) 23433e519524SHoward Hinnant *__result = *--__last; 23443e519524SHoward Hinnant return __result; 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnant// rotate 23483e519524SHoward Hinnant 23493e519524SHoward Hinnanttemplate <class _ForwardIterator> 23503e519524SHoward Hinnant_ForwardIterator 2351aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23523e519524SHoward Hinnant{ 2353aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2354aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2355aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2356aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2357aca09de3SHoward Hinnant return __lm1; 2358aca09de3SHoward Hinnant} 2359aca09de3SHoward Hinnant 2360aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2361aca09de3SHoward Hinnant_BidirectionalIterator 2362aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2363aca09de3SHoward Hinnant{ 2364aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2365aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2366aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2367aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2368aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2369aca09de3SHoward Hinnant return __fp1; 2370aca09de3SHoward Hinnant} 2371aca09de3SHoward Hinnant 2372aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2373aca09de3SHoward Hinnant_ForwardIterator 2374aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2375aca09de3SHoward Hinnant{ 23763e519524SHoward Hinnant _ForwardIterator __i = __middle; 23773e519524SHoward Hinnant while (true) 23783e519524SHoward Hinnant { 23793e519524SHoward Hinnant swap(*__first, *__i); 23803e519524SHoward Hinnant ++__first; 23813e519524SHoward Hinnant if (++__i == __last) 23823e519524SHoward Hinnant break; 23833e519524SHoward Hinnant if (__first == __middle) 23843e519524SHoward Hinnant __middle = __i; 23853e519524SHoward Hinnant } 23863e519524SHoward Hinnant _ForwardIterator __r = __first; 23873e519524SHoward Hinnant if (__first != __middle) 23883e519524SHoward Hinnant { 23893e519524SHoward Hinnant __i = __middle; 23903e519524SHoward Hinnant while (true) 23913e519524SHoward Hinnant { 23923e519524SHoward Hinnant swap(*__first, *__i); 23933e519524SHoward Hinnant ++__first; 23943e519524SHoward Hinnant if (++__i == __last) 23953e519524SHoward Hinnant { 23963e519524SHoward Hinnant if (__first == __middle) 23973e519524SHoward Hinnant break; 23983e519524SHoward Hinnant __i = __middle; 23993e519524SHoward Hinnant } 24003e519524SHoward Hinnant else if (__first == __middle) 24013e519524SHoward Hinnant __middle = __i; 24023e519524SHoward Hinnant } 24033e519524SHoward Hinnant } 24043e519524SHoward Hinnant return __r; 24053e519524SHoward Hinnant} 24063e519524SHoward Hinnant 24073e519524SHoward Hinnanttemplate<typename _Integral> 24083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24093e519524SHoward Hinnant_Integral 241019b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24113e519524SHoward Hinnant{ 24123e519524SHoward Hinnant do 24133e519524SHoward Hinnant { 24143e519524SHoward Hinnant _Integral __t = __x % __y; 24153e519524SHoward Hinnant __x = __y; 24163e519524SHoward Hinnant __y = __t; 24173e519524SHoward Hinnant } while (__y); 24183e519524SHoward Hinnant return __x; 24193e519524SHoward Hinnant} 24203e519524SHoward Hinnant 24213e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24223e519524SHoward Hinnant_RandomAccessIterator 2423aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24243e519524SHoward Hinnant{ 24253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24273e519524SHoward Hinnant 24283e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24293e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24303e519524SHoward Hinnant if (__m1 == __m2) 24313e519524SHoward Hinnant { 2432ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24333e519524SHoward Hinnant return __middle; 24343e519524SHoward Hinnant } 243519b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24363e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24373e519524SHoward Hinnant { 2438aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24393e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24403e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24413e519524SHoward Hinnant do 24423e519524SHoward Hinnant { 2443aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24443e519524SHoward Hinnant __p1 = __p2; 24453e519524SHoward Hinnant const difference_type __d = __last - __p2; 24463e519524SHoward Hinnant if (__m1 < __d) 24473e519524SHoward Hinnant __p2 += __m1; 24483e519524SHoward Hinnant else 24493e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24503e519524SHoward Hinnant } while (__p2 != __p); 2451aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24523e519524SHoward Hinnant } 24533e519524SHoward Hinnant return __first + __m2; 24543e519524SHoward Hinnant} 24553e519524SHoward Hinnant 24563e519524SHoward Hinnanttemplate <class _ForwardIterator> 24573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24583e519524SHoward Hinnant_ForwardIterator 2459aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2460aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2461aca09de3SHoward Hinnant{ 2462aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2463aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2464aca09de3SHoward Hinnant { 2465aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2466aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2467aca09de3SHoward Hinnant } 2468aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2469aca09de3SHoward Hinnant} 2470aca09de3SHoward Hinnant 2471aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2472aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2473aca09de3SHoward Hinnant_BidirectionalIterator 2474aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2475aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2476aca09de3SHoward Hinnant{ 2477aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2478aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2479aca09de3SHoward Hinnant { 2480aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2481aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2482aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2483aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2484aca09de3SHoward Hinnant } 2485aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2486aca09de3SHoward Hinnant} 2487aca09de3SHoward Hinnant 2488aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2489aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2490aca09de3SHoward Hinnant_RandomAccessIterator 2491aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2492aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2493aca09de3SHoward Hinnant{ 2494aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2495aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2496aca09de3SHoward Hinnant { 2497aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2498aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2499aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2500aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2501aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2502aca09de3SHoward Hinnant } 2503aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2504aca09de3SHoward Hinnant} 2505aca09de3SHoward Hinnant 2506aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2507aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2508aca09de3SHoward Hinnant_ForwardIterator 25093e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25103e519524SHoward Hinnant{ 2511aca09de3SHoward Hinnant if (__first == __middle) 2512aca09de3SHoward Hinnant return __last; 2513aca09de3SHoward Hinnant if (__middle == __last) 2514aca09de3SHoward Hinnant return __first; 2515ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2516aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25173e519524SHoward Hinnant} 25183e519524SHoward Hinnant 25193e519524SHoward Hinnant// rotate_copy 25203e519524SHoward Hinnant 25213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25233e519524SHoward Hinnant_OutputIterator 25243e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25253e519524SHoward Hinnant{ 2526ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25273e519524SHoward Hinnant} 25283e519524SHoward Hinnant 25293e519524SHoward Hinnant// min_element 25303e519524SHoward Hinnant 25313e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25329d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25333e519524SHoward Hinnant_ForwardIterator 25340b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25353e519524SHoward Hinnant{ 25363e519524SHoward Hinnant if (__first != __last) 25373e519524SHoward Hinnant { 25383e519524SHoward Hinnant _ForwardIterator __i = __first; 25393e519524SHoward Hinnant while (++__i != __last) 25403e519524SHoward Hinnant if (__comp(*__i, *__first)) 25413e519524SHoward Hinnant __first = __i; 25423e519524SHoward Hinnant } 25433e519524SHoward Hinnant return __first; 25443e519524SHoward Hinnant} 25453e519524SHoward Hinnant 25463e519524SHoward Hinnanttemplate <class _ForwardIterator> 25470b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25483e519524SHoward Hinnant_ForwardIterator 25493e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25503e519524SHoward Hinnant{ 25510b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25524eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25534eb27b79SHoward Hinnant} 25544eb27b79SHoward Hinnant 25554eb27b79SHoward Hinnant// min 25564eb27b79SHoward Hinnant 25574eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25589d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25594eb27b79SHoward Hinnantconst _Tp& 25604eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25614eb27b79SHoward Hinnant{ 25624eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25634eb27b79SHoward Hinnant} 25644eb27b79SHoward Hinnant 25654eb27b79SHoward Hinnanttemplate <class _Tp> 25669d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25674eb27b79SHoward Hinnantconst _Tp& 25684eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25694eb27b79SHoward Hinnant{ 2570ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25714eb27b79SHoward Hinnant} 25724eb27b79SHoward Hinnant 2573ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 257454976f26SHoward Hinnant 25754eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25769d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25774eb27b79SHoward Hinnant_Tp 25784eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25794eb27b79SHoward Hinnant{ 25800b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25814eb27b79SHoward Hinnant} 25824eb27b79SHoward Hinnant 25834eb27b79SHoward Hinnanttemplate<class _Tp> 25849d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25854eb27b79SHoward Hinnant_Tp 25864eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25874eb27b79SHoward Hinnant{ 25880b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25893e519524SHoward Hinnant} 25903e519524SHoward Hinnant 2591ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 259254976f26SHoward Hinnant 25933e519524SHoward Hinnant// max_element 25943e519524SHoward Hinnant 25953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25969d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25973e519524SHoward Hinnant_ForwardIterator 25980b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25993e519524SHoward Hinnant{ 26003e519524SHoward Hinnant if (__first != __last) 26013e519524SHoward Hinnant { 26023e519524SHoward Hinnant _ForwardIterator __i = __first; 26033e519524SHoward Hinnant while (++__i != __last) 26043e519524SHoward Hinnant if (__comp(*__first, *__i)) 26053e519524SHoward Hinnant __first = __i; 26063e519524SHoward Hinnant } 26073e519524SHoward Hinnant return __first; 26083e519524SHoward Hinnant} 26093e519524SHoward Hinnant 26109d67c6d5SMarshall Clow 26113e519524SHoward Hinnanttemplate <class _ForwardIterator> 26120b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26133e519524SHoward Hinnant_ForwardIterator 26143e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26153e519524SHoward Hinnant{ 26160b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26174eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26184eb27b79SHoward Hinnant} 26194eb27b79SHoward Hinnant 26204eb27b79SHoward Hinnant// max 26214eb27b79SHoward Hinnant 26224eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26239d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26244eb27b79SHoward Hinnantconst _Tp& 26254eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26264eb27b79SHoward Hinnant{ 26274eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26284eb27b79SHoward Hinnant} 26294eb27b79SHoward Hinnant 26304eb27b79SHoward Hinnanttemplate <class _Tp> 26319d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26324eb27b79SHoward Hinnantconst _Tp& 26334eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26344eb27b79SHoward Hinnant{ 2635ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26364eb27b79SHoward Hinnant} 26374eb27b79SHoward Hinnant 2638ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 263954976f26SHoward Hinnant 26404eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26419d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26424eb27b79SHoward Hinnant_Tp 26434eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26444eb27b79SHoward Hinnant{ 26450b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26464eb27b79SHoward Hinnant} 26474eb27b79SHoward Hinnant 26484eb27b79SHoward Hinnanttemplate<class _Tp> 26499d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26504eb27b79SHoward Hinnant_Tp 26514eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26524eb27b79SHoward Hinnant{ 26530b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26543e519524SHoward Hinnant} 26553e519524SHoward Hinnant 2656ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 265754976f26SHoward Hinnant 2658146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2659146c14acSMarshall Clow// clamp 2660146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2661146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2662146c14acSMarshall Clowconst _Tp& 2663146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2664146c14acSMarshall Clow{ 2665146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2666146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2667146c14acSMarshall Clow 2668146c14acSMarshall Clow} 2669146c14acSMarshall Clow 2670146c14acSMarshall Clowtemplate<class _Tp> 2671146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2672146c14acSMarshall Clowconst _Tp& 2673146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2674146c14acSMarshall Clow{ 2675146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2676146c14acSMarshall Clow} 2677146c14acSMarshall Clow#endif 2678146c14acSMarshall Clow 26793e519524SHoward Hinnant// minmax_element 26803e519524SHoward Hinnant 26813e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26820b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26833e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26843e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26853e519524SHoward Hinnant{ 26863e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26873e519524SHoward Hinnant if (__first != __last) 26883e519524SHoward Hinnant { 26893e519524SHoward Hinnant if (++__first != __last) 26903e519524SHoward Hinnant { 26913e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26923e519524SHoward Hinnant __result.first = __first; 26933e519524SHoward Hinnant else 26943e519524SHoward Hinnant __result.second = __first; 26953e519524SHoward Hinnant while (++__first != __last) 26963e519524SHoward Hinnant { 26973e519524SHoward Hinnant _ForwardIterator __i = __first; 26983e519524SHoward Hinnant if (++__first == __last) 26993e519524SHoward Hinnant { 27003e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27013e519524SHoward Hinnant __result.first = __i; 27023e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27033e519524SHoward Hinnant __result.second = __i; 27043e519524SHoward Hinnant break; 27053e519524SHoward Hinnant } 27063e519524SHoward Hinnant else 27073e519524SHoward Hinnant { 27083e519524SHoward Hinnant if (__comp(*__first, *__i)) 27093e519524SHoward Hinnant { 27103e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27113e519524SHoward Hinnant __result.first = __first; 27123e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27133e519524SHoward Hinnant __result.second = __i; 27143e519524SHoward Hinnant } 27153e519524SHoward Hinnant else 27163e519524SHoward Hinnant { 27173e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27183e519524SHoward Hinnant __result.first = __i; 27193e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27203e519524SHoward Hinnant __result.second = __first; 27213e519524SHoward Hinnant } 27223e519524SHoward Hinnant } 27233e519524SHoward Hinnant } 27243e519524SHoward Hinnant } 27253e519524SHoward Hinnant } 27263e519524SHoward Hinnant return __result; 27273e519524SHoward Hinnant} 27283e519524SHoward Hinnant 27293e519524SHoward Hinnanttemplate <class _ForwardIterator> 27300b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27313e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27323e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27333e519524SHoward Hinnant{ 27349d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27359d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27363e519524SHoward Hinnant} 27373e519524SHoward Hinnant 27384eb27b79SHoward Hinnant// minmax 27394eb27b79SHoward Hinnant 27404eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27419d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27424eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27434eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27444eb27b79SHoward Hinnant{ 27454eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27464eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27474eb27b79SHoward Hinnant} 27484eb27b79SHoward Hinnant 27494eb27b79SHoward Hinnanttemplate<class _Tp> 27509d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27514eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27524eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27534eb27b79SHoward Hinnant{ 2754ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27554eb27b79SHoward Hinnant} 27564eb27b79SHoward Hinnant 2757ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 275854976f26SHoward Hinnant 27594eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27614eb27b79SHoward Hinnantpair<_Tp, _Tp> 27624eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27634eb27b79SHoward Hinnant{ 27649d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27659d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27669d67c6d5SMarshall Clow _Iter __last = __t.end(); 27679d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27689d67c6d5SMarshall Clow 27699d67c6d5SMarshall Clow ++__first; 27709d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27719d67c6d5SMarshall Clow { 27729d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27739d67c6d5SMarshall Clow __result.first = *__first; 27749d67c6d5SMarshall Clow else 27759d67c6d5SMarshall Clow __result.second = *__first; 27769d67c6d5SMarshall Clow ++__first; 27779d67c6d5SMarshall Clow } 27789d67c6d5SMarshall Clow 27799d67c6d5SMarshall Clow while (__first != __last) 27809d67c6d5SMarshall Clow { 27819d67c6d5SMarshall Clow _Tp __prev = *__first++; 2782002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2783002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2784002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27859d67c6d5SMarshall Clow } 27869d67c6d5SMarshall Clow else { 2787002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2788002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27899d67c6d5SMarshall Clow } 27909d67c6d5SMarshall Clow 27919d67c6d5SMarshall Clow __first++; 27929d67c6d5SMarshall Clow } 27939d67c6d5SMarshall Clow return __result; 27949d67c6d5SMarshall Clow} 27959d67c6d5SMarshall Clow 27969d67c6d5SMarshall Clowtemplate<class _Tp> 27979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27989d67c6d5SMarshall Clowpair<_Tp, _Tp> 27999d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28009d67c6d5SMarshall Clow{ 28019d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28024eb27b79SHoward Hinnant} 28034eb27b79SHoward Hinnant 2804ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 280554976f26SHoward Hinnant 28063e519524SHoward Hinnant// random_shuffle 28073e519524SHoward Hinnant 2808f9d540b0SHoward Hinnant// __independent_bits_engine 2809f9d540b0SHoward Hinnant 2810c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2811f9d540b0SHoward Hinnantstruct __log2_imp 28123e519524SHoward Hinnant{ 2813c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2814c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28153e519524SHoward Hinnant}; 28163e519524SHoward Hinnant 2817c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2818c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28193e519524SHoward Hinnant{ 2820f9d540b0SHoward Hinnant static const size_t value = 0; 28213e519524SHoward Hinnant}; 28223e519524SHoward Hinnant 2823c003db1fSHoward Hinnanttemplate <size_t _Rp> 2824c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28253e519524SHoward Hinnant{ 2826c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28273e519524SHoward Hinnant}; 28283e519524SHoward Hinnant 282989918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2830f9d540b0SHoward Hinnantstruct __log2 28313e519524SHoward Hinnant{ 2832c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 283389918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28343e519524SHoward Hinnant}; 28353e519524SHoward Hinnant 2836f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2837f9d540b0SHoward Hinnantclass __independent_bits_engine 28383e519524SHoward Hinnant{ 2839f9d540b0SHoward Hinnantpublic: 2840f9d540b0SHoward Hinnant // types 2841f9d540b0SHoward Hinnant typedef _UIntType result_type; 2842f9d540b0SHoward Hinnant 2843f9d540b0SHoward Hinnantprivate: 2844f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2845f9d540b0SHoward Hinnant typedef typename conditional 2846f9d540b0SHoward Hinnant < 2847f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2848f9d540b0SHoward Hinnant result_type, 2849f9d540b0SHoward Hinnant _Engine_result_type 2850f9d540b0SHoward Hinnant >::type _Working_result_type; 2851f9d540b0SHoward Hinnant 2852f9d540b0SHoward Hinnant _Engine& __e_; 2853f9d540b0SHoward Hinnant size_t __w_; 2854f9d540b0SHoward Hinnant size_t __w0_; 2855f9d540b0SHoward Hinnant size_t __n_; 2856f9d540b0SHoward Hinnant size_t __n0_; 2857f9d540b0SHoward Hinnant _Working_result_type __y0_; 2858f9d540b0SHoward Hinnant _Working_result_type __y1_; 2859f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2860f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2861f9d540b0SHoward Hinnant 2862ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2863c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2864f9d540b0SHoward Hinnant + _Working_result_type(1); 2865e386b7b3SHoward Hinnant#else 2866e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2867e386b7b3SHoward Hinnant + _Working_result_type(1); 2868e386b7b3SHoward Hinnant#endif 2869e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2870e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2871e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2872f9d540b0SHoward Hinnant 2873f9d540b0SHoward Hinnantpublic: 2874f9d540b0SHoward Hinnant // constructors and seeding functions 2875f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2876f9d540b0SHoward Hinnant 2877f9d540b0SHoward Hinnant // generating functions 2878c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2879f9d540b0SHoward Hinnant 2880f9d540b0SHoward Hinnantprivate: 288108bba64aSMarshall Clow result_type __eval(false_type); 288208bba64aSMarshall Clow result_type __eval(true_type); 2883f9d540b0SHoward Hinnant}; 2884f9d540b0SHoward Hinnant 2885f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2886f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2887f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2888f9d540b0SHoward Hinnant : __e_(__e), 2889f9d540b0SHoward Hinnant __w_(__w) 2890f9d540b0SHoward Hinnant{ 2891f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2892f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2893c003db1fSHoward Hinnant if (_Rp == 0) 2894c003db1fSHoward Hinnant __y0_ = _Rp; 2895f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2896c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2897f9d540b0SHoward Hinnant else 2898f9d540b0SHoward Hinnant __y0_ = 0; 2899c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2900f9d540b0SHoward Hinnant { 2901f9d540b0SHoward Hinnant ++__n_; 2902f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2903f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2904c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2905f9d540b0SHoward Hinnant else 2906f9d540b0SHoward Hinnant __y0_ = 0; 2907f9d540b0SHoward Hinnant } 2908f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2909f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2910c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2911f9d540b0SHoward Hinnant else 2912f9d540b0SHoward Hinnant __y1_ = 0; 2913f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2914f9d540b0SHoward Hinnant _Engine_result_type(0); 2915f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2916f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2917f9d540b0SHoward Hinnant _Engine_result_type(~0); 29183e519524SHoward Hinnant} 29193e519524SHoward Hinnant 2920f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2921f9d540b0SHoward Hinnantinline 2922f9d540b0SHoward Hinnant_UIntType 292308bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29243e519524SHoward Hinnant{ 2925f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29263e519524SHoward Hinnant} 29273e519524SHoward Hinnant 2928f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2929f9d540b0SHoward Hinnant_UIntType 293008bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29313e519524SHoward Hinnant{ 29325beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2933c003db1fSHoward Hinnant result_type _Sp = 0; 2934f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2935f9d540b0SHoward Hinnant { 2936f9d540b0SHoward Hinnant _Engine_result_type __u; 29373e519524SHoward Hinnant do 2938f9d540b0SHoward Hinnant { 2939f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2940f9d540b0SHoward Hinnant } while (__u >= __y0_); 29415beb2c3aSMarshall Clow if (__w0_ < _WRt) 2942c003db1fSHoward Hinnant _Sp <<= __w0_; 2943f9d540b0SHoward Hinnant else 2944c003db1fSHoward Hinnant _Sp = 0; 2945c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2946f9d540b0SHoward Hinnant } 2947f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2948f9d540b0SHoward Hinnant { 2949f9d540b0SHoward Hinnant _Engine_result_type __u; 2950f9d540b0SHoward Hinnant do 2951f9d540b0SHoward Hinnant { 2952f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2953f9d540b0SHoward Hinnant } while (__u >= __y1_); 29545beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2955c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2956f9d540b0SHoward Hinnant else 2957c003db1fSHoward Hinnant _Sp = 0; 2958c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2959f9d540b0SHoward Hinnant } 2960c003db1fSHoward Hinnant return _Sp; 29613e519524SHoward Hinnant} 29623e519524SHoward Hinnant 2963f9d540b0SHoward Hinnant// uniform_int_distribution 29643e519524SHoward Hinnant 2965f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2966f9d540b0SHoward Hinnantclass uniform_int_distribution 29673e519524SHoward Hinnant{ 2968f9d540b0SHoward Hinnantpublic: 2969f9d540b0SHoward Hinnant // types 2970f9d540b0SHoward Hinnant typedef _IntType result_type; 2971f9d540b0SHoward Hinnant 2972f9d540b0SHoward Hinnant class param_type 2973f9d540b0SHoward Hinnant { 2974f9d540b0SHoward Hinnant result_type __a_; 2975f9d540b0SHoward Hinnant result_type __b_; 2976f9d540b0SHoward Hinnant public: 2977f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2978f9d540b0SHoward Hinnant 2979f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2980f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2981f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2982f9d540b0SHoward Hinnant 2983f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2984f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2985f9d540b0SHoward Hinnant 2986f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2987f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2988f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2989f9d540b0SHoward Hinnant {return !(__x == __y);} 29903e519524SHoward Hinnant }; 29913e519524SHoward Hinnant 2992f9d540b0SHoward Hinnantprivate: 2993f9d540b0SHoward Hinnant param_type __p_; 29943e519524SHoward Hinnant 2995f9d540b0SHoward Hinnantpublic: 2996f9d540b0SHoward Hinnant // constructors and reset functions 2997f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2998f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2999f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3000f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3001f9d540b0SHoward Hinnant void reset() {} 3002f9d540b0SHoward Hinnant 3003f9d540b0SHoward Hinnant // generating functions 3004f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3005f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3006f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3007f9d540b0SHoward Hinnant 3008f9d540b0SHoward Hinnant // property functions 3009f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3010f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3011f9d540b0SHoward Hinnant 3012f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3013f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3014f9d540b0SHoward Hinnant 3015f9d540b0SHoward Hinnant result_type min() const {return a();} 3016f9d540b0SHoward Hinnant result_type max() const {return b();} 3017f9d540b0SHoward Hinnant 3018f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3019f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3020f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3021f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3022f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3023f9d540b0SHoward Hinnant {return !(__x == __y);} 30243e519524SHoward Hinnant}; 30253e519524SHoward Hinnant 3026f9d540b0SHoward Hinnanttemplate<class _IntType> 3027f9d540b0SHoward Hinnanttemplate<class _URNG> 3028f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3029f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30303e519524SHoward Hinnant{ 3031f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3032f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3033c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3034c003db1fSHoward Hinnant if (_Rp == 1) 3035f9d540b0SHoward Hinnant return __p.a(); 3036f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3037f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3038c003db1fSHoward Hinnant if (_Rp == 0) 3039f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3040c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3041a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3042f9d540b0SHoward Hinnant ++__w; 3043f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3044f9d540b0SHoward Hinnant _UIntType __u; 3045f9d540b0SHoward Hinnant do 30463e519524SHoward Hinnant { 3047f9d540b0SHoward Hinnant __u = __e(); 3048c003db1fSHoward Hinnant } while (__u >= _Rp); 3049f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30503e519524SHoward Hinnant} 3051f9d540b0SHoward Hinnant 305266f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 305366f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3054f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3055f9d540b0SHoward Hinnant 3056f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3057f9d540b0SHoward Hinnant 3058f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30593e519524SHoward Hinnant{ 3060f9d540b0SHoward Hinnant static unsigned __c_; 3061f9d540b0SHoward Hinnant 3062f9d540b0SHoward Hinnant __rs_default(); 3063f9d540b0SHoward Hinnantpublic: 3064b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3065f9d540b0SHoward Hinnant 3066f9d540b0SHoward Hinnant static const result_type _Min = 0; 3067f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3068f9d540b0SHoward Hinnant 3069f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3070f9d540b0SHoward Hinnant ~__rs_default(); 3071f9d540b0SHoward Hinnant 3072f9d540b0SHoward Hinnant result_type operator()(); 3073f9d540b0SHoward Hinnant 3074788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3075788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3076f9d540b0SHoward Hinnant 3077f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3078f9d540b0SHoward Hinnant}; 3079f9d540b0SHoward Hinnant 3080f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30813e519524SHoward Hinnant 30823e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30833e519524SHoward Hinnantvoid 30843e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30853e519524SHoward Hinnant{ 30863e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3087c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3088c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30893e519524SHoward Hinnant difference_type __d = __last - __first; 30903e519524SHoward Hinnant if (__d > 1) 30913e519524SHoward Hinnant { 3092c003db1fSHoward Hinnant _Dp __uid; 3093f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3094f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3095007b26beSHoward Hinnant { 3096c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3097007b26beSHoward Hinnant if (__i != difference_type(0)) 3098007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3099007b26beSHoward Hinnant } 31003e519524SHoward Hinnant } 31013e519524SHoward Hinnant} 31023e519524SHoward Hinnant 31033e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31043e519524SHoward Hinnantvoid 31053e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3106ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31073e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31083e519524SHoward Hinnant#else 31093e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31103e519524SHoward Hinnant#endif 31113e519524SHoward Hinnant{ 31123e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31133e519524SHoward Hinnant difference_type __d = __last - __first; 31143e519524SHoward Hinnant if (__d > 1) 31153e519524SHoward Hinnant { 31163e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3117007b26beSHoward Hinnant { 3118007b26beSHoward Hinnant difference_type __i = __rand(__d); 3119007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3120007b26beSHoward Hinnant } 31213e519524SHoward Hinnant } 31223e519524SHoward Hinnant} 31230f37a410SMarshall Clow#endif 31243e519524SHoward Hinnant 3125e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3126e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3127e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3128e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 312942bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3130e7154709SEric Fiselier _Distance __n, 3131e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3132e7154709SEric Fiselier input_iterator_tag) { 3133e7154709SEric Fiselier 3134e7154709SEric Fiselier _Distance __k = 0; 3135e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 313642bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3137e7154709SEric Fiselier _Distance __sz = __k; 3138e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3139e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3140e7154709SEric Fiselier if (__r < __sz) 314142bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3142e7154709SEric Fiselier } 314342bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3144e7154709SEric Fiselier} 3145e7154709SEric Fiselier 3146e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3147e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3148e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3149e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 315042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3151e7154709SEric Fiselier _Distance __n, 3152e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3153e7154709SEric Fiselier forward_iterator_tag) { 3154e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3155e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3156e7154709SEric Fiselier _Distance __r = 3157e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3158e7154709SEric Fiselier if (__r < __n) { 315942bfedd9SAlexander Richardson *__output_iter++ = *__first; 3160e7154709SEric Fiselier --__n; 3161e7154709SEric Fiselier } 3162e7154709SEric Fiselier } 316342bfedd9SAlexander Richardson return __output_iter; 3164e7154709SEric Fiselier} 3165e7154709SEric Fiselier 3166e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3167e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3168e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3169e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 317042bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3171e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3172e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3173e7154709SEric Fiselier _PopCategory; 3174e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3175e7154709SEric Fiselier _Difference; 3176e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3177e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3178e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3179e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3180e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3181e7154709SEric Fiselier return _VSTD::__sample( 318242bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3183e7154709SEric Fiselier __g, _PopCategory()); 3184e7154709SEric Fiselier} 3185e7154709SEric Fiselier 3186e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3187e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3188e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3189e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3190e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 319142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3192e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 319342bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3194e7154709SEric Fiselier} 3195e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3196e7154709SEric Fiselier 3197f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3198f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3199ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3200fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3201fb340102SHoward Hinnant#else 3202f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3203fb340102SHoward Hinnant#endif 3204f9d540b0SHoward Hinnant{ 3205f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3206c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3207c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3208f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3209f9d540b0SHoward Hinnant if (__d > 1) 3210f9d540b0SHoward Hinnant { 3211c003db1fSHoward Hinnant _Dp __uid; 3212f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3213007b26beSHoward Hinnant { 3214c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3215007b26beSHoward Hinnant if (__i != difference_type(0)) 3216007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3217007b26beSHoward Hinnant } 3218f9d540b0SHoward Hinnant } 3219f9d540b0SHoward Hinnant} 3220f9d540b0SHoward Hinnant 32213e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 322249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 32233e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32243e519524SHoward Hinnant{ 32253e519524SHoward Hinnant for (; __first != __last; ++__first) 32263e519524SHoward Hinnant if (!__pred(*__first)) 32273e519524SHoward Hinnant break; 3228b9595b79SMarshall Clow if ( __first == __last ) 3229b9595b79SMarshall Clow return true; 3230b9595b79SMarshall Clow ++__first; 32313e519524SHoward Hinnant for (; __first != __last; ++__first) 32323e519524SHoward Hinnant if (__pred(*__first)) 32333e519524SHoward Hinnant return false; 32343e519524SHoward Hinnant return true; 32353e519524SHoward Hinnant} 32363e519524SHoward Hinnant 32373e519524SHoward Hinnant// partition 32383e519524SHoward Hinnant 32393e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32403e519524SHoward Hinnant_ForwardIterator 32413e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32423e519524SHoward Hinnant{ 32433e519524SHoward Hinnant while (true) 32443e519524SHoward Hinnant { 32453e519524SHoward Hinnant if (__first == __last) 32463e519524SHoward Hinnant return __first; 32473e519524SHoward Hinnant if (!__pred(*__first)) 32483e519524SHoward Hinnant break; 32493e519524SHoward Hinnant ++__first; 32503e519524SHoward Hinnant } 32513e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32523e519524SHoward Hinnant { 32533e519524SHoward Hinnant if (__pred(*__p)) 32543e519524SHoward Hinnant { 32553e519524SHoward Hinnant swap(*__first, *__p); 32563e519524SHoward Hinnant ++__first; 32573e519524SHoward Hinnant } 32583e519524SHoward Hinnant } 32593e519524SHoward Hinnant return __first; 32603e519524SHoward Hinnant} 32613e519524SHoward Hinnant 32623e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32633e519524SHoward Hinnant_BidirectionalIterator 32643e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32653e519524SHoward Hinnant bidirectional_iterator_tag) 32663e519524SHoward Hinnant{ 32673e519524SHoward Hinnant while (true) 32683e519524SHoward Hinnant { 32693e519524SHoward Hinnant while (true) 32703e519524SHoward Hinnant { 32713e519524SHoward Hinnant if (__first == __last) 32723e519524SHoward Hinnant return __first; 32733e519524SHoward Hinnant if (!__pred(*__first)) 32743e519524SHoward Hinnant break; 32753e519524SHoward Hinnant ++__first; 32763e519524SHoward Hinnant } 32773e519524SHoward Hinnant do 32783e519524SHoward Hinnant { 32793e519524SHoward Hinnant if (__first == --__last) 32803e519524SHoward Hinnant return __first; 32813e519524SHoward Hinnant } while (!__pred(*__last)); 32823e519524SHoward Hinnant swap(*__first, *__last); 32833e519524SHoward Hinnant ++__first; 32843e519524SHoward Hinnant } 32853e519524SHoward Hinnant} 32863e519524SHoward Hinnant 32873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32893e519524SHoward Hinnant_ForwardIterator 32903e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32913e519524SHoward Hinnant{ 3292ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32933e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32943e519524SHoward Hinnant} 32953e519524SHoward Hinnant 32963e519524SHoward Hinnant// partition_copy 32973e519524SHoward Hinnant 32983e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32993e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33001b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_OutputIterator1, _OutputIterator2> 33013e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33023e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33033e519524SHoward Hinnant _Predicate __pred) 33043e519524SHoward Hinnant{ 33053e519524SHoward Hinnant for (; __first != __last; ++__first) 33063e519524SHoward Hinnant { 33073e519524SHoward Hinnant if (__pred(*__first)) 33083e519524SHoward Hinnant { 33093e519524SHoward Hinnant *__out_true = *__first; 33103e519524SHoward Hinnant ++__out_true; 33113e519524SHoward Hinnant } 33123e519524SHoward Hinnant else 33133e519524SHoward Hinnant { 33143e519524SHoward Hinnant *__out_false = *__first; 33153e519524SHoward Hinnant ++__out_false; 33163e519524SHoward Hinnant } 33173e519524SHoward Hinnant } 33183e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33193e519524SHoward Hinnant} 33203e519524SHoward Hinnant 33213e519524SHoward Hinnant// partition_point 33223e519524SHoward Hinnant 33233e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 3324674f9128SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 33253e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33263e519524SHoward Hinnant{ 33273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3328ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33293e519524SHoward Hinnant while (__len != 0) 33303e519524SHoward Hinnant { 33313e519524SHoward Hinnant difference_type __l2 = __len / 2; 33323e519524SHoward Hinnant _ForwardIterator __m = __first; 3333ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33343e519524SHoward Hinnant if (__pred(*__m)) 33353e519524SHoward Hinnant { 33363e519524SHoward Hinnant __first = ++__m; 33373e519524SHoward Hinnant __len -= __l2 + 1; 33383e519524SHoward Hinnant } 33393e519524SHoward Hinnant else 33403e519524SHoward Hinnant __len = __l2; 33413e519524SHoward Hinnant } 33423e519524SHoward Hinnant return __first; 33433e519524SHoward Hinnant} 33443e519524SHoward Hinnant 33453e519524SHoward Hinnant// stable_partition 33463e519524SHoward Hinnant 33473e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33483e519524SHoward Hinnant_ForwardIterator 33493e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33503e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33513e519524SHoward Hinnant{ 33523e519524SHoward Hinnant // *__first is known to be false 33533e519524SHoward Hinnant // __len >= 1 33543e519524SHoward Hinnant if (__len == 1) 33553e519524SHoward Hinnant return __first; 33563e519524SHoward Hinnant if (__len == 2) 33573e519524SHoward Hinnant { 33583e519524SHoward Hinnant _ForwardIterator __m = __first; 33593e519524SHoward Hinnant if (__pred(*++__m)) 33603e519524SHoward Hinnant { 33613e519524SHoward Hinnant swap(*__first, *__m); 33623e519524SHoward Hinnant return __m; 33633e519524SHoward Hinnant } 33643e519524SHoward Hinnant return __first; 33653e519524SHoward Hinnant } 33663e519524SHoward Hinnant if (__len <= __p.second) 33673e519524SHoward Hinnant { // The buffer is big enough to use 33683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33693e519524SHoward Hinnant __destruct_n __d(0); 33703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33713e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33723e519524SHoward Hinnant // Update __first to always point to the end of the trues 33733e519524SHoward Hinnant value_type* __t = __p.first; 3374ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33753e519524SHoward Hinnant __d.__incr((value_type*)0); 33763e519524SHoward Hinnant ++__t; 33773e519524SHoward Hinnant _ForwardIterator __i = __first; 33783e519524SHoward Hinnant while (++__i != __last) 33793e519524SHoward Hinnant { 33803e519524SHoward Hinnant if (__pred(*__i)) 33813e519524SHoward Hinnant { 3382ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33833e519524SHoward Hinnant ++__first; 33843e519524SHoward Hinnant } 33853e519524SHoward Hinnant else 33863e519524SHoward Hinnant { 3387ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33883e519524SHoward Hinnant __d.__incr((value_type*)0); 33893e519524SHoward Hinnant ++__t; 33903e519524SHoward Hinnant } 33913e519524SHoward Hinnant } 33923e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33933e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33943e519524SHoward Hinnant __i = __first; 33953e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3396ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33973e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33983e519524SHoward Hinnant return __first; 33993e519524SHoward Hinnant } 34003e519524SHoward Hinnant // Else not enough buffer, do in place 34013e519524SHoward Hinnant // __len >= 3 34023e519524SHoward Hinnant _ForwardIterator __m = __first; 34033e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3404ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34053e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34063e519524SHoward Hinnant // F????????????????? 34073e519524SHoward Hinnant // f m l 34083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34093e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34103e519524SHoward Hinnant // TTTFFFFF?????????? 34113e519524SHoward Hinnant // f ff m l 34123e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34133e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34143e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34153e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34163e519524SHoward Hinnant while (__pred(*__m1)) 34173e519524SHoward Hinnant { 34183e519524SHoward Hinnant if (++__m1 == __last) 34193e519524SHoward Hinnant goto __second_half_done; 34203e519524SHoward Hinnant --__len_half; 34213e519524SHoward Hinnant } 34223e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34233e519524SHoward Hinnant // f ff m m1 l 34243e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34253e519524SHoward Hinnant__second_half_done: 34263e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34273e519524SHoward Hinnant // f ff m sf l 3428ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34293e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34303e519524SHoward Hinnant // | 34313e519524SHoward Hinnant} 34323e519524SHoward Hinnant 34333e519524SHoward Hinnantstruct __return_temporary_buffer 34343e519524SHoward Hinnant{ 34353e519524SHoward Hinnant template <class _Tp> 3436ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34373e519524SHoward Hinnant}; 34383e519524SHoward Hinnant 34393e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34403e519524SHoward Hinnant_ForwardIterator 34413e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34423e519524SHoward Hinnant forward_iterator_tag) 34433e519524SHoward Hinnant{ 34443e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34453e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34463e519524SHoward Hinnant while (true) 34473e519524SHoward Hinnant { 34483e519524SHoward Hinnant if (__first == __last) 34493e519524SHoward Hinnant return __first; 34503e519524SHoward Hinnant if (!__pred(*__first)) 34513e519524SHoward Hinnant break; 34523e519524SHoward Hinnant ++__first; 34533e519524SHoward Hinnant } 34543e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34553e519524SHoward Hinnant // *__first is known to be false 34563e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34573e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3458ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34593e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34603e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34613e519524SHoward Hinnant if (__len >= __alloc_limit) 34623e519524SHoward Hinnant { 3463ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34643e519524SHoward Hinnant __h.reset(__p.first); 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34673e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34683e519524SHoward Hinnant} 34693e519524SHoward Hinnant 34703e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34713e519524SHoward Hinnant_BidirectionalIterator 34723e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34733e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34743e519524SHoward Hinnant{ 34753e519524SHoward Hinnant // *__first is known to be false 34763e519524SHoward Hinnant // *__last is known to be true 34773e519524SHoward Hinnant // __len >= 2 34783e519524SHoward Hinnant if (__len == 2) 34793e519524SHoward Hinnant { 34803e519524SHoward Hinnant swap(*__first, *__last); 34813e519524SHoward Hinnant return __last; 34823e519524SHoward Hinnant } 34833e519524SHoward Hinnant if (__len == 3) 34843e519524SHoward Hinnant { 34853e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34863e519524SHoward Hinnant if (__pred(*++__m)) 34873e519524SHoward Hinnant { 34883e519524SHoward Hinnant swap(*__first, *__m); 34893e519524SHoward Hinnant swap(*__m, *__last); 34903e519524SHoward Hinnant return __last; 34913e519524SHoward Hinnant } 34923e519524SHoward Hinnant swap(*__m, *__last); 34933e519524SHoward Hinnant swap(*__first, *__m); 34943e519524SHoward Hinnant return __m; 34953e519524SHoward Hinnant } 34963e519524SHoward Hinnant if (__len <= __p.second) 34973e519524SHoward Hinnant { // The buffer is big enough to use 34983e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34993e519524SHoward Hinnant __destruct_n __d(0); 35003e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35013e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35023e519524SHoward Hinnant // Update __first to always point to the end of the trues 35033e519524SHoward Hinnant value_type* __t = __p.first; 3504ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35053e519524SHoward Hinnant __d.__incr((value_type*)0); 35063e519524SHoward Hinnant ++__t; 35073e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35083e519524SHoward Hinnant while (++__i != __last) 35093e519524SHoward Hinnant { 35103e519524SHoward Hinnant if (__pred(*__i)) 35113e519524SHoward Hinnant { 3512ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35133e519524SHoward Hinnant ++__first; 35143e519524SHoward Hinnant } 35153e519524SHoward Hinnant else 35163e519524SHoward Hinnant { 3517ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35183e519524SHoward Hinnant __d.__incr((value_type*)0); 35193e519524SHoward Hinnant ++__t; 35203e519524SHoward Hinnant } 35213e519524SHoward Hinnant } 35223e519524SHoward Hinnant // move *__last, known to be true 3523ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35243e519524SHoward Hinnant __i = ++__first; 35253e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35263e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35273e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3528ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35293e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35303e519524SHoward Hinnant return __first; 35313e519524SHoward Hinnant } 35323e519524SHoward Hinnant // Else not enough buffer, do in place 35333e519524SHoward Hinnant // __len >= 4 35343e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35353e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3536ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35373e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35383e519524SHoward Hinnant // F????????????????T 35393e519524SHoward Hinnant // f m l 35403e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35413e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35423e519524SHoward Hinnant _Distance __len_half = __len2; 35433e519524SHoward Hinnant while (!__pred(*--__m1)) 35443e519524SHoward Hinnant { 35453e519524SHoward Hinnant if (__m1 == __first) 35463e519524SHoward Hinnant goto __first_half_done; 35473e519524SHoward Hinnant --__len_half; 35483e519524SHoward Hinnant } 35493e519524SHoward Hinnant // F???TFFF?????????T 35503e519524SHoward Hinnant // f m1 m l 35513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35523e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35533e519524SHoward Hinnant__first_half_done: 35543e519524SHoward Hinnant // TTTFFFFF?????????T 35553e519524SHoward Hinnant // f ff m l 35563e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35573e519524SHoward Hinnant __m1 = __m; 35583e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35593e519524SHoward Hinnant ++__second_false; 35603e519524SHoward Hinnant __len_half = __len - __len2; 35613e519524SHoward Hinnant while (__pred(*__m1)) 35623e519524SHoward Hinnant { 35633e519524SHoward Hinnant if (++__m1 == __last) 35643e519524SHoward Hinnant goto __second_half_done; 35653e519524SHoward Hinnant --__len_half; 35663e519524SHoward Hinnant } 35673e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35683e519524SHoward Hinnant // f ff m m1 l 35693e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35703e519524SHoward Hinnant__second_half_done: 35713e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35723e519524SHoward Hinnant // f ff m sf l 3573ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35743e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35753e519524SHoward Hinnant // | 35763e519524SHoward Hinnant} 35773e519524SHoward Hinnant 35783e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35793e519524SHoward Hinnant_BidirectionalIterator 35803e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35813e519524SHoward Hinnant bidirectional_iterator_tag) 35823e519524SHoward Hinnant{ 35833e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35843e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35853e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35863e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35873e519524SHoward Hinnant while (true) 35883e519524SHoward Hinnant { 35893e519524SHoward Hinnant if (__first == __last) 35903e519524SHoward Hinnant return __first; 35913e519524SHoward Hinnant if (!__pred(*__first)) 35923e519524SHoward Hinnant break; 35933e519524SHoward Hinnant ++__first; 35943e519524SHoward Hinnant } 35953e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35963e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35973e519524SHoward Hinnant do 35983e519524SHoward Hinnant { 35993e519524SHoward Hinnant if (__first == --__last) 36003e519524SHoward Hinnant return __first; 36013e519524SHoward Hinnant } while (!__pred(*__last)); 36023e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36033e519524SHoward Hinnant // *__first is known to be false 36043e519524SHoward Hinnant // *__last is known to be true 36053e519524SHoward Hinnant // __len >= 2 3606ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36073e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36083e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36093e519524SHoward Hinnant if (__len >= __alloc_limit) 36103e519524SHoward Hinnant { 3611ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36123e519524SHoward Hinnant __h.reset(__p.first); 36133e519524SHoward Hinnant } 36143e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36153e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36163e519524SHoward Hinnant} 36173e519524SHoward Hinnant 36183e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36203e519524SHoward Hinnant_ForwardIterator 36213e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36223e519524SHoward Hinnant{ 36233e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36243e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36253e519524SHoward Hinnant} 36263e519524SHoward Hinnant 36273e519524SHoward Hinnant// is_sorted_until 36283e519524SHoward Hinnant 36293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 363049c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 36313e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36323e519524SHoward Hinnant{ 36333e519524SHoward Hinnant if (__first != __last) 36343e519524SHoward Hinnant { 36353e519524SHoward Hinnant _ForwardIterator __i = __first; 36363e519524SHoward Hinnant while (++__i != __last) 36373e519524SHoward Hinnant { 36383e519524SHoward Hinnant if (__comp(*__i, *__first)) 36393e519524SHoward Hinnant return __i; 36403e519524SHoward Hinnant __first = __i; 36413e519524SHoward Hinnant } 36423e519524SHoward Hinnant } 36433e519524SHoward Hinnant return __last; 36443e519524SHoward Hinnant} 36453e519524SHoward Hinnant 36463e519524SHoward Hinnanttemplate<class _ForwardIterator> 364749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36483e519524SHoward Hinnant_ForwardIterator 36493e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36503e519524SHoward Hinnant{ 3651ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36523e519524SHoward Hinnant} 36533e519524SHoward Hinnant 36543e519524SHoward Hinnant// is_sorted 36553e519524SHoward Hinnant 36563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 365749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36583e519524SHoward Hinnantbool 36593e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36603e519524SHoward Hinnant{ 3661ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36623e519524SHoward Hinnant} 36633e519524SHoward Hinnant 36643e519524SHoward Hinnanttemplate<class _ForwardIterator> 366549c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36663e519524SHoward Hinnantbool 36673e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36683e519524SHoward Hinnant{ 3669ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36703e519524SHoward Hinnant} 36713e519524SHoward Hinnant 36723e519524SHoward Hinnant// sort 36733e519524SHoward Hinnant 36743e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36753e519524SHoward Hinnant 36763e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36773e519524SHoward Hinnantunsigned 36783e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36793e519524SHoward Hinnant{ 36803e519524SHoward Hinnant unsigned __r = 0; 36813e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36823e519524SHoward Hinnant { 36833e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36843e519524SHoward Hinnant return __r; // x <= y && y <= z 36853e519524SHoward Hinnant // x <= y && y > z 36863e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36873e519524SHoward Hinnant __r = 1; 36883e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36893e519524SHoward Hinnant { 36903e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36913e519524SHoward Hinnant __r = 2; 36923e519524SHoward Hinnant } 36933e519524SHoward Hinnant return __r; // x <= y && y < z 36943e519524SHoward Hinnant } 36953e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36963e519524SHoward Hinnant { 36973e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36983e519524SHoward Hinnant __r = 1; 36993e519524SHoward Hinnant return __r; 37003e519524SHoward Hinnant } 37013e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37023e519524SHoward Hinnant __r = 1; // x < y && x <= z 37033e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37043e519524SHoward Hinnant { 37053e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37063e519524SHoward Hinnant __r = 2; 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant return __r; 37093e519524SHoward Hinnant} // x <= y && y <= z 37103e519524SHoward Hinnant 37113e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37123e519524SHoward Hinnant 37133e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37143e519524SHoward Hinnantunsigned 37153e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37163e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37173e519524SHoward Hinnant{ 37183e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37193e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37203e519524SHoward Hinnant { 37213e519524SHoward Hinnant swap(*__x3, *__x4); 37223e519524SHoward Hinnant ++__r; 37233e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37243e519524SHoward Hinnant { 37253e519524SHoward Hinnant swap(*__x2, *__x3); 37263e519524SHoward Hinnant ++__r; 37273e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37283e519524SHoward Hinnant { 37293e519524SHoward Hinnant swap(*__x1, *__x2); 37303e519524SHoward Hinnant ++__r; 37313e519524SHoward Hinnant } 37323e519524SHoward Hinnant } 37333e519524SHoward Hinnant } 37343e519524SHoward Hinnant return __r; 37353e519524SHoward Hinnant} 37363e519524SHoward Hinnant 37373e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37383e519524SHoward Hinnant 37393e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37403e519524SHoward Hinnantunsigned 37413e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37423e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37433e519524SHoward Hinnant{ 37443e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37453e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37463e519524SHoward Hinnant { 37473e519524SHoward Hinnant swap(*__x4, *__x5); 37483e519524SHoward Hinnant ++__r; 37493e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37503e519524SHoward Hinnant { 37513e519524SHoward Hinnant swap(*__x3, *__x4); 37523e519524SHoward Hinnant ++__r; 37533e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37543e519524SHoward Hinnant { 37553e519524SHoward Hinnant swap(*__x2, *__x3); 37563e519524SHoward Hinnant ++__r; 37573e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37583e519524SHoward Hinnant { 37593e519524SHoward Hinnant swap(*__x1, *__x2); 37603e519524SHoward Hinnant ++__r; 37613e519524SHoward Hinnant } 37623e519524SHoward Hinnant } 37633e519524SHoward Hinnant } 37643e519524SHoward Hinnant } 37653e519524SHoward Hinnant return __r; 37663e519524SHoward Hinnant} 37673e519524SHoward Hinnant 37683e519524SHoward Hinnant// Assumes size > 0 37693e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37703e519524SHoward Hinnantvoid 37713e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37723e519524SHoward Hinnant{ 37733e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37743e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37753e519524SHoward Hinnant { 3776ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37773e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37783e519524SHoward Hinnant (__first, __last, __comp); 37793e519524SHoward Hinnant if (__i != __first) 37803e519524SHoward Hinnant swap(*__first, *__i); 37813e519524SHoward Hinnant } 37823e519524SHoward Hinnant} 37833e519524SHoward Hinnant 37843e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37853e519524SHoward Hinnantvoid 37863e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37873e519524SHoward Hinnant{ 37883e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37893e519524SHoward Hinnant if (__first != __last) 37903e519524SHoward Hinnant { 37913e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37923e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37933e519524SHoward Hinnant { 37943e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3795ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37963e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3797ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3798ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37993e519524SHoward Hinnant } 38003e519524SHoward Hinnant } 38013e519524SHoward Hinnant} 38023e519524SHoward Hinnant 38033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38043e519524SHoward Hinnantvoid 38053e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38063e519524SHoward Hinnant{ 38073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38083e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38093e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38103e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38113e519524SHoward Hinnant { 38123e519524SHoward Hinnant if (__comp(*__i, *__j)) 38133e519524SHoward Hinnant { 3814ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38153e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38163e519524SHoward Hinnant __j = __i; 38173e519524SHoward Hinnant do 38183e519524SHoward Hinnant { 3819ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38203e519524SHoward Hinnant __j = __k; 38213e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3822ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38233e519524SHoward Hinnant } 38243e519524SHoward Hinnant __j = __i; 38253e519524SHoward Hinnant } 38263e519524SHoward Hinnant} 38273e519524SHoward Hinnant 38283e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38293e519524SHoward Hinnantbool 38303e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38313e519524SHoward Hinnant{ 38323e519524SHoward Hinnant switch (__last - __first) 38333e519524SHoward Hinnant { 38343e519524SHoward Hinnant case 0: 38353e519524SHoward Hinnant case 1: 38363e519524SHoward Hinnant return true; 38373e519524SHoward Hinnant case 2: 38383e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38393e519524SHoward Hinnant swap(*__first, *__last); 38403e519524SHoward Hinnant return true; 38413e519524SHoward Hinnant case 3: 3842ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38433e519524SHoward Hinnant return true; 38443e519524SHoward Hinnant case 4: 3845ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38463e519524SHoward Hinnant return true; 38473e519524SHoward Hinnant case 5: 3848ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38493e519524SHoward Hinnant return true; 38503e519524SHoward Hinnant } 38513e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38523e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38533e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38543e519524SHoward Hinnant const unsigned __limit = 8; 38553e519524SHoward Hinnant unsigned __count = 0; 38563e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38573e519524SHoward Hinnant { 38583e519524SHoward Hinnant if (__comp(*__i, *__j)) 38593e519524SHoward Hinnant { 3860ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38613e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38623e519524SHoward Hinnant __j = __i; 38633e519524SHoward Hinnant do 38643e519524SHoward Hinnant { 3865ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38663e519524SHoward Hinnant __j = __k; 38673e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3868ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38693e519524SHoward Hinnant if (++__count == __limit) 38703e519524SHoward Hinnant return ++__i == __last; 38713e519524SHoward Hinnant } 38723e519524SHoward Hinnant __j = __i; 38733e519524SHoward Hinnant } 38743e519524SHoward Hinnant return true; 38753e519524SHoward Hinnant} 38763e519524SHoward Hinnant 38773e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38783e519524SHoward Hinnantvoid 38793e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38803e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38813e519524SHoward Hinnant{ 38823e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38833e519524SHoward Hinnant if (__first1 != __last1) 38843e519524SHoward Hinnant { 38853e519524SHoward Hinnant __destruct_n __d(0); 38863e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38873e519524SHoward Hinnant value_type* __last2 = __first2; 3888ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38893e519524SHoward Hinnant __d.__incr((value_type*)0); 38903e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant value_type* __j2 = __last2; 38933e519524SHoward Hinnant value_type* __i2 = __j2; 38943e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38953e519524SHoward Hinnant { 3896ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38973e519524SHoward Hinnant __d.__incr((value_type*)0); 38983e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3899ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3900ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39013e519524SHoward Hinnant } 39023e519524SHoward Hinnant else 39033e519524SHoward Hinnant { 3904ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39053e519524SHoward Hinnant __d.__incr((value_type*)0); 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant } 39083e519524SHoward Hinnant __h.release(); 39093e519524SHoward Hinnant } 39103e519524SHoward Hinnant} 39113e519524SHoward Hinnant 39123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39133e519524SHoward Hinnantvoid 39143e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39153e519524SHoward Hinnant{ 39163e519524SHoward Hinnant // _Compare is known to be a reference type 39173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3919ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3920ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39213e519524SHoward Hinnant while (true) 39223e519524SHoward Hinnant { 39233e519524SHoward Hinnant __restart: 39243e519524SHoward Hinnant difference_type __len = __last - __first; 39253e519524SHoward Hinnant switch (__len) 39263e519524SHoward Hinnant { 39273e519524SHoward Hinnant case 0: 39283e519524SHoward Hinnant case 1: 39293e519524SHoward Hinnant return; 39303e519524SHoward Hinnant case 2: 39313e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39323e519524SHoward Hinnant swap(*__first, *__last); 39333e519524SHoward Hinnant return; 39343e519524SHoward Hinnant case 3: 3935ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39363e519524SHoward Hinnant return; 39373e519524SHoward Hinnant case 4: 3938ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39393e519524SHoward Hinnant return; 39403e519524SHoward Hinnant case 5: 3941ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39423e519524SHoward Hinnant return; 39433e519524SHoward Hinnant } 39443e519524SHoward Hinnant if (__len <= __limit) 39453e519524SHoward Hinnant { 3946ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39473e519524SHoward Hinnant return; 39483e519524SHoward Hinnant } 39493e519524SHoward Hinnant // __len > 5 39503e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39513e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39523e519524SHoward Hinnant --__lm1; 39533e519524SHoward Hinnant unsigned __n_swaps; 39543e519524SHoward Hinnant { 39553e519524SHoward Hinnant difference_type __delta; 39563e519524SHoward Hinnant if (__len >= 1000) 39573e519524SHoward Hinnant { 39583e519524SHoward Hinnant __delta = __len/2; 39593e519524SHoward Hinnant __m += __delta; 39603e519524SHoward Hinnant __delta /= 2; 3961ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39623e519524SHoward Hinnant } 39633e519524SHoward Hinnant else 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant __delta = __len/2; 39663e519524SHoward Hinnant __m += __delta; 3967ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant } 39703e519524SHoward Hinnant // *__m is median 39713e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39723e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39733e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39743e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39753e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39763e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39773e519524SHoward Hinnant // Prime the downward search with a guard. 39783e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39793e519524SHoward Hinnant { 39803e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39813e519524SHoward Hinnant // manually guard downward moving __j against __i 39823e519524SHoward Hinnant while (true) 39833e519524SHoward Hinnant { 39843e519524SHoward Hinnant if (__i == --__j) 39853e519524SHoward Hinnant { 39863e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39873e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39883e519524SHoward Hinnant ++__i; // __first + 1 39893e519524SHoward Hinnant __j = __last; 39903e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39913e519524SHoward Hinnant { 39923e519524SHoward Hinnant while (true) 39933e519524SHoward Hinnant { 39943e519524SHoward Hinnant if (__i == __j) 39953e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39963e519524SHoward Hinnant if (__comp(*__first, *__i)) 39973e519524SHoward Hinnant { 39983e519524SHoward Hinnant swap(*__i, *__j); 39993e519524SHoward Hinnant ++__n_swaps; 40003e519524SHoward Hinnant ++__i; 40013e519524SHoward Hinnant break; 40023e519524SHoward Hinnant } 40033e519524SHoward Hinnant ++__i; 40043e519524SHoward Hinnant } 40053e519524SHoward Hinnant } 40063e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40073e519524SHoward Hinnant if (__i == __j) 40083e519524SHoward Hinnant return; 40093e519524SHoward Hinnant while (true) 40103e519524SHoward Hinnant { 40113e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40123e519524SHoward Hinnant ++__i; 40133e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40143e519524SHoward Hinnant ; 40153e519524SHoward Hinnant if (__i >= __j) 40163e519524SHoward Hinnant break; 40173e519524SHoward Hinnant swap(*__i, *__j); 40183e519524SHoward Hinnant ++__n_swaps; 40193e519524SHoward Hinnant ++__i; 40203e519524SHoward Hinnant } 40213e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40223e519524SHoward Hinnant // The first part is sorted, sort the secod part 4023ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40243e519524SHoward Hinnant __first = __i; 40253e519524SHoward Hinnant goto __restart; 40263e519524SHoward Hinnant } 40273e519524SHoward Hinnant if (__comp(*__j, *__m)) 40283e519524SHoward Hinnant { 40293e519524SHoward Hinnant swap(*__i, *__j); 40303e519524SHoward Hinnant ++__n_swaps; 40313e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40323e519524SHoward Hinnant } 40333e519524SHoward Hinnant } 40343e519524SHoward Hinnant } 40353e519524SHoward Hinnant // It is known that *__i < *__m 40363e519524SHoward Hinnant ++__i; 40373e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40383e519524SHoward Hinnant // if not yet partitioned... 40393e519524SHoward Hinnant if (__i < __j) 40403e519524SHoward Hinnant { 40413e519524SHoward Hinnant // known that *(__i - 1) < *__m 40423e519524SHoward Hinnant // known that __i <= __m 40433e519524SHoward Hinnant while (true) 40443e519524SHoward Hinnant { 40453e519524SHoward Hinnant // __m still guards upward moving __i 40463e519524SHoward Hinnant while (__comp(*__i, *__m)) 40473e519524SHoward Hinnant ++__i; 40483e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40493e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40503e519524SHoward Hinnant ; 40513e519524SHoward Hinnant if (__i > __j) 40523e519524SHoward Hinnant break; 40533e519524SHoward Hinnant swap(*__i, *__j); 40543e519524SHoward Hinnant ++__n_swaps; 40553e519524SHoward Hinnant // It is known that __m != __j 40563e519524SHoward Hinnant // If __m just moved, follow it 40573e519524SHoward Hinnant if (__m == __i) 40583e519524SHoward Hinnant __m = __j; 40593e519524SHoward Hinnant ++__i; 40603e519524SHoward Hinnant } 40613e519524SHoward Hinnant } 40623e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40633e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40643e519524SHoward Hinnant { 40653e519524SHoward Hinnant swap(*__i, *__m); 40663e519524SHoward Hinnant ++__n_swaps; 40673e519524SHoward Hinnant } 40683e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40693e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40703e519524SHoward Hinnant if (__n_swaps == 0) 40713e519524SHoward Hinnant { 4072ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4073ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40743e519524SHoward Hinnant { 40753e519524SHoward Hinnant if (__fs) 40763e519524SHoward Hinnant return; 40773e519524SHoward Hinnant __last = __i; 40783e519524SHoward Hinnant continue; 40793e519524SHoward Hinnant } 40803e519524SHoward Hinnant else 40813e519524SHoward Hinnant { 40823e519524SHoward Hinnant if (__fs) 40833e519524SHoward Hinnant { 40843e519524SHoward Hinnant __first = ++__i; 40853e519524SHoward Hinnant continue; 40863e519524SHoward Hinnant } 40873e519524SHoward Hinnant } 40883e519524SHoward Hinnant } 40893e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40903e519524SHoward Hinnant if (__i - __first < __last - __i) 40913e519524SHoward Hinnant { 4092ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4093ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40943e519524SHoward Hinnant __first = ++__i; 40953e519524SHoward Hinnant } 40963e519524SHoward Hinnant else 40973e519524SHoward Hinnant { 4098ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4099ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41003e519524SHoward Hinnant __last = __i; 41013e519524SHoward Hinnant } 41023e519524SHoward Hinnant } 41033e519524SHoward Hinnant} 41043e519524SHoward Hinnant 41053e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41083e519524SHoward Hinnantvoid 41093e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41103e519524SHoward Hinnant{ 4111145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41143e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4115145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41173e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4118145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41193e519524SHoward Hinnant} 41203e519524SHoward Hinnant 41213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41233e519524SHoward Hinnantvoid 41243e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41253e519524SHoward Hinnant{ 4126ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41273e519524SHoward Hinnant} 41283e519524SHoward Hinnant 41293e519524SHoward Hinnanttemplate <class _Tp> 41303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41313e519524SHoward Hinnantvoid 41323e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41333e519524SHoward Hinnant{ 4134ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41353e519524SHoward Hinnant} 41363e519524SHoward Hinnant 41373e519524SHoward Hinnanttemplate <class _Tp> 41383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41393e519524SHoward Hinnantvoid 41403e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41413e519524SHoward Hinnant{ 4142ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41433e519524SHoward Hinnant} 41443e519524SHoward Hinnant 4145f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4146f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4147f554add5SHoward Hinnantvoid 4148f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4149f554add5SHoward Hinnant{ 4150f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4151f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4152f554add5SHoward Hinnant} 4153f554add5SHoward Hinnant 4154f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4155f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4156f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4157f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4158f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4159f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4160f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4161f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4162f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4163f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4164f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4165f0544c20SHoward 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>&)) 4166f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4167f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4168f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41693e519524SHoward Hinnant 4170f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4171f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4172f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4173f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4174f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4175f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4176f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4177f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4178f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4179f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4180f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4181f0544c20SHoward 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>&)) 4182f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4183f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4184f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41853e519524SHoward Hinnant 4186f0544c20SHoward 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>&)) 41873e519524SHoward Hinnant 41883e519524SHoward Hinnant// lower_bound 41893e519524SHoward Hinnant 41903e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4191d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4192e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41933e519524SHoward Hinnant{ 41943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4195ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41963e519524SHoward Hinnant while (__len != 0) 41973e519524SHoward Hinnant { 41983e519524SHoward Hinnant difference_type __l2 = __len / 2; 41993e519524SHoward Hinnant _ForwardIterator __m = __first; 4200ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4201e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42023e519524SHoward Hinnant { 42033e519524SHoward Hinnant __first = ++__m; 42043e519524SHoward Hinnant __len -= __l2 + 1; 42053e519524SHoward Hinnant } 42063e519524SHoward Hinnant else 42073e519524SHoward Hinnant __len = __l2; 42083e519524SHoward Hinnant } 42093e519524SHoward Hinnant return __first; 42103e519524SHoward Hinnant} 42113e519524SHoward Hinnant 42123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4213d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42143e519524SHoward Hinnant_ForwardIterator 4215e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42163e519524SHoward Hinnant{ 4217145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4220e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4221145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4223e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4224145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42253e519524SHoward Hinnant} 42263e519524SHoward Hinnant 42273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4228d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42293e519524SHoward Hinnant_ForwardIterator 4230e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42313e519524SHoward Hinnant{ 4232e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42333e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42343e519524SHoward Hinnant} 42353e519524SHoward Hinnant 42363e519524SHoward Hinnant// upper_bound 42373e519524SHoward Hinnant 42383e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4239d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 4240e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42413e519524SHoward Hinnant{ 42423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4243ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42443e519524SHoward Hinnant while (__len != 0) 42453e519524SHoward Hinnant { 42463e519524SHoward Hinnant difference_type __l2 = __len / 2; 42473e519524SHoward Hinnant _ForwardIterator __m = __first; 4248ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4249e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42503e519524SHoward Hinnant __len = __l2; 42513e519524SHoward Hinnant else 42523e519524SHoward Hinnant { 42533e519524SHoward Hinnant __first = ++__m; 42543e519524SHoward Hinnant __len -= __l2 + 1; 42553e519524SHoward Hinnant } 42563e519524SHoward Hinnant } 42573e519524SHoward Hinnant return __first; 42583e519524SHoward Hinnant} 42593e519524SHoward Hinnant 42603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4261d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42623e519524SHoward Hinnant_ForwardIterator 4263e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42643e519524SHoward Hinnant{ 4265145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4268e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4269145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4271e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4272145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4276d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 42773e519524SHoward Hinnant_ForwardIterator 4278e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42793e519524SHoward Hinnant{ 4280e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42813e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42823e519524SHoward Hinnant} 42833e519524SHoward Hinnant 42843e519524SHoward Hinnant// equal_range 42853e519524SHoward Hinnant 42863e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4287d57c03ddSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 pair<_ForwardIterator, _ForwardIterator> 4288e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42893e519524SHoward Hinnant{ 42903e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4291ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42923e519524SHoward Hinnant while (__len != 0) 42933e519524SHoward Hinnant { 42943e519524SHoward Hinnant difference_type __l2 = __len / 2; 42953e519524SHoward Hinnant _ForwardIterator __m = __first; 4296ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4297e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42983e519524SHoward Hinnant { 42993e519524SHoward Hinnant __first = ++__m; 43003e519524SHoward Hinnant __len -= __l2 + 1; 43013e519524SHoward Hinnant } 4302e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43033e519524SHoward Hinnant { 43043e519524SHoward Hinnant __last = __m; 43053e519524SHoward Hinnant __len = __l2; 43063e519524SHoward Hinnant } 43073e519524SHoward Hinnant else 43083e519524SHoward Hinnant { 43093e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43103e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43113e519524SHoward Hinnant ( 4312e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4313e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43143e519524SHoward Hinnant ); 43153e519524SHoward Hinnant } 43163e519524SHoward Hinnant } 43173e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43183e519524SHoward Hinnant} 43193e519524SHoward Hinnant 43203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4321d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43223e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4323e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43243e519524SHoward Hinnant{ 4325145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4328e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4329145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4331e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4332145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43333e519524SHoward Hinnant} 43343e519524SHoward Hinnant 43353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4336d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43373e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4338e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43393e519524SHoward Hinnant{ 4340e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43413e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43423e519524SHoward Hinnant} 43433e519524SHoward Hinnant 43443e519524SHoward Hinnant// binary_search 43453e519524SHoward Hinnant 43463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 4347d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43483e519524SHoward Hinnantbool 4349e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43503e519524SHoward Hinnant{ 4351e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4352e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43533e519524SHoward Hinnant} 43543e519524SHoward Hinnant 43553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 4356d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43573e519524SHoward Hinnantbool 4358e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43593e519524SHoward Hinnant{ 4360145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4363e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4364145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4366e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4367145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43683e519524SHoward Hinnant} 43693e519524SHoward Hinnant 43703e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 4371d57c03ddSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 43723e519524SHoward Hinnantbool 4373e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43743e519524SHoward Hinnant{ 4375e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43763e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43773e519524SHoward Hinnant} 43783e519524SHoward Hinnant 43793e519524SHoward Hinnant// merge 43803e519524SHoward Hinnant 43813e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43823e519524SHoward Hinnant_OutputIterator 43833e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43853e519524SHoward Hinnant{ 43863e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43873e519524SHoward Hinnant { 43883e519524SHoward Hinnant if (__first2 == __last2) 4389ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43903e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43913e519524SHoward Hinnant { 43923e519524SHoward Hinnant *__result = *__first2; 43933e519524SHoward Hinnant ++__first2; 43943e519524SHoward Hinnant } 43953e519524SHoward Hinnant else 43963e519524SHoward Hinnant { 43973e519524SHoward Hinnant *__result = *__first1; 43983e519524SHoward Hinnant ++__first1; 43993e519524SHoward Hinnant } 44003e519524SHoward Hinnant } 4401ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44023e519524SHoward Hinnant} 44033e519524SHoward Hinnant 44043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44063e519524SHoward Hinnant_OutputIterator 44073e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44093e519524SHoward Hinnant{ 4410145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4413ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4414145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4416ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4417145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44183e519524SHoward Hinnant} 44193e519524SHoward Hinnant 44203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44223e519524SHoward Hinnant_OutputIterator 44233e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44253e519524SHoward Hinnant{ 44263e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44273e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44283e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44293e519524SHoward Hinnant} 44303e519524SHoward Hinnant 44313e519524SHoward Hinnant// inplace_merge 44323e519524SHoward Hinnant 4433adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4434adfdae18SMarshall Clow class _OutputIterator> 4435adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4436adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4437adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4438adfdae18SMarshall Clow{ 4439adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4440adfdae18SMarshall Clow { 4441adfdae18SMarshall Clow if (__first2 == __last2) 4442adfdae18SMarshall Clow { 4443adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4444adfdae18SMarshall Clow return; 4445adfdae18SMarshall Clow } 4446adfdae18SMarshall Clow 4447adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4448adfdae18SMarshall Clow { 4449adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4450adfdae18SMarshall Clow ++__first2; 4451adfdae18SMarshall Clow } 4452adfdae18SMarshall Clow else 4453adfdae18SMarshall Clow { 4454adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4455adfdae18SMarshall Clow ++__first1; 4456adfdae18SMarshall Clow } 4457adfdae18SMarshall Clow } 4458adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4459adfdae18SMarshall Clow} 4460adfdae18SMarshall Clow 44613e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44623e519524SHoward Hinnantvoid 44633e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44643e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44653e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44663e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44673e519524SHoward Hinnant{ 44683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44693e519524SHoward Hinnant __destruct_n __d(0); 44703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44713e519524SHoward Hinnant if (__len1 <= __len2) 44723e519524SHoward Hinnant { 44733e519524SHoward Hinnant value_type* __p = __buff; 4474910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4475ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4476adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44773e519524SHoward Hinnant } 44783e519524SHoward Hinnant else 44793e519524SHoward Hinnant { 44803e519524SHoward Hinnant value_type* __p = __buff; 4481910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4482ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44833e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44843e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4485adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4486adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4487a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 44883e519524SHoward Hinnant } 44893e519524SHoward Hinnant} 44903e519524SHoward Hinnant 44913e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44923e519524SHoward Hinnantvoid 44933e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44943e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44953e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44963e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44973e519524SHoward Hinnant{ 44983e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44993e519524SHoward Hinnant while (true) 45003e519524SHoward Hinnant { 45013e519524SHoward Hinnant // if __middle == __last, we're done 45023e519524SHoward Hinnant if (__len2 == 0) 45033e519524SHoward Hinnant return; 4504526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4505526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4506526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45073e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4508910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45093e519524SHoward Hinnant { 45103e519524SHoward Hinnant if (__len1 == 0) 45113e519524SHoward Hinnant return; 45123e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45133e519524SHoward Hinnant break; 45143e519524SHoward Hinnant } 45153e519524SHoward Hinnant // __first < __middle < __last 45163e519524SHoward Hinnant // *__first > *__middle 45173e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45183e519524SHoward Hinnant // all elements in: 45193e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45203e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45213e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45223e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45233e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45243e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45253e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45263e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45273e519524SHoward Hinnant // binary search smaller range 45283e519524SHoward Hinnant if (__len1 < __len2) 45293e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45303e519524SHoward Hinnant __len21 = __len2 / 2; 45313e519524SHoward Hinnant __m2 = __middle; 4532ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45333e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4534ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45353e519524SHoward Hinnant } 45363e519524SHoward Hinnant else 45373e519524SHoward Hinnant { 45383e519524SHoward Hinnant if (__len1 == 1) 45393e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45403e519524SHoward Hinnant // It is known *__first > *__middle 45413e519524SHoward Hinnant swap(*__first, *__middle); 45423e519524SHoward Hinnant return; 45433e519524SHoward Hinnant } 45443e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45453e519524SHoward Hinnant __len11 = __len1 / 2; 45463e519524SHoward Hinnant __m1 = __first; 4547ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45483e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4549ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45503e519524SHoward Hinnant } 45513e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45523e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45533e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45543e519524SHoward Hinnant // swap middle two partitions 4555ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45563e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45573e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45583e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45593e519524SHoward Hinnant { 45603e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45613e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45623e519524SHoward Hinnant __first = __middle; 45633e519524SHoward Hinnant __middle = __m2; 45643e519524SHoward Hinnant __len1 = __len12; 45653e519524SHoward Hinnant __len2 = __len22; 45663e519524SHoward Hinnant } 45673e519524SHoward Hinnant else 45683e519524SHoward Hinnant { 45693e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45703e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45713e519524SHoward Hinnant __last = __middle; 45723e519524SHoward Hinnant __middle = __m1; 45733e519524SHoward Hinnant __len1 = __len11; 45743e519524SHoward Hinnant __len2 = __len21; 45753e519524SHoward Hinnant } 45763e519524SHoward Hinnant } 45773e519524SHoward Hinnant} 45783e519524SHoward Hinnant 45793e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45813e519524SHoward Hinnantvoid 45823e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45833e519524SHoward Hinnant _Compare __comp) 45843e519524SHoward Hinnant{ 45853e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4587ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4588ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4589ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45900b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45910b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45920b48cf9aSMarshall Clow 4593145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4596ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45973e519524SHoward Hinnant __buf.first, __buf.second); 4598145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4600ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46013e519524SHoward Hinnant __buf.first, __buf.second); 4602145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46033e519524SHoward Hinnant} 46043e519524SHoward Hinnant 46053e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46073e519524SHoward Hinnantvoid 46083e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46093e519524SHoward Hinnant{ 4610ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46113e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46123e519524SHoward Hinnant} 46133e519524SHoward Hinnant 46143e519524SHoward Hinnant// stable_sort 46153e519524SHoward Hinnant 46163e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 46173e519524SHoward Hinnantvoid 46183e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 46193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46203e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 46213e519524SHoward Hinnant{ 46223e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46233e519524SHoward Hinnant __destruct_n __d(0); 46243e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46253e519524SHoward Hinnant for (; true; ++__result) 46263e519524SHoward Hinnant { 46273e519524SHoward Hinnant if (__first1 == __last1) 46283e519524SHoward Hinnant { 46293e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4630ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46313e519524SHoward Hinnant __h.release(); 46323e519524SHoward Hinnant return; 46333e519524SHoward Hinnant } 46343e519524SHoward Hinnant if (__first2 == __last2) 46353e519524SHoward Hinnant { 46363e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4637ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46383e519524SHoward Hinnant __h.release(); 46393e519524SHoward Hinnant return; 46403e519524SHoward Hinnant } 46413e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46423e519524SHoward Hinnant { 4643ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46443e519524SHoward Hinnant __d.__incr((value_type*)0); 46453e519524SHoward Hinnant ++__first2; 46463e519524SHoward Hinnant } 46473e519524SHoward Hinnant else 46483e519524SHoward Hinnant { 4649ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46503e519524SHoward Hinnant __d.__incr((value_type*)0); 46513e519524SHoward Hinnant ++__first1; 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant } 46543e519524SHoward Hinnant} 46553e519524SHoward Hinnant 46563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46573e519524SHoward Hinnantvoid 46583e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46603e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46613e519524SHoward Hinnant{ 46623e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46633e519524SHoward Hinnant { 46643e519524SHoward Hinnant if (__first2 == __last2) 46653e519524SHoward Hinnant { 46663e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4667ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46683e519524SHoward Hinnant return; 46693e519524SHoward Hinnant } 46703e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46713e519524SHoward Hinnant { 4672ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46733e519524SHoward Hinnant ++__first2; 46743e519524SHoward Hinnant } 46753e519524SHoward Hinnant else 46763e519524SHoward Hinnant { 4677ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46783e519524SHoward Hinnant ++__first1; 46793e519524SHoward Hinnant } 46803e519524SHoward Hinnant } 46813e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4682ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46833e519524SHoward Hinnant} 46843e519524SHoward Hinnant 46853e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46863e519524SHoward Hinnantvoid 46873e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46883e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46903e519524SHoward Hinnant 46913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46923e519524SHoward Hinnantvoid 46933e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46963e519524SHoward Hinnant{ 46973e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46983e519524SHoward Hinnant switch (__len) 46993e519524SHoward Hinnant { 47003e519524SHoward Hinnant case 0: 47013e519524SHoward Hinnant return; 47023e519524SHoward Hinnant case 1: 4703ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47043e519524SHoward Hinnant return; 47053e519524SHoward Hinnant case 2: 47063e519524SHoward Hinnant __destruct_n __d(0); 47073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47083e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47093e519524SHoward Hinnant { 4710ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47113e519524SHoward Hinnant __d.__incr((value_type*)0); 47123e519524SHoward Hinnant ++__first2; 4713ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47143e519524SHoward Hinnant } 47153e519524SHoward Hinnant else 47163e519524SHoward Hinnant { 4717ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47183e519524SHoward Hinnant __d.__incr((value_type*)0); 47193e519524SHoward Hinnant ++__first2; 4720ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47213e519524SHoward Hinnant } 47223e519524SHoward Hinnant __h2.release(); 47233e519524SHoward Hinnant return; 47243e519524SHoward Hinnant } 47253e519524SHoward Hinnant if (__len <= 8) 47263e519524SHoward Hinnant { 47273e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47283e519524SHoward Hinnant return; 47293e519524SHoward Hinnant } 47303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47313e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47323e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47333e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47343e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47353e519524SHoward Hinnant} 47363e519524SHoward Hinnant 47373e519524SHoward Hinnanttemplate <class _Tp> 47383e519524SHoward Hinnantstruct __stable_sort_switch 47393e519524SHoward Hinnant{ 4740ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47413e519524SHoward Hinnant}; 47423e519524SHoward Hinnant 47433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47443e519524SHoward Hinnantvoid 47453e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47463e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47473e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47483e519524SHoward Hinnant{ 47493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47513e519524SHoward Hinnant switch (__len) 47523e519524SHoward Hinnant { 47533e519524SHoward Hinnant case 0: 47543e519524SHoward Hinnant case 1: 47553e519524SHoward Hinnant return; 47563e519524SHoward Hinnant case 2: 47573e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47583e519524SHoward Hinnant swap(*__first, *__last); 47593e519524SHoward Hinnant return; 47603e519524SHoward Hinnant } 47613e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47623e519524SHoward Hinnant { 47633e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47643e519524SHoward Hinnant return; 47653e519524SHoward Hinnant } 47663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47673e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47683e519524SHoward Hinnant if (__len <= __buff_size) 47693e519524SHoward Hinnant { 47703e519524SHoward Hinnant __destruct_n __d(0); 47713e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47723e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47733e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47743e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47753e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47763e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47773e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47783e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47793e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47803e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47813e519524SHoward Hinnant// __first, __comp); 47823e519524SHoward Hinnant return; 47833e519524SHoward Hinnant } 47843e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47853e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47863e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47873e519524SHoward Hinnant} 47883e519524SHoward Hinnant 47893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47913e519524SHoward Hinnantvoid 47923e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47933e519524SHoward Hinnant{ 47943e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47963e519524SHoward Hinnant difference_type __len = __last - __first; 47973e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47983e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47993e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48003e519524SHoward Hinnant { 4801ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48023e519524SHoward Hinnant __h.reset(__buf.first); 48033e519524SHoward Hinnant } 4804145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48073e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4808145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48103e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4811145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48123e519524SHoward Hinnant} 48133e519524SHoward Hinnant 48143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48163e519524SHoward Hinnantvoid 48173e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 48183e519524SHoward Hinnant{ 4819ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48203e519524SHoward Hinnant} 48213e519524SHoward Hinnant 48223e519524SHoward Hinnant// is_heap_until 48233e519524SHoward Hinnant 48243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 482549c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 48263e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48273e519524SHoward Hinnant{ 4828ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48293e519524SHoward Hinnant difference_type __len = __last - __first; 48303e519524SHoward Hinnant difference_type __p = 0; 48313e519524SHoward Hinnant difference_type __c = 1; 48323e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48333e519524SHoward Hinnant while (__c < __len) 48343e519524SHoward Hinnant { 48353e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48363e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48373e519524SHoward Hinnant return __cp; 48383e519524SHoward Hinnant ++__c; 48393e519524SHoward Hinnant ++__cp; 48403e519524SHoward Hinnant if (__c == __len) 48413e519524SHoward Hinnant return __last; 48423e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48433e519524SHoward Hinnant return __cp; 48443e519524SHoward Hinnant ++__p; 48453e519524SHoward Hinnant ++__pp; 48463e519524SHoward Hinnant __c = 2 * __p + 1; 48473e519524SHoward Hinnant } 48483e519524SHoward Hinnant return __last; 48493e519524SHoward Hinnant} 48503e519524SHoward Hinnant 48513e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 485249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48533e519524SHoward Hinnant_RandomAccessIterator 48543e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48553e519524SHoward Hinnant{ 4856ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48573e519524SHoward Hinnant} 48583e519524SHoward Hinnant 48593e519524SHoward Hinnant// is_heap 48603e519524SHoward Hinnant 48613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 486249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48633e519524SHoward Hinnantbool 48643e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48653e519524SHoward Hinnant{ 4866ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48673e519524SHoward Hinnant} 48683e519524SHoward Hinnant 48693e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 487049c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48713e519524SHoward Hinnantbool 48723e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48733e519524SHoward Hinnant{ 4874ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48753e519524SHoward Hinnant} 48763e519524SHoward Hinnant 48773e519524SHoward Hinnant// push_heap 48783e519524SHoward Hinnant 48793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48803e519524SHoward Hinnantvoid 48818b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48833e519524SHoward Hinnant{ 48843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48853e519524SHoward Hinnant if (__len > 1) 48863e519524SHoward Hinnant { 48873e519524SHoward Hinnant __len = (__len - 2) / 2; 48883e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48893e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48903e519524SHoward Hinnant { 4891ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48923e519524SHoward Hinnant do 48933e519524SHoward Hinnant { 4894ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48953e519524SHoward Hinnant __last = __ptr; 48963e519524SHoward Hinnant if (__len == 0) 48973e519524SHoward Hinnant break; 48983e519524SHoward Hinnant __len = (__len - 1) / 2; 48993e519524SHoward Hinnant __ptr = __first + __len; 49003e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4901ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49023e519524SHoward Hinnant } 49033e519524SHoward Hinnant } 49043e519524SHoward Hinnant} 49053e519524SHoward Hinnant 49063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49083e519524SHoward Hinnantvoid 49093e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49103e519524SHoward Hinnant{ 4911145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49148b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4915145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49178b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4918145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49193e519524SHoward Hinnant} 49203e519524SHoward Hinnant 49213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49233e519524SHoward Hinnantvoid 49243e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49253e519524SHoward Hinnant{ 4926ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49273e519524SHoward Hinnant} 49283e519524SHoward Hinnant 49293e519524SHoward Hinnant// pop_heap 49303e519524SHoward Hinnant 49313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49328b512602SDavid Majnemervoid 4933fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4934fd838227SEric Fiselier _Compare __comp, 49358b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49368b512602SDavid Majnemer _RandomAccessIterator __start) 49378b512602SDavid Majnemer{ 49388b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49398b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49408b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49418b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49428b512602SDavid Majnemer difference_type __child = __start - __first; 49438b512602SDavid Majnemer 49448b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49458b512602SDavid Majnemer return; 49468b512602SDavid Majnemer 49478b512602SDavid Majnemer __child = 2 * __child + 1; 49488b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49498b512602SDavid Majnemer 49508b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49518b512602SDavid Majnemer // right-child exists and is greater than left-child 49528b512602SDavid Majnemer ++__child_i; 49538b512602SDavid Majnemer ++__child; 49548b512602SDavid Majnemer } 49558b512602SDavid Majnemer 49568b512602SDavid Majnemer // check if we are in heap-order 49578b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49588b512602SDavid Majnemer // we are, __start is larger than it's largest child 49598b512602SDavid Majnemer return; 49608b512602SDavid Majnemer 49618b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49628b512602SDavid Majnemer do 49638b512602SDavid Majnemer { 49648b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49658b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49668b512602SDavid Majnemer __start = __child_i; 49678b512602SDavid Majnemer 49688b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49698b512602SDavid Majnemer break; 49708b512602SDavid Majnemer 49718b512602SDavid Majnemer // recompute the child based off of the updated parent 49728b512602SDavid Majnemer __child = 2 * __child + 1; 49738b512602SDavid Majnemer __child_i = __first + __child; 49748b512602SDavid Majnemer 49758b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49768b512602SDavid Majnemer // right-child exists and is greater than left-child 49778b512602SDavid Majnemer ++__child_i; 49788b512602SDavid Majnemer ++__child; 49798b512602SDavid Majnemer } 49808b512602SDavid Majnemer 49818b512602SDavid Majnemer // check if we are in heap-order 49828b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49838b512602SDavid Majnemer *__start = _VSTD::move(__top); 49848b512602SDavid Majnemer} 49858b512602SDavid Majnemer 49868b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49883e519524SHoward Hinnantvoid 49893e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49903e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49913e519524SHoward Hinnant{ 49923e519524SHoward Hinnant if (__len > 1) 49933e519524SHoward Hinnant { 49943e519524SHoward Hinnant swap(*__first, *--__last); 49958b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49963e519524SHoward Hinnant } 49973e519524SHoward Hinnant} 49983e519524SHoward Hinnant 49993e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50013e519524SHoward Hinnantvoid 50023e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50033e519524SHoward Hinnant{ 5004145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50053e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50063e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50073e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5008145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50103e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5011145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50123e519524SHoward Hinnant} 50133e519524SHoward Hinnant 50143e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50163e519524SHoward Hinnantvoid 50173e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50183e519524SHoward Hinnant{ 5019ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50203e519524SHoward Hinnant} 50213e519524SHoward Hinnant 50223e519524SHoward Hinnant// make_heap 50233e519524SHoward Hinnant 50243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50253e519524SHoward Hinnantvoid 50263e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50273e519524SHoward Hinnant{ 50283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50293e519524SHoward Hinnant difference_type __n = __last - __first; 50303e519524SHoward Hinnant if (__n > 1) 50313e519524SHoward Hinnant { 50328b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50338b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50348b512602SDavid Majnemer { 50358b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 50368b512602SDavid Majnemer } 50373e519524SHoward Hinnant } 50383e519524SHoward Hinnant} 50393e519524SHoward Hinnant 50403e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50423e519524SHoward Hinnantvoid 50433e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50443e519524SHoward Hinnant{ 5045145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50483e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5049145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50513e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5052145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50533e519524SHoward Hinnant} 50543e519524SHoward Hinnant 50553e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50573e519524SHoward Hinnantvoid 50583e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50593e519524SHoward Hinnant{ 5060ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50613e519524SHoward Hinnant} 50623e519524SHoward Hinnant 50633e519524SHoward Hinnant// sort_heap 50643e519524SHoward Hinnant 50653e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50663e519524SHoward Hinnantvoid 50673e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50683e519524SHoward Hinnant{ 50693e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50703e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50713e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50723e519524SHoward Hinnant} 50733e519524SHoward Hinnant 50743e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50763e519524SHoward Hinnantvoid 50773e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50783e519524SHoward Hinnant{ 5079145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50823e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5083145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50843e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50853e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5086145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50873e519524SHoward Hinnant} 50883e519524SHoward Hinnant 50893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50913e519524SHoward Hinnantvoid 50923e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50933e519524SHoward Hinnant{ 5094ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50953e519524SHoward Hinnant} 50963e519524SHoward Hinnant 50973e519524SHoward Hinnant// partial_sort 50983e519524SHoward Hinnant 50993e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51003e519524SHoward Hinnantvoid 51013e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51023e519524SHoward Hinnant _Compare __comp) 51033e519524SHoward Hinnant{ 51043e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51053e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51063e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51073e519524SHoward Hinnant { 51083e519524SHoward Hinnant if (__comp(*__i, *__first)) 51093e519524SHoward Hinnant { 51103e519524SHoward Hinnant swap(*__i, *__first); 51118b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51123e519524SHoward Hinnant } 51133e519524SHoward Hinnant } 51143e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51153e519524SHoward Hinnant} 51163e519524SHoward Hinnant 51173e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51193e519524SHoward Hinnantvoid 51203e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51213e519524SHoward Hinnant _Compare __comp) 51223e519524SHoward Hinnant{ 5123145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51263e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5127145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51293e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5130145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51313e519524SHoward Hinnant} 51323e519524SHoward Hinnant 51333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51353e519524SHoward Hinnantvoid 51363e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51373e519524SHoward Hinnant{ 5138ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 51393e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51403e519524SHoward Hinnant} 51413e519524SHoward Hinnant 51423e519524SHoward Hinnant// partial_sort_copy 51433e519524SHoward Hinnant 51443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 51453e519524SHoward Hinnant_RandomAccessIterator 51463e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51473e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51483e519524SHoward Hinnant{ 51493e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51503e519524SHoward Hinnant if (__r != __result_last) 51513e519524SHoward Hinnant { 5152910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51533e519524SHoward Hinnant *__r = *__first; 51543e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51558b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51563e519524SHoward Hinnant for (; __first != __last; ++__first) 51573e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51583e519524SHoward Hinnant { 51593e519524SHoward Hinnant *__result_first = *__first; 51608b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51613e519524SHoward Hinnant } 51623e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51633e519524SHoward Hinnant } 51643e519524SHoward Hinnant return __r; 51653e519524SHoward Hinnant} 51663e519524SHoward Hinnant 51673e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51693e519524SHoward Hinnant_RandomAccessIterator 51703e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51713e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51723e519524SHoward Hinnant{ 5173145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51763e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5177145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51793e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5180145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51813e519524SHoward Hinnant} 51823e519524SHoward Hinnant 51833e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51853e519524SHoward Hinnant_RandomAccessIterator 51863e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51873e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51883e519524SHoward Hinnant{ 5189ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51903e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51913e519524SHoward Hinnant} 51923e519524SHoward Hinnant 51933e519524SHoward Hinnant// nth_element 51943e519524SHoward Hinnant 51953e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51963e519524SHoward Hinnantvoid 51973e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51983e519524SHoward Hinnant{ 51993e519524SHoward Hinnant // _Compare is known to be a reference type 52003e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52013e519524SHoward Hinnant const difference_type __limit = 7; 52023e519524SHoward Hinnant while (true) 52033e519524SHoward Hinnant { 52043e519524SHoward Hinnant __restart: 5205b34b4819SHoward Hinnant if (__nth == __last) 5206b34b4819SHoward Hinnant return; 52073e519524SHoward Hinnant difference_type __len = __last - __first; 52083e519524SHoward Hinnant switch (__len) 52093e519524SHoward Hinnant { 52103e519524SHoward Hinnant case 0: 52113e519524SHoward Hinnant case 1: 52123e519524SHoward Hinnant return; 52133e519524SHoward Hinnant case 2: 52143e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52153e519524SHoward Hinnant swap(*__first, *__last); 52163e519524SHoward Hinnant return; 52173e519524SHoward Hinnant case 3: 52183e519524SHoward Hinnant { 52193e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5220ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52213e519524SHoward Hinnant return; 52223e519524SHoward Hinnant } 52233e519524SHoward Hinnant } 52243e519524SHoward Hinnant if (__len <= __limit) 52253e519524SHoward Hinnant { 52263e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 52273e519524SHoward Hinnant return; 52283e519524SHoward Hinnant } 52293e519524SHoward Hinnant // __len > __limit >= 3 52303e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 52313e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5232ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52333e519524SHoward Hinnant // *__m is median 52343e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 52353e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 52363e519524SHoward Hinnant _RandomAccessIterator __i = __first; 52373e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 52383e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52393e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 52403e519524SHoward Hinnant // Prime the downward search with a guard. 52413e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 52423e519524SHoward Hinnant { 52433e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 52443e519524SHoward Hinnant // manually guard downward moving __j against __i 52453e519524SHoward Hinnant while (true) 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant if (__i == --__j) 52483e519524SHoward Hinnant { 52493e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52503e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52513e519524SHoward Hinnant ++__i; // __first + 1 52523e519524SHoward Hinnant __j = __last; 52533e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52543e519524SHoward Hinnant { 52553e519524SHoward Hinnant while (true) 52563e519524SHoward Hinnant { 52573e519524SHoward Hinnant if (__i == __j) 52583e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52593e519524SHoward Hinnant if (__comp(*__first, *__i)) 52603e519524SHoward Hinnant { 52613e519524SHoward Hinnant swap(*__i, *__j); 52623e519524SHoward Hinnant ++__n_swaps; 52633e519524SHoward Hinnant ++__i; 52643e519524SHoward Hinnant break; 52653e519524SHoward Hinnant } 52663e519524SHoward Hinnant ++__i; 52673e519524SHoward Hinnant } 52683e519524SHoward Hinnant } 52693e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52703e519524SHoward Hinnant if (__i == __j) 52713e519524SHoward Hinnant return; 52723e519524SHoward Hinnant while (true) 52733e519524SHoward Hinnant { 52743e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52753e519524SHoward Hinnant ++__i; 52763e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52773e519524SHoward Hinnant ; 52783e519524SHoward Hinnant if (__i >= __j) 52793e519524SHoward Hinnant break; 52803e519524SHoward Hinnant swap(*__i, *__j); 52813e519524SHoward Hinnant ++__n_swaps; 52823e519524SHoward Hinnant ++__i; 52833e519524SHoward Hinnant } 52843e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52853e519524SHoward Hinnant // The first part is sorted, 52863e519524SHoward Hinnant if (__nth < __i) 52873e519524SHoward Hinnant return; 52883e519524SHoward Hinnant // __nth_element the secod part 52893e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52903e519524SHoward Hinnant __first = __i; 52913e519524SHoward Hinnant goto __restart; 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant if (__comp(*__j, *__m)) 52943e519524SHoward Hinnant { 52953e519524SHoward Hinnant swap(*__i, *__j); 52963e519524SHoward Hinnant ++__n_swaps; 52973e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52983e519524SHoward Hinnant } 52993e519524SHoward Hinnant } 53003e519524SHoward Hinnant } 53013e519524SHoward Hinnant ++__i; 53023e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53033e519524SHoward Hinnant // if not yet partitioned... 53043e519524SHoward Hinnant if (__i < __j) 53053e519524SHoward Hinnant { 53063e519524SHoward Hinnant // known that *(__i - 1) < *__m 53073e519524SHoward Hinnant while (true) 53083e519524SHoward Hinnant { 53093e519524SHoward Hinnant // __m still guards upward moving __i 53103e519524SHoward Hinnant while (__comp(*__i, *__m)) 53113e519524SHoward Hinnant ++__i; 53123e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53133e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53143e519524SHoward Hinnant ; 53153e519524SHoward Hinnant if (__i >= __j) 53163e519524SHoward Hinnant break; 53173e519524SHoward Hinnant swap(*__i, *__j); 53183e519524SHoward Hinnant ++__n_swaps; 53193e519524SHoward Hinnant // It is known that __m != __j 53203e519524SHoward Hinnant // If __m just moved, follow it 53213e519524SHoward Hinnant if (__m == __i) 53223e519524SHoward Hinnant __m = __j; 53233e519524SHoward Hinnant ++__i; 53243e519524SHoward Hinnant } 53253e519524SHoward Hinnant } 53263e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53273e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53283e519524SHoward Hinnant { 53293e519524SHoward Hinnant swap(*__i, *__m); 53303e519524SHoward Hinnant ++__n_swaps; 53313e519524SHoward Hinnant } 53323e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53333e519524SHoward Hinnant if (__nth == __i) 53343e519524SHoward Hinnant return; 53353e519524SHoward Hinnant if (__n_swaps == 0) 53363e519524SHoward Hinnant { 53373e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53383e519524SHoward Hinnant if (__nth < __i) 53393e519524SHoward Hinnant { 53403e519524SHoward Hinnant // Check for [__first, __i) already sorted 53413e519524SHoward Hinnant __j = __m = __first; 53423e519524SHoward Hinnant while (++__j != __i) 53433e519524SHoward Hinnant { 53443e519524SHoward Hinnant if (__comp(*__j, *__m)) 53453e519524SHoward Hinnant // not yet sorted, so sort 53463e519524SHoward Hinnant goto not_sorted; 53473e519524SHoward Hinnant __m = __j; 53483e519524SHoward Hinnant } 53493e519524SHoward Hinnant // [__first, __i) sorted 53503e519524SHoward Hinnant return; 53513e519524SHoward Hinnant } 53523e519524SHoward Hinnant else 53533e519524SHoward Hinnant { 53543e519524SHoward Hinnant // Check for [__i, __last) already sorted 53553e519524SHoward Hinnant __j = __m = __i; 53563e519524SHoward Hinnant while (++__j != __last) 53573e519524SHoward Hinnant { 53583e519524SHoward Hinnant if (__comp(*__j, *__m)) 53593e519524SHoward Hinnant // not yet sorted, so sort 53603e519524SHoward Hinnant goto not_sorted; 53613e519524SHoward Hinnant __m = __j; 53623e519524SHoward Hinnant } 53633e519524SHoward Hinnant // [__i, __last) sorted 53643e519524SHoward Hinnant return; 53653e519524SHoward Hinnant } 53663e519524SHoward Hinnant } 53673e519524SHoward Hinnantnot_sorted: 53683e519524SHoward Hinnant // __nth_element on range containing __nth 53693e519524SHoward Hinnant if (__nth < __i) 53703e519524SHoward Hinnant { 53713e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53723e519524SHoward Hinnant __last = __i; 53733e519524SHoward Hinnant } 53743e519524SHoward Hinnant else 53753e519524SHoward Hinnant { 53763e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53773e519524SHoward Hinnant __first = ++__i; 53783e519524SHoward Hinnant } 53793e519524SHoward Hinnant } 53803e519524SHoward Hinnant} 53813e519524SHoward Hinnant 53823e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53843e519524SHoward Hinnantvoid 53853e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53863e519524SHoward Hinnant{ 5387145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53903e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5391145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53933e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5394145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53953e519524SHoward Hinnant} 53963e519524SHoward Hinnant 53973e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53993e519524SHoward Hinnantvoid 54003e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54013e519524SHoward Hinnant{ 5402ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54033e519524SHoward Hinnant} 54043e519524SHoward Hinnant 54053e519524SHoward Hinnant// includes 54063e519524SHoward Hinnant 54073e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54088da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 54093e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54103e519524SHoward Hinnant _Compare __comp) 54113e519524SHoward Hinnant{ 54123e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54133e519524SHoward Hinnant { 54143e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54153e519524SHoward Hinnant return false; 54163e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54173e519524SHoward Hinnant ++__first2; 54183e519524SHoward Hinnant } 54193e519524SHoward Hinnant return true; 54203e519524SHoward Hinnant} 54213e519524SHoward Hinnant 54223e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 54238da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54243e519524SHoward Hinnantbool 54253e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54263e519524SHoward Hinnant _Compare __comp) 54273e519524SHoward Hinnant{ 5428145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54293e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54303e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54313e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5432145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54333e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54343e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5435145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54363e519524SHoward Hinnant} 54373e519524SHoward Hinnant 54383e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 54398da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 54403e519524SHoward Hinnantbool 54413e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 54423e519524SHoward Hinnant{ 5443ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 54443e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54453e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54463e519524SHoward Hinnant} 54473e519524SHoward Hinnant 54483e519524SHoward Hinnant// set_union 54493e519524SHoward Hinnant 54503e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54513e519524SHoward Hinnant_OutputIterator 54523e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54543e519524SHoward Hinnant{ 54553e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54563e519524SHoward Hinnant { 54573e519524SHoward Hinnant if (__first2 == __last2) 5458ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54603e519524SHoward Hinnant { 54613e519524SHoward Hinnant *__result = *__first2; 54623e519524SHoward Hinnant ++__first2; 54633e519524SHoward Hinnant } 54643e519524SHoward Hinnant else 54653e519524SHoward Hinnant { 54663e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54673e519524SHoward Hinnant ++__first2; 546805da5b02SMarshall Clow *__result = *__first1; 54693e519524SHoward Hinnant ++__first1; 54703e519524SHoward Hinnant } 54713e519524SHoward Hinnant } 5472ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54733e519524SHoward Hinnant} 54743e519524SHoward Hinnant 54753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54773e519524SHoward Hinnant_OutputIterator 54783e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54803e519524SHoward Hinnant{ 5481145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54843e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5485145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54863e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54873e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5488145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54893e519524SHoward Hinnant} 54903e519524SHoward Hinnant 54913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54933e519524SHoward Hinnant_OutputIterator 54943e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54963e519524SHoward Hinnant{ 5497ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54983e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54993e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55003e519524SHoward Hinnant} 55013e519524SHoward Hinnant 55023e519524SHoward Hinnant// set_intersection 55033e519524SHoward Hinnant 55043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55058da1a487SMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator 55063e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55083e519524SHoward Hinnant{ 55093e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55103e519524SHoward Hinnant { 55113e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55123e519524SHoward Hinnant ++__first1; 55133e519524SHoward Hinnant else 55143e519524SHoward Hinnant { 55153e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55163e519524SHoward Hinnant { 55173e519524SHoward Hinnant *__result = *__first1; 55183e519524SHoward Hinnant ++__result; 55193e519524SHoward Hinnant ++__first1; 55203e519524SHoward Hinnant } 55213e519524SHoward Hinnant ++__first2; 55223e519524SHoward Hinnant } 55233e519524SHoward Hinnant } 55243e519524SHoward Hinnant return __result; 55253e519524SHoward Hinnant} 55263e519524SHoward Hinnant 55273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55288da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55293e519524SHoward Hinnant_OutputIterator 55303e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55323e519524SHoward Hinnant{ 5533145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55363e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5537145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55393e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5540145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55413e519524SHoward Hinnant} 55423e519524SHoward Hinnant 55433e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55448da1a487SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 55453e519524SHoward Hinnant_OutputIterator 55463e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55483e519524SHoward Hinnant{ 5549ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55503e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55513e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55523e519524SHoward Hinnant} 55533e519524SHoward Hinnant 55543e519524SHoward Hinnant// set_difference 55553e519524SHoward Hinnant 55563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55573e519524SHoward Hinnant_OutputIterator 55583e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55603e519524SHoward Hinnant{ 55613e519524SHoward Hinnant while (__first1 != __last1) 55623e519524SHoward Hinnant { 55633e519524SHoward Hinnant if (__first2 == __last2) 5564ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55653e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55663e519524SHoward Hinnant { 55673e519524SHoward Hinnant *__result = *__first1; 55683e519524SHoward Hinnant ++__result; 55693e519524SHoward Hinnant ++__first1; 55703e519524SHoward Hinnant } 55713e519524SHoward Hinnant else 55723e519524SHoward Hinnant { 55733e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55743e519524SHoward Hinnant ++__first1; 55753e519524SHoward Hinnant ++__first2; 55763e519524SHoward Hinnant } 55773e519524SHoward Hinnant } 55783e519524SHoward Hinnant return __result; 55793e519524SHoward Hinnant} 55803e519524SHoward Hinnant 55813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55833e519524SHoward Hinnant_OutputIterator 55843e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55863e519524SHoward Hinnant{ 5587145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55903e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5591145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55933e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5594145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55953e519524SHoward Hinnant} 55963e519524SHoward Hinnant 55973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55993e519524SHoward Hinnant_OutputIterator 56003e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56023e519524SHoward Hinnant{ 5603ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56043e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56053e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56063e519524SHoward Hinnant} 56073e519524SHoward Hinnant 56083e519524SHoward Hinnant// set_symmetric_difference 56093e519524SHoward Hinnant 56103e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56113e519524SHoward Hinnant_OutputIterator 56123e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56143e519524SHoward Hinnant{ 56153e519524SHoward Hinnant while (__first1 != __last1) 56163e519524SHoward Hinnant { 56173e519524SHoward Hinnant if (__first2 == __last2) 5618ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56193e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56203e519524SHoward Hinnant { 56213e519524SHoward Hinnant *__result = *__first1; 56223e519524SHoward Hinnant ++__result; 56233e519524SHoward Hinnant ++__first1; 56243e519524SHoward Hinnant } 56253e519524SHoward Hinnant else 56263e519524SHoward Hinnant { 56273e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56283e519524SHoward Hinnant { 56293e519524SHoward Hinnant *__result = *__first2; 56303e519524SHoward Hinnant ++__result; 56313e519524SHoward Hinnant } 56323e519524SHoward Hinnant else 56333e519524SHoward Hinnant ++__first1; 56343e519524SHoward Hinnant ++__first2; 56353e519524SHoward Hinnant } 56363e519524SHoward Hinnant } 5637ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56423e519524SHoward Hinnant_OutputIterator 56433e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56453e519524SHoward Hinnant{ 5646145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56493e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5650145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56523e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5653145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56543e519524SHoward Hinnant} 56553e519524SHoward Hinnant 56563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56583e519524SHoward Hinnant_OutputIterator 56593e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56613e519524SHoward Hinnant{ 5662ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56633e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56643e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56653e519524SHoward Hinnant} 56663e519524SHoward Hinnant 56673e519524SHoward Hinnant// lexicographical_compare 56683e519524SHoward Hinnant 56693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56701b9a4ffdSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 56713e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56733e519524SHoward Hinnant{ 5674910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56753e519524SHoward Hinnant { 56763e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56773e519524SHoward Hinnant return true; 56783e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56793e519524SHoward Hinnant return false; 56803e519524SHoward Hinnant } 56813e519524SHoward Hinnant return false; 56823e519524SHoward Hinnant} 56833e519524SHoward Hinnant 56843e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56851b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 56863e519524SHoward Hinnantbool 56873e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56893e519524SHoward Hinnant{ 5690145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56933e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5694145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56963e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5697145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56983e519524SHoward Hinnant} 56993e519524SHoward Hinnant 57003e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57011b9a4ffdSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 57023e519524SHoward Hinnantbool 57033e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57053e519524SHoward Hinnant{ 5706ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57073e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57083e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57093e519524SHoward Hinnant} 57103e519524SHoward Hinnant 57113e519524SHoward Hinnant// next_permutation 57123e519524SHoward Hinnant 57133e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57143e519524SHoward Hinnantbool 57153e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57163e519524SHoward Hinnant{ 57173e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57183e519524SHoward Hinnant if (__first == __last || __first == --__i) 57193e519524SHoward Hinnant return false; 57203e519524SHoward Hinnant while (true) 57213e519524SHoward Hinnant { 57223e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57233e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57243e519524SHoward Hinnant { 57253e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57263e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57273e519524SHoward Hinnant ; 57283e519524SHoward Hinnant swap(*__i, *__j); 5729ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57303e519524SHoward Hinnant return true; 57313e519524SHoward Hinnant } 57323e519524SHoward Hinnant if (__i == __first) 57333e519524SHoward Hinnant { 5734ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57353e519524SHoward Hinnant return false; 57363e519524SHoward Hinnant } 57373e519524SHoward Hinnant } 57383e519524SHoward Hinnant} 57393e519524SHoward Hinnant 57403e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57423e519524SHoward Hinnantbool 57433e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57443e519524SHoward Hinnant{ 5745145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57483e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5749145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57513e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5752145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57533e519524SHoward Hinnant} 57543e519524SHoward Hinnant 57553e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57573e519524SHoward Hinnantbool 57583e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57593e519524SHoward Hinnant{ 5760ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57613e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57623e519524SHoward Hinnant} 57633e519524SHoward Hinnant 57643e519524SHoward Hinnant// prev_permutation 57653e519524SHoward Hinnant 57663e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57673e519524SHoward Hinnantbool 57683e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57693e519524SHoward Hinnant{ 57703e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57713e519524SHoward Hinnant if (__first == __last || __first == --__i) 57723e519524SHoward Hinnant return false; 57733e519524SHoward Hinnant while (true) 57743e519524SHoward Hinnant { 57753e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57763e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57773e519524SHoward Hinnant { 57783e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57793e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57803e519524SHoward Hinnant ; 57813e519524SHoward Hinnant swap(*__i, *__j); 5782ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57833e519524SHoward Hinnant return true; 57843e519524SHoward Hinnant } 57853e519524SHoward Hinnant if (__i == __first) 57863e519524SHoward Hinnant { 5787ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57883e519524SHoward Hinnant return false; 57893e519524SHoward Hinnant } 57903e519524SHoward Hinnant } 57913e519524SHoward Hinnant} 57923e519524SHoward Hinnant 57933e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57953e519524SHoward Hinnantbool 57963e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57973e519524SHoward Hinnant{ 5798145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58013e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5802145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58043e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5805145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58063e519524SHoward Hinnant} 58073e519524SHoward Hinnant 58083e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58103e519524SHoward Hinnantbool 58113e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58123e519524SHoward Hinnant{ 5813ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58143e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58153e519524SHoward Hinnant} 58163e519524SHoward Hinnant 58173e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58183e519524SHoward Hinnant 5819a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5820a016efb1SEric Fiselier 58213e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5822