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> 23*706ffef7SMarshall 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> 27*706ffef7SMarshall 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> 31*706ffef7SMarshall 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> 353e519524SHoward Hinnant Function 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 38d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 39d5c65ffaSMarshall Clow InputIterator for_each_n(InputIterator first, Size n, Function f); // C++17 40d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 4249c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 433e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 443e519524SHoward Hinnant 453e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 4649c7643cSMarshall Clow constexpr InputIterator // constexpr in C++20 473e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 483e519524SHoward Hinnant 493e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 503e519524SHoward Hinnant InputIterator 513e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 523e519524SHoward Hinnant 533e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 543e519524SHoward Hinnant ForwardIterator1 553e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 563e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 573e519524SHoward Hinnant 583e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 593e519524SHoward Hinnant ForwardIterator1 603e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 613e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 623e519524SHoward Hinnant 633e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 643e519524SHoward Hinnant ForwardIterator1 653e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 663e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 673e519524SHoward Hinnant 683e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 693e519524SHoward Hinnant ForwardIterator1 703e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 713e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 723e519524SHoward Hinnant 733e519524SHoward Hinnanttemplate <class ForwardIterator> 743e519524SHoward Hinnant ForwardIterator 753e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 763e519524SHoward Hinnant 773e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 783e519524SHoward Hinnant ForwardIterator 793e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 803e519524SHoward Hinnant 813e519524SHoward Hinnanttemplate <class InputIterator, class T> 823e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 833e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 843e519524SHoward Hinnant 853e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 863e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 873e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 883e519524SHoward Hinnant 893e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 903e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 913e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 923e519524SHoward Hinnant 930b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 940b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 950b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 960b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 970b0bbd2fSMarshall Clow 983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 993e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 1003e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 1013e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1023e519524SHoward Hinnant 1030b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1040b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1050b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1060b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1070b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1080b0bbd2fSMarshall Clow 1093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1103e519524SHoward Hinnant bool 1113e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1123e519524SHoward Hinnant 1130b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1140b0bbd2fSMarshall Clow bool 1150b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1160b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1170b0bbd2fSMarshall Clow 1183e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1193e519524SHoward Hinnant bool 1203e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1213e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1223e519524SHoward Hinnant 1230b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1240b0bbd2fSMarshall Clow bool 1250b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1260b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1270b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1280b0bbd2fSMarshall Clow 1293e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 13049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1313e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1323e519524SHoward Hinnant ForwardIterator2 first2); 1333e519524SHoward Hinnant 1340b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 13549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1360b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1370b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1380b0bbd2fSMarshall Clow 1393e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14049c7643cSMarshall Clow constexpr bool // constexpr in C++20 1413e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1423e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1433e519524SHoward Hinnant 1440b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 14549c7643cSMarshall Clow constexpr bool // constexpr in C++20 1460b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1470b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1480b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1490b0bbd2fSMarshall Clow 1503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1513e519524SHoward Hinnant ForwardIterator1 1523e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1543e519524SHoward Hinnant 1553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1563e519524SHoward Hinnant ForwardIterator1 1573e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1593e519524SHoward Hinnant 1603e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1613e519524SHoward Hinnant ForwardIterator 1623e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1633e519524SHoward Hinnant 1643e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1653e519524SHoward Hinnant ForwardIterator 1663e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1673e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1683e519524SHoward Hinnant 1693e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1703e519524SHoward Hinnant OutputIterator 1713e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1723e519524SHoward Hinnant 1733e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1743e519524SHoward Hinnant OutputIterator 1753e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1763e519524SHoward Hinnant OutputIterator result, Predicate pred); 1773e519524SHoward Hinnant 1783e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1793e519524SHoward Hinnant OutputIterator 1803e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1813e519524SHoward Hinnant 1823e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1833e519524SHoward Hinnant BidirectionalIterator2 1843e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1853e519524SHoward Hinnant BidirectionalIterator2 result); 1863e519524SHoward Hinnant 1873e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1883e519524SHoward Hinnant ForwardIterator2 1893e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1903e519524SHoward Hinnant 1913e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1923e519524SHoward Hinnant void 1933e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1943e519524SHoward Hinnant 1953e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1963e519524SHoward Hinnant OutputIterator 1973e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1983e519524SHoward Hinnant 1993e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 2003e519524SHoward Hinnant OutputIterator 2013e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 2023e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2033e519524SHoward Hinnant 2043e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2053e519524SHoward Hinnant void 2063e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2073e519524SHoward Hinnant 2083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2093e519524SHoward Hinnant void 2103e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2113e519524SHoward Hinnant 2123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2133e519524SHoward Hinnant OutputIterator 2143e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2153e519524SHoward Hinnant const T& old_value, const T& new_value); 2163e519524SHoward Hinnant 2173e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2183e519524SHoward Hinnant OutputIterator 2193e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2203e519524SHoward Hinnant 2213e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2223e519524SHoward Hinnant void 2233e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2243e519524SHoward Hinnant 2253e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2263e519524SHoward Hinnant OutputIterator 2273e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2283e519524SHoward Hinnant 2293e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2303e519524SHoward Hinnant void 2313e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2323e519524SHoward Hinnant 2333e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2343e519524SHoward Hinnant OutputIterator 2353e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2363e519524SHoward Hinnant 2373e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2383e519524SHoward Hinnant ForwardIterator 2393e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2403e519524SHoward Hinnant 2413e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2423e519524SHoward Hinnant ForwardIterator 2433e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2443e519524SHoward Hinnant 2453e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2463e519524SHoward Hinnant OutputIterator 2473e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2483e519524SHoward Hinnant 2493e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2503e519524SHoward Hinnant OutputIterator 2513e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2523e519524SHoward Hinnant 2533e519524SHoward Hinnanttemplate <class ForwardIterator> 2543e519524SHoward Hinnant ForwardIterator 2553e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2563e519524SHoward Hinnant 2573e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2583e519524SHoward Hinnant ForwardIterator 2593e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2603e519524SHoward Hinnant 2613e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2623e519524SHoward Hinnant OutputIterator 2633e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2643e519524SHoward Hinnant 2653e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2663e519524SHoward Hinnant OutputIterator 2673e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2683e519524SHoward Hinnant 2693e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2703e519524SHoward Hinnant void 2713e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2723e519524SHoward Hinnant 2733e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2743e519524SHoward Hinnant OutputIterator 2753e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2763e519524SHoward Hinnant 2773e519524SHoward Hinnanttemplate <class ForwardIterator> 2783e519524SHoward Hinnant ForwardIterator 2793e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2803e519524SHoward Hinnant 2813e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2823e519524SHoward Hinnant OutputIterator 2833e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2843e519524SHoward Hinnant 2853e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2863e519524SHoward Hinnant void 2870f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2883e519524SHoward Hinnant 2893e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2903e519524SHoward Hinnant void 29106965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2920f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 2933e519524SHoward Hinnant 294e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 295e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 296e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 297e7154709SEric Fiselier SampleIterator out, Distance n, 298e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 299e7154709SEric Fiselier 300f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 301f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 302fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 303f9d540b0SHoward Hinnant 3043e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 30549c7643cSMarshall Clow constexpr bool // constexpr in C++20 3063e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3073e519524SHoward Hinnant 3083e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3093e519524SHoward Hinnant ForwardIterator 3103e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3113e519524SHoward Hinnant 3123e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3133e519524SHoward Hinnant class OutputIterator2, class Predicate> 3143e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3153e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3163e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3173e519524SHoward Hinnant Predicate pred); 3183e519524SHoward Hinnant 3193e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3203e519524SHoward Hinnant ForwardIterator 3213e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3223e519524SHoward Hinnant 3233e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3243e519524SHoward Hinnant ForwardIterator 3253e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3263e519524SHoward Hinnant 3273e519524SHoward Hinnanttemplate <class ForwardIterator> 32849c7643cSMarshall Clow constexpr bool // constexpr in C++20 3293e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3303e519524SHoward Hinnant 3313e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3323e519524SHoward Hinnant bool 3333e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3343e519524SHoward Hinnant 3353e519524SHoward Hinnanttemplate<class ForwardIterator> 3363e519524SHoward Hinnant ForwardIterator 3373e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3383e519524SHoward Hinnant 3393e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3403e519524SHoward Hinnant ForwardIterator 3413e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3423e519524SHoward Hinnant 3433e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3443e519524SHoward Hinnant void 3453e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3463e519524SHoward Hinnant 3473e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3483e519524SHoward Hinnant void 3493e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3503e519524SHoward Hinnant 3513e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3523e519524SHoward Hinnant void 3533e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3543e519524SHoward Hinnant 3553e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3563e519524SHoward Hinnant void 3573e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3583e519524SHoward Hinnant 3593e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3603e519524SHoward Hinnant void 3613e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant void 3653e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3663e519524SHoward Hinnant 3673e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3683e519524SHoward Hinnant RandomAccessIterator 3693e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3703e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant RandomAccessIterator 3743e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3753e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3763e519524SHoward Hinnant 3773e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3783e519524SHoward Hinnant void 3793e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3803e519524SHoward Hinnant 3813e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3823e519524SHoward Hinnant void 3833e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3843e519524SHoward Hinnant 3853e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3863e519524SHoward Hinnant ForwardIterator 3873e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3883e519524SHoward Hinnant 3893e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3903e519524SHoward Hinnant ForwardIterator 3913e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3923e519524SHoward Hinnant 3933e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3943e519524SHoward Hinnant ForwardIterator 3953e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3963e519524SHoward Hinnant 3973e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3983e519524SHoward Hinnant ForwardIterator 3993e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4003e519524SHoward Hinnant 4013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4023e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 4033e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4043e519524SHoward Hinnant 4053e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4063e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 4073e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4083e519524SHoward Hinnant 4093e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4103e519524SHoward Hinnant bool 4113e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4143e519524SHoward Hinnant bool 4153e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4163e519524SHoward Hinnant 4173e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4183e519524SHoward Hinnant OutputIterator 4193e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4203e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4233e519524SHoward Hinnant OutputIterator 4243e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4253e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4263e519524SHoward Hinnant 4273e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4283e519524SHoward Hinnant void 4293e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4303e519524SHoward Hinnant 4313e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4323e519524SHoward Hinnant void 4333e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4343e519524SHoward Hinnant 4353e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4363e519524SHoward Hinnant bool 4373e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4403e519524SHoward Hinnant bool 4413e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4423e519524SHoward Hinnant 4433e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4443e519524SHoward Hinnant OutputIterator 4453e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4463e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4473e519524SHoward Hinnant 4483e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4493e519524SHoward Hinnant OutputIterator 4503e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4513e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4523e519524SHoward Hinnant 4533e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4543e519524SHoward Hinnant OutputIterator 4553e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4563e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4573e519524SHoward Hinnant 4583e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4593e519524SHoward Hinnant OutputIterator 4603e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4613e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4623e519524SHoward Hinnant 4633e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4643e519524SHoward Hinnant OutputIterator 4653e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4663e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4673e519524SHoward Hinnant 4683e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4693e519524SHoward Hinnant OutputIterator 4703e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4713e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4723e519524SHoward Hinnant 4733e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4743e519524SHoward Hinnant OutputIterator 4753e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4763e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4793e519524SHoward Hinnant OutputIterator 4803e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4813e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4823e519524SHoward Hinnant 4833e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4843e519524SHoward Hinnant void 4853e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4863e519524SHoward Hinnant 4873e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4883e519524SHoward Hinnant void 4893e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4903e519524SHoward Hinnant 4913e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4923e519524SHoward Hinnant void 4933e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4943e519524SHoward Hinnant 4953e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4963e519524SHoward Hinnant void 4973e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4983e519524SHoward Hinnant 4993e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5003e519524SHoward Hinnant void 5013e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 5023e519524SHoward Hinnant 5033e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5043e519524SHoward Hinnant void 5053e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5063e519524SHoward Hinnant 5073e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5083e519524SHoward Hinnant void 5093e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5103e519524SHoward Hinnant 5113e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5123e519524SHoward Hinnant void 5133e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5143e519524SHoward Hinnant 5153e519524SHoward Hinnanttemplate <class RandomAccessIterator> 51649c7643cSMarshall Clow constexpr bool // constexpr in C++20 5173e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5183e519524SHoward Hinnant 5193e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52049c7643cSMarshall Clow constexpr bool // constexpr in C++20 5213e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5223e519524SHoward Hinnant 5233e519524SHoward Hinnanttemplate <class RandomAccessIterator> 52449c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5253e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5263e519524SHoward Hinnant 5273e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 52849c7643cSMarshall Clow constexpr RandomAccessIterator // constexpr in C++20 5293e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5303e519524SHoward Hinnant 5314eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5324eb27b79SHoward Hinnant ForwardIterator 5330b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5344eb27b79SHoward Hinnant 5354eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5364eb27b79SHoward Hinnant ForwardIterator 5370b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5384eb27b79SHoward Hinnant 5393e519524SHoward Hinnanttemplate <class T> 5403e519524SHoward Hinnant const T& 5419d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5423e519524SHoward Hinnant 5433e519524SHoward Hinnanttemplate <class T, class Compare> 5443e519524SHoward Hinnant const T& 5459d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5463e519524SHoward Hinnant 5473e519524SHoward Hinnanttemplate<class T> 5484eb27b79SHoward Hinnant T 5499d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5503e519524SHoward Hinnant 5513e519524SHoward Hinnanttemplate<class T, class Compare> 5524eb27b79SHoward Hinnant T 5539d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5543e519524SHoward Hinnant 555146c14acSMarshall Clowtemplate<class T> 556146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 557146c14acSMarshall Clow 558146c14acSMarshall Clowtemplate<class T, class Compare> 559146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 560146c14acSMarshall Clow 5613e519524SHoward Hinnanttemplate <class ForwardIterator> 5623e519524SHoward Hinnant ForwardIterator 5630b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5643e519524SHoward Hinnant 5653e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5663e519524SHoward Hinnant ForwardIterator 5670b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5683e519524SHoward Hinnant 5694eb27b79SHoward Hinnanttemplate <class T> 5704eb27b79SHoward Hinnant const T& 5719d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5724eb27b79SHoward Hinnant 5734eb27b79SHoward Hinnanttemplate <class T, class Compare> 5744eb27b79SHoward Hinnant const T& 5759d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5764eb27b79SHoward Hinnant 5774eb27b79SHoward Hinnanttemplate<class T> 5784eb27b79SHoward Hinnant T 5799d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5804eb27b79SHoward Hinnant 5814eb27b79SHoward Hinnanttemplate<class T, class Compare> 5824eb27b79SHoward Hinnant T 5839d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5844eb27b79SHoward Hinnant 5854eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5864eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5870b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5884eb27b79SHoward Hinnant 5894eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5904eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5910b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5924eb27b79SHoward Hinnant 5934eb27b79SHoward Hinnanttemplate<class T> 5944eb27b79SHoward Hinnant pair<const T&, const T&> 5959d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5964eb27b79SHoward Hinnant 5974eb27b79SHoward Hinnanttemplate<class T, class Compare> 5984eb27b79SHoward Hinnant pair<const T&, const T&> 5999d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 6004eb27b79SHoward Hinnant 6014eb27b79SHoward Hinnanttemplate<class T> 6024eb27b79SHoward Hinnant pair<T, T> 6039d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 6044eb27b79SHoward Hinnant 6054eb27b79SHoward Hinnanttemplate<class T, class Compare> 6064eb27b79SHoward Hinnant pair<T, T> 6079d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 6084eb27b79SHoward Hinnant 6093e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6103e519524SHoward Hinnant bool 6113e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6143e519524SHoward Hinnant bool 6153e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6173e519524SHoward Hinnant 6183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6193e519524SHoward Hinnant bool 6203e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6213e519524SHoward Hinnant 6223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6233e519524SHoward Hinnant bool 6243e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6253e519524SHoward Hinnant 6263e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6273e519524SHoward Hinnant bool 6283e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6293e519524SHoward Hinnant 6303e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6313e519524SHoward Hinnant bool 6323e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6333e519524SHoward Hinnant 6343e519524SHoward Hinnant} // std 6353e519524SHoward Hinnant 6363e519524SHoward Hinnant*/ 6373e519524SHoward Hinnant 6383e519524SHoward Hinnant#include <__config> 6393e519524SHoward Hinnant#include <initializer_list> 6403e519524SHoward Hinnant#include <type_traits> 6413e519524SHoward Hinnant#include <cstring> 642f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6433e519524SHoward Hinnant#include <memory> 644d835e592SMarshall Clow#include <functional> 6453e519524SHoward Hinnant#include <iterator> 646a1d07d57SHoward Hinnant#include <cstddef> 6473e519524SHoward Hinnant 6485d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6495d1a701dSHoward Hinnant#include "support/ibm/support.h" 6505d1a701dSHoward Hinnant#endif 6515d50aa32SEric Fiselier#if defined(_LIBCPP_COMPILER_MSVC) 65280f8cfb3SEric Fiselier#include <intrin.h> 6535f878d4bSHoward Hinnant#endif 6545d1a701dSHoward Hinnant 655c1bd9197SEric Fiselier#include <__debug> 656c1bd9197SEric Fiselier 657073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6583e519524SHoward Hinnant#pragma GCC system_header 659073458b1SHoward Hinnant#endif 6603e519524SHoward Hinnant 661a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 662a016efb1SEric Fiselier#include <__undef_macros> 663a016efb1SEric Fiselier 664a016efb1SEric Fiselier 6653e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6663e519524SHoward Hinnant 6679d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6689d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6699d67c6d5SMarshall Clow// * We haven't included <functional> here. 6703e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6713e519524SHoward Hinnantstruct __equal_to 6723e519524SHoward Hinnant{ 6733e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6743e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6753e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6763e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6773e519524SHoward Hinnant}; 6783e519524SHoward Hinnant 6793e519524SHoward Hinnanttemplate <class _T1> 6803e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6813e519524SHoward Hinnant{ 6829d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6839d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6843e519524SHoward Hinnant}; 6853e519524SHoward Hinnant 6863e519524SHoward Hinnanttemplate <class _T1> 6873e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6883e519524SHoward Hinnant{ 6899d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6909d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6913e519524SHoward Hinnant}; 6923e519524SHoward Hinnant 6933e519524SHoward Hinnanttemplate <class _T1> 6943e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6953e519524SHoward Hinnant{ 6969d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6979d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6983e519524SHoward Hinnant}; 6993e519524SHoward Hinnant 7003e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 7013e519524SHoward Hinnantstruct __less 7023e519524SHoward Hinnant{ 7039d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7049d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7059d67c6d5SMarshall Clow 7069d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7079d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7089d67c6d5SMarshall Clow 7099d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7109d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7119d67c6d5SMarshall Clow 7129d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7139d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7143e519524SHoward Hinnant}; 7153e519524SHoward Hinnant 7163e519524SHoward Hinnanttemplate <class _T1> 7173e519524SHoward Hinnantstruct __less<_T1, _T1> 7183e519524SHoward Hinnant{ 7199d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7209d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7213e519524SHoward Hinnant}; 7223e519524SHoward Hinnant 7233e519524SHoward Hinnanttemplate <class _T1> 7243e519524SHoward Hinnantstruct __less<const _T1, _T1> 7253e519524SHoward Hinnant{ 7269d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7279d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7283e519524SHoward Hinnant}; 7293e519524SHoward Hinnant 7303e519524SHoward Hinnanttemplate <class _T1> 7313e519524SHoward Hinnantstruct __less<_T1, const _T1> 7323e519524SHoward Hinnant{ 7339d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7349d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7353e519524SHoward Hinnant}; 7363e519524SHoward Hinnant 7373e519524SHoward Hinnanttemplate <class _Predicate> 738a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7393e519524SHoward Hinnant{ 7403e519524SHoward Hinnantprivate: 7413e519524SHoward Hinnant _Predicate __p_; 7423e519524SHoward Hinnantpublic: 743a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7443e519524SHoward Hinnant 7453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 746a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7473e519524SHoward Hinnant 7483e519524SHoward Hinnant template <class _T1> 7493e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7503e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7513e519524SHoward Hinnant 7523e519524SHoward Hinnant template <class _T1, class _T2> 7533e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 754a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7553e519524SHoward Hinnant}; 7563e519524SHoward Hinnant 757145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7583e519524SHoward Hinnant 7593e519524SHoward Hinnanttemplate <class _Compare> 7603e519524SHoward Hinnantstruct __debug_less 7613e519524SHoward Hinnant{ 7623e519524SHoward Hinnant _Compare __comp_; 7633e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 764331d2159SEric Fiselier 7653e519524SHoward Hinnant template <class _Tp, class _Up> 7663e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7673e519524SHoward Hinnant { 7683e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7693e519524SHoward Hinnant if (__r) 770331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7713e519524SHoward Hinnant return __r; 7723e519524SHoward Hinnant } 773331d2159SEric Fiselier 774331d2159SEric Fiselier template <class _LHS, class _RHS> 775331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 776331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 777331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 778331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 779331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 780331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 781331d2159SEric Fiselier } 782331d2159SEric Fiselier 783331d2159SEric Fiselier template <class _LHS, class _RHS> 784331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 785331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7863e519524SHoward Hinnant}; 7873e519524SHoward Hinnant 788145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7893e519524SHoward Hinnant 790c8edcb36SHoward Hinnant// Precondition: __x != 0 791c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 79280f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 79380f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 794c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 79580f8cfb3SEric Fiselier#else 79680f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 79780f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 79880f8cfb3SEric Fiselier unsigned long where; 79980f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 80080f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8019a0a0045SShoaib Meenai if (_BitScanForward(&where, __x)) 80280f8cfb3SEric Fiselier return where; 80380f8cfb3SEric Fiselier return 32; 80480f8cfb3SEric Fiselier#endif 805c206366fSHoward Hinnant} 806c206366fSHoward Hinnant 807c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 80880f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 80980f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 810c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 81180f8cfb3SEric Fiselier#else 81280f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 81380f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 81480f8cfb3SEric Fiselier#endif 815c206366fSHoward Hinnant} 816c206366fSHoward Hinnant 817c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 81880f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 81980f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 820c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 82180f8cfb3SEric Fiselier#else 82280f8cfb3SEric Fiselier unsigned long where; 82380f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 82480f8cfb3SEric Fiselier// Returns zero if no set bit is found. 82580f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 82680f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 8279a0a0045SShoaib Meenai if (_BitScanForward64(&where, __x)) 82880f8cfb3SEric Fiselier return static_cast<int>(where); 82980f8cfb3SEric Fiselier#else 83080f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 83180f8cfb3SEric Fiselier // Scan the Low Word. 8329a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x))) 83380f8cfb3SEric Fiselier return where; 83480f8cfb3SEric Fiselier // Scan the High Word. 8359a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x >> 32))) 83680f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 83780f8cfb3SEric Fiselier#endif 83880f8cfb3SEric Fiselier return 64; 83980f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 840c206366fSHoward Hinnant} 841c8edcb36SHoward Hinnant 842c8edcb36SHoward Hinnant// Precondition: __x != 0 843c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 84480f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 84580f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 846c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 84780f8cfb3SEric Fiselier#else 84880f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 84980f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 85080f8cfb3SEric Fiselier unsigned long where; 85180f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 85280f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8539a0a0045SShoaib Meenai if (_BitScanReverse(&where, __x)) 85480f8cfb3SEric Fiselier return 31 - where; 85580f8cfb3SEric Fiselier return 32; // Undefined Behavior. 85680f8cfb3SEric Fiselier#endif 857c206366fSHoward Hinnant} 858c206366fSHoward Hinnant 859c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 86080f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 86180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 862c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 86380f8cfb3SEric Fiselier#else 86480f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 86580f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 86680f8cfb3SEric Fiselier#endif 867c206366fSHoward Hinnant} 868c206366fSHoward Hinnant 869c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 87080f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 87180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 872c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 87380f8cfb3SEric Fiselier#else 87480f8cfb3SEric Fiselier unsigned long where; 87580f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 87680f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 87780f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 8789a0a0045SShoaib Meenai if (_BitScanReverse64(&where, __x)) 87980f8cfb3SEric Fiselier return static_cast<int>(63 - where); 88080f8cfb3SEric Fiselier#else 88180f8cfb3SEric Fiselier // Scan the high 32 bits. 8829a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x >> 32))) 88380f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 88480f8cfb3SEric Fiselier // Scan the low 32 bits. 8859a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x))) 88680f8cfb3SEric Fiselier return 63 - where; 88780f8cfb3SEric Fiselier#endif 88880f8cfb3SEric Fiselier return 64; // Undefined Behavior. 88980f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 890c206366fSHoward Hinnant} 891c8edcb36SHoward Hinnant 89280f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 89380f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 89480f8cfb3SEric Fiselier return __builtin_popcount (__x); 89580f8cfb3SEric Fiselier#else 89680f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 89780f8cfb3SEric Fiselier return __popcnt(__x); 89880f8cfb3SEric Fiselier#endif 89980f8cfb3SEric Fiselier} 90080f8cfb3SEric Fiselier 90180f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 90280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90380f8cfb3SEric Fiselier return __builtin_popcountl (__x); 90480f8cfb3SEric Fiselier#else 90580f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 90680f8cfb3SEric Fiselier return __popcnt(__x); 90780f8cfb3SEric Fiselier#endif 90880f8cfb3SEric Fiselier} 90980f8cfb3SEric Fiselier 91080f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 91180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 91280f8cfb3SEric Fiselier return __builtin_popcountll(__x); 91380f8cfb3SEric Fiselier#else 91480f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 91580f8cfb3SEric Fiselier return __popcnt64(__x); 91680f8cfb3SEric Fiselier#endif 91780f8cfb3SEric Fiselier} 918c8edcb36SHoward Hinnant 9193e519524SHoward Hinnant// all_of 9203e519524SHoward Hinnant 9213e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 922*706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9233e519524SHoward Hinnantbool 9243e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9253e519524SHoward Hinnant{ 9263e519524SHoward Hinnant for (; __first != __last; ++__first) 9273e519524SHoward Hinnant if (!__pred(*__first)) 9283e519524SHoward Hinnant return false; 9293e519524SHoward Hinnant return true; 9303e519524SHoward Hinnant} 9313e519524SHoward Hinnant 9323e519524SHoward Hinnant// any_of 9333e519524SHoward Hinnant 9343e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 935*706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9363e519524SHoward Hinnantbool 9373e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9383e519524SHoward Hinnant{ 9393e519524SHoward Hinnant for (; __first != __last; ++__first) 9403e519524SHoward Hinnant if (__pred(*__first)) 9413e519524SHoward Hinnant return true; 9423e519524SHoward Hinnant return false; 9433e519524SHoward Hinnant} 9443e519524SHoward Hinnant 9453e519524SHoward Hinnant// none_of 9463e519524SHoward Hinnant 9473e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 948*706ffef7SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9493e519524SHoward Hinnantbool 9503e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9513e519524SHoward Hinnant{ 9523e519524SHoward Hinnant for (; __first != __last; ++__first) 9533e519524SHoward Hinnant if (__pred(*__first)) 9543e519524SHoward Hinnant return false; 9553e519524SHoward Hinnant return true; 9563e519524SHoward Hinnant} 9573e519524SHoward Hinnant 9583e519524SHoward Hinnant// for_each 9593e519524SHoward Hinnant 9603e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9623e519524SHoward Hinnant_Function 9633e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9643e519524SHoward Hinnant{ 9653e519524SHoward Hinnant for (; __first != __last; ++__first) 9663e519524SHoward Hinnant __f(*__first); 9671c7fe126SMarshall Clow return __f; 9683e519524SHoward Hinnant} 9693e519524SHoward Hinnant 9701d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 971d5c65ffaSMarshall Clow// for_each_n 972d5c65ffaSMarshall Clow 973d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 974d5c65ffaSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 975d5c65ffaSMarshall Clow_InputIterator 976d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 977d5c65ffaSMarshall Clow{ 978d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 979d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 980d5c65ffaSMarshall Clow while (__n > 0) 981d5c65ffaSMarshall Clow { 982d5c65ffaSMarshall Clow __f(*__first); 983d5c65ffaSMarshall Clow ++__first; 984d5c65ffaSMarshall Clow --__n; 985d5c65ffaSMarshall Clow } 986d5c65ffaSMarshall Clow return __first; 987d5c65ffaSMarshall Clow} 9881d02996dSMarshall Clow#endif 989d5c65ffaSMarshall Clow 9903e519524SHoward Hinnant// find 9913e519524SHoward Hinnant 9923e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 99349c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 9943e519524SHoward Hinnant_InputIterator 995e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9963e519524SHoward Hinnant{ 9973e519524SHoward Hinnant for (; __first != __last; ++__first) 998e4383379SHoward Hinnant if (*__first == __value_) 9993e519524SHoward Hinnant break; 10003e519524SHoward Hinnant return __first; 10013e519524SHoward Hinnant} 10023e519524SHoward Hinnant 10033e519524SHoward Hinnant// find_if 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 100649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 10073e519524SHoward Hinnant_InputIterator 10083e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant for (; __first != __last; ++__first) 10113e519524SHoward Hinnant if (__pred(*__first)) 10123e519524SHoward Hinnant break; 10133e519524SHoward Hinnant return __first; 10143e519524SHoward Hinnant} 10153e519524SHoward Hinnant 10163e519524SHoward Hinnant// find_if_not 10173e519524SHoward Hinnant 10183e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10203e519524SHoward Hinnant_InputIterator 10213e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10223e519524SHoward Hinnant{ 10233e519524SHoward Hinnant for (; __first != __last; ++__first) 10243e519524SHoward Hinnant if (!__pred(*__first)) 10253e519524SHoward Hinnant break; 10263e519524SHoward Hinnant return __first; 10273e519524SHoward Hinnant} 10283e519524SHoward Hinnant 10293e519524SHoward Hinnant// find_end 10303e519524SHoward Hinnant 10313e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10323e519524SHoward Hinnant_ForwardIterator1 10333e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10343e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10353e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10363e519524SHoward Hinnant{ 10373e519524SHoward Hinnant // modeled after search algorithm 10383e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10393e519524SHoward Hinnant if (__first2 == __last2) 10403e519524SHoward Hinnant return __r; 10413e519524SHoward Hinnant while (true) 10423e519524SHoward Hinnant { 10433e519524SHoward Hinnant while (true) 10443e519524SHoward Hinnant { 10453e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10463e519524SHoward Hinnant return __r; // (or __last1 if never found) 10473e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10483e519524SHoward Hinnant break; 10493e519524SHoward Hinnant ++__first1; 10503e519524SHoward Hinnant } 10513e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10523e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10533e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10543e519524SHoward Hinnant while (true) 10553e519524SHoward Hinnant { 10563e519524SHoward Hinnant if (++__m2 == __last2) 10573e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10583e519524SHoward Hinnant __r = __first1; 10593e519524SHoward Hinnant ++__first1; 10603e519524SHoward Hinnant break; 10613e519524SHoward Hinnant } 10623e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10633e519524SHoward Hinnant return __r; 10643e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10653e519524SHoward Hinnant { 10663e519524SHoward Hinnant ++__first1; 10673e519524SHoward Hinnant break; 10683e519524SHoward Hinnant } // else there is a match, check next elements 10693e519524SHoward Hinnant } 10703e519524SHoward Hinnant } 10713e519524SHoward Hinnant} 10723e519524SHoward Hinnant 10733e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10743e519524SHoward Hinnant_BidirectionalIterator1 10753e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10763e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10773e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10783e519524SHoward Hinnant{ 10793e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10803e519524SHoward Hinnant if (__first2 == __last2) 10813e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10823e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10833e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10843e519524SHoward Hinnant --__l2; 10853e519524SHoward Hinnant while (true) 10863e519524SHoward Hinnant { 10873e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10883e519524SHoward Hinnant while (true) 10893e519524SHoward Hinnant { 10903e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10913e519524SHoward Hinnant return __last1; 10923e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10933e519524SHoward Hinnant break; 10943e519524SHoward Hinnant } 10953e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10963e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10973e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10983e519524SHoward Hinnant while (true) 10993e519524SHoward Hinnant { 11003e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 11013e519524SHoward Hinnant return __m1; 11023e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 11033e519524SHoward Hinnant return __last1; 11043e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11053e519524SHoward Hinnant { 11063e519524SHoward Hinnant break; 11073e519524SHoward Hinnant } // else there is a match, check next elements 11083e519524SHoward Hinnant } 11093e519524SHoward Hinnant } 11103e519524SHoward Hinnant} 11113e519524SHoward Hinnant 11123e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11139b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11143e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11153e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11163e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11173e519524SHoward Hinnant{ 11183e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11203e519524SHoward Hinnant if (__len2 == 0) 11213e519524SHoward Hinnant return __last1; 11223e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11233e519524SHoward Hinnant if (__len1 < __len2) 11243e519524SHoward Hinnant return __last1; 11253e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11263e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11273e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11283e519524SHoward Hinnant --__l2; 11293e519524SHoward Hinnant while (true) 11303e519524SHoward Hinnant { 11313e519524SHoward Hinnant while (true) 11323e519524SHoward Hinnant { 11333e519524SHoward Hinnant if (__s == __l1) 11343e519524SHoward Hinnant return __last1; 11353e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11363e519524SHoward Hinnant break; 11373e519524SHoward Hinnant } 11383e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11393e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11403e519524SHoward Hinnant while (true) 11413e519524SHoward Hinnant { 11423e519524SHoward Hinnant if (__m2 == __first2) 11433e519524SHoward Hinnant return __m1; 11443e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11453e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11463e519524SHoward Hinnant { 11473e519524SHoward Hinnant break; 11483e519524SHoward Hinnant } 11493e519524SHoward Hinnant } 11503e519524SHoward Hinnant } 11513e519524SHoward Hinnant} 11523e519524SHoward Hinnant 11533e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11553e519524SHoward Hinnant_ForwardIterator1 11563e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11573e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11583e519524SHoward Hinnant{ 1159ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11603e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11613e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11623e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11633e519524SHoward Hinnant} 11643e519524SHoward Hinnant 11653e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11673e519524SHoward Hinnant_ForwardIterator1 11683e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11693e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11703e519524SHoward Hinnant{ 11713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1173ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11743e519524SHoward Hinnant} 11753e519524SHoward Hinnant 11763e519524SHoward Hinnant// find_first_of 11773e519524SHoward Hinnant 11783e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11799b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11809b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11813e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11823e519524SHoward Hinnant{ 11833e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11843e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11853e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11863e519524SHoward Hinnant return __first1; 11873e519524SHoward Hinnant return __last1; 11883e519524SHoward Hinnant} 11893e519524SHoward Hinnant 11909b0af34dSMarshall Clow 11919b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11929b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11939b0af34dSMarshall Clow_ForwardIterator1 11949b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11959b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11969b0af34dSMarshall Clow{ 11979b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11989b0af34dSMarshall Clow} 11999b0af34dSMarshall Clow 12003e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12023e519524SHoward Hinnant_ForwardIterator1 12033e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12043e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12053e519524SHoward Hinnant{ 12063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12073e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12089b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12093e519524SHoward Hinnant} 12103e519524SHoward Hinnant 12113e519524SHoward Hinnant// adjacent_find 12123e519524SHoward Hinnant 12133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12153e519524SHoward Hinnant_ForwardIterator 12163e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12173e519524SHoward Hinnant{ 12183e519524SHoward Hinnant if (__first != __last) 12193e519524SHoward Hinnant { 12203e519524SHoward Hinnant _ForwardIterator __i = __first; 12213e519524SHoward Hinnant while (++__i != __last) 12223e519524SHoward Hinnant { 12233e519524SHoward Hinnant if (__pred(*__first, *__i)) 12243e519524SHoward Hinnant return __first; 12253e519524SHoward Hinnant __first = __i; 12263e519524SHoward Hinnant } 12273e519524SHoward Hinnant } 12283e519524SHoward Hinnant return __last; 12293e519524SHoward Hinnant} 12303e519524SHoward Hinnant 12313e519524SHoward Hinnanttemplate <class _ForwardIterator> 12323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12333e519524SHoward Hinnant_ForwardIterator 12343e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12353e519524SHoward Hinnant{ 12363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1237ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12383e519524SHoward Hinnant} 12393e519524SHoward Hinnant 12403e519524SHoward Hinnant// count 12413e519524SHoward Hinnant 12423e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12443e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1245e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12463e519524SHoward Hinnant{ 12473e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12483e519524SHoward Hinnant for (; __first != __last; ++__first) 1249e4383379SHoward Hinnant if (*__first == __value_) 12503e519524SHoward Hinnant ++__r; 12513e519524SHoward Hinnant return __r; 12523e519524SHoward Hinnant} 12533e519524SHoward Hinnant 12543e519524SHoward Hinnant// count_if 12553e519524SHoward Hinnant 12563e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12583e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12593e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12603e519524SHoward Hinnant{ 12613e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12623e519524SHoward Hinnant for (; __first != __last; ++__first) 12633e519524SHoward Hinnant if (__pred(*__first)) 12643e519524SHoward Hinnant ++__r; 12653e519524SHoward Hinnant return __r; 12663e519524SHoward Hinnant} 12673e519524SHoward Hinnant 12683e519524SHoward Hinnant// mismatch 12693e519524SHoward Hinnant 12703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12723e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12733e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12743e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12753e519524SHoward Hinnant{ 1276bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12773e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12783e519524SHoward Hinnant break; 12793e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12803e519524SHoward Hinnant} 12813e519524SHoward Hinnant 12823e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12843e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12853e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12863e519524SHoward Hinnant{ 12873e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12883e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1289ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12903e519524SHoward Hinnant} 12913e519524SHoward Hinnant 12920b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12930b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12940b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12950b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12960b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12970b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12980b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12990b0bbd2fSMarshall Clow{ 1300bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13010b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13020b0bbd2fSMarshall Clow break; 13030b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 13040b0bbd2fSMarshall Clow} 13050b0bbd2fSMarshall Clow 13060b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13070b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13080b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13090b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13100b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13110b0bbd2fSMarshall Clow{ 13120b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13130b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13140b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13150b0bbd2fSMarshall Clow} 13160b0bbd2fSMarshall Clow#endif 13170b0bbd2fSMarshall Clow 13183e519524SHoward Hinnant// equal 13193e519524SHoward Hinnant 13203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13223e519524SHoward Hinnantbool 13233e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13243e519524SHoward Hinnant{ 1325910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13263e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13273e519524SHoward Hinnant return false; 13283e519524SHoward Hinnant return true; 13293e519524SHoward Hinnant} 13303e519524SHoward Hinnant 13313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13333e519524SHoward Hinnantbool 13343e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13353e519524SHoward Hinnant{ 13363e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13373e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1338ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13393e519524SHoward Hinnant} 13403e519524SHoward Hinnant 13410b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13420b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13430b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13440b0bbd2fSMarshall Clowbool 13450b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13460b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13470b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13480b0bbd2fSMarshall Clow{ 1349910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13500b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13510b0bbd2fSMarshall Clow return false; 13520b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13530b0bbd2fSMarshall Clow} 13540b0bbd2fSMarshall Clow 13550b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13560b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13570b0bbd2fSMarshall Clowbool 13580b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13590b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13600b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13610b0bbd2fSMarshall Clow{ 13620b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13630b0bbd2fSMarshall Clow return false; 13640b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13650b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13660b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13670b0bbd2fSMarshall Clow} 13680b0bbd2fSMarshall Clow 13690b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13700b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13710b0bbd2fSMarshall Clowbool 13720b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13730b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13740b0bbd2fSMarshall Clow{ 13750b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13760b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13770b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13780b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13790b0bbd2fSMarshall Clow} 13800b0bbd2fSMarshall Clow 13810b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13820b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13830b0bbd2fSMarshall Clowbool 13840b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13850b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13860b0bbd2fSMarshall Clow{ 13870b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13880b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13890b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13900b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13910b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13920b0bbd2fSMarshall Clow} 13930b0bbd2fSMarshall Clow#endif 13940b0bbd2fSMarshall Clow 13953e519524SHoward Hinnant// is_permutation 13963e519524SHoward Hinnant 13973e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 139849c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 13993e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14003e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 14013e519524SHoward Hinnant{ 140249c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1403910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 14043e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 140549c7643cSMarshall Clow break; 140649c7643cSMarshall Clow if (__first1 == __last1) 14073e519524SHoward Hinnant return true; 140849c7643cSMarshall Clow 14093e519524SHoward Hinnant// __first1 != __last1 && *__first1 != *__first2 14103e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1411ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14123e519524SHoward Hinnant if (__l1 == _D1(1)) 14133e519524SHoward Hinnant return false; 1414ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14153e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14163e519524SHoward Hinnant // equal elements in [f2, l2) 14173e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14183e519524SHoward Hinnant { 14193e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 142049c7643cSMarshall Clow if (find(__first1, __i, *__i) == __i) { 14213e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14223e519524SHoward Hinnant _D1 __c2 = 0; 14233e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14243e519524SHoward Hinnant if (__pred(*__i, *__j)) 14253e519524SHoward Hinnant ++__c2; 14263e519524SHoward Hinnant if (__c2 == 0) 14273e519524SHoward Hinnant return false; 14283e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14293e519524SHoward Hinnant _D1 __c1 = 1; 1430ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14313e519524SHoward Hinnant if (__pred(*__i, *__j)) 14323e519524SHoward Hinnant ++__c1; 14333e519524SHoward Hinnant if (__c1 != __c2) 14343e519524SHoward Hinnant return false; 14353e519524SHoward Hinnant } 14363e519524SHoward Hinnant } 14373e519524SHoward Hinnant return true; 14383e519524SHoward Hinnant} 14393e519524SHoward Hinnant 14403e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 144149c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 14423e519524SHoward Hinnantbool 14433e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14443e519524SHoward Hinnant _ForwardIterator2 __first2) 14453e519524SHoward Hinnant{ 14463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1448ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14493e519524SHoward Hinnant} 14503e519524SHoward Hinnant 14510b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14520b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 145349c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 14540b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14550b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14560b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14570b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14580b0bbd2fSMarshall Clow{ 145949c7643cSMarshall Clow// shorten sequences as much as possible by lopping of any equal prefix 1460847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14610b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 146249c7643cSMarshall Clow break; 146349c7643cSMarshall Clow if (__first1 == __last1) 146449c7643cSMarshall Clow return __first2 == __last2; 146549c7643cSMarshall Clow else if (__first2 == __last2) 146649c7643cSMarshall Clow return false; 146749c7643cSMarshall Clow 14680b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14690b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14700b0bbd2fSMarshall Clow 14710b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1472fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14730b0bbd2fSMarshall Clow if (__l1 != __l2) 14740b0bbd2fSMarshall Clow return false; 14750b0bbd2fSMarshall Clow 14760b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14770b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14780b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14790b0bbd2fSMarshall Clow { 14800b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 148149c7643cSMarshall Clow if (find(__first1, __i, *__i) == __i) { 14820b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14830b0bbd2fSMarshall Clow _D1 __c2 = 0; 14840b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14850b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14860b0bbd2fSMarshall Clow ++__c2; 14870b0bbd2fSMarshall Clow if (__c2 == 0) 14880b0bbd2fSMarshall Clow return false; 14890b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14900b0bbd2fSMarshall Clow _D1 __c1 = 1; 14910b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14920b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14930b0bbd2fSMarshall Clow ++__c1; 14940b0bbd2fSMarshall Clow if (__c1 != __c2) 14950b0bbd2fSMarshall Clow return false; 14960b0bbd2fSMarshall Clow } 14970b0bbd2fSMarshall Clow } 14980b0bbd2fSMarshall Clow return true; 14990b0bbd2fSMarshall Clow} 15000b0bbd2fSMarshall Clow 15010b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 150249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 15030b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 15040b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 15050b0bbd2fSMarshall Clow _BinaryPredicate __pred, 15060b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 15070b0bbd2fSMarshall Clow{ 15080b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 15090b0bbd2fSMarshall Clow return false; 15100b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 15110b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 15120b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 15130b0bbd2fSMarshall Clow} 15140b0bbd2fSMarshall Clow 15150b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 151649c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15170b0bbd2fSMarshall Clowbool 15180b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15190b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 15200b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15210b0bbd2fSMarshall Clow{ 15220b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15230b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15240b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15250b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15260b0bbd2fSMarshall Clow} 15270b0bbd2fSMarshall Clow 15280b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 152949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 15300b0bbd2fSMarshall Clowbool 15310b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15320b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15330b0bbd2fSMarshall Clow{ 15340b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15350b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15360b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15370b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15380b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15390b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15400b0bbd2fSMarshall Clow} 15410b0bbd2fSMarshall Clow#endif 15420b0bbd2fSMarshall Clow 15433e519524SHoward Hinnant// search 1544d835e592SMarshall Clow// __search is in <functional> 15453e519524SHoward Hinnant 15463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15483e519524SHoward Hinnant_ForwardIterator1 15493e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15513e519524SHoward Hinnant{ 1552ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15533e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 155428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 155528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 155628cc4ddeSMarshall Clow .first; 15573e519524SHoward Hinnant} 15583e519524SHoward Hinnant 15593e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15613e519524SHoward Hinnant_ForwardIterator1 15623e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15633e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15643e519524SHoward Hinnant{ 156528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 156628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1567ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15683e519524SHoward Hinnant} 15693e519524SHoward Hinnant 1570d835e592SMarshall Clow 1571d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1572d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 1573d835e592SMarshall Clow_LIBCPP_INLINE_VISIBILITY 1574d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1575d835e592SMarshall Clow{ return __s(__f, __l).first; } 1576d835e592SMarshall Clow#endif 1577d835e592SMarshall Clow 15783e519524SHoward Hinnant// search_n 15793e519524SHoward Hinnant 15803e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15813e519524SHoward Hinnant_ForwardIterator 15823e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1583e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15843e519524SHoward Hinnant{ 15853e519524SHoward Hinnant if (__count <= 0) 15863e519524SHoward Hinnant return __first; 15873e519524SHoward Hinnant while (true) 15883e519524SHoward Hinnant { 1589e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15903e519524SHoward Hinnant while (true) 15913e519524SHoward Hinnant { 1592e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15933e519524SHoward Hinnant return __last; 1594e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15953e519524SHoward Hinnant break; 15963e519524SHoward Hinnant ++__first; 15973e519524SHoward Hinnant } 1598e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15993e519524SHoward Hinnant _ForwardIterator __m = __first; 16003e519524SHoward Hinnant _Size __c(0); 16013e519524SHoward Hinnant while (true) 16023e519524SHoward Hinnant { 16033e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16043e519524SHoward Hinnant return __first; 16053e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16063e519524SHoward Hinnant return __last; 1607e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16083e519524SHoward Hinnant { 16093e519524SHoward Hinnant __first = __m; 16103e519524SHoward Hinnant ++__first; 16113e519524SHoward Hinnant break; 16123e519524SHoward Hinnant } // else there is a match, check next elements 16133e519524SHoward Hinnant } 16143e519524SHoward Hinnant } 16153e519524SHoward Hinnant} 16163e519524SHoward Hinnant 16173e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16183e519524SHoward Hinnant_RandomAccessIterator 16193e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1620e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16213e519524SHoward Hinnant{ 16223e519524SHoward Hinnant if (__count <= 0) 16233e519524SHoward Hinnant return __first; 16243e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16253e519524SHoward Hinnant if (__len < __count) 16263e519524SHoward Hinnant return __last; 16273e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16283e519524SHoward Hinnant while (true) 16293e519524SHoward Hinnant { 1630e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16313e519524SHoward Hinnant while (true) 16323e519524SHoward Hinnant { 1633b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16343e519524SHoward Hinnant return __last; 1635e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16363e519524SHoward Hinnant break; 16373e519524SHoward Hinnant ++__first; 16383e519524SHoward Hinnant } 1639e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16403e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16413e519524SHoward Hinnant _Size __c(0); 16423e519524SHoward Hinnant while (true) 16433e519524SHoward Hinnant { 16443e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16453e519524SHoward Hinnant return __first; 16463e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1647e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16483e519524SHoward Hinnant { 16493e519524SHoward Hinnant __first = __m; 16503e519524SHoward Hinnant ++__first; 16513e519524SHoward Hinnant break; 16523e519524SHoward Hinnant } // else there is a match, check next elements 16533e519524SHoward Hinnant } 16543e519524SHoward Hinnant } 16553e519524SHoward Hinnant} 16563e519524SHoward Hinnant 16573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16593e519524SHoward Hinnant_ForwardIterator 16603e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1661e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16623e519524SHoward Hinnant{ 1663ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 166451544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 166551544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16663e519524SHoward Hinnant} 16673e519524SHoward Hinnant 16683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16703e519524SHoward Hinnant_ForwardIterator 1671e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16723e519524SHoward Hinnant{ 16733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 167451544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 167551544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16763e519524SHoward Hinnant} 16773e519524SHoward Hinnant 16783e519524SHoward Hinnant// copy 16793e519524SHoward Hinnanttemplate <class _Iter> 16803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16813e519524SHoward Hinnant_Iter 16823e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16833e519524SHoward Hinnant{ 16843e519524SHoward Hinnant return __i; 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnanttemplate <class _Tp> 16885b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 16893e519524SHoward Hinnanttypename enable_if 16903e519524SHoward Hinnant< 1691ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16923e519524SHoward Hinnant _Tp* 16933e519524SHoward Hinnant>::type 16943e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16953e519524SHoward Hinnant{ 16963e519524SHoward Hinnant return __i.base(); 16973e519524SHoward Hinnant} 16983e519524SHoward Hinnant 1699fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1700fc88dbd2SHoward Hinnant 17013e519524SHoward Hinnanttemplate <class _Tp> 17025b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17033e519524SHoward Hinnanttypename enable_if 17043e519524SHoward Hinnant< 1705ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17063e519524SHoward Hinnant _Tp* 17073e519524SHoward Hinnant>::type 17083e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17093e519524SHoward Hinnant{ 17103e519524SHoward Hinnant return __i.base(); 17113e519524SHoward Hinnant} 17123e519524SHoward Hinnant 171314bd0bf0SEric Fiselier#else 171414bd0bf0SEric Fiselier 171514bd0bf0SEric Fiseliertemplate <class _Tp> 17165b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 171714bd0bf0SEric Fiseliertypename enable_if 171814bd0bf0SEric Fiselier< 171914bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 172014bd0bf0SEric Fiselier __wrap_iter<_Tp*> 172114bd0bf0SEric Fiselier>::type 172214bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 172314bd0bf0SEric Fiselier{ 172414bd0bf0SEric Fiselier return __i; 172514bd0bf0SEric Fiselier} 172614bd0bf0SEric Fiselier 1727fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1728fc88dbd2SHoward Hinnant 17293e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17313e519524SHoward Hinnant_OutputIterator 17323e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17333e519524SHoward Hinnant{ 1734910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17353e519524SHoward Hinnant *__result = *__first; 17363e519524SHoward Hinnant return __result; 17373e519524SHoward Hinnant} 17383e519524SHoward Hinnant 17393e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17413e519524SHoward Hinnanttypename enable_if 17423e519524SHoward Hinnant< 17433e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1744ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17453e519524SHoward Hinnant _Up* 17463e519524SHoward Hinnant>::type 17473e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17483e519524SHoward Hinnant{ 17493e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17505b312052SMarshall Clow if (__n > 0) 1751ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17523e519524SHoward Hinnant return __result + __n; 17533e519524SHoward Hinnant} 17543e519524SHoward Hinnant 17553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17573e519524SHoward Hinnant_OutputIterator 17583e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17593e519524SHoward Hinnant{ 1760ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17613e519524SHoward Hinnant} 17623e519524SHoward Hinnant 17633e519524SHoward Hinnant// copy_backward 17643e519524SHoward Hinnant 1765d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17673e519524SHoward Hinnant_OutputIterator 1768d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17693e519524SHoward Hinnant{ 17703e519524SHoward Hinnant while (__first != __last) 17713e519524SHoward Hinnant *--__result = *--__last; 17723e519524SHoward Hinnant return __result; 17733e519524SHoward Hinnant} 17743e519524SHoward Hinnant 17753e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17773e519524SHoward Hinnanttypename enable_if 17783e519524SHoward Hinnant< 17793e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1780ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17813e519524SHoward Hinnant _Up* 17823e519524SHoward Hinnant>::type 17833e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17843e519524SHoward Hinnant{ 17853e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17865b312052SMarshall Clow if (__n > 0) 17875b312052SMarshall Clow { 17883e519524SHoward Hinnant __result -= __n; 1789ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17905b312052SMarshall Clow } 17913e519524SHoward Hinnant return __result; 17923e519524SHoward Hinnant} 17933e519524SHoward Hinnant 17943e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17963e519524SHoward Hinnant_BidirectionalIterator2 17973e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17983e519524SHoward Hinnant _BidirectionalIterator2 __result) 17993e519524SHoward Hinnant{ 1800fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1801fd838227SEric Fiselier __unwrap_iter(__last), 1802fd838227SEric Fiselier __unwrap_iter(__result)); 18033e519524SHoward Hinnant} 18043e519524SHoward Hinnant 18053e519524SHoward Hinnant// copy_if 18063e519524SHoward Hinnant 18073e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18093e519524SHoward Hinnant_OutputIterator 18103e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18113e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18123e519524SHoward Hinnant{ 18133e519524SHoward Hinnant for (; __first != __last; ++__first) 18143e519524SHoward Hinnant { 18153e519524SHoward Hinnant if (__pred(*__first)) 18163e519524SHoward Hinnant { 18173e519524SHoward Hinnant *__result = *__first; 18183e519524SHoward Hinnant ++__result; 18193e519524SHoward Hinnant } 18203e519524SHoward Hinnant } 18213e519524SHoward Hinnant return __result; 18223e519524SHoward Hinnant} 18233e519524SHoward Hinnant 18243e519524SHoward Hinnant// copy_n 18253e519524SHoward Hinnant 18263e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18283e519524SHoward Hinnanttypename enable_if 18293e519524SHoward Hinnant< 18303e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18313e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18323e519524SHoward Hinnant _OutputIterator 18333e519524SHoward Hinnant>::type 183451544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18353e519524SHoward Hinnant{ 183651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 183751544023SEric Fiselier _IntegralSize __n = __orig_n; 183899847d2bSHoward Hinnant if (__n > 0) 183999847d2bSHoward Hinnant { 18403e519524SHoward Hinnant *__result = *__first; 184199847d2bSHoward Hinnant ++__result; 184299847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184399847d2bSHoward Hinnant { 184499847d2bSHoward Hinnant ++__first; 184599847d2bSHoward Hinnant *__result = *__first; 184699847d2bSHoward Hinnant ++__result; 184799847d2bSHoward Hinnant } 184899847d2bSHoward Hinnant } 18493e519524SHoward Hinnant return __result; 18503e519524SHoward Hinnant} 18513e519524SHoward Hinnant 18523e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18543e519524SHoward Hinnanttypename enable_if 18553e519524SHoward Hinnant< 18563e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18573e519524SHoward Hinnant _OutputIterator 18583e519524SHoward Hinnant>::type 185951544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18603e519524SHoward Hinnant{ 186151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 186251544023SEric Fiselier _IntegralSize __n = __orig_n; 1863ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18643e519524SHoward Hinnant} 18653e519524SHoward Hinnant 18663e519524SHoward Hinnant// move 18673e519524SHoward Hinnant 18683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18703e519524SHoward Hinnant_OutputIterator 18713e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18723e519524SHoward Hinnant{ 1873910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1874ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18753e519524SHoward Hinnant return __result; 18763e519524SHoward Hinnant} 18773e519524SHoward Hinnant 18783e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18803e519524SHoward Hinnanttypename enable_if 18813e519524SHoward Hinnant< 18823e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1883ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18843e519524SHoward Hinnant _Up* 18853e519524SHoward Hinnant>::type 18863e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18873e519524SHoward Hinnant{ 18883e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18895b312052SMarshall Clow if (__n > 0) 1890ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18913e519524SHoward Hinnant return __result + __n; 18923e519524SHoward Hinnant} 18933e519524SHoward Hinnant 18943e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18963e519524SHoward Hinnant_OutputIterator 18973e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18983e519524SHoward Hinnant{ 1899ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19003e519524SHoward Hinnant} 19013e519524SHoward Hinnant 19023e519524SHoward Hinnant// move_backward 19033e519524SHoward Hinnant 19043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19063e519524SHoward Hinnant_OutputIterator 19073e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19083e519524SHoward Hinnant{ 19093e519524SHoward Hinnant while (__first != __last) 1910ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19113e519524SHoward Hinnant return __result; 19123e519524SHoward Hinnant} 19133e519524SHoward Hinnant 19143e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19163e519524SHoward Hinnanttypename enable_if 19173e519524SHoward Hinnant< 19183e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1919ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19203e519524SHoward Hinnant _Up* 19213e519524SHoward Hinnant>::type 19223e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19233e519524SHoward Hinnant{ 19243e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19255b312052SMarshall Clow if (__n > 0) 19265b312052SMarshall Clow { 19273e519524SHoward Hinnant __result -= __n; 1928ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19295b312052SMarshall Clow } 19303e519524SHoward Hinnant return __result; 19313e519524SHoward Hinnant} 19323e519524SHoward Hinnant 19333e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19353e519524SHoward Hinnant_BidirectionalIterator2 19363e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19373e519524SHoward Hinnant _BidirectionalIterator2 __result) 19383e519524SHoward Hinnant{ 1939ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19403e519524SHoward Hinnant} 19413e519524SHoward Hinnant 19423e519524SHoward Hinnant// iter_swap 19433e519524SHoward Hinnant 1944a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19453e519524SHoward Hinnant 19463e519524SHoward Hinnant// transform 19473e519524SHoward Hinnant 19483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19503e519524SHoward Hinnant_OutputIterator 19513e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19523e519524SHoward Hinnant{ 1953910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19543e519524SHoward Hinnant *__result = __op(*__first); 19553e519524SHoward Hinnant return __result; 19563e519524SHoward Hinnant} 19573e519524SHoward Hinnant 19583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19603e519524SHoward Hinnant_OutputIterator 19613e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19623e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19633e519524SHoward Hinnant{ 1964910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19653e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19663e519524SHoward Hinnant return __result; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// replace 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnantvoid 19743e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19753e519524SHoward Hinnant{ 19763e519524SHoward Hinnant for (; __first != __last; ++__first) 19773e519524SHoward Hinnant if (*__first == __old_value) 19783e519524SHoward Hinnant *__first = __new_value; 19793e519524SHoward Hinnant} 19803e519524SHoward Hinnant 19813e519524SHoward Hinnant// replace_if 19823e519524SHoward Hinnant 19833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19853e519524SHoward Hinnantvoid 19863e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19873e519524SHoward Hinnant{ 19883e519524SHoward Hinnant for (; __first != __last; ++__first) 19893e519524SHoward Hinnant if (__pred(*__first)) 19903e519524SHoward Hinnant *__first = __new_value; 19913e519524SHoward Hinnant} 19923e519524SHoward Hinnant 19933e519524SHoward Hinnant// replace_copy 19943e519524SHoward Hinnant 19953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19973e519524SHoward Hinnant_OutputIterator 19983e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19993e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20003e519524SHoward Hinnant{ 2001910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20023e519524SHoward Hinnant if (*__first == __old_value) 20033e519524SHoward Hinnant *__result = __new_value; 20043e519524SHoward Hinnant else 20053e519524SHoward Hinnant *__result = *__first; 20063e519524SHoward Hinnant return __result; 20073e519524SHoward Hinnant} 20083e519524SHoward Hinnant 20093e519524SHoward Hinnant// replace_copy_if 20103e519524SHoward Hinnant 20113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20133e519524SHoward Hinnant_OutputIterator 20143e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20153e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20163e519524SHoward Hinnant{ 2017910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20183e519524SHoward Hinnant if (__pred(*__first)) 20193e519524SHoward Hinnant *__result = __new_value; 20203e519524SHoward Hinnant else 20213e519524SHoward Hinnant *__result = *__first; 20223e519524SHoward Hinnant return __result; 20233e519524SHoward Hinnant} 20243e519524SHoward Hinnant 20253e519524SHoward Hinnant// fill_n 20263e519524SHoward Hinnant 20273e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20293e519524SHoward Hinnant_OutputIterator 20300f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20313e519524SHoward Hinnant{ 2032910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2033e4383379SHoward Hinnant *__first = __value_; 20343e519524SHoward Hinnant return __first; 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20370f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20390f242beaSHoward Hinnanttypename enable_if 20400f242beaSHoward Hinnant< 20410f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20420f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20430f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20440f242beaSHoward Hinnant _Tp* 20450f242beaSHoward Hinnant>::type 20460f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20473e519524SHoward Hinnant{ 20483e519524SHoward Hinnant if (__n > 0) 2049e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20503e519524SHoward Hinnant return __first + __n; 20513e519524SHoward Hinnant} 20523e519524SHoward Hinnant 20533e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20553e519524SHoward Hinnant_OutputIterator 2056e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20573e519524SHoward Hinnant{ 205851544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20593e519524SHoward Hinnant} 20603e519524SHoward Hinnant 20613e519524SHoward Hinnant// fill 20623e519524SHoward Hinnant 20633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20653e519524SHoward Hinnantvoid 2066e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20673e519524SHoward Hinnant{ 20683e519524SHoward Hinnant for (; __first != __last; ++__first) 2069e4383379SHoward Hinnant *__first = __value_; 20703e519524SHoward Hinnant} 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20743e519524SHoward Hinnantvoid 2075e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20763e519524SHoward Hinnant{ 2077e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20783e519524SHoward Hinnant} 20793e519524SHoward Hinnant 20803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20823e519524SHoward Hinnantvoid 2083e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20843e519524SHoward Hinnant{ 2085e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20863e519524SHoward Hinnant} 20873e519524SHoward Hinnant 20883e519524SHoward Hinnant// generate 20893e519524SHoward Hinnant 20903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20923e519524SHoward Hinnantvoid 20933e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20943e519524SHoward Hinnant{ 20953e519524SHoward Hinnant for (; __first != __last; ++__first) 20963e519524SHoward Hinnant *__first = __gen(); 20973e519524SHoward Hinnant} 20983e519524SHoward Hinnant 20993e519524SHoward Hinnant// generate_n 21003e519524SHoward Hinnant 21013e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21033e519524SHoward Hinnant_OutputIterator 210451544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21053e519524SHoward Hinnant{ 210651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 210751544023SEric Fiselier _IntegralSize __n = __orig_n; 2108910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21093e519524SHoward Hinnant *__first = __gen(); 21103e519524SHoward Hinnant return __first; 21113e519524SHoward Hinnant} 21123e519524SHoward Hinnant 21133e519524SHoward Hinnant// remove 21143e519524SHoward Hinnant 21153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21163e519524SHoward Hinnant_ForwardIterator 2117e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21183e519524SHoward Hinnant{ 2119e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21203e519524SHoward Hinnant if (__first != __last) 21213e519524SHoward Hinnant { 21223e519524SHoward Hinnant _ForwardIterator __i = __first; 21233e519524SHoward Hinnant while (++__i != __last) 21243e519524SHoward Hinnant { 2125e4383379SHoward Hinnant if (!(*__i == __value_)) 21263e519524SHoward Hinnant { 2127ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21283e519524SHoward Hinnant ++__first; 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant } 21313e519524SHoward Hinnant } 21323e519524SHoward Hinnant return __first; 21333e519524SHoward Hinnant} 21343e519524SHoward Hinnant 21353e519524SHoward Hinnant// remove_if 21363e519524SHoward Hinnant 21373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21383e519524SHoward Hinnant_ForwardIterator 21393e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21403e519524SHoward Hinnant{ 2141ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21423e519524SHoward Hinnant (__first, __last, __pred); 21433e519524SHoward Hinnant if (__first != __last) 21443e519524SHoward Hinnant { 21453e519524SHoward Hinnant _ForwardIterator __i = __first; 21463e519524SHoward Hinnant while (++__i != __last) 21473e519524SHoward Hinnant { 21483e519524SHoward Hinnant if (!__pred(*__i)) 21493e519524SHoward Hinnant { 2150ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21513e519524SHoward Hinnant ++__first; 21523e519524SHoward Hinnant } 21533e519524SHoward Hinnant } 21543e519524SHoward Hinnant } 21553e519524SHoward Hinnant return __first; 21563e519524SHoward Hinnant} 21573e519524SHoward Hinnant 21583e519524SHoward Hinnant// remove_copy 21593e519524SHoward Hinnant 21603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21623e519524SHoward Hinnant_OutputIterator 2163e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21643e519524SHoward Hinnant{ 21653e519524SHoward Hinnant for (; __first != __last; ++__first) 21663e519524SHoward Hinnant { 2167e4383379SHoward Hinnant if (!(*__first == __value_)) 21683e519524SHoward Hinnant { 21693e519524SHoward Hinnant *__result = *__first; 21703e519524SHoward Hinnant ++__result; 21713e519524SHoward Hinnant } 21723e519524SHoward Hinnant } 21733e519524SHoward Hinnant return __result; 21743e519524SHoward Hinnant} 21753e519524SHoward Hinnant 21763e519524SHoward Hinnant// remove_copy_if 21773e519524SHoward Hinnant 21783e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21803e519524SHoward Hinnant_OutputIterator 21813e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21823e519524SHoward Hinnant{ 21833e519524SHoward Hinnant for (; __first != __last; ++__first) 21843e519524SHoward Hinnant { 21853e519524SHoward Hinnant if (!__pred(*__first)) 21863e519524SHoward Hinnant { 21873e519524SHoward Hinnant *__result = *__first; 21883e519524SHoward Hinnant ++__result; 21893e519524SHoward Hinnant } 21903e519524SHoward Hinnant } 21913e519524SHoward Hinnant return __result; 21923e519524SHoward Hinnant} 21933e519524SHoward Hinnant 21943e519524SHoward Hinnant// unique 21953e519524SHoward Hinnant 21963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21973e519524SHoward Hinnant_ForwardIterator 21983e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21993e519524SHoward Hinnant{ 2200ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22013e519524SHoward Hinnant (__first, __last, __pred); 22023e519524SHoward Hinnant if (__first != __last) 22033e519524SHoward Hinnant { 22043e519524SHoward Hinnant // ... a a ? ... 22053e519524SHoward Hinnant // f i 22063e519524SHoward Hinnant _ForwardIterator __i = __first; 22073e519524SHoward Hinnant for (++__i; ++__i != __last;) 22083e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2209ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22103e519524SHoward Hinnant ++__first; 22113e519524SHoward Hinnant } 22123e519524SHoward Hinnant return __first; 22133e519524SHoward Hinnant} 22143e519524SHoward Hinnant 22153e519524SHoward Hinnanttemplate <class _ForwardIterator> 22163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22173e519524SHoward Hinnant_ForwardIterator 22183e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22193e519524SHoward Hinnant{ 22203e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2221ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22223e519524SHoward Hinnant} 22233e519524SHoward Hinnant 22243e519524SHoward Hinnant// unique_copy 22253e519524SHoward Hinnant 22263e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22273e519524SHoward Hinnant_OutputIterator 22283e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22293e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22303e519524SHoward Hinnant{ 22313e519524SHoward Hinnant if (__first != __last) 22323e519524SHoward Hinnant { 22333e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22343e519524SHoward Hinnant *__result = __t; 22353e519524SHoward Hinnant ++__result; 22363e519524SHoward Hinnant while (++__first != __last) 22373e519524SHoward Hinnant { 22383e519524SHoward Hinnant if (!__pred(__t, *__first)) 22393e519524SHoward Hinnant { 22403e519524SHoward Hinnant __t = *__first; 22413e519524SHoward Hinnant *__result = __t; 22423e519524SHoward Hinnant ++__result; 22433e519524SHoward Hinnant } 22443e519524SHoward Hinnant } 22453e519524SHoward Hinnant } 22463e519524SHoward Hinnant return __result; 22473e519524SHoward Hinnant} 22483e519524SHoward Hinnant 22493e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22503e519524SHoward Hinnant_OutputIterator 22513e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22523e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22533e519524SHoward Hinnant{ 22543e519524SHoward Hinnant if (__first != __last) 22553e519524SHoward Hinnant { 22563e519524SHoward Hinnant _ForwardIterator __i = __first; 22573e519524SHoward Hinnant *__result = *__i; 22583e519524SHoward Hinnant ++__result; 22593e519524SHoward Hinnant while (++__first != __last) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22623e519524SHoward Hinnant { 22633e519524SHoward Hinnant *__result = *__first; 22643e519524SHoward Hinnant ++__result; 22653e519524SHoward Hinnant __i = __first; 22663e519524SHoward Hinnant } 22673e519524SHoward Hinnant } 22683e519524SHoward Hinnant } 22693e519524SHoward Hinnant return __result; 22703e519524SHoward Hinnant} 22713e519524SHoward Hinnant 22723e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22733e519524SHoward Hinnant_ForwardIterator 22743e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22753e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22763e519524SHoward Hinnant{ 22773e519524SHoward Hinnant if (__first != __last) 22783e519524SHoward Hinnant { 22793e519524SHoward Hinnant *__result = *__first; 22803e519524SHoward Hinnant while (++__first != __last) 22813e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22823e519524SHoward Hinnant *++__result = *__first; 22833e519524SHoward Hinnant ++__result; 22843e519524SHoward Hinnant } 22853e519524SHoward Hinnant return __result; 22863e519524SHoward Hinnant} 22873e519524SHoward Hinnant 22883e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22903e519524SHoward Hinnant_OutputIterator 22913e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22923e519524SHoward Hinnant{ 2293ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22943e519524SHoward Hinnant (__first, __last, __result, __pred, 22953e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22963e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22973e519524SHoward Hinnant} 22983e519524SHoward Hinnant 22993e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23013e519524SHoward Hinnant_OutputIterator 23023e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23033e519524SHoward Hinnant{ 23043e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2305ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23063e519524SHoward Hinnant} 23073e519524SHoward Hinnant 23083e519524SHoward Hinnant// reverse 23093e519524SHoward Hinnant 23103e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23123e519524SHoward Hinnantvoid 23133e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23143e519524SHoward Hinnant{ 23153e519524SHoward Hinnant while (__first != __last) 23163e519524SHoward Hinnant { 23173e519524SHoward Hinnant if (__first == --__last) 23183e519524SHoward Hinnant break; 2319def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23203e519524SHoward Hinnant ++__first; 23213e519524SHoward Hinnant } 23223e519524SHoward Hinnant} 23233e519524SHoward Hinnant 23243e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23263e519524SHoward Hinnantvoid 23273e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23283e519524SHoward Hinnant{ 23293e519524SHoward Hinnant if (__first != __last) 23303e519524SHoward Hinnant for (; __first < --__last; ++__first) 2331def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23323e519524SHoward Hinnant} 23333e519524SHoward Hinnant 23343e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23363e519524SHoward Hinnantvoid 23373e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23383e519524SHoward Hinnant{ 2339ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23403e519524SHoward Hinnant} 23413e519524SHoward Hinnant 23423e519524SHoward Hinnant// reverse_copy 23433e519524SHoward Hinnant 23443e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23463e519524SHoward Hinnant_OutputIterator 23473e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23483e519524SHoward Hinnant{ 23493e519524SHoward Hinnant for (; __first != __last; ++__result) 23503e519524SHoward Hinnant *__result = *--__last; 23513e519524SHoward Hinnant return __result; 23523e519524SHoward Hinnant} 23533e519524SHoward Hinnant 23543e519524SHoward Hinnant// rotate 23553e519524SHoward Hinnant 23563e519524SHoward Hinnanttemplate <class _ForwardIterator> 23573e519524SHoward Hinnant_ForwardIterator 2358aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23593e519524SHoward Hinnant{ 2360aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2361aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2362aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2363aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2364aca09de3SHoward Hinnant return __lm1; 2365aca09de3SHoward Hinnant} 2366aca09de3SHoward Hinnant 2367aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2368aca09de3SHoward Hinnant_BidirectionalIterator 2369aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2370aca09de3SHoward Hinnant{ 2371aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2372aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2373aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2374aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2375aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2376aca09de3SHoward Hinnant return __fp1; 2377aca09de3SHoward Hinnant} 2378aca09de3SHoward Hinnant 2379aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2380aca09de3SHoward Hinnant_ForwardIterator 2381aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2382aca09de3SHoward Hinnant{ 23833e519524SHoward Hinnant _ForwardIterator __i = __middle; 23843e519524SHoward Hinnant while (true) 23853e519524SHoward Hinnant { 23863e519524SHoward Hinnant swap(*__first, *__i); 23873e519524SHoward Hinnant ++__first; 23883e519524SHoward Hinnant if (++__i == __last) 23893e519524SHoward Hinnant break; 23903e519524SHoward Hinnant if (__first == __middle) 23913e519524SHoward Hinnant __middle = __i; 23923e519524SHoward Hinnant } 23933e519524SHoward Hinnant _ForwardIterator __r = __first; 23943e519524SHoward Hinnant if (__first != __middle) 23953e519524SHoward Hinnant { 23963e519524SHoward Hinnant __i = __middle; 23973e519524SHoward Hinnant while (true) 23983e519524SHoward Hinnant { 23993e519524SHoward Hinnant swap(*__first, *__i); 24003e519524SHoward Hinnant ++__first; 24013e519524SHoward Hinnant if (++__i == __last) 24023e519524SHoward Hinnant { 24033e519524SHoward Hinnant if (__first == __middle) 24043e519524SHoward Hinnant break; 24053e519524SHoward Hinnant __i = __middle; 24063e519524SHoward Hinnant } 24073e519524SHoward Hinnant else if (__first == __middle) 24083e519524SHoward Hinnant __middle = __i; 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant } 24113e519524SHoward Hinnant return __r; 24123e519524SHoward Hinnant} 24133e519524SHoward Hinnant 24143e519524SHoward Hinnanttemplate<typename _Integral> 24153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24163e519524SHoward Hinnant_Integral 241719b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24183e519524SHoward Hinnant{ 24193e519524SHoward Hinnant do 24203e519524SHoward Hinnant { 24213e519524SHoward Hinnant _Integral __t = __x % __y; 24223e519524SHoward Hinnant __x = __y; 24233e519524SHoward Hinnant __y = __t; 24243e519524SHoward Hinnant } while (__y); 24253e519524SHoward Hinnant return __x; 24263e519524SHoward Hinnant} 24273e519524SHoward Hinnant 24283e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24293e519524SHoward Hinnant_RandomAccessIterator 2430aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24313e519524SHoward Hinnant{ 24323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24343e519524SHoward Hinnant 24353e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24363e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24373e519524SHoward Hinnant if (__m1 == __m2) 24383e519524SHoward Hinnant { 2439ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24403e519524SHoward Hinnant return __middle; 24413e519524SHoward Hinnant } 244219b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24433e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24443e519524SHoward Hinnant { 2445aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24463e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24473e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24483e519524SHoward Hinnant do 24493e519524SHoward Hinnant { 2450aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24513e519524SHoward Hinnant __p1 = __p2; 24523e519524SHoward Hinnant const difference_type __d = __last - __p2; 24533e519524SHoward Hinnant if (__m1 < __d) 24543e519524SHoward Hinnant __p2 += __m1; 24553e519524SHoward Hinnant else 24563e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24573e519524SHoward Hinnant } while (__p2 != __p); 2458aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24593e519524SHoward Hinnant } 24603e519524SHoward Hinnant return __first + __m2; 24613e519524SHoward Hinnant} 24623e519524SHoward Hinnant 24633e519524SHoward Hinnanttemplate <class _ForwardIterator> 24643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24653e519524SHoward Hinnant_ForwardIterator 2466aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2467aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2468aca09de3SHoward Hinnant{ 2469aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2470aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2471aca09de3SHoward Hinnant { 2472aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2473aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2474aca09de3SHoward Hinnant } 2475aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2476aca09de3SHoward Hinnant} 2477aca09de3SHoward Hinnant 2478aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2479aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2480aca09de3SHoward Hinnant_BidirectionalIterator 2481aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2482aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2483aca09de3SHoward Hinnant{ 2484aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2485aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2486aca09de3SHoward Hinnant { 2487aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2488aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2489aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2490aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2491aca09de3SHoward Hinnant } 2492aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2493aca09de3SHoward Hinnant} 2494aca09de3SHoward Hinnant 2495aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2496aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2497aca09de3SHoward Hinnant_RandomAccessIterator 2498aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2499aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2500aca09de3SHoward Hinnant{ 2501aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2502aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2503aca09de3SHoward Hinnant { 2504aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2505aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2506aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2507aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2508aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2509aca09de3SHoward Hinnant } 2510aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2511aca09de3SHoward Hinnant} 2512aca09de3SHoward Hinnant 2513aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2514aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2515aca09de3SHoward Hinnant_ForwardIterator 25163e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25173e519524SHoward Hinnant{ 2518aca09de3SHoward Hinnant if (__first == __middle) 2519aca09de3SHoward Hinnant return __last; 2520aca09de3SHoward Hinnant if (__middle == __last) 2521aca09de3SHoward Hinnant return __first; 2522ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2523aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25243e519524SHoward Hinnant} 25253e519524SHoward Hinnant 25263e519524SHoward Hinnant// rotate_copy 25273e519524SHoward Hinnant 25283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25303e519524SHoward Hinnant_OutputIterator 25313e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25323e519524SHoward Hinnant{ 2533ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25343e519524SHoward Hinnant} 25353e519524SHoward Hinnant 25363e519524SHoward Hinnant// min_element 25373e519524SHoward Hinnant 25383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25399d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25403e519524SHoward Hinnant_ForwardIterator 25410b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25423e519524SHoward Hinnant{ 25433e519524SHoward Hinnant if (__first != __last) 25443e519524SHoward Hinnant { 25453e519524SHoward Hinnant _ForwardIterator __i = __first; 25463e519524SHoward Hinnant while (++__i != __last) 25473e519524SHoward Hinnant if (__comp(*__i, *__first)) 25483e519524SHoward Hinnant __first = __i; 25493e519524SHoward Hinnant } 25503e519524SHoward Hinnant return __first; 25513e519524SHoward Hinnant} 25523e519524SHoward Hinnant 25533e519524SHoward Hinnanttemplate <class _ForwardIterator> 25540b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25553e519524SHoward Hinnant_ForwardIterator 25563e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25573e519524SHoward Hinnant{ 25580b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25594eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25604eb27b79SHoward Hinnant} 25614eb27b79SHoward Hinnant 25624eb27b79SHoward Hinnant// min 25634eb27b79SHoward Hinnant 25644eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25659d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25664eb27b79SHoward Hinnantconst _Tp& 25674eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25684eb27b79SHoward Hinnant{ 25694eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25704eb27b79SHoward Hinnant} 25714eb27b79SHoward Hinnant 25724eb27b79SHoward Hinnanttemplate <class _Tp> 25739d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25744eb27b79SHoward Hinnantconst _Tp& 25754eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25764eb27b79SHoward Hinnant{ 2577ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25784eb27b79SHoward Hinnant} 25794eb27b79SHoward Hinnant 2580ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 258154976f26SHoward Hinnant 25824eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25839d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25844eb27b79SHoward Hinnant_Tp 25854eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25864eb27b79SHoward Hinnant{ 25870b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25884eb27b79SHoward Hinnant} 25894eb27b79SHoward Hinnant 25904eb27b79SHoward Hinnanttemplate<class _Tp> 25919d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25924eb27b79SHoward Hinnant_Tp 25934eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25944eb27b79SHoward Hinnant{ 25950b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25963e519524SHoward Hinnant} 25973e519524SHoward Hinnant 2598ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 259954976f26SHoward Hinnant 26003e519524SHoward Hinnant// max_element 26013e519524SHoward Hinnant 26023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26039d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26043e519524SHoward Hinnant_ForwardIterator 26050b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26063e519524SHoward Hinnant{ 26073e519524SHoward Hinnant if (__first != __last) 26083e519524SHoward Hinnant { 26093e519524SHoward Hinnant _ForwardIterator __i = __first; 26103e519524SHoward Hinnant while (++__i != __last) 26113e519524SHoward Hinnant if (__comp(*__first, *__i)) 26123e519524SHoward Hinnant __first = __i; 26133e519524SHoward Hinnant } 26143e519524SHoward Hinnant return __first; 26153e519524SHoward Hinnant} 26163e519524SHoward Hinnant 26179d67c6d5SMarshall Clow 26183e519524SHoward Hinnanttemplate <class _ForwardIterator> 26190b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26203e519524SHoward Hinnant_ForwardIterator 26213e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26223e519524SHoward Hinnant{ 26230b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26244eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26254eb27b79SHoward Hinnant} 26264eb27b79SHoward Hinnant 26274eb27b79SHoward Hinnant// max 26284eb27b79SHoward Hinnant 26294eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26309d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26314eb27b79SHoward Hinnantconst _Tp& 26324eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26334eb27b79SHoward Hinnant{ 26344eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26354eb27b79SHoward Hinnant} 26364eb27b79SHoward Hinnant 26374eb27b79SHoward Hinnanttemplate <class _Tp> 26389d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26394eb27b79SHoward Hinnantconst _Tp& 26404eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26414eb27b79SHoward Hinnant{ 2642ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26434eb27b79SHoward Hinnant} 26444eb27b79SHoward Hinnant 2645ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 264654976f26SHoward Hinnant 26474eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26494eb27b79SHoward Hinnant_Tp 26504eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26514eb27b79SHoward Hinnant{ 26520b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26534eb27b79SHoward Hinnant} 26544eb27b79SHoward Hinnant 26554eb27b79SHoward Hinnanttemplate<class _Tp> 26569d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26574eb27b79SHoward Hinnant_Tp 26584eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26594eb27b79SHoward Hinnant{ 26600b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26613e519524SHoward Hinnant} 26623e519524SHoward Hinnant 2663ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 266454976f26SHoward Hinnant 2665146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2666146c14acSMarshall Clow// clamp 2667146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2668146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2669146c14acSMarshall Clowconst _Tp& 2670146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2671146c14acSMarshall Clow{ 2672146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2673146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2674146c14acSMarshall Clow 2675146c14acSMarshall Clow} 2676146c14acSMarshall Clow 2677146c14acSMarshall Clowtemplate<class _Tp> 2678146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2679146c14acSMarshall Clowconst _Tp& 2680146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2681146c14acSMarshall Clow{ 2682146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2683146c14acSMarshall Clow} 2684146c14acSMarshall Clow#endif 2685146c14acSMarshall Clow 26863e519524SHoward Hinnant// minmax_element 26873e519524SHoward Hinnant 26883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26890b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26903e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26913e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26923e519524SHoward Hinnant{ 26933e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26943e519524SHoward Hinnant if (__first != __last) 26953e519524SHoward Hinnant { 26963e519524SHoward Hinnant if (++__first != __last) 26973e519524SHoward Hinnant { 26983e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26993e519524SHoward Hinnant __result.first = __first; 27003e519524SHoward Hinnant else 27013e519524SHoward Hinnant __result.second = __first; 27023e519524SHoward Hinnant while (++__first != __last) 27033e519524SHoward Hinnant { 27043e519524SHoward Hinnant _ForwardIterator __i = __first; 27053e519524SHoward Hinnant if (++__first == __last) 27063e519524SHoward Hinnant { 27073e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27083e519524SHoward Hinnant __result.first = __i; 27093e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27103e519524SHoward Hinnant __result.second = __i; 27113e519524SHoward Hinnant break; 27123e519524SHoward Hinnant } 27133e519524SHoward Hinnant else 27143e519524SHoward Hinnant { 27153e519524SHoward Hinnant if (__comp(*__first, *__i)) 27163e519524SHoward Hinnant { 27173e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27183e519524SHoward Hinnant __result.first = __first; 27193e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27203e519524SHoward Hinnant __result.second = __i; 27213e519524SHoward Hinnant } 27223e519524SHoward Hinnant else 27233e519524SHoward Hinnant { 27243e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27253e519524SHoward Hinnant __result.first = __i; 27263e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27273e519524SHoward Hinnant __result.second = __first; 27283e519524SHoward Hinnant } 27293e519524SHoward Hinnant } 27303e519524SHoward Hinnant } 27313e519524SHoward Hinnant } 27323e519524SHoward Hinnant } 27333e519524SHoward Hinnant return __result; 27343e519524SHoward Hinnant} 27353e519524SHoward Hinnant 27363e519524SHoward Hinnanttemplate <class _ForwardIterator> 27370b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27383e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27393e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27403e519524SHoward Hinnant{ 27419d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27429d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27433e519524SHoward Hinnant} 27443e519524SHoward Hinnant 27454eb27b79SHoward Hinnant// minmax 27464eb27b79SHoward Hinnant 27474eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27494eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27504eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27514eb27b79SHoward Hinnant{ 27524eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27534eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27544eb27b79SHoward Hinnant} 27554eb27b79SHoward Hinnant 27564eb27b79SHoward Hinnanttemplate<class _Tp> 27579d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27584eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27594eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27604eb27b79SHoward Hinnant{ 2761ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27624eb27b79SHoward Hinnant} 27634eb27b79SHoward Hinnant 2764ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 276554976f26SHoward Hinnant 27664eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27679d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27684eb27b79SHoward Hinnantpair<_Tp, _Tp> 27694eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27704eb27b79SHoward Hinnant{ 27719d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27729d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27739d67c6d5SMarshall Clow _Iter __last = __t.end(); 27749d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27759d67c6d5SMarshall Clow 27769d67c6d5SMarshall Clow ++__first; 27779d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27789d67c6d5SMarshall Clow { 27799d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27809d67c6d5SMarshall Clow __result.first = *__first; 27819d67c6d5SMarshall Clow else 27829d67c6d5SMarshall Clow __result.second = *__first; 27839d67c6d5SMarshall Clow ++__first; 27849d67c6d5SMarshall Clow } 27859d67c6d5SMarshall Clow 27869d67c6d5SMarshall Clow while (__first != __last) 27879d67c6d5SMarshall Clow { 27889d67c6d5SMarshall Clow _Tp __prev = *__first++; 2789002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2790002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2791002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27929d67c6d5SMarshall Clow } 27939d67c6d5SMarshall Clow else { 2794002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2795002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27969d67c6d5SMarshall Clow } 27979d67c6d5SMarshall Clow 27989d67c6d5SMarshall Clow __first++; 27999d67c6d5SMarshall Clow } 28009d67c6d5SMarshall Clow return __result; 28019d67c6d5SMarshall Clow} 28029d67c6d5SMarshall Clow 28039d67c6d5SMarshall Clowtemplate<class _Tp> 28049d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28059d67c6d5SMarshall Clowpair<_Tp, _Tp> 28069d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28079d67c6d5SMarshall Clow{ 28089d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28094eb27b79SHoward Hinnant} 28104eb27b79SHoward Hinnant 2811ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 281254976f26SHoward Hinnant 28133e519524SHoward Hinnant// random_shuffle 28143e519524SHoward Hinnant 2815f9d540b0SHoward Hinnant// __independent_bits_engine 2816f9d540b0SHoward Hinnant 2817c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2818f9d540b0SHoward Hinnantstruct __log2_imp 28193e519524SHoward Hinnant{ 2820c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2821c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28223e519524SHoward Hinnant}; 28233e519524SHoward Hinnant 2824c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2825c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28263e519524SHoward Hinnant{ 2827f9d540b0SHoward Hinnant static const size_t value = 0; 28283e519524SHoward Hinnant}; 28293e519524SHoward Hinnant 2830c003db1fSHoward Hinnanttemplate <size_t _Rp> 2831c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28323e519524SHoward Hinnant{ 2833c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28343e519524SHoward Hinnant}; 28353e519524SHoward Hinnant 283689918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2837f9d540b0SHoward Hinnantstruct __log2 28383e519524SHoward Hinnant{ 2839c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 284089918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28413e519524SHoward Hinnant}; 28423e519524SHoward Hinnant 2843f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2844f9d540b0SHoward Hinnantclass __independent_bits_engine 28453e519524SHoward Hinnant{ 2846f9d540b0SHoward Hinnantpublic: 2847f9d540b0SHoward Hinnant // types 2848f9d540b0SHoward Hinnant typedef _UIntType result_type; 2849f9d540b0SHoward Hinnant 2850f9d540b0SHoward Hinnantprivate: 2851f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2852f9d540b0SHoward Hinnant typedef typename conditional 2853f9d540b0SHoward Hinnant < 2854f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2855f9d540b0SHoward Hinnant result_type, 2856f9d540b0SHoward Hinnant _Engine_result_type 2857f9d540b0SHoward Hinnant >::type _Working_result_type; 2858f9d540b0SHoward Hinnant 2859f9d540b0SHoward Hinnant _Engine& __e_; 2860f9d540b0SHoward Hinnant size_t __w_; 2861f9d540b0SHoward Hinnant size_t __w0_; 2862f9d540b0SHoward Hinnant size_t __n_; 2863f9d540b0SHoward Hinnant size_t __n0_; 2864f9d540b0SHoward Hinnant _Working_result_type __y0_; 2865f9d540b0SHoward Hinnant _Working_result_type __y1_; 2866f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2867f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2868f9d540b0SHoward Hinnant 2869ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2870c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2871f9d540b0SHoward Hinnant + _Working_result_type(1); 2872e386b7b3SHoward Hinnant#else 2873e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2874e386b7b3SHoward Hinnant + _Working_result_type(1); 2875e386b7b3SHoward Hinnant#endif 2876e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2877e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2878e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2879f9d540b0SHoward Hinnant 2880f9d540b0SHoward Hinnantpublic: 2881f9d540b0SHoward Hinnant // constructors and seeding functions 2882f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2883f9d540b0SHoward Hinnant 2884f9d540b0SHoward Hinnant // generating functions 2885c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2886f9d540b0SHoward Hinnant 2887f9d540b0SHoward Hinnantprivate: 288808bba64aSMarshall Clow result_type __eval(false_type); 288908bba64aSMarshall Clow result_type __eval(true_type); 2890f9d540b0SHoward Hinnant}; 2891f9d540b0SHoward Hinnant 2892f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2893f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2894f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2895f9d540b0SHoward Hinnant : __e_(__e), 2896f9d540b0SHoward Hinnant __w_(__w) 2897f9d540b0SHoward Hinnant{ 2898f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2899f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2900c003db1fSHoward Hinnant if (_Rp == 0) 2901c003db1fSHoward Hinnant __y0_ = _Rp; 2902f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2903c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2904f9d540b0SHoward Hinnant else 2905f9d540b0SHoward Hinnant __y0_ = 0; 2906c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2907f9d540b0SHoward Hinnant { 2908f9d540b0SHoward Hinnant ++__n_; 2909f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2910f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2911c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2912f9d540b0SHoward Hinnant else 2913f9d540b0SHoward Hinnant __y0_ = 0; 2914f9d540b0SHoward Hinnant } 2915f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2916f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2917c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2918f9d540b0SHoward Hinnant else 2919f9d540b0SHoward Hinnant __y1_ = 0; 2920f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2921f9d540b0SHoward Hinnant _Engine_result_type(0); 2922f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2923f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2924f9d540b0SHoward Hinnant _Engine_result_type(~0); 29253e519524SHoward Hinnant} 29263e519524SHoward Hinnant 2927f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2928f9d540b0SHoward Hinnantinline 2929f9d540b0SHoward Hinnant_UIntType 293008bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29313e519524SHoward Hinnant{ 2932f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29333e519524SHoward Hinnant} 29343e519524SHoward Hinnant 2935f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2936f9d540b0SHoward Hinnant_UIntType 293708bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29383e519524SHoward Hinnant{ 29395beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2940c003db1fSHoward Hinnant result_type _Sp = 0; 2941f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2942f9d540b0SHoward Hinnant { 2943f9d540b0SHoward Hinnant _Engine_result_type __u; 29443e519524SHoward Hinnant do 2945f9d540b0SHoward Hinnant { 2946f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2947f9d540b0SHoward Hinnant } while (__u >= __y0_); 29485beb2c3aSMarshall Clow if (__w0_ < _WRt) 2949c003db1fSHoward Hinnant _Sp <<= __w0_; 2950f9d540b0SHoward Hinnant else 2951c003db1fSHoward Hinnant _Sp = 0; 2952c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2953f9d540b0SHoward Hinnant } 2954f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2955f9d540b0SHoward Hinnant { 2956f9d540b0SHoward Hinnant _Engine_result_type __u; 2957f9d540b0SHoward Hinnant do 2958f9d540b0SHoward Hinnant { 2959f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2960f9d540b0SHoward Hinnant } while (__u >= __y1_); 29615beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2962c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2963f9d540b0SHoward Hinnant else 2964c003db1fSHoward Hinnant _Sp = 0; 2965c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2966f9d540b0SHoward Hinnant } 2967c003db1fSHoward Hinnant return _Sp; 29683e519524SHoward Hinnant} 29693e519524SHoward Hinnant 2970f9d540b0SHoward Hinnant// uniform_int_distribution 29713e519524SHoward Hinnant 2972f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2973f9d540b0SHoward Hinnantclass uniform_int_distribution 29743e519524SHoward Hinnant{ 2975f9d540b0SHoward Hinnantpublic: 2976f9d540b0SHoward Hinnant // types 2977f9d540b0SHoward Hinnant typedef _IntType result_type; 2978f9d540b0SHoward Hinnant 2979f9d540b0SHoward Hinnant class param_type 2980f9d540b0SHoward Hinnant { 2981f9d540b0SHoward Hinnant result_type __a_; 2982f9d540b0SHoward Hinnant result_type __b_; 2983f9d540b0SHoward Hinnant public: 2984f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2985f9d540b0SHoward Hinnant 2986f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2987f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2988f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2989f9d540b0SHoward Hinnant 2990f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2991f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2992f9d540b0SHoward Hinnant 2993f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2994f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2995f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2996f9d540b0SHoward Hinnant {return !(__x == __y);} 29973e519524SHoward Hinnant }; 29983e519524SHoward Hinnant 2999f9d540b0SHoward Hinnantprivate: 3000f9d540b0SHoward Hinnant param_type __p_; 30013e519524SHoward Hinnant 3002f9d540b0SHoward Hinnantpublic: 3003f9d540b0SHoward Hinnant // constructors and reset functions 3004f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3005f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3006f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3007f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3008f9d540b0SHoward Hinnant void reset() {} 3009f9d540b0SHoward Hinnant 3010f9d540b0SHoward Hinnant // generating functions 3011f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3012f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3013f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3014f9d540b0SHoward Hinnant 3015f9d540b0SHoward Hinnant // property functions 3016f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3017f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3018f9d540b0SHoward Hinnant 3019f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3020f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3021f9d540b0SHoward Hinnant 3022f9d540b0SHoward Hinnant result_type min() const {return a();} 3023f9d540b0SHoward Hinnant result_type max() const {return b();} 3024f9d540b0SHoward Hinnant 3025f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3026f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3027f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3028f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3029f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3030f9d540b0SHoward Hinnant {return !(__x == __y);} 30313e519524SHoward Hinnant}; 30323e519524SHoward Hinnant 3033f9d540b0SHoward Hinnanttemplate<class _IntType> 3034f9d540b0SHoward Hinnanttemplate<class _URNG> 3035f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3036f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30373e519524SHoward Hinnant{ 3038f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3039f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3040c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3041c003db1fSHoward Hinnant if (_Rp == 1) 3042f9d540b0SHoward Hinnant return __p.a(); 3043f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3044f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3045c003db1fSHoward Hinnant if (_Rp == 0) 3046f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3047c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3048a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3049f9d540b0SHoward Hinnant ++__w; 3050f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3051f9d540b0SHoward Hinnant _UIntType __u; 3052f9d540b0SHoward Hinnant do 30533e519524SHoward Hinnant { 3054f9d540b0SHoward Hinnant __u = __e(); 3055c003db1fSHoward Hinnant } while (__u >= _Rp); 3056f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30573e519524SHoward Hinnant} 3058f9d540b0SHoward Hinnant 305966f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 306066f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3061f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3062f9d540b0SHoward Hinnant 3063f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3064f9d540b0SHoward Hinnant 3065f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30663e519524SHoward Hinnant{ 3067f9d540b0SHoward Hinnant static unsigned __c_; 3068f9d540b0SHoward Hinnant 3069f9d540b0SHoward Hinnant __rs_default(); 3070f9d540b0SHoward Hinnantpublic: 3071b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3072f9d540b0SHoward Hinnant 3073f9d540b0SHoward Hinnant static const result_type _Min = 0; 3074f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3075f9d540b0SHoward Hinnant 3076f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3077f9d540b0SHoward Hinnant ~__rs_default(); 3078f9d540b0SHoward Hinnant 3079f9d540b0SHoward Hinnant result_type operator()(); 3080f9d540b0SHoward Hinnant 3081788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3082788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3083f9d540b0SHoward Hinnant 3084f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3085f9d540b0SHoward Hinnant}; 3086f9d540b0SHoward Hinnant 3087f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30883e519524SHoward Hinnant 30893e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30903e519524SHoward Hinnantvoid 30913e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30923e519524SHoward Hinnant{ 30933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3094c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3095c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30963e519524SHoward Hinnant difference_type __d = __last - __first; 30973e519524SHoward Hinnant if (__d > 1) 30983e519524SHoward Hinnant { 3099c003db1fSHoward Hinnant _Dp __uid; 3100f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3101f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3102007b26beSHoward Hinnant { 3103c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3104007b26beSHoward Hinnant if (__i != difference_type(0)) 3105007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3106007b26beSHoward Hinnant } 31073e519524SHoward Hinnant } 31083e519524SHoward Hinnant} 31093e519524SHoward Hinnant 31103e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31113e519524SHoward Hinnantvoid 31123e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3113ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31143e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31153e519524SHoward Hinnant#else 31163e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31173e519524SHoward Hinnant#endif 31183e519524SHoward Hinnant{ 31193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31203e519524SHoward Hinnant difference_type __d = __last - __first; 31213e519524SHoward Hinnant if (__d > 1) 31223e519524SHoward Hinnant { 31233e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3124007b26beSHoward Hinnant { 3125007b26beSHoward Hinnant difference_type __i = __rand(__d); 3126007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3127007b26beSHoward Hinnant } 31283e519524SHoward Hinnant } 31293e519524SHoward Hinnant} 31300f37a410SMarshall Clow#endif 31313e519524SHoward Hinnant 3132e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3133e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3134e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3135e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 313642bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3137e7154709SEric Fiselier _Distance __n, 3138e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3139e7154709SEric Fiselier input_iterator_tag) { 3140e7154709SEric Fiselier 3141e7154709SEric Fiselier _Distance __k = 0; 3142e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 314342bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3144e7154709SEric Fiselier _Distance __sz = __k; 3145e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3146e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3147e7154709SEric Fiselier if (__r < __sz) 314842bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3149e7154709SEric Fiselier } 315042bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3151e7154709SEric Fiselier} 3152e7154709SEric Fiselier 3153e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3154e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3155e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3156e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 315742bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3158e7154709SEric Fiselier _Distance __n, 3159e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3160e7154709SEric Fiselier forward_iterator_tag) { 3161e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3162e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3163e7154709SEric Fiselier _Distance __r = 3164e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3165e7154709SEric Fiselier if (__r < __n) { 316642bfedd9SAlexander Richardson *__output_iter++ = *__first; 3167e7154709SEric Fiselier --__n; 3168e7154709SEric Fiselier } 3169e7154709SEric Fiselier } 317042bfedd9SAlexander Richardson return __output_iter; 3171e7154709SEric Fiselier} 3172e7154709SEric Fiselier 3173e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3174e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3175e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3176e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 317742bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3178e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3179e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3180e7154709SEric Fiselier _PopCategory; 3181e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3182e7154709SEric Fiselier _Difference; 3183e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3184e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3185e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3186e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3187e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3188e7154709SEric Fiselier return _VSTD::__sample( 318942bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3190e7154709SEric Fiselier __g, _PopCategory()); 3191e7154709SEric Fiselier} 3192e7154709SEric Fiselier 3193e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3194e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3195e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3196e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3197e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 319842bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3199e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 320042bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3201e7154709SEric Fiselier} 3202e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3203e7154709SEric Fiselier 3204f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3205f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3206ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3207fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3208fb340102SHoward Hinnant#else 3209f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3210fb340102SHoward Hinnant#endif 3211f9d540b0SHoward Hinnant{ 3212f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3213c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3214c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3215f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3216f9d540b0SHoward Hinnant if (__d > 1) 3217f9d540b0SHoward Hinnant { 3218c003db1fSHoward Hinnant _Dp __uid; 3219f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3220007b26beSHoward Hinnant { 3221c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3222007b26beSHoward Hinnant if (__i != difference_type(0)) 3223007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3224007b26beSHoward Hinnant } 3225f9d540b0SHoward Hinnant } 3226f9d540b0SHoward Hinnant} 3227f9d540b0SHoward Hinnant 32283e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 322949c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 bool 32303e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32313e519524SHoward Hinnant{ 32323e519524SHoward Hinnant for (; __first != __last; ++__first) 32333e519524SHoward Hinnant if (!__pred(*__first)) 32343e519524SHoward Hinnant break; 3235b9595b79SMarshall Clow if ( __first == __last ) 3236b9595b79SMarshall Clow return true; 3237b9595b79SMarshall Clow ++__first; 32383e519524SHoward Hinnant for (; __first != __last; ++__first) 32393e519524SHoward Hinnant if (__pred(*__first)) 32403e519524SHoward Hinnant return false; 32413e519524SHoward Hinnant return true; 32423e519524SHoward Hinnant} 32433e519524SHoward Hinnant 32443e519524SHoward Hinnant// partition 32453e519524SHoward Hinnant 32463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32473e519524SHoward Hinnant_ForwardIterator 32483e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32493e519524SHoward Hinnant{ 32503e519524SHoward Hinnant while (true) 32513e519524SHoward Hinnant { 32523e519524SHoward Hinnant if (__first == __last) 32533e519524SHoward Hinnant return __first; 32543e519524SHoward Hinnant if (!__pred(*__first)) 32553e519524SHoward Hinnant break; 32563e519524SHoward Hinnant ++__first; 32573e519524SHoward Hinnant } 32583e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32593e519524SHoward Hinnant { 32603e519524SHoward Hinnant if (__pred(*__p)) 32613e519524SHoward Hinnant { 32623e519524SHoward Hinnant swap(*__first, *__p); 32633e519524SHoward Hinnant ++__first; 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant } 32663e519524SHoward Hinnant return __first; 32673e519524SHoward Hinnant} 32683e519524SHoward Hinnant 32693e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32703e519524SHoward Hinnant_BidirectionalIterator 32713e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32723e519524SHoward Hinnant bidirectional_iterator_tag) 32733e519524SHoward Hinnant{ 32743e519524SHoward Hinnant while (true) 32753e519524SHoward Hinnant { 32763e519524SHoward Hinnant while (true) 32773e519524SHoward Hinnant { 32783e519524SHoward Hinnant if (__first == __last) 32793e519524SHoward Hinnant return __first; 32803e519524SHoward Hinnant if (!__pred(*__first)) 32813e519524SHoward Hinnant break; 32823e519524SHoward Hinnant ++__first; 32833e519524SHoward Hinnant } 32843e519524SHoward Hinnant do 32853e519524SHoward Hinnant { 32863e519524SHoward Hinnant if (__first == --__last) 32873e519524SHoward Hinnant return __first; 32883e519524SHoward Hinnant } while (!__pred(*__last)); 32893e519524SHoward Hinnant swap(*__first, *__last); 32903e519524SHoward Hinnant ++__first; 32913e519524SHoward Hinnant } 32923e519524SHoward Hinnant} 32933e519524SHoward Hinnant 32943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32963e519524SHoward Hinnant_ForwardIterator 32973e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32983e519524SHoward Hinnant{ 3299ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33003e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33013e519524SHoward Hinnant} 33023e519524SHoward Hinnant 33033e519524SHoward Hinnant// partition_copy 33043e519524SHoward Hinnant 33053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33063e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33073e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33083e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33093e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33103e519524SHoward Hinnant _Predicate __pred) 33113e519524SHoward Hinnant{ 33123e519524SHoward Hinnant for (; __first != __last; ++__first) 33133e519524SHoward Hinnant { 33143e519524SHoward Hinnant if (__pred(*__first)) 33153e519524SHoward Hinnant { 33163e519524SHoward Hinnant *__out_true = *__first; 33173e519524SHoward Hinnant ++__out_true; 33183e519524SHoward Hinnant } 33193e519524SHoward Hinnant else 33203e519524SHoward Hinnant { 33213e519524SHoward Hinnant *__out_false = *__first; 33223e519524SHoward Hinnant ++__out_false; 33233e519524SHoward Hinnant } 33243e519524SHoward Hinnant } 33253e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33263e519524SHoward Hinnant} 33273e519524SHoward Hinnant 33283e519524SHoward Hinnant// partition_point 33293e519524SHoward Hinnant 33303e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 33313e519524SHoward Hinnant_ForwardIterator 33323e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33333e519524SHoward Hinnant{ 33343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3335ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33363e519524SHoward Hinnant while (__len != 0) 33373e519524SHoward Hinnant { 33383e519524SHoward Hinnant difference_type __l2 = __len / 2; 33393e519524SHoward Hinnant _ForwardIterator __m = __first; 3340ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33413e519524SHoward Hinnant if (__pred(*__m)) 33423e519524SHoward Hinnant { 33433e519524SHoward Hinnant __first = ++__m; 33443e519524SHoward Hinnant __len -= __l2 + 1; 33453e519524SHoward Hinnant } 33463e519524SHoward Hinnant else 33473e519524SHoward Hinnant __len = __l2; 33483e519524SHoward Hinnant } 33493e519524SHoward Hinnant return __first; 33503e519524SHoward Hinnant} 33513e519524SHoward Hinnant 33523e519524SHoward Hinnant// stable_partition 33533e519524SHoward Hinnant 33543e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33553e519524SHoward Hinnant_ForwardIterator 33563e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33573e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33583e519524SHoward Hinnant{ 33593e519524SHoward Hinnant // *__first is known to be false 33603e519524SHoward Hinnant // __len >= 1 33613e519524SHoward Hinnant if (__len == 1) 33623e519524SHoward Hinnant return __first; 33633e519524SHoward Hinnant if (__len == 2) 33643e519524SHoward Hinnant { 33653e519524SHoward Hinnant _ForwardIterator __m = __first; 33663e519524SHoward Hinnant if (__pred(*++__m)) 33673e519524SHoward Hinnant { 33683e519524SHoward Hinnant swap(*__first, *__m); 33693e519524SHoward Hinnant return __m; 33703e519524SHoward Hinnant } 33713e519524SHoward Hinnant return __first; 33723e519524SHoward Hinnant } 33733e519524SHoward Hinnant if (__len <= __p.second) 33743e519524SHoward Hinnant { // The buffer is big enough to use 33753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33763e519524SHoward Hinnant __destruct_n __d(0); 33773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33783e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33793e519524SHoward Hinnant // Update __first to always point to the end of the trues 33803e519524SHoward Hinnant value_type* __t = __p.first; 3381ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33823e519524SHoward Hinnant __d.__incr((value_type*)0); 33833e519524SHoward Hinnant ++__t; 33843e519524SHoward Hinnant _ForwardIterator __i = __first; 33853e519524SHoward Hinnant while (++__i != __last) 33863e519524SHoward Hinnant { 33873e519524SHoward Hinnant if (__pred(*__i)) 33883e519524SHoward Hinnant { 3389ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33903e519524SHoward Hinnant ++__first; 33913e519524SHoward Hinnant } 33923e519524SHoward Hinnant else 33933e519524SHoward Hinnant { 3394ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33953e519524SHoward Hinnant __d.__incr((value_type*)0); 33963e519524SHoward Hinnant ++__t; 33973e519524SHoward Hinnant } 33983e519524SHoward Hinnant } 33993e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34003e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34013e519524SHoward Hinnant __i = __first; 34023e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3403ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34043e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34053e519524SHoward Hinnant return __first; 34063e519524SHoward Hinnant } 34073e519524SHoward Hinnant // Else not enough buffer, do in place 34083e519524SHoward Hinnant // __len >= 3 34093e519524SHoward Hinnant _ForwardIterator __m = __first; 34103e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3411ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34123e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34133e519524SHoward Hinnant // F????????????????? 34143e519524SHoward Hinnant // f m l 34153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34163e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34173e519524SHoward Hinnant // TTTFFFFF?????????? 34183e519524SHoward Hinnant // f ff m l 34193e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34203e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34213e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34223e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34233e519524SHoward Hinnant while (__pred(*__m1)) 34243e519524SHoward Hinnant { 34253e519524SHoward Hinnant if (++__m1 == __last) 34263e519524SHoward Hinnant goto __second_half_done; 34273e519524SHoward Hinnant --__len_half; 34283e519524SHoward Hinnant } 34293e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34303e519524SHoward Hinnant // f ff m m1 l 34313e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34323e519524SHoward Hinnant__second_half_done: 34333e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34343e519524SHoward Hinnant // f ff m sf l 3435ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34363e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34373e519524SHoward Hinnant // | 34383e519524SHoward Hinnant} 34393e519524SHoward Hinnant 34403e519524SHoward Hinnantstruct __return_temporary_buffer 34413e519524SHoward Hinnant{ 34423e519524SHoward Hinnant template <class _Tp> 3443ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34443e519524SHoward Hinnant}; 34453e519524SHoward Hinnant 34463e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34473e519524SHoward Hinnant_ForwardIterator 34483e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34493e519524SHoward Hinnant forward_iterator_tag) 34503e519524SHoward Hinnant{ 34513e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34523e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34533e519524SHoward Hinnant while (true) 34543e519524SHoward Hinnant { 34553e519524SHoward Hinnant if (__first == __last) 34563e519524SHoward Hinnant return __first; 34573e519524SHoward Hinnant if (!__pred(*__first)) 34583e519524SHoward Hinnant break; 34593e519524SHoward Hinnant ++__first; 34603e519524SHoward Hinnant } 34613e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34623e519524SHoward Hinnant // *__first is known to be false 34633e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3465ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34663e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34673e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34683e519524SHoward Hinnant if (__len >= __alloc_limit) 34693e519524SHoward Hinnant { 3470ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34713e519524SHoward Hinnant __h.reset(__p.first); 34723e519524SHoward Hinnant } 34733e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34743e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34753e519524SHoward Hinnant} 34763e519524SHoward Hinnant 34773e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34783e519524SHoward Hinnant_BidirectionalIterator 34793e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34803e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34813e519524SHoward Hinnant{ 34823e519524SHoward Hinnant // *__first is known to be false 34833e519524SHoward Hinnant // *__last is known to be true 34843e519524SHoward Hinnant // __len >= 2 34853e519524SHoward Hinnant if (__len == 2) 34863e519524SHoward Hinnant { 34873e519524SHoward Hinnant swap(*__first, *__last); 34883e519524SHoward Hinnant return __last; 34893e519524SHoward Hinnant } 34903e519524SHoward Hinnant if (__len == 3) 34913e519524SHoward Hinnant { 34923e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34933e519524SHoward Hinnant if (__pred(*++__m)) 34943e519524SHoward Hinnant { 34953e519524SHoward Hinnant swap(*__first, *__m); 34963e519524SHoward Hinnant swap(*__m, *__last); 34973e519524SHoward Hinnant return __last; 34983e519524SHoward Hinnant } 34993e519524SHoward Hinnant swap(*__m, *__last); 35003e519524SHoward Hinnant swap(*__first, *__m); 35013e519524SHoward Hinnant return __m; 35023e519524SHoward Hinnant } 35033e519524SHoward Hinnant if (__len <= __p.second) 35043e519524SHoward Hinnant { // The buffer is big enough to use 35053e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35063e519524SHoward Hinnant __destruct_n __d(0); 35073e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35083e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35093e519524SHoward Hinnant // Update __first to always point to the end of the trues 35103e519524SHoward Hinnant value_type* __t = __p.first; 3511ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35123e519524SHoward Hinnant __d.__incr((value_type*)0); 35133e519524SHoward Hinnant ++__t; 35143e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35153e519524SHoward Hinnant while (++__i != __last) 35163e519524SHoward Hinnant { 35173e519524SHoward Hinnant if (__pred(*__i)) 35183e519524SHoward Hinnant { 3519ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35203e519524SHoward Hinnant ++__first; 35213e519524SHoward Hinnant } 35223e519524SHoward Hinnant else 35233e519524SHoward Hinnant { 3524ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35253e519524SHoward Hinnant __d.__incr((value_type*)0); 35263e519524SHoward Hinnant ++__t; 35273e519524SHoward Hinnant } 35283e519524SHoward Hinnant } 35293e519524SHoward Hinnant // move *__last, known to be true 3530ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35313e519524SHoward Hinnant __i = ++__first; 35323e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35333e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35343e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3535ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35363e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35373e519524SHoward Hinnant return __first; 35383e519524SHoward Hinnant } 35393e519524SHoward Hinnant // Else not enough buffer, do in place 35403e519524SHoward Hinnant // __len >= 4 35413e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35423e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3543ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35443e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35453e519524SHoward Hinnant // F????????????????T 35463e519524SHoward Hinnant // f m l 35473e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35483e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35493e519524SHoward Hinnant _Distance __len_half = __len2; 35503e519524SHoward Hinnant while (!__pred(*--__m1)) 35513e519524SHoward Hinnant { 35523e519524SHoward Hinnant if (__m1 == __first) 35533e519524SHoward Hinnant goto __first_half_done; 35543e519524SHoward Hinnant --__len_half; 35553e519524SHoward Hinnant } 35563e519524SHoward Hinnant // F???TFFF?????????T 35573e519524SHoward Hinnant // f m1 m l 35583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35593e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35603e519524SHoward Hinnant__first_half_done: 35613e519524SHoward Hinnant // TTTFFFFF?????????T 35623e519524SHoward Hinnant // f ff m l 35633e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35643e519524SHoward Hinnant __m1 = __m; 35653e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35663e519524SHoward Hinnant ++__second_false; 35673e519524SHoward Hinnant __len_half = __len - __len2; 35683e519524SHoward Hinnant while (__pred(*__m1)) 35693e519524SHoward Hinnant { 35703e519524SHoward Hinnant if (++__m1 == __last) 35713e519524SHoward Hinnant goto __second_half_done; 35723e519524SHoward Hinnant --__len_half; 35733e519524SHoward Hinnant } 35743e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35753e519524SHoward Hinnant // f ff m m1 l 35763e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35773e519524SHoward Hinnant__second_half_done: 35783e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35793e519524SHoward Hinnant // f ff m sf l 3580ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35813e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35823e519524SHoward Hinnant // | 35833e519524SHoward Hinnant} 35843e519524SHoward Hinnant 35853e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35863e519524SHoward Hinnant_BidirectionalIterator 35873e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35883e519524SHoward Hinnant bidirectional_iterator_tag) 35893e519524SHoward Hinnant{ 35903e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35913e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35923e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35933e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35943e519524SHoward Hinnant while (true) 35953e519524SHoward Hinnant { 35963e519524SHoward Hinnant if (__first == __last) 35973e519524SHoward Hinnant return __first; 35983e519524SHoward Hinnant if (!__pred(*__first)) 35993e519524SHoward Hinnant break; 36003e519524SHoward Hinnant ++__first; 36013e519524SHoward Hinnant } 36023e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36033e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36043e519524SHoward Hinnant do 36053e519524SHoward Hinnant { 36063e519524SHoward Hinnant if (__first == --__last) 36073e519524SHoward Hinnant return __first; 36083e519524SHoward Hinnant } while (!__pred(*__last)); 36093e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36103e519524SHoward Hinnant // *__first is known to be false 36113e519524SHoward Hinnant // *__last is known to be true 36123e519524SHoward Hinnant // __len >= 2 3613ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36143e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36153e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36163e519524SHoward Hinnant if (__len >= __alloc_limit) 36173e519524SHoward Hinnant { 3618ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36193e519524SHoward Hinnant __h.reset(__p.first); 36203e519524SHoward Hinnant } 36213e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36223e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36233e519524SHoward Hinnant} 36243e519524SHoward Hinnant 36253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36273e519524SHoward Hinnant_ForwardIterator 36283e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36293e519524SHoward Hinnant{ 36303e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36313e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36323e519524SHoward Hinnant} 36333e519524SHoward Hinnant 36343e519524SHoward Hinnant// is_sorted_until 36353e519524SHoward Hinnant 36363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 363749c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator 36383e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36393e519524SHoward Hinnant{ 36403e519524SHoward Hinnant if (__first != __last) 36413e519524SHoward Hinnant { 36423e519524SHoward Hinnant _ForwardIterator __i = __first; 36433e519524SHoward Hinnant while (++__i != __last) 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant if (__comp(*__i, *__first)) 36463e519524SHoward Hinnant return __i; 36473e519524SHoward Hinnant __first = __i; 36483e519524SHoward Hinnant } 36493e519524SHoward Hinnant } 36503e519524SHoward Hinnant return __last; 36513e519524SHoward Hinnant} 36523e519524SHoward Hinnant 36533e519524SHoward Hinnanttemplate<class _ForwardIterator> 365449c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36553e519524SHoward Hinnant_ForwardIterator 36563e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36573e519524SHoward Hinnant{ 3658ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36593e519524SHoward Hinnant} 36603e519524SHoward Hinnant 36613e519524SHoward Hinnant// is_sorted 36623e519524SHoward Hinnant 36633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 366449c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36653e519524SHoward Hinnantbool 36663e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36673e519524SHoward Hinnant{ 3668ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36693e519524SHoward Hinnant} 36703e519524SHoward Hinnant 36713e519524SHoward Hinnanttemplate<class _ForwardIterator> 367249c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 36733e519524SHoward Hinnantbool 36743e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36753e519524SHoward Hinnant{ 3676ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36773e519524SHoward Hinnant} 36783e519524SHoward Hinnant 36793e519524SHoward Hinnant// sort 36803e519524SHoward Hinnant 36813e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36823e519524SHoward Hinnant 36833e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36843e519524SHoward Hinnantunsigned 36853e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36863e519524SHoward Hinnant{ 36873e519524SHoward Hinnant unsigned __r = 0; 36883e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36893e519524SHoward Hinnant { 36903e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36913e519524SHoward Hinnant return __r; // x <= y && y <= z 36923e519524SHoward Hinnant // x <= y && y > z 36933e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36943e519524SHoward Hinnant __r = 1; 36953e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36963e519524SHoward Hinnant { 36973e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36983e519524SHoward Hinnant __r = 2; 36993e519524SHoward Hinnant } 37003e519524SHoward Hinnant return __r; // x <= y && y < z 37013e519524SHoward Hinnant } 37023e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37033e519524SHoward Hinnant { 37043e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37053e519524SHoward Hinnant __r = 1; 37063e519524SHoward Hinnant return __r; 37073e519524SHoward Hinnant } 37083e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37093e519524SHoward Hinnant __r = 1; // x < y && x <= z 37103e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37113e519524SHoward Hinnant { 37123e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37133e519524SHoward Hinnant __r = 2; 37143e519524SHoward Hinnant } 37153e519524SHoward Hinnant return __r; 37163e519524SHoward Hinnant} // x <= y && y <= z 37173e519524SHoward Hinnant 37183e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37193e519524SHoward Hinnant 37203e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37213e519524SHoward Hinnantunsigned 37223e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37233e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37243e519524SHoward Hinnant{ 37253e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37263e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37273e519524SHoward Hinnant { 37283e519524SHoward Hinnant swap(*__x3, *__x4); 37293e519524SHoward Hinnant ++__r; 37303e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37313e519524SHoward Hinnant { 37323e519524SHoward Hinnant swap(*__x2, *__x3); 37333e519524SHoward Hinnant ++__r; 37343e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37353e519524SHoward Hinnant { 37363e519524SHoward Hinnant swap(*__x1, *__x2); 37373e519524SHoward Hinnant ++__r; 37383e519524SHoward Hinnant } 37393e519524SHoward Hinnant } 37403e519524SHoward Hinnant } 37413e519524SHoward Hinnant return __r; 37423e519524SHoward Hinnant} 37433e519524SHoward Hinnant 37443e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37453e519524SHoward Hinnant 37463e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37473e519524SHoward Hinnantunsigned 37483e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37493e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37503e519524SHoward Hinnant{ 37513e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37523e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37533e519524SHoward Hinnant { 37543e519524SHoward Hinnant swap(*__x4, *__x5); 37553e519524SHoward Hinnant ++__r; 37563e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37573e519524SHoward Hinnant { 37583e519524SHoward Hinnant swap(*__x3, *__x4); 37593e519524SHoward Hinnant ++__r; 37603e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37613e519524SHoward Hinnant { 37623e519524SHoward Hinnant swap(*__x2, *__x3); 37633e519524SHoward Hinnant ++__r; 37643e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37653e519524SHoward Hinnant { 37663e519524SHoward Hinnant swap(*__x1, *__x2); 37673e519524SHoward Hinnant ++__r; 37683e519524SHoward Hinnant } 37693e519524SHoward Hinnant } 37703e519524SHoward Hinnant } 37713e519524SHoward Hinnant } 37723e519524SHoward Hinnant return __r; 37733e519524SHoward Hinnant} 37743e519524SHoward Hinnant 37753e519524SHoward Hinnant// Assumes size > 0 37763e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37773e519524SHoward Hinnantvoid 37783e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37793e519524SHoward Hinnant{ 37803e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37813e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37823e519524SHoward Hinnant { 3783ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37843e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37853e519524SHoward Hinnant (__first, __last, __comp); 37863e519524SHoward Hinnant if (__i != __first) 37873e519524SHoward Hinnant swap(*__first, *__i); 37883e519524SHoward Hinnant } 37893e519524SHoward Hinnant} 37903e519524SHoward Hinnant 37913e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37923e519524SHoward Hinnantvoid 37933e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37943e519524SHoward Hinnant{ 37953e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37963e519524SHoward Hinnant if (__first != __last) 37973e519524SHoward Hinnant { 37983e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37993e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38003e519524SHoward Hinnant { 38013e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3802ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38033e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3804ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3805ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38063e519524SHoward Hinnant } 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant} 38093e519524SHoward Hinnant 38103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38113e519524SHoward Hinnantvoid 38123e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38133e519524SHoward Hinnant{ 38143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38153e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38163e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38173e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38183e519524SHoward Hinnant { 38193e519524SHoward Hinnant if (__comp(*__i, *__j)) 38203e519524SHoward Hinnant { 3821ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38223e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38233e519524SHoward Hinnant __j = __i; 38243e519524SHoward Hinnant do 38253e519524SHoward Hinnant { 3826ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38273e519524SHoward Hinnant __j = __k; 38283e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3829ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38303e519524SHoward Hinnant } 38313e519524SHoward Hinnant __j = __i; 38323e519524SHoward Hinnant } 38333e519524SHoward Hinnant} 38343e519524SHoward Hinnant 38353e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38363e519524SHoward Hinnantbool 38373e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38383e519524SHoward Hinnant{ 38393e519524SHoward Hinnant switch (__last - __first) 38403e519524SHoward Hinnant { 38413e519524SHoward Hinnant case 0: 38423e519524SHoward Hinnant case 1: 38433e519524SHoward Hinnant return true; 38443e519524SHoward Hinnant case 2: 38453e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38463e519524SHoward Hinnant swap(*__first, *__last); 38473e519524SHoward Hinnant return true; 38483e519524SHoward Hinnant case 3: 3849ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38503e519524SHoward Hinnant return true; 38513e519524SHoward Hinnant case 4: 3852ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38533e519524SHoward Hinnant return true; 38543e519524SHoward Hinnant case 5: 3855ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38563e519524SHoward Hinnant return true; 38573e519524SHoward Hinnant } 38583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38593e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38603e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38613e519524SHoward Hinnant const unsigned __limit = 8; 38623e519524SHoward Hinnant unsigned __count = 0; 38633e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38643e519524SHoward Hinnant { 38653e519524SHoward Hinnant if (__comp(*__i, *__j)) 38663e519524SHoward Hinnant { 3867ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38683e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38693e519524SHoward Hinnant __j = __i; 38703e519524SHoward Hinnant do 38713e519524SHoward Hinnant { 3872ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38733e519524SHoward Hinnant __j = __k; 38743e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3875ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38763e519524SHoward Hinnant if (++__count == __limit) 38773e519524SHoward Hinnant return ++__i == __last; 38783e519524SHoward Hinnant } 38793e519524SHoward Hinnant __j = __i; 38803e519524SHoward Hinnant } 38813e519524SHoward Hinnant return true; 38823e519524SHoward Hinnant} 38833e519524SHoward Hinnant 38843e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38853e519524SHoward Hinnantvoid 38863e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38873e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38883e519524SHoward Hinnant{ 38893e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38903e519524SHoward Hinnant if (__first1 != __last1) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant __destruct_n __d(0); 38933e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38943e519524SHoward Hinnant value_type* __last2 = __first2; 3895ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38963e519524SHoward Hinnant __d.__incr((value_type*)0); 38973e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38983e519524SHoward Hinnant { 38993e519524SHoward Hinnant value_type* __j2 = __last2; 39003e519524SHoward Hinnant value_type* __i2 = __j2; 39013e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39023e519524SHoward Hinnant { 3903ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39043e519524SHoward Hinnant __d.__incr((value_type*)0); 39053e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3906ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3907ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39083e519524SHoward Hinnant } 39093e519524SHoward Hinnant else 39103e519524SHoward Hinnant { 3911ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39123e519524SHoward Hinnant __d.__incr((value_type*)0); 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant } 39153e519524SHoward Hinnant __h.release(); 39163e519524SHoward Hinnant } 39173e519524SHoward Hinnant} 39183e519524SHoward Hinnant 39193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39203e519524SHoward Hinnantvoid 39213e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39223e519524SHoward Hinnant{ 39233e519524SHoward Hinnant // _Compare is known to be a reference type 39243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3926ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3927ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39283e519524SHoward Hinnant while (true) 39293e519524SHoward Hinnant { 39303e519524SHoward Hinnant __restart: 39313e519524SHoward Hinnant difference_type __len = __last - __first; 39323e519524SHoward Hinnant switch (__len) 39333e519524SHoward Hinnant { 39343e519524SHoward Hinnant case 0: 39353e519524SHoward Hinnant case 1: 39363e519524SHoward Hinnant return; 39373e519524SHoward Hinnant case 2: 39383e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39393e519524SHoward Hinnant swap(*__first, *__last); 39403e519524SHoward Hinnant return; 39413e519524SHoward Hinnant case 3: 3942ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39433e519524SHoward Hinnant return; 39443e519524SHoward Hinnant case 4: 3945ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39463e519524SHoward Hinnant return; 39473e519524SHoward Hinnant case 5: 3948ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39493e519524SHoward Hinnant return; 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant if (__len <= __limit) 39523e519524SHoward Hinnant { 3953ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39543e519524SHoward Hinnant return; 39553e519524SHoward Hinnant } 39563e519524SHoward Hinnant // __len > 5 39573e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39583e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39593e519524SHoward Hinnant --__lm1; 39603e519524SHoward Hinnant unsigned __n_swaps; 39613e519524SHoward Hinnant { 39623e519524SHoward Hinnant difference_type __delta; 39633e519524SHoward Hinnant if (__len >= 1000) 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant __delta = __len/2; 39663e519524SHoward Hinnant __m += __delta; 39673e519524SHoward Hinnant __delta /= 2; 3968ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39693e519524SHoward Hinnant } 39703e519524SHoward Hinnant else 39713e519524SHoward Hinnant { 39723e519524SHoward Hinnant __delta = __len/2; 39733e519524SHoward Hinnant __m += __delta; 3974ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39753e519524SHoward Hinnant } 39763e519524SHoward Hinnant } 39773e519524SHoward Hinnant // *__m is median 39783e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39793e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39803e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39813e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39823e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39833e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39843e519524SHoward Hinnant // Prime the downward search with a guard. 39853e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39863e519524SHoward Hinnant { 39873e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39883e519524SHoward Hinnant // manually guard downward moving __j against __i 39893e519524SHoward Hinnant while (true) 39903e519524SHoward Hinnant { 39913e519524SHoward Hinnant if (__i == --__j) 39923e519524SHoward Hinnant { 39933e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39943e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39953e519524SHoward Hinnant ++__i; // __first + 1 39963e519524SHoward Hinnant __j = __last; 39973e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39983e519524SHoward Hinnant { 39993e519524SHoward Hinnant while (true) 40003e519524SHoward Hinnant { 40013e519524SHoward Hinnant if (__i == __j) 40023e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40033e519524SHoward Hinnant if (__comp(*__first, *__i)) 40043e519524SHoward Hinnant { 40053e519524SHoward Hinnant swap(*__i, *__j); 40063e519524SHoward Hinnant ++__n_swaps; 40073e519524SHoward Hinnant ++__i; 40083e519524SHoward Hinnant break; 40093e519524SHoward Hinnant } 40103e519524SHoward Hinnant ++__i; 40113e519524SHoward Hinnant } 40123e519524SHoward Hinnant } 40133e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40143e519524SHoward Hinnant if (__i == __j) 40153e519524SHoward Hinnant return; 40163e519524SHoward Hinnant while (true) 40173e519524SHoward Hinnant { 40183e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40193e519524SHoward Hinnant ++__i; 40203e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40213e519524SHoward Hinnant ; 40223e519524SHoward Hinnant if (__i >= __j) 40233e519524SHoward Hinnant break; 40243e519524SHoward Hinnant swap(*__i, *__j); 40253e519524SHoward Hinnant ++__n_swaps; 40263e519524SHoward Hinnant ++__i; 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40293e519524SHoward Hinnant // The first part is sorted, sort the secod part 4030ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40313e519524SHoward Hinnant __first = __i; 40323e519524SHoward Hinnant goto __restart; 40333e519524SHoward Hinnant } 40343e519524SHoward Hinnant if (__comp(*__j, *__m)) 40353e519524SHoward Hinnant { 40363e519524SHoward Hinnant swap(*__i, *__j); 40373e519524SHoward Hinnant ++__n_swaps; 40383e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40393e519524SHoward Hinnant } 40403e519524SHoward Hinnant } 40413e519524SHoward Hinnant } 40423e519524SHoward Hinnant // It is known that *__i < *__m 40433e519524SHoward Hinnant ++__i; 40443e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40453e519524SHoward Hinnant // if not yet partitioned... 40463e519524SHoward Hinnant if (__i < __j) 40473e519524SHoward Hinnant { 40483e519524SHoward Hinnant // known that *(__i - 1) < *__m 40493e519524SHoward Hinnant // known that __i <= __m 40503e519524SHoward Hinnant while (true) 40513e519524SHoward Hinnant { 40523e519524SHoward Hinnant // __m still guards upward moving __i 40533e519524SHoward Hinnant while (__comp(*__i, *__m)) 40543e519524SHoward Hinnant ++__i; 40553e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40563e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40573e519524SHoward Hinnant ; 40583e519524SHoward Hinnant if (__i > __j) 40593e519524SHoward Hinnant break; 40603e519524SHoward Hinnant swap(*__i, *__j); 40613e519524SHoward Hinnant ++__n_swaps; 40623e519524SHoward Hinnant // It is known that __m != __j 40633e519524SHoward Hinnant // If __m just moved, follow it 40643e519524SHoward Hinnant if (__m == __i) 40653e519524SHoward Hinnant __m = __j; 40663e519524SHoward Hinnant ++__i; 40673e519524SHoward Hinnant } 40683e519524SHoward Hinnant } 40693e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40703e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40713e519524SHoward Hinnant { 40723e519524SHoward Hinnant swap(*__i, *__m); 40733e519524SHoward Hinnant ++__n_swaps; 40743e519524SHoward Hinnant } 40753e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40763e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40773e519524SHoward Hinnant if (__n_swaps == 0) 40783e519524SHoward Hinnant { 4079ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4080ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40813e519524SHoward Hinnant { 40823e519524SHoward Hinnant if (__fs) 40833e519524SHoward Hinnant return; 40843e519524SHoward Hinnant __last = __i; 40853e519524SHoward Hinnant continue; 40863e519524SHoward Hinnant } 40873e519524SHoward Hinnant else 40883e519524SHoward Hinnant { 40893e519524SHoward Hinnant if (__fs) 40903e519524SHoward Hinnant { 40913e519524SHoward Hinnant __first = ++__i; 40923e519524SHoward Hinnant continue; 40933e519524SHoward Hinnant } 40943e519524SHoward Hinnant } 40953e519524SHoward Hinnant } 40963e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40973e519524SHoward Hinnant if (__i - __first < __last - __i) 40983e519524SHoward Hinnant { 4099ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4100ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41013e519524SHoward Hinnant __first = ++__i; 41023e519524SHoward Hinnant } 41033e519524SHoward Hinnant else 41043e519524SHoward Hinnant { 4105ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4106ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41073e519524SHoward Hinnant __last = __i; 41083e519524SHoward Hinnant } 41093e519524SHoward Hinnant } 41103e519524SHoward Hinnant} 41113e519524SHoward Hinnant 41123e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41153e519524SHoward Hinnantvoid 41163e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41173e519524SHoward Hinnant{ 4118145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41193e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41203e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41213e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4122145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41233e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41243e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4125145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41263e519524SHoward Hinnant} 41273e519524SHoward Hinnant 41283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41303e519524SHoward Hinnantvoid 41313e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41323e519524SHoward Hinnant{ 4133ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41343e519524SHoward Hinnant} 41353e519524SHoward Hinnant 41363e519524SHoward Hinnanttemplate <class _Tp> 41373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41383e519524SHoward Hinnantvoid 41393e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41403e519524SHoward Hinnant{ 4141ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41423e519524SHoward Hinnant} 41433e519524SHoward Hinnant 41443e519524SHoward Hinnanttemplate <class _Tp> 41453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41463e519524SHoward Hinnantvoid 41473e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41483e519524SHoward Hinnant{ 4149ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41503e519524SHoward Hinnant} 41513e519524SHoward Hinnant 4152f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4153f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4154f554add5SHoward Hinnantvoid 4155f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4156f554add5SHoward Hinnant{ 4157f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4158f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4159f554add5SHoward Hinnant} 4160f554add5SHoward Hinnant 4161f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4162f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4163f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4164f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4165f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4166f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4167f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4168f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4169f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4170f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4171f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4172f0544c20SHoward 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>&)) 4173f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4174f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4175f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41763e519524SHoward Hinnant 4177f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4178f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4179f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4180f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4181f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4182f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4183f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4184f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4185f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4186f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4187f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4188f0544c20SHoward 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>&)) 4189f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4190f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4191f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41923e519524SHoward Hinnant 4193f0544c20SHoward 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>&)) 41943e519524SHoward Hinnant 41953e519524SHoward Hinnant// lower_bound 41963e519524SHoward Hinnant 41973e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41983e519524SHoward Hinnant_ForwardIterator 4199e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42003e519524SHoward Hinnant{ 42013e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4202ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42033e519524SHoward Hinnant while (__len != 0) 42043e519524SHoward Hinnant { 42053e519524SHoward Hinnant difference_type __l2 = __len / 2; 42063e519524SHoward Hinnant _ForwardIterator __m = __first; 4207ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4208e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42093e519524SHoward Hinnant { 42103e519524SHoward Hinnant __first = ++__m; 42113e519524SHoward Hinnant __len -= __l2 + 1; 42123e519524SHoward Hinnant } 42133e519524SHoward Hinnant else 42143e519524SHoward Hinnant __len = __l2; 42153e519524SHoward Hinnant } 42163e519524SHoward Hinnant return __first; 42173e519524SHoward Hinnant} 42183e519524SHoward Hinnant 42193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42213e519524SHoward Hinnant_ForwardIterator 4222e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42233e519524SHoward Hinnant{ 4224145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42253e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42263e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4227e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4228145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42293e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4230e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4231145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42323e519524SHoward Hinnant} 42333e519524SHoward Hinnant 42343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42363e519524SHoward Hinnant_ForwardIterator 4237e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42383e519524SHoward Hinnant{ 4239e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42403e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42413e519524SHoward Hinnant} 42423e519524SHoward Hinnant 42433e519524SHoward Hinnant// upper_bound 42443e519524SHoward Hinnant 42453e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42463e519524SHoward Hinnant_ForwardIterator 4247e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42483e519524SHoward Hinnant{ 42493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4250ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42513e519524SHoward Hinnant while (__len != 0) 42523e519524SHoward Hinnant { 42533e519524SHoward Hinnant difference_type __l2 = __len / 2; 42543e519524SHoward Hinnant _ForwardIterator __m = __first; 4255ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4256e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42573e519524SHoward Hinnant __len = __l2; 42583e519524SHoward Hinnant else 42593e519524SHoward Hinnant { 42603e519524SHoward Hinnant __first = ++__m; 42613e519524SHoward Hinnant __len -= __l2 + 1; 42623e519524SHoward Hinnant } 42633e519524SHoward Hinnant } 42643e519524SHoward Hinnant return __first; 42653e519524SHoward Hinnant} 42663e519524SHoward Hinnant 42673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42693e519524SHoward Hinnant_ForwardIterator 4270e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42713e519524SHoward Hinnant{ 4272145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4275e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4276145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4278e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4279145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42803e519524SHoward Hinnant} 42813e519524SHoward Hinnant 42823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42843e519524SHoward Hinnant_ForwardIterator 4285e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42863e519524SHoward Hinnant{ 4287e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42883e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42893e519524SHoward Hinnant} 42903e519524SHoward Hinnant 42913e519524SHoward Hinnant// equal_range 42923e519524SHoward Hinnant 42933e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42943e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4295e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42963e519524SHoward Hinnant{ 42973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4298ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42993e519524SHoward Hinnant while (__len != 0) 43003e519524SHoward Hinnant { 43013e519524SHoward Hinnant difference_type __l2 = __len / 2; 43023e519524SHoward Hinnant _ForwardIterator __m = __first; 4303ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4304e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43053e519524SHoward Hinnant { 43063e519524SHoward Hinnant __first = ++__m; 43073e519524SHoward Hinnant __len -= __l2 + 1; 43083e519524SHoward Hinnant } 4309e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43103e519524SHoward Hinnant { 43113e519524SHoward Hinnant __last = __m; 43123e519524SHoward Hinnant __len = __l2; 43133e519524SHoward Hinnant } 43143e519524SHoward Hinnant else 43153e519524SHoward Hinnant { 43163e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43173e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43183e519524SHoward Hinnant ( 4319e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4320e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43213e519524SHoward Hinnant ); 43223e519524SHoward Hinnant } 43233e519524SHoward Hinnant } 43243e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43253e519524SHoward Hinnant} 43263e519524SHoward Hinnant 43273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43293e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4330e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43313e519524SHoward Hinnant{ 4332145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4335e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4336145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4338e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4339145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43403e519524SHoward Hinnant} 43413e519524SHoward Hinnant 43423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43443e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4345e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43463e519524SHoward Hinnant{ 4347e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43483e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43493e519524SHoward Hinnant} 43503e519524SHoward Hinnant 43513e519524SHoward Hinnant// binary_search 43523e519524SHoward Hinnant 43533e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43553e519524SHoward Hinnantbool 4356e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43573e519524SHoward Hinnant{ 4358e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4359e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43603e519524SHoward Hinnant} 43613e519524SHoward Hinnant 43623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43643e519524SHoward Hinnantbool 4365e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43663e519524SHoward Hinnant{ 4367145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43683e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43693e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4370e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4371145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4373e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4374145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43753e519524SHoward Hinnant} 43763e519524SHoward Hinnant 43773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43793e519524SHoward Hinnantbool 4380e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43813e519524SHoward Hinnant{ 4382e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43833e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43843e519524SHoward Hinnant} 43853e519524SHoward Hinnant 43863e519524SHoward Hinnant// merge 43873e519524SHoward Hinnant 43883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43893e519524SHoward Hinnant_OutputIterator 43903e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43923e519524SHoward Hinnant{ 43933e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43943e519524SHoward Hinnant { 43953e519524SHoward Hinnant if (__first2 == __last2) 4396ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43973e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43983e519524SHoward Hinnant { 43993e519524SHoward Hinnant *__result = *__first2; 44003e519524SHoward Hinnant ++__first2; 44013e519524SHoward Hinnant } 44023e519524SHoward Hinnant else 44033e519524SHoward Hinnant { 44043e519524SHoward Hinnant *__result = *__first1; 44053e519524SHoward Hinnant ++__first1; 44063e519524SHoward Hinnant } 44073e519524SHoward Hinnant } 4408ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44093e519524SHoward Hinnant} 44103e519524SHoward Hinnant 44113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44133e519524SHoward Hinnant_OutputIterator 44143e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44163e519524SHoward Hinnant{ 4417145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4420ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4421145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4423ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4424145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44253e519524SHoward Hinnant} 44263e519524SHoward Hinnant 44273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44293e519524SHoward Hinnant_OutputIterator 44303e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44323e519524SHoward Hinnant{ 44333e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44343e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44353e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44363e519524SHoward Hinnant} 44373e519524SHoward Hinnant 44383e519524SHoward Hinnant// inplace_merge 44393e519524SHoward Hinnant 4440adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4441adfdae18SMarshall Clow class _OutputIterator> 4442adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4443adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4444adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4445adfdae18SMarshall Clow{ 4446adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4447adfdae18SMarshall Clow { 4448adfdae18SMarshall Clow if (__first2 == __last2) 4449adfdae18SMarshall Clow { 4450adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4451adfdae18SMarshall Clow return; 4452adfdae18SMarshall Clow } 4453adfdae18SMarshall Clow 4454adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4455adfdae18SMarshall Clow { 4456adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4457adfdae18SMarshall Clow ++__first2; 4458adfdae18SMarshall Clow } 4459adfdae18SMarshall Clow else 4460adfdae18SMarshall Clow { 4461adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4462adfdae18SMarshall Clow ++__first1; 4463adfdae18SMarshall Clow } 4464adfdae18SMarshall Clow } 4465adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4466adfdae18SMarshall Clow} 4467adfdae18SMarshall Clow 44683e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44693e519524SHoward Hinnantvoid 44703e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44713e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44723e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44733e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44743e519524SHoward Hinnant{ 44753e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44763e519524SHoward Hinnant __destruct_n __d(0); 44773e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44783e519524SHoward Hinnant if (__len1 <= __len2) 44793e519524SHoward Hinnant { 44803e519524SHoward Hinnant value_type* __p = __buff; 4481910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4482ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4483adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44843e519524SHoward Hinnant } 44853e519524SHoward Hinnant else 44863e519524SHoward Hinnant { 44873e519524SHoward Hinnant value_type* __p = __buff; 4488910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4489ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44903e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44913e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4492adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4493adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4494a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 44953e519524SHoward Hinnant } 44963e519524SHoward Hinnant} 44973e519524SHoward Hinnant 44983e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44993e519524SHoward Hinnantvoid 45003e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45013e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45023e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45033e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45043e519524SHoward Hinnant{ 45053e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45063e519524SHoward Hinnant while (true) 45073e519524SHoward Hinnant { 45083e519524SHoward Hinnant // if __middle == __last, we're done 45093e519524SHoward Hinnant if (__len2 == 0) 45103e519524SHoward Hinnant return; 4511526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4512526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4513526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45143e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4515910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45163e519524SHoward Hinnant { 45173e519524SHoward Hinnant if (__len1 == 0) 45183e519524SHoward Hinnant return; 45193e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45203e519524SHoward Hinnant break; 45213e519524SHoward Hinnant } 45223e519524SHoward Hinnant // __first < __middle < __last 45233e519524SHoward Hinnant // *__first > *__middle 45243e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45253e519524SHoward Hinnant // all elements in: 45263e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45273e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45283e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45293e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45303e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45313e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45323e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45333e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45343e519524SHoward Hinnant // binary search smaller range 45353e519524SHoward Hinnant if (__len1 < __len2) 45363e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45373e519524SHoward Hinnant __len21 = __len2 / 2; 45383e519524SHoward Hinnant __m2 = __middle; 4539ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45403e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4541ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45423e519524SHoward Hinnant } 45433e519524SHoward Hinnant else 45443e519524SHoward Hinnant { 45453e519524SHoward Hinnant if (__len1 == 1) 45463e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45473e519524SHoward Hinnant // It is known *__first > *__middle 45483e519524SHoward Hinnant swap(*__first, *__middle); 45493e519524SHoward Hinnant return; 45503e519524SHoward Hinnant } 45513e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45523e519524SHoward Hinnant __len11 = __len1 / 2; 45533e519524SHoward Hinnant __m1 = __first; 4554ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45553e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4556ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45573e519524SHoward Hinnant } 45583e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45593e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45603e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45613e519524SHoward Hinnant // swap middle two partitions 4562ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45633e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45643e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45653e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45663e519524SHoward Hinnant { 45673e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45683e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45693e519524SHoward Hinnant __first = __middle; 45703e519524SHoward Hinnant __middle = __m2; 45713e519524SHoward Hinnant __len1 = __len12; 45723e519524SHoward Hinnant __len2 = __len22; 45733e519524SHoward Hinnant } 45743e519524SHoward Hinnant else 45753e519524SHoward Hinnant { 45763e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45773e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45783e519524SHoward Hinnant __last = __middle; 45793e519524SHoward Hinnant __middle = __m1; 45803e519524SHoward Hinnant __len1 = __len11; 45813e519524SHoward Hinnant __len2 = __len21; 45823e519524SHoward Hinnant } 45833e519524SHoward Hinnant } 45843e519524SHoward Hinnant} 45853e519524SHoward Hinnant 45863e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45883e519524SHoward Hinnantvoid 45893e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45903e519524SHoward Hinnant _Compare __comp) 45913e519524SHoward Hinnant{ 45923e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45933e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4594ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4595ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4596ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45970b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45980b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45990b48cf9aSMarshall Clow 4600145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4603ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46043e519524SHoward Hinnant __buf.first, __buf.second); 4605145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46063e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4607ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46083e519524SHoward Hinnant __buf.first, __buf.second); 4609145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46103e519524SHoward Hinnant} 46113e519524SHoward Hinnant 46123e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46143e519524SHoward Hinnantvoid 46153e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46163e519524SHoward Hinnant{ 4617ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46183e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46193e519524SHoward Hinnant} 46203e519524SHoward Hinnant 46213e519524SHoward Hinnant// stable_sort 46223e519524SHoward Hinnant 46233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 46243e519524SHoward Hinnantvoid 46253e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 46263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46273e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 46283e519524SHoward Hinnant{ 46293e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46303e519524SHoward Hinnant __destruct_n __d(0); 46313e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46323e519524SHoward Hinnant for (; true; ++__result) 46333e519524SHoward Hinnant { 46343e519524SHoward Hinnant if (__first1 == __last1) 46353e519524SHoward Hinnant { 46363e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4637ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46383e519524SHoward Hinnant __h.release(); 46393e519524SHoward Hinnant return; 46403e519524SHoward Hinnant } 46413e519524SHoward Hinnant if (__first2 == __last2) 46423e519524SHoward Hinnant { 46433e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4644ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46453e519524SHoward Hinnant __h.release(); 46463e519524SHoward Hinnant return; 46473e519524SHoward Hinnant } 46483e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46493e519524SHoward Hinnant { 4650ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46513e519524SHoward Hinnant __d.__incr((value_type*)0); 46523e519524SHoward Hinnant ++__first2; 46533e519524SHoward Hinnant } 46543e519524SHoward Hinnant else 46553e519524SHoward Hinnant { 4656ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46573e519524SHoward Hinnant __d.__incr((value_type*)0); 46583e519524SHoward Hinnant ++__first1; 46593e519524SHoward Hinnant } 46603e519524SHoward Hinnant } 46613e519524SHoward Hinnant} 46623e519524SHoward Hinnant 46633e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46643e519524SHoward Hinnantvoid 46653e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46673e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46683e519524SHoward Hinnant{ 46693e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46703e519524SHoward Hinnant { 46713e519524SHoward Hinnant if (__first2 == __last2) 46723e519524SHoward Hinnant { 46733e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4674ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46753e519524SHoward Hinnant return; 46763e519524SHoward Hinnant } 46773e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46783e519524SHoward Hinnant { 4679ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46803e519524SHoward Hinnant ++__first2; 46813e519524SHoward Hinnant } 46823e519524SHoward Hinnant else 46833e519524SHoward Hinnant { 4684ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46853e519524SHoward Hinnant ++__first1; 46863e519524SHoward Hinnant } 46873e519524SHoward Hinnant } 46883e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4689ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46903e519524SHoward Hinnant} 46913e519524SHoward Hinnant 46923e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46933e519524SHoward Hinnantvoid 46943e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46963e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46973e519524SHoward Hinnant 46983e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46993e519524SHoward Hinnantvoid 47003e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47023e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47033e519524SHoward Hinnant{ 47043e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47053e519524SHoward Hinnant switch (__len) 47063e519524SHoward Hinnant { 47073e519524SHoward Hinnant case 0: 47083e519524SHoward Hinnant return; 47093e519524SHoward Hinnant case 1: 4710ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47113e519524SHoward Hinnant return; 47123e519524SHoward Hinnant case 2: 47133e519524SHoward Hinnant __destruct_n __d(0); 47143e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47153e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47163e519524SHoward Hinnant { 4717ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47183e519524SHoward Hinnant __d.__incr((value_type*)0); 47193e519524SHoward Hinnant ++__first2; 4720ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47213e519524SHoward Hinnant } 47223e519524SHoward Hinnant else 47233e519524SHoward Hinnant { 4724ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47253e519524SHoward Hinnant __d.__incr((value_type*)0); 47263e519524SHoward Hinnant ++__first2; 4727ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47283e519524SHoward Hinnant } 47293e519524SHoward Hinnant __h2.release(); 47303e519524SHoward Hinnant return; 47313e519524SHoward Hinnant } 47323e519524SHoward Hinnant if (__len <= 8) 47333e519524SHoward Hinnant { 47343e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47353e519524SHoward Hinnant return; 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47383e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47393e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47403e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47413e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47423e519524SHoward Hinnant} 47433e519524SHoward Hinnant 47443e519524SHoward Hinnanttemplate <class _Tp> 47453e519524SHoward Hinnantstruct __stable_sort_switch 47463e519524SHoward Hinnant{ 4747ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47483e519524SHoward Hinnant}; 47493e519524SHoward Hinnant 47503e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47513e519524SHoward Hinnantvoid 47523e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47533e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47543e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47553e519524SHoward Hinnant{ 47563e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47583e519524SHoward Hinnant switch (__len) 47593e519524SHoward Hinnant { 47603e519524SHoward Hinnant case 0: 47613e519524SHoward Hinnant case 1: 47623e519524SHoward Hinnant return; 47633e519524SHoward Hinnant case 2: 47643e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47653e519524SHoward Hinnant swap(*__first, *__last); 47663e519524SHoward Hinnant return; 47673e519524SHoward Hinnant } 47683e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47693e519524SHoward Hinnant { 47703e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47713e519524SHoward Hinnant return; 47723e519524SHoward Hinnant } 47733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47743e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47753e519524SHoward Hinnant if (__len <= __buff_size) 47763e519524SHoward Hinnant { 47773e519524SHoward Hinnant __destruct_n __d(0); 47783e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47793e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47803e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47813e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47823e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47833e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47843e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47853e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47863e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47873e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47883e519524SHoward Hinnant// __first, __comp); 47893e519524SHoward Hinnant return; 47903e519524SHoward Hinnant } 47913e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47923e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47933e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47943e519524SHoward Hinnant} 47953e519524SHoward Hinnant 47963e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47983e519524SHoward Hinnantvoid 47993e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48003e519524SHoward Hinnant{ 48013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48033e519524SHoward Hinnant difference_type __len = __last - __first; 48043e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48053e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48063e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48073e519524SHoward Hinnant { 4808ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48093e519524SHoward Hinnant __h.reset(__buf.first); 48103e519524SHoward Hinnant } 4811145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48143e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4815145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48173e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4818145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48193e519524SHoward Hinnant} 48203e519524SHoward Hinnant 48213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48233e519524SHoward Hinnantvoid 48243e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 48253e519524SHoward Hinnant{ 4826ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48273e519524SHoward Hinnant} 48283e519524SHoward Hinnant 48293e519524SHoward Hinnant// is_heap_until 48303e519524SHoward Hinnant 48313e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 483249c7643cSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX17 _RandomAccessIterator 48333e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48343e519524SHoward Hinnant{ 4835ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48363e519524SHoward Hinnant difference_type __len = __last - __first; 48373e519524SHoward Hinnant difference_type __p = 0; 48383e519524SHoward Hinnant difference_type __c = 1; 48393e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48403e519524SHoward Hinnant while (__c < __len) 48413e519524SHoward Hinnant { 48423e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48433e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48443e519524SHoward Hinnant return __cp; 48453e519524SHoward Hinnant ++__c; 48463e519524SHoward Hinnant ++__cp; 48473e519524SHoward Hinnant if (__c == __len) 48483e519524SHoward Hinnant return __last; 48493e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48503e519524SHoward Hinnant return __cp; 48513e519524SHoward Hinnant ++__p; 48523e519524SHoward Hinnant ++__pp; 48533e519524SHoward Hinnant __c = 2 * __p + 1; 48543e519524SHoward Hinnant } 48553e519524SHoward Hinnant return __last; 48563e519524SHoward Hinnant} 48573e519524SHoward Hinnant 48583e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 485949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48603e519524SHoward Hinnant_RandomAccessIterator 48613e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48623e519524SHoward Hinnant{ 4863ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48643e519524SHoward Hinnant} 48653e519524SHoward Hinnant 48663e519524SHoward Hinnant// is_heap 48673e519524SHoward Hinnant 48683e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 486949c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48703e519524SHoward Hinnantbool 48713e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48723e519524SHoward Hinnant{ 4873ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48743e519524SHoward Hinnant} 48753e519524SHoward Hinnant 48763e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 487749c7643cSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 48783e519524SHoward Hinnantbool 48793e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48803e519524SHoward Hinnant{ 4881ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnant// push_heap 48853e519524SHoward Hinnant 48863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48873e519524SHoward Hinnantvoid 48888b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48903e519524SHoward Hinnant{ 48913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48923e519524SHoward Hinnant if (__len > 1) 48933e519524SHoward Hinnant { 48943e519524SHoward Hinnant __len = (__len - 2) / 2; 48953e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48963e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48973e519524SHoward Hinnant { 4898ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48993e519524SHoward Hinnant do 49003e519524SHoward Hinnant { 4901ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49023e519524SHoward Hinnant __last = __ptr; 49033e519524SHoward Hinnant if (__len == 0) 49043e519524SHoward Hinnant break; 49053e519524SHoward Hinnant __len = (__len - 1) / 2; 49063e519524SHoward Hinnant __ptr = __first + __len; 49073e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4908ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49093e519524SHoward Hinnant } 49103e519524SHoward Hinnant } 49113e519524SHoward Hinnant} 49123e519524SHoward Hinnant 49133e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49153e519524SHoward Hinnantvoid 49163e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49173e519524SHoward Hinnant{ 4918145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49193e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49203e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49218b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4922145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49233e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49248b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4925145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49263e519524SHoward Hinnant} 49273e519524SHoward Hinnant 49283e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49303e519524SHoward Hinnantvoid 49313e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49323e519524SHoward Hinnant{ 4933ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49343e519524SHoward Hinnant} 49353e519524SHoward Hinnant 49363e519524SHoward Hinnant// pop_heap 49373e519524SHoward Hinnant 49383e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49398b512602SDavid Majnemervoid 4940fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4941fd838227SEric Fiselier _Compare __comp, 49428b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49438b512602SDavid Majnemer _RandomAccessIterator __start) 49448b512602SDavid Majnemer{ 49458b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49468b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49478b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49488b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49498b512602SDavid Majnemer difference_type __child = __start - __first; 49508b512602SDavid Majnemer 49518b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49528b512602SDavid Majnemer return; 49538b512602SDavid Majnemer 49548b512602SDavid Majnemer __child = 2 * __child + 1; 49558b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49568b512602SDavid Majnemer 49578b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49588b512602SDavid Majnemer // right-child exists and is greater than left-child 49598b512602SDavid Majnemer ++__child_i; 49608b512602SDavid Majnemer ++__child; 49618b512602SDavid Majnemer } 49628b512602SDavid Majnemer 49638b512602SDavid Majnemer // check if we are in heap-order 49648b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49658b512602SDavid Majnemer // we are, __start is larger than it's largest child 49668b512602SDavid Majnemer return; 49678b512602SDavid Majnemer 49688b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49698b512602SDavid Majnemer do 49708b512602SDavid Majnemer { 49718b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49728b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49738b512602SDavid Majnemer __start = __child_i; 49748b512602SDavid Majnemer 49758b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49768b512602SDavid Majnemer break; 49778b512602SDavid Majnemer 49788b512602SDavid Majnemer // recompute the child based off of the updated parent 49798b512602SDavid Majnemer __child = 2 * __child + 1; 49808b512602SDavid Majnemer __child_i = __first + __child; 49818b512602SDavid Majnemer 49828b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49838b512602SDavid Majnemer // right-child exists and is greater than left-child 49848b512602SDavid Majnemer ++__child_i; 49858b512602SDavid Majnemer ++__child; 49868b512602SDavid Majnemer } 49878b512602SDavid Majnemer 49888b512602SDavid Majnemer // check if we are in heap-order 49898b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49908b512602SDavid Majnemer *__start = _VSTD::move(__top); 49918b512602SDavid Majnemer} 49928b512602SDavid Majnemer 49938b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49953e519524SHoward Hinnantvoid 49963e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49973e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49983e519524SHoward Hinnant{ 49993e519524SHoward Hinnant if (__len > 1) 50003e519524SHoward Hinnant { 50013e519524SHoward Hinnant swap(*__first, *--__last); 50028b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50033e519524SHoward Hinnant } 50043e519524SHoward Hinnant} 50053e519524SHoward Hinnant 50063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50083e519524SHoward Hinnantvoid 50093e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50103e519524SHoward Hinnant{ 5011145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50143e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5015145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50173e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5018145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50193e519524SHoward Hinnant} 50203e519524SHoward Hinnant 50213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50233e519524SHoward Hinnantvoid 50243e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50253e519524SHoward Hinnant{ 5026ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50273e519524SHoward Hinnant} 50283e519524SHoward Hinnant 50293e519524SHoward Hinnant// make_heap 50303e519524SHoward Hinnant 50313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50323e519524SHoward Hinnantvoid 50333e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50343e519524SHoward Hinnant{ 50353e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50363e519524SHoward Hinnant difference_type __n = __last - __first; 50373e519524SHoward Hinnant if (__n > 1) 50383e519524SHoward Hinnant { 50398b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50408b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50418b512602SDavid Majnemer { 50428b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 50438b512602SDavid Majnemer } 50443e519524SHoward Hinnant } 50453e519524SHoward Hinnant} 50463e519524SHoward Hinnant 50473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50493e519524SHoward Hinnantvoid 50503e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50513e519524SHoward Hinnant{ 5052145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50553e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5056145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50583e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5059145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50603e519524SHoward Hinnant} 50613e519524SHoward Hinnant 50623e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50643e519524SHoward Hinnantvoid 50653e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50663e519524SHoward Hinnant{ 5067ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50683e519524SHoward Hinnant} 50693e519524SHoward Hinnant 50703e519524SHoward Hinnant// sort_heap 50713e519524SHoward Hinnant 50723e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50733e519524SHoward Hinnantvoid 50743e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50753e519524SHoward Hinnant{ 50763e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50773e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50783e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50793e519524SHoward Hinnant} 50803e519524SHoward Hinnant 50813e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50833e519524SHoward Hinnantvoid 50843e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50853e519524SHoward Hinnant{ 5086145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50873e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50883e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50893e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5090145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50913e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50923e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5093145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50943e519524SHoward Hinnant} 50953e519524SHoward Hinnant 50963e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50983e519524SHoward Hinnantvoid 50993e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51003e519524SHoward Hinnant{ 5101ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51023e519524SHoward Hinnant} 51033e519524SHoward Hinnant 51043e519524SHoward Hinnant// partial_sort 51053e519524SHoward Hinnant 51063e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51073e519524SHoward Hinnantvoid 51083e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51093e519524SHoward Hinnant _Compare __comp) 51103e519524SHoward Hinnant{ 51113e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51133e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51143e519524SHoward Hinnant { 51153e519524SHoward Hinnant if (__comp(*__i, *__first)) 51163e519524SHoward Hinnant { 51173e519524SHoward Hinnant swap(*__i, *__first); 51188b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51193e519524SHoward Hinnant } 51203e519524SHoward Hinnant } 51213e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51223e519524SHoward Hinnant} 51233e519524SHoward Hinnant 51243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51263e519524SHoward Hinnantvoid 51273e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51283e519524SHoward Hinnant _Compare __comp) 51293e519524SHoward Hinnant{ 5130145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51333e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5134145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51363e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5137145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51383e519524SHoward Hinnant} 51393e519524SHoward Hinnant 51403e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51423e519524SHoward Hinnantvoid 51433e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51443e519524SHoward Hinnant{ 5145ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 51463e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51473e519524SHoward Hinnant} 51483e519524SHoward Hinnant 51493e519524SHoward Hinnant// partial_sort_copy 51503e519524SHoward Hinnant 51513e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 51523e519524SHoward Hinnant_RandomAccessIterator 51533e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51543e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51553e519524SHoward Hinnant{ 51563e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51573e519524SHoward Hinnant if (__r != __result_last) 51583e519524SHoward Hinnant { 5159910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51603e519524SHoward Hinnant *__r = *__first; 51613e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51628b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51633e519524SHoward Hinnant for (; __first != __last; ++__first) 51643e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51653e519524SHoward Hinnant { 51663e519524SHoward Hinnant *__result_first = *__first; 51678b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51683e519524SHoward Hinnant } 51693e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51703e519524SHoward Hinnant } 51713e519524SHoward Hinnant return __r; 51723e519524SHoward Hinnant} 51733e519524SHoward Hinnant 51743e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51763e519524SHoward Hinnant_RandomAccessIterator 51773e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51783e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51793e519524SHoward Hinnant{ 5180145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51813e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51823e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51833e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5184145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51863e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5187145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51883e519524SHoward Hinnant} 51893e519524SHoward Hinnant 51903e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51923e519524SHoward Hinnant_RandomAccessIterator 51933e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51943e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51953e519524SHoward Hinnant{ 5196ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51973e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51983e519524SHoward Hinnant} 51993e519524SHoward Hinnant 52003e519524SHoward Hinnant// nth_element 52013e519524SHoward Hinnant 52023e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52033e519524SHoward Hinnantvoid 52043e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52053e519524SHoward Hinnant{ 52063e519524SHoward Hinnant // _Compare is known to be a reference type 52073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52083e519524SHoward Hinnant const difference_type __limit = 7; 52093e519524SHoward Hinnant while (true) 52103e519524SHoward Hinnant { 52113e519524SHoward Hinnant __restart: 5212b34b4819SHoward Hinnant if (__nth == __last) 5213b34b4819SHoward Hinnant return; 52143e519524SHoward Hinnant difference_type __len = __last - __first; 52153e519524SHoward Hinnant switch (__len) 52163e519524SHoward Hinnant { 52173e519524SHoward Hinnant case 0: 52183e519524SHoward Hinnant case 1: 52193e519524SHoward Hinnant return; 52203e519524SHoward Hinnant case 2: 52213e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52223e519524SHoward Hinnant swap(*__first, *__last); 52233e519524SHoward Hinnant return; 52243e519524SHoward Hinnant case 3: 52253e519524SHoward Hinnant { 52263e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5227ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52283e519524SHoward Hinnant return; 52293e519524SHoward Hinnant } 52303e519524SHoward Hinnant } 52313e519524SHoward Hinnant if (__len <= __limit) 52323e519524SHoward Hinnant { 52333e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 52343e519524SHoward Hinnant return; 52353e519524SHoward Hinnant } 52363e519524SHoward Hinnant // __len > __limit >= 3 52373e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 52383e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5239ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52403e519524SHoward Hinnant // *__m is median 52413e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 52423e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 52433e519524SHoward Hinnant _RandomAccessIterator __i = __first; 52443e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 52453e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52463e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 52473e519524SHoward Hinnant // Prime the downward search with a guard. 52483e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 52493e519524SHoward Hinnant { 52503e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 52513e519524SHoward Hinnant // manually guard downward moving __j against __i 52523e519524SHoward Hinnant while (true) 52533e519524SHoward Hinnant { 52543e519524SHoward Hinnant if (__i == --__j) 52553e519524SHoward Hinnant { 52563e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52573e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52583e519524SHoward Hinnant ++__i; // __first + 1 52593e519524SHoward Hinnant __j = __last; 52603e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52613e519524SHoward Hinnant { 52623e519524SHoward Hinnant while (true) 52633e519524SHoward Hinnant { 52643e519524SHoward Hinnant if (__i == __j) 52653e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52663e519524SHoward Hinnant if (__comp(*__first, *__i)) 52673e519524SHoward Hinnant { 52683e519524SHoward Hinnant swap(*__i, *__j); 52693e519524SHoward Hinnant ++__n_swaps; 52703e519524SHoward Hinnant ++__i; 52713e519524SHoward Hinnant break; 52723e519524SHoward Hinnant } 52733e519524SHoward Hinnant ++__i; 52743e519524SHoward Hinnant } 52753e519524SHoward Hinnant } 52763e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52773e519524SHoward Hinnant if (__i == __j) 52783e519524SHoward Hinnant return; 52793e519524SHoward Hinnant while (true) 52803e519524SHoward Hinnant { 52813e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52823e519524SHoward Hinnant ++__i; 52833e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52843e519524SHoward Hinnant ; 52853e519524SHoward Hinnant if (__i >= __j) 52863e519524SHoward Hinnant break; 52873e519524SHoward Hinnant swap(*__i, *__j); 52883e519524SHoward Hinnant ++__n_swaps; 52893e519524SHoward Hinnant ++__i; 52903e519524SHoward Hinnant } 52913e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52923e519524SHoward Hinnant // The first part is sorted, 52933e519524SHoward Hinnant if (__nth < __i) 52943e519524SHoward Hinnant return; 52953e519524SHoward Hinnant // __nth_element the secod part 52963e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52973e519524SHoward Hinnant __first = __i; 52983e519524SHoward Hinnant goto __restart; 52993e519524SHoward Hinnant } 53003e519524SHoward Hinnant if (__comp(*__j, *__m)) 53013e519524SHoward Hinnant { 53023e519524SHoward Hinnant swap(*__i, *__j); 53033e519524SHoward Hinnant ++__n_swaps; 53043e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53053e519524SHoward Hinnant } 53063e519524SHoward Hinnant } 53073e519524SHoward Hinnant } 53083e519524SHoward Hinnant ++__i; 53093e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53103e519524SHoward Hinnant // if not yet partitioned... 53113e519524SHoward Hinnant if (__i < __j) 53123e519524SHoward Hinnant { 53133e519524SHoward Hinnant // known that *(__i - 1) < *__m 53143e519524SHoward Hinnant while (true) 53153e519524SHoward Hinnant { 53163e519524SHoward Hinnant // __m still guards upward moving __i 53173e519524SHoward Hinnant while (__comp(*__i, *__m)) 53183e519524SHoward Hinnant ++__i; 53193e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53203e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53213e519524SHoward Hinnant ; 53223e519524SHoward Hinnant if (__i >= __j) 53233e519524SHoward Hinnant break; 53243e519524SHoward Hinnant swap(*__i, *__j); 53253e519524SHoward Hinnant ++__n_swaps; 53263e519524SHoward Hinnant // It is known that __m != __j 53273e519524SHoward Hinnant // If __m just moved, follow it 53283e519524SHoward Hinnant if (__m == __i) 53293e519524SHoward Hinnant __m = __j; 53303e519524SHoward Hinnant ++__i; 53313e519524SHoward Hinnant } 53323e519524SHoward Hinnant } 53333e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53343e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53353e519524SHoward Hinnant { 53363e519524SHoward Hinnant swap(*__i, *__m); 53373e519524SHoward Hinnant ++__n_swaps; 53383e519524SHoward Hinnant } 53393e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53403e519524SHoward Hinnant if (__nth == __i) 53413e519524SHoward Hinnant return; 53423e519524SHoward Hinnant if (__n_swaps == 0) 53433e519524SHoward Hinnant { 53443e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53453e519524SHoward Hinnant if (__nth < __i) 53463e519524SHoward Hinnant { 53473e519524SHoward Hinnant // Check for [__first, __i) already sorted 53483e519524SHoward Hinnant __j = __m = __first; 53493e519524SHoward Hinnant while (++__j != __i) 53503e519524SHoward Hinnant { 53513e519524SHoward Hinnant if (__comp(*__j, *__m)) 53523e519524SHoward Hinnant // not yet sorted, so sort 53533e519524SHoward Hinnant goto not_sorted; 53543e519524SHoward Hinnant __m = __j; 53553e519524SHoward Hinnant } 53563e519524SHoward Hinnant // [__first, __i) sorted 53573e519524SHoward Hinnant return; 53583e519524SHoward Hinnant } 53593e519524SHoward Hinnant else 53603e519524SHoward Hinnant { 53613e519524SHoward Hinnant // Check for [__i, __last) already sorted 53623e519524SHoward Hinnant __j = __m = __i; 53633e519524SHoward Hinnant while (++__j != __last) 53643e519524SHoward Hinnant { 53653e519524SHoward Hinnant if (__comp(*__j, *__m)) 53663e519524SHoward Hinnant // not yet sorted, so sort 53673e519524SHoward Hinnant goto not_sorted; 53683e519524SHoward Hinnant __m = __j; 53693e519524SHoward Hinnant } 53703e519524SHoward Hinnant // [__i, __last) sorted 53713e519524SHoward Hinnant return; 53723e519524SHoward Hinnant } 53733e519524SHoward Hinnant } 53743e519524SHoward Hinnantnot_sorted: 53753e519524SHoward Hinnant // __nth_element on range containing __nth 53763e519524SHoward Hinnant if (__nth < __i) 53773e519524SHoward Hinnant { 53783e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53793e519524SHoward Hinnant __last = __i; 53803e519524SHoward Hinnant } 53813e519524SHoward Hinnant else 53823e519524SHoward Hinnant { 53833e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53843e519524SHoward Hinnant __first = ++__i; 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant } 53873e519524SHoward Hinnant} 53883e519524SHoward Hinnant 53893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53913e519524SHoward Hinnantvoid 53923e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53933e519524SHoward Hinnant{ 5394145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53973e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5398145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54003e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5401145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54023e519524SHoward Hinnant} 54033e519524SHoward Hinnant 54043e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54063e519524SHoward Hinnantvoid 54073e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54083e519524SHoward Hinnant{ 5409ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54103e519524SHoward Hinnant} 54113e519524SHoward Hinnant 54123e519524SHoward Hinnant// includes 54133e519524SHoward Hinnant 54143e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54153e519524SHoward Hinnantbool 54163e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54173e519524SHoward Hinnant _Compare __comp) 54183e519524SHoward Hinnant{ 54193e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54203e519524SHoward Hinnant { 54213e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54223e519524SHoward Hinnant return false; 54233e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54243e519524SHoward Hinnant ++__first2; 54253e519524SHoward Hinnant } 54263e519524SHoward Hinnant return true; 54273e519524SHoward Hinnant} 54283e519524SHoward Hinnant 54293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 54303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54313e519524SHoward Hinnantbool 54323e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54333e519524SHoward Hinnant _Compare __comp) 54343e519524SHoward Hinnant{ 5435145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54383e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5439145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54413e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5442145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 54463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54473e519524SHoward Hinnantbool 54483e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 54493e519524SHoward Hinnant{ 5450ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 54513e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54523e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54533e519524SHoward Hinnant} 54543e519524SHoward Hinnant 54553e519524SHoward Hinnant// set_union 54563e519524SHoward Hinnant 54573e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54583e519524SHoward Hinnant_OutputIterator 54593e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54613e519524SHoward Hinnant{ 54623e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54633e519524SHoward Hinnant { 54643e519524SHoward Hinnant if (__first2 == __last2) 5465ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54663e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54673e519524SHoward Hinnant { 54683e519524SHoward Hinnant *__result = *__first2; 54693e519524SHoward Hinnant ++__first2; 54703e519524SHoward Hinnant } 54713e519524SHoward Hinnant else 54723e519524SHoward Hinnant { 54733e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54743e519524SHoward Hinnant ++__first2; 547505da5b02SMarshall Clow *__result = *__first1; 54763e519524SHoward Hinnant ++__first1; 54773e519524SHoward Hinnant } 54783e519524SHoward Hinnant } 5479ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54803e519524SHoward Hinnant} 54813e519524SHoward Hinnant 54823e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54843e519524SHoward Hinnant_OutputIterator 54853e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54863e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54873e519524SHoward Hinnant{ 5488145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54913e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5492145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54943e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5495145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54963e519524SHoward Hinnant} 54973e519524SHoward Hinnant 54983e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55003e519524SHoward Hinnant_OutputIterator 55013e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55033e519524SHoward Hinnant{ 5504ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55053e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55063e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55073e519524SHoward Hinnant} 55083e519524SHoward Hinnant 55093e519524SHoward Hinnant// set_intersection 55103e519524SHoward Hinnant 55113e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55123e519524SHoward Hinnant_OutputIterator 55133e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55153e519524SHoward Hinnant{ 55163e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55173e519524SHoward Hinnant { 55183e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55193e519524SHoward Hinnant ++__first1; 55203e519524SHoward Hinnant else 55213e519524SHoward Hinnant { 55223e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55233e519524SHoward Hinnant { 55243e519524SHoward Hinnant *__result = *__first1; 55253e519524SHoward Hinnant ++__result; 55263e519524SHoward Hinnant ++__first1; 55273e519524SHoward Hinnant } 55283e519524SHoward Hinnant ++__first2; 55293e519524SHoward Hinnant } 55303e519524SHoward Hinnant } 55313e519524SHoward Hinnant return __result; 55323e519524SHoward Hinnant} 55333e519524SHoward Hinnant 55343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55363e519524SHoward Hinnant_OutputIterator 55373e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55383e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55393e519524SHoward Hinnant{ 5540145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55413e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55423e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55433e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5544145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55463e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5547145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55483e519524SHoward Hinnant} 55493e519524SHoward Hinnant 55503e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55523e519524SHoward Hinnant_OutputIterator 55533e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55543e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55553e519524SHoward Hinnant{ 5556ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55573e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55583e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55593e519524SHoward Hinnant} 55603e519524SHoward Hinnant 55613e519524SHoward Hinnant// set_difference 55623e519524SHoward Hinnant 55633e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55643e519524SHoward Hinnant_OutputIterator 55653e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55673e519524SHoward Hinnant{ 55683e519524SHoward Hinnant while (__first1 != __last1) 55693e519524SHoward Hinnant { 55703e519524SHoward Hinnant if (__first2 == __last2) 5571ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55723e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55733e519524SHoward Hinnant { 55743e519524SHoward Hinnant *__result = *__first1; 55753e519524SHoward Hinnant ++__result; 55763e519524SHoward Hinnant ++__first1; 55773e519524SHoward Hinnant } 55783e519524SHoward Hinnant else 55793e519524SHoward Hinnant { 55803e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55813e519524SHoward Hinnant ++__first1; 55823e519524SHoward Hinnant ++__first2; 55833e519524SHoward Hinnant } 55843e519524SHoward Hinnant } 55853e519524SHoward Hinnant return __result; 55863e519524SHoward Hinnant} 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55903e519524SHoward Hinnant_OutputIterator 55913e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55933e519524SHoward Hinnant{ 5594145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55973e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5598145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56003e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5601145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56023e519524SHoward Hinnant} 56033e519524SHoward Hinnant 56043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56063e519524SHoward Hinnant_OutputIterator 56073e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56093e519524SHoward Hinnant{ 5610ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56113e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56123e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56133e519524SHoward Hinnant} 56143e519524SHoward Hinnant 56153e519524SHoward Hinnant// set_symmetric_difference 56163e519524SHoward Hinnant 56173e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56183e519524SHoward Hinnant_OutputIterator 56193e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56213e519524SHoward Hinnant{ 56223e519524SHoward Hinnant while (__first1 != __last1) 56233e519524SHoward Hinnant { 56243e519524SHoward Hinnant if (__first2 == __last2) 5625ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56263e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56273e519524SHoward Hinnant { 56283e519524SHoward Hinnant *__result = *__first1; 56293e519524SHoward Hinnant ++__result; 56303e519524SHoward Hinnant ++__first1; 56313e519524SHoward Hinnant } 56323e519524SHoward Hinnant else 56333e519524SHoward Hinnant { 56343e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56353e519524SHoward Hinnant { 56363e519524SHoward Hinnant *__result = *__first2; 56373e519524SHoward Hinnant ++__result; 56383e519524SHoward Hinnant } 56393e519524SHoward Hinnant else 56403e519524SHoward Hinnant ++__first1; 56413e519524SHoward Hinnant ++__first2; 56423e519524SHoward Hinnant } 56433e519524SHoward Hinnant } 5644ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56453e519524SHoward Hinnant} 56463e519524SHoward Hinnant 56473e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56493e519524SHoward Hinnant_OutputIterator 56503e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56523e519524SHoward Hinnant{ 5653145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56543e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56553e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56563e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5657145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56593e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5660145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56613e519524SHoward Hinnant} 56623e519524SHoward Hinnant 56633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56653e519524SHoward Hinnant_OutputIterator 56663e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56673e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56683e519524SHoward Hinnant{ 5669ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56703e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56713e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56723e519524SHoward Hinnant} 56733e519524SHoward Hinnant 56743e519524SHoward Hinnant// lexicographical_compare 56753e519524SHoward Hinnant 56763e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56773e519524SHoward Hinnantbool 56783e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56803e519524SHoward Hinnant{ 5681910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56823e519524SHoward Hinnant { 56833e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56843e519524SHoward Hinnant return true; 56853e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56863e519524SHoward Hinnant return false; 56873e519524SHoward Hinnant } 56883e519524SHoward Hinnant return false; 56893e519524SHoward Hinnant} 56903e519524SHoward Hinnant 56913e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56933e519524SHoward Hinnantbool 56943e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56963e519524SHoward Hinnant{ 5697145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56983e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56993e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57003e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5701145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57033e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5704145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57053e519524SHoward Hinnant} 57063e519524SHoward Hinnant 57073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57093e519524SHoward Hinnantbool 57103e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57123e519524SHoward Hinnant{ 5713ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57143e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57153e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57163e519524SHoward Hinnant} 57173e519524SHoward Hinnant 57183e519524SHoward Hinnant// next_permutation 57193e519524SHoward Hinnant 57203e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57213e519524SHoward Hinnantbool 57223e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57233e519524SHoward Hinnant{ 57243e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57253e519524SHoward Hinnant if (__first == __last || __first == --__i) 57263e519524SHoward Hinnant return false; 57273e519524SHoward Hinnant while (true) 57283e519524SHoward Hinnant { 57293e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57303e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57313e519524SHoward Hinnant { 57323e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57333e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57343e519524SHoward Hinnant ; 57353e519524SHoward Hinnant swap(*__i, *__j); 5736ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57373e519524SHoward Hinnant return true; 57383e519524SHoward Hinnant } 57393e519524SHoward Hinnant if (__i == __first) 57403e519524SHoward Hinnant { 5741ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57423e519524SHoward Hinnant return false; 57433e519524SHoward Hinnant } 57443e519524SHoward Hinnant } 57453e519524SHoward Hinnant} 57463e519524SHoward Hinnant 57473e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57493e519524SHoward Hinnantbool 57503e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57513e519524SHoward Hinnant{ 5752145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57553e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5756145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57583e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5759145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57603e519524SHoward Hinnant} 57613e519524SHoward Hinnant 57623e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57643e519524SHoward Hinnantbool 57653e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57663e519524SHoward Hinnant{ 5767ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57683e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57693e519524SHoward Hinnant} 57703e519524SHoward Hinnant 57713e519524SHoward Hinnant// prev_permutation 57723e519524SHoward Hinnant 57733e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57743e519524SHoward Hinnantbool 57753e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57763e519524SHoward Hinnant{ 57773e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57783e519524SHoward Hinnant if (__first == __last || __first == --__i) 57793e519524SHoward Hinnant return false; 57803e519524SHoward Hinnant while (true) 57813e519524SHoward Hinnant { 57823e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57833e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57843e519524SHoward Hinnant { 57853e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57863e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57873e519524SHoward Hinnant ; 57883e519524SHoward Hinnant swap(*__i, *__j); 5789ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57903e519524SHoward Hinnant return true; 57913e519524SHoward Hinnant } 57923e519524SHoward Hinnant if (__i == __first) 57933e519524SHoward Hinnant { 5794ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57953e519524SHoward Hinnant return false; 57963e519524SHoward Hinnant } 57973e519524SHoward Hinnant } 57983e519524SHoward Hinnant} 57993e519524SHoward Hinnant 58003e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58023e519524SHoward Hinnantbool 58033e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58043e519524SHoward Hinnant{ 5805145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58083e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5809145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58113e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5812145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58133e519524SHoward Hinnant} 58143e519524SHoward Hinnant 58153e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58173e519524SHoward Hinnantbool 58183e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58193e519524SHoward Hinnant{ 5820ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58213e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58223e519524SHoward Hinnant} 58233e519524SHoward Hinnant 58243e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58253e519524SHoward Hinnant 5826a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5827a016efb1SEric Fiselier 58283e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5829