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> 233e519524SHoward Hinnant bool 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 273e519524SHoward Hinnant bool 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 313e519524SHoward Hinnant bool 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 38*d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 39*d5c65ffaSMarshall Clow InputIterator for_each_n(InputIterator first, Size n, Function f); // C++17 40*d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 423e519524SHoward Hinnant InputIterator 433e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 443e519524SHoward Hinnant 453e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 463e519524SHoward Hinnant InputIterator 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> 1303e519524SHoward Hinnant bool 1313e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1323e519524SHoward Hinnant ForwardIterator2 first2); 1333e519524SHoward Hinnant 1340b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1350b0bbd2fSMarshall Clow bool 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> 1403e519524SHoward Hinnant bool 1413e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1423e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1433e519524SHoward Hinnant 1440b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1450b0bbd2fSMarshall Clow bool 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> 3053e519524SHoward Hinnant bool 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> 3283e519524SHoward Hinnant bool 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> 5163e519524SHoward Hinnant bool 5173e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5183e519524SHoward Hinnant 5193e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5203e519524SHoward Hinnant bool 5213e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5223e519524SHoward Hinnant 5233e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5243e519524SHoward Hinnant RandomAccessIterator 5253e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5263e519524SHoward Hinnant 5273e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5283e519524SHoward Hinnant RandomAccessIterator 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> 6443e519524SHoward Hinnant#include <iterator> 645a1d07d57SHoward Hinnant#include <cstddef> 6463e519524SHoward Hinnant 6475d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6485d1a701dSHoward Hinnant#include "support/ibm/support.h" 6495d1a701dSHoward Hinnant#endif 6505d50aa32SEric Fiselier#if defined(_LIBCPP_COMPILER_MSVC) 65180f8cfb3SEric Fiselier#include <intrin.h> 6525f878d4bSHoward Hinnant#endif 6535d1a701dSHoward Hinnant 654ab4f4382SHoward Hinnant#include <__undef_min_max> 655ab4f4382SHoward Hinnant 656c1bd9197SEric Fiselier#include <__debug> 657c1bd9197SEric Fiselier 658073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6593e519524SHoward Hinnant#pragma GCC system_header 660073458b1SHoward Hinnant#endif 6613e519524SHoward Hinnant 6623e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6633e519524SHoward Hinnant 6649d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6659d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6669d67c6d5SMarshall Clow// * We haven't included <functional> here. 6673e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6683e519524SHoward Hinnantstruct __equal_to 6693e519524SHoward Hinnant{ 6703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6713e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6723e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6733e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6743e519524SHoward Hinnant}; 6753e519524SHoward Hinnant 6763e519524SHoward Hinnanttemplate <class _T1> 6773e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6783e519524SHoward Hinnant{ 6799d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6809d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6813e519524SHoward Hinnant}; 6823e519524SHoward Hinnant 6833e519524SHoward Hinnanttemplate <class _T1> 6843e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6853e519524SHoward Hinnant{ 6869d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6879d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6883e519524SHoward Hinnant}; 6893e519524SHoward Hinnant 6903e519524SHoward Hinnanttemplate <class _T1> 6913e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6923e519524SHoward Hinnant{ 6939d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6949d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6953e519524SHoward Hinnant}; 6963e519524SHoward Hinnant 6973e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6983e519524SHoward Hinnantstruct __less 6993e519524SHoward Hinnant{ 7009d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7019d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7029d67c6d5SMarshall Clow 7039d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7049d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7059d67c6d5SMarshall Clow 7069d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7079d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7089d67c6d5SMarshall Clow 7099d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7109d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7113e519524SHoward Hinnant}; 7123e519524SHoward Hinnant 7133e519524SHoward Hinnanttemplate <class _T1> 7143e519524SHoward Hinnantstruct __less<_T1, _T1> 7153e519524SHoward Hinnant{ 7169d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7179d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7183e519524SHoward Hinnant}; 7193e519524SHoward Hinnant 7203e519524SHoward Hinnanttemplate <class _T1> 7213e519524SHoward Hinnantstruct __less<const _T1, _T1> 7223e519524SHoward Hinnant{ 7239d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7249d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7253e519524SHoward Hinnant}; 7263e519524SHoward Hinnant 7273e519524SHoward Hinnanttemplate <class _T1> 7283e519524SHoward Hinnantstruct __less<_T1, const _T1> 7293e519524SHoward Hinnant{ 7309d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7319d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7323e519524SHoward Hinnant}; 7333e519524SHoward Hinnant 7343e519524SHoward Hinnanttemplate <class _Predicate> 7353e519524SHoward Hinnantclass __negate 7363e519524SHoward Hinnant{ 7373e519524SHoward Hinnantprivate: 7383e519524SHoward Hinnant _Predicate __p_; 7393e519524SHoward Hinnantpublic: 7403e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7413e519524SHoward Hinnant 7423e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7433e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7443e519524SHoward Hinnant 7453e519524SHoward Hinnant template <class _T1> 7463e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7473e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7483e519524SHoward Hinnant 7493e519524SHoward Hinnant template <class _T1, class _T2> 7503e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7513e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7523e519524SHoward Hinnant}; 7533e519524SHoward Hinnant 754145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7553e519524SHoward Hinnant 7563e519524SHoward Hinnanttemplate <class _Compare> 7573e519524SHoward Hinnantstruct __debug_less 7583e519524SHoward Hinnant{ 7593e519524SHoward Hinnant _Compare __comp_; 7603e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 761331d2159SEric Fiselier 7623e519524SHoward Hinnant template <class _Tp, class _Up> 7633e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7643e519524SHoward Hinnant { 7653e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7663e519524SHoward Hinnant if (__r) 767331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7683e519524SHoward Hinnant return __r; 7693e519524SHoward Hinnant } 770331d2159SEric Fiselier 771331d2159SEric Fiselier template <class _LHS, class _RHS> 772331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 773331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 774331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 775331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 776331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 777331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 778331d2159SEric Fiselier } 779331d2159SEric Fiselier 780331d2159SEric Fiselier template <class _LHS, class _RHS> 781331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 782331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7833e519524SHoward Hinnant}; 7843e519524SHoward Hinnant 785145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7863e519524SHoward Hinnant 787c8edcb36SHoward Hinnant// Precondition: __x != 0 788c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 78980f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 79080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 791c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 79280f8cfb3SEric Fiselier#else 79380f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 79480f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 79580f8cfb3SEric Fiselier unsigned long where; 79680f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 79780f8cfb3SEric Fiselier // Returns zero if no set bit is found. 79880f8cfb3SEric Fiselier if (_BitScanForward(&where, mask)) 79980f8cfb3SEric Fiselier return where; 80080f8cfb3SEric Fiselier return 32; 80180f8cfb3SEric Fiselier#endif 802c206366fSHoward Hinnant} 803c206366fSHoward Hinnant 804c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 80580f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 80680f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 807c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 80880f8cfb3SEric Fiselier#else 80980f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 81080f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 81180f8cfb3SEric Fiselier#endif 812c206366fSHoward Hinnant} 813c206366fSHoward Hinnant 814c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 81580f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 81680f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 817c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 81880f8cfb3SEric Fiselier#else 81980f8cfb3SEric Fiselier unsigned long where; 82080f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 82180f8cfb3SEric Fiselier// Returns zero if no set bit is found. 82280f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 82380f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 82480f8cfb3SEric Fiselier if (_BitScanForward64(&where, mask)) 82580f8cfb3SEric Fiselier return static_cast<int>(where); 82680f8cfb3SEric Fiselier#else 82780f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 82880f8cfb3SEric Fiselier // Scan the Low Word. 82980f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask))) 83080f8cfb3SEric Fiselier return where; 83180f8cfb3SEric Fiselier // Scan the High Word. 83280f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask >> 32))) 83380f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 83480f8cfb3SEric Fiselier#endif 83580f8cfb3SEric Fiselier return 64; 83680f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 837c206366fSHoward Hinnant} 838c8edcb36SHoward Hinnant 839c8edcb36SHoward Hinnant// Precondition: __x != 0 840c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 84180f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 84280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 843c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 84480f8cfb3SEric Fiselier#else 84580f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 84680f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 84780f8cfb3SEric Fiselier unsigned long where; 84880f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 84980f8cfb3SEric Fiselier // Returns zero if no set bit is found. 85080f8cfb3SEric Fiselier if (_BitScanReverse(&where, mask)) 85180f8cfb3SEric Fiselier return 31 - where; 85280f8cfb3SEric Fiselier return 32; // Undefined Behavior. 85380f8cfb3SEric Fiselier#endif 854c206366fSHoward Hinnant} 855c206366fSHoward Hinnant 856c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 85780f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 85880f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 859c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 86080f8cfb3SEric Fiselier#else 86180f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 86280f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 86380f8cfb3SEric Fiselier#endif 864c206366fSHoward Hinnant} 865c206366fSHoward Hinnant 866c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 86780f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 86880f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 869c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 87080f8cfb3SEric Fiselier#else 87180f8cfb3SEric Fiselier unsigned long where; 87280f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 87380f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 87480f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 87580f8cfb3SEric Fiselier if (_BitScanReverse64(&where, mask)) 87680f8cfb3SEric Fiselier return static_cast<int>(63 - where); 87780f8cfb3SEric Fiselier#else 87880f8cfb3SEric Fiselier // Scan the high 32 bits. 87980f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask >> 32))) 88080f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 88180f8cfb3SEric Fiselier // Scan the low 32 bits. 88280f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask))) 88380f8cfb3SEric Fiselier return 63 - where; 88480f8cfb3SEric Fiselier#endif 88580f8cfb3SEric Fiselier return 64; // Undefined Behavior. 88680f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 887c206366fSHoward Hinnant} 888c8edcb36SHoward Hinnant 88980f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 89080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 89180f8cfb3SEric Fiselier return __builtin_popcount (__x); 89280f8cfb3SEric Fiselier#else 89380f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 89480f8cfb3SEric Fiselier return __popcnt(__x); 89580f8cfb3SEric Fiselier#endif 89680f8cfb3SEric Fiselier} 89780f8cfb3SEric Fiselier 89880f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 89980f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90080f8cfb3SEric Fiselier return __builtin_popcountl (__x); 90180f8cfb3SEric Fiselier#else 90280f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 90380f8cfb3SEric Fiselier return __popcnt(__x); 90480f8cfb3SEric Fiselier#endif 90580f8cfb3SEric Fiselier} 90680f8cfb3SEric Fiselier 90780f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 90880f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90980f8cfb3SEric Fiselier return __builtin_popcountll(__x); 91080f8cfb3SEric Fiselier#else 91180f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 91280f8cfb3SEric Fiselier return __popcnt64(__x); 91380f8cfb3SEric Fiselier#endif 91480f8cfb3SEric Fiselier} 915c8edcb36SHoward Hinnant 9163e519524SHoward Hinnant// all_of 9173e519524SHoward Hinnant 9183e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9203e519524SHoward Hinnantbool 9213e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9223e519524SHoward Hinnant{ 9233e519524SHoward Hinnant for (; __first != __last; ++__first) 9243e519524SHoward Hinnant if (!__pred(*__first)) 9253e519524SHoward Hinnant return false; 9263e519524SHoward Hinnant return true; 9273e519524SHoward Hinnant} 9283e519524SHoward Hinnant 9293e519524SHoward Hinnant// any_of 9303e519524SHoward Hinnant 9313e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9333e519524SHoward Hinnantbool 9343e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9353e519524SHoward Hinnant{ 9363e519524SHoward Hinnant for (; __first != __last; ++__first) 9373e519524SHoward Hinnant if (__pred(*__first)) 9383e519524SHoward Hinnant return true; 9393e519524SHoward Hinnant return false; 9403e519524SHoward Hinnant} 9413e519524SHoward Hinnant 9423e519524SHoward Hinnant// none_of 9433e519524SHoward Hinnant 9443e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9463e519524SHoward Hinnantbool 9473e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9483e519524SHoward Hinnant{ 9493e519524SHoward Hinnant for (; __first != __last; ++__first) 9503e519524SHoward Hinnant if (__pred(*__first)) 9513e519524SHoward Hinnant return false; 9523e519524SHoward Hinnant return true; 9533e519524SHoward Hinnant} 9543e519524SHoward Hinnant 9553e519524SHoward Hinnant// for_each 9563e519524SHoward Hinnant 9573e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9593e519524SHoward Hinnant_Function 9603e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9613e519524SHoward Hinnant{ 9623e519524SHoward Hinnant for (; __first != __last; ++__first) 9633e519524SHoward Hinnant __f(*__first); 9641c7fe126SMarshall Clow return __f; 9653e519524SHoward Hinnant} 9663e519524SHoward Hinnant 967*d5c65ffaSMarshall Clow// for_each_n 968*d5c65ffaSMarshall Clow 969*d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 970*d5c65ffaSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 971*d5c65ffaSMarshall Clow_InputIterator 972*d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 973*d5c65ffaSMarshall Clow{ 974*d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 975*d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 976*d5c65ffaSMarshall Clow while (__n > 0) 977*d5c65ffaSMarshall Clow { 978*d5c65ffaSMarshall Clow __f(*__first); 979*d5c65ffaSMarshall Clow ++__first; 980*d5c65ffaSMarshall Clow --__n; 981*d5c65ffaSMarshall Clow } 982*d5c65ffaSMarshall Clow return __first; 983*d5c65ffaSMarshall Clow} 984*d5c65ffaSMarshall Clow 9853e519524SHoward Hinnant// find 9863e519524SHoward Hinnant 9873e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9893e519524SHoward Hinnant_InputIterator 990e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9913e519524SHoward Hinnant{ 9923e519524SHoward Hinnant for (; __first != __last; ++__first) 993e4383379SHoward Hinnant if (*__first == __value_) 9943e519524SHoward Hinnant break; 9953e519524SHoward Hinnant return __first; 9963e519524SHoward Hinnant} 9973e519524SHoward Hinnant 9983e519524SHoward Hinnant// find_if 9993e519524SHoward Hinnant 10003e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10023e519524SHoward Hinnant_InputIterator 10033e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10043e519524SHoward Hinnant{ 10053e519524SHoward Hinnant for (; __first != __last; ++__first) 10063e519524SHoward Hinnant if (__pred(*__first)) 10073e519524SHoward Hinnant break; 10083e519524SHoward Hinnant return __first; 10093e519524SHoward Hinnant} 10103e519524SHoward Hinnant 10113e519524SHoward Hinnant// find_if_not 10123e519524SHoward Hinnant 10133e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10153e519524SHoward Hinnant_InputIterator 10163e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10173e519524SHoward Hinnant{ 10183e519524SHoward Hinnant for (; __first != __last; ++__first) 10193e519524SHoward Hinnant if (!__pred(*__first)) 10203e519524SHoward Hinnant break; 10213e519524SHoward Hinnant return __first; 10223e519524SHoward Hinnant} 10233e519524SHoward Hinnant 10243e519524SHoward Hinnant// find_end 10253e519524SHoward Hinnant 10263e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10273e519524SHoward Hinnant_ForwardIterator1 10283e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10293e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10303e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10313e519524SHoward Hinnant{ 10323e519524SHoward Hinnant // modeled after search algorithm 10333e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10343e519524SHoward Hinnant if (__first2 == __last2) 10353e519524SHoward Hinnant return __r; 10363e519524SHoward Hinnant while (true) 10373e519524SHoward Hinnant { 10383e519524SHoward Hinnant while (true) 10393e519524SHoward Hinnant { 10403e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10413e519524SHoward Hinnant return __r; // (or __last1 if never found) 10423e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10433e519524SHoward Hinnant break; 10443e519524SHoward Hinnant ++__first1; 10453e519524SHoward Hinnant } 10463e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10473e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10483e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10493e519524SHoward Hinnant while (true) 10503e519524SHoward Hinnant { 10513e519524SHoward Hinnant if (++__m2 == __last2) 10523e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10533e519524SHoward Hinnant __r = __first1; 10543e519524SHoward Hinnant ++__first1; 10553e519524SHoward Hinnant break; 10563e519524SHoward Hinnant } 10573e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10583e519524SHoward Hinnant return __r; 10593e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10603e519524SHoward Hinnant { 10613e519524SHoward Hinnant ++__first1; 10623e519524SHoward Hinnant break; 10633e519524SHoward Hinnant } // else there is a match, check next elements 10643e519524SHoward Hinnant } 10653e519524SHoward Hinnant } 10663e519524SHoward Hinnant} 10673e519524SHoward Hinnant 10683e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10693e519524SHoward Hinnant_BidirectionalIterator1 10703e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10713e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10723e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10733e519524SHoward Hinnant{ 10743e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10753e519524SHoward Hinnant if (__first2 == __last2) 10763e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10773e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10783e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10793e519524SHoward Hinnant --__l2; 10803e519524SHoward Hinnant while (true) 10813e519524SHoward Hinnant { 10823e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10833e519524SHoward Hinnant while (true) 10843e519524SHoward Hinnant { 10853e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10863e519524SHoward Hinnant return __last1; 10873e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10883e519524SHoward Hinnant break; 10893e519524SHoward Hinnant } 10903e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10913e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10923e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10933e519524SHoward Hinnant while (true) 10943e519524SHoward Hinnant { 10953e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10963e519524SHoward Hinnant return __m1; 10973e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 10983e519524SHoward Hinnant return __last1; 10993e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11003e519524SHoward Hinnant { 11013e519524SHoward Hinnant break; 11023e519524SHoward Hinnant } // else there is a match, check next elements 11033e519524SHoward Hinnant } 11043e519524SHoward Hinnant } 11053e519524SHoward Hinnant} 11063e519524SHoward Hinnant 11073e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11089b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11093e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11103e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11113e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11123e519524SHoward Hinnant{ 11133e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11153e519524SHoward Hinnant if (__len2 == 0) 11163e519524SHoward Hinnant return __last1; 11173e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11183e519524SHoward Hinnant if (__len1 < __len2) 11193e519524SHoward Hinnant return __last1; 11203e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11213e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11223e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11233e519524SHoward Hinnant --__l2; 11243e519524SHoward Hinnant while (true) 11253e519524SHoward Hinnant { 11263e519524SHoward Hinnant while (true) 11273e519524SHoward Hinnant { 11283e519524SHoward Hinnant if (__s == __l1) 11293e519524SHoward Hinnant return __last1; 11303e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11313e519524SHoward Hinnant break; 11323e519524SHoward Hinnant } 11333e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11343e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11353e519524SHoward Hinnant while (true) 11363e519524SHoward Hinnant { 11373e519524SHoward Hinnant if (__m2 == __first2) 11383e519524SHoward Hinnant return __m1; 11393e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11403e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11413e519524SHoward Hinnant { 11423e519524SHoward Hinnant break; 11433e519524SHoward Hinnant } 11443e519524SHoward Hinnant } 11453e519524SHoward Hinnant } 11463e519524SHoward Hinnant} 11473e519524SHoward Hinnant 11483e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11503e519524SHoward Hinnant_ForwardIterator1 11513e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11523e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11533e519524SHoward Hinnant{ 1154ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11553e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11563e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11573e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11583e519524SHoward Hinnant} 11593e519524SHoward Hinnant 11603e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11623e519524SHoward Hinnant_ForwardIterator1 11633e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11643e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11653e519524SHoward Hinnant{ 11663e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11673e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1168ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11693e519524SHoward Hinnant} 11703e519524SHoward Hinnant 11713e519524SHoward Hinnant// find_first_of 11723e519524SHoward Hinnant 11733e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11749b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11759b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11763e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11773e519524SHoward Hinnant{ 11783e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11793e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11803e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11813e519524SHoward Hinnant return __first1; 11823e519524SHoward Hinnant return __last1; 11833e519524SHoward Hinnant} 11843e519524SHoward Hinnant 11859b0af34dSMarshall Clow 11869b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11879b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11889b0af34dSMarshall Clow_ForwardIterator1 11899b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11909b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11919b0af34dSMarshall Clow{ 11929b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11939b0af34dSMarshall Clow} 11949b0af34dSMarshall Clow 11953e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11973e519524SHoward Hinnant_ForwardIterator1 11983e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11993e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12003e519524SHoward Hinnant{ 12013e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12039b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12043e519524SHoward Hinnant} 12053e519524SHoward Hinnant 12063e519524SHoward Hinnant// adjacent_find 12073e519524SHoward Hinnant 12083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12103e519524SHoward Hinnant_ForwardIterator 12113e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12123e519524SHoward Hinnant{ 12133e519524SHoward Hinnant if (__first != __last) 12143e519524SHoward Hinnant { 12153e519524SHoward Hinnant _ForwardIterator __i = __first; 12163e519524SHoward Hinnant while (++__i != __last) 12173e519524SHoward Hinnant { 12183e519524SHoward Hinnant if (__pred(*__first, *__i)) 12193e519524SHoward Hinnant return __first; 12203e519524SHoward Hinnant __first = __i; 12213e519524SHoward Hinnant } 12223e519524SHoward Hinnant } 12233e519524SHoward Hinnant return __last; 12243e519524SHoward Hinnant} 12253e519524SHoward Hinnant 12263e519524SHoward Hinnanttemplate <class _ForwardIterator> 12273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12283e519524SHoward Hinnant_ForwardIterator 12293e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12303e519524SHoward Hinnant{ 12313e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1232ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12333e519524SHoward Hinnant} 12343e519524SHoward Hinnant 12353e519524SHoward Hinnant// count 12363e519524SHoward Hinnant 12373e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12393e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1240e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12413e519524SHoward Hinnant{ 12423e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12433e519524SHoward Hinnant for (; __first != __last; ++__first) 1244e4383379SHoward Hinnant if (*__first == __value_) 12453e519524SHoward Hinnant ++__r; 12463e519524SHoward Hinnant return __r; 12473e519524SHoward Hinnant} 12483e519524SHoward Hinnant 12493e519524SHoward Hinnant// count_if 12503e519524SHoward Hinnant 12513e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12533e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12543e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12553e519524SHoward Hinnant{ 12563e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12573e519524SHoward Hinnant for (; __first != __last; ++__first) 12583e519524SHoward Hinnant if (__pred(*__first)) 12593e519524SHoward Hinnant ++__r; 12603e519524SHoward Hinnant return __r; 12613e519524SHoward Hinnant} 12623e519524SHoward Hinnant 12633e519524SHoward Hinnant// mismatch 12643e519524SHoward Hinnant 12653e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12673e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12683e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12693e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12703e519524SHoward Hinnant{ 1271bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12723e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12733e519524SHoward Hinnant break; 12743e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12753e519524SHoward Hinnant} 12763e519524SHoward Hinnant 12773e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12793e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12803e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12813e519524SHoward Hinnant{ 12823e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12833e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1284ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12853e519524SHoward Hinnant} 12863e519524SHoward Hinnant 12870b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12880b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12890b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12900b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12910b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12920b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12930b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12940b0bbd2fSMarshall Clow{ 1295bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12960b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12970b0bbd2fSMarshall Clow break; 12980b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12990b0bbd2fSMarshall Clow} 13000b0bbd2fSMarshall Clow 13010b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13020b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13030b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13040b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13050b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13060b0bbd2fSMarshall Clow{ 13070b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13080b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13090b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13100b0bbd2fSMarshall Clow} 13110b0bbd2fSMarshall Clow#endif 13120b0bbd2fSMarshall Clow 13133e519524SHoward Hinnant// equal 13143e519524SHoward Hinnant 13153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13173e519524SHoward Hinnantbool 13183e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13193e519524SHoward Hinnant{ 1320910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13213e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13223e519524SHoward Hinnant return false; 13233e519524SHoward Hinnant return true; 13243e519524SHoward Hinnant} 13253e519524SHoward Hinnant 13263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13283e519524SHoward Hinnantbool 13293e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13303e519524SHoward Hinnant{ 13313e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13323e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1333ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13343e519524SHoward Hinnant} 13353e519524SHoward Hinnant 13360b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13370b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13380b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13390b0bbd2fSMarshall Clowbool 13400b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13410b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13420b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13430b0bbd2fSMarshall Clow{ 1344910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13450b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13460b0bbd2fSMarshall Clow return false; 13470b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13480b0bbd2fSMarshall Clow} 13490b0bbd2fSMarshall Clow 13500b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13510b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13520b0bbd2fSMarshall Clowbool 13530b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13540b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13550b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13560b0bbd2fSMarshall Clow{ 13570b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13580b0bbd2fSMarshall Clow return false; 13590b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13600b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13610b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13620b0bbd2fSMarshall Clow} 13630b0bbd2fSMarshall Clow 13640b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13650b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13660b0bbd2fSMarshall Clowbool 13670b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13680b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13690b0bbd2fSMarshall Clow{ 13700b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13710b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13720b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13730b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13740b0bbd2fSMarshall Clow} 13750b0bbd2fSMarshall Clow 13760b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13770b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13780b0bbd2fSMarshall Clowbool 13790b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13800b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13810b0bbd2fSMarshall Clow{ 13820b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13830b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13840b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13850b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13860b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13870b0bbd2fSMarshall Clow} 13880b0bbd2fSMarshall Clow#endif 13890b0bbd2fSMarshall Clow 13903e519524SHoward Hinnant// is_permutation 13913e519524SHoward Hinnant 13923e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13933e519524SHoward Hinnantbool 13943e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13953e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13963e519524SHoward Hinnant{ 13973e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1398910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13993e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 14003e519524SHoward Hinnant goto __not_done; 14013e519524SHoward Hinnant return true; 14023e519524SHoward Hinnant__not_done: 14033e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 14043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1405ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14063e519524SHoward Hinnant if (__l1 == _D1(1)) 14073e519524SHoward Hinnant return false; 1408ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14093e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14103e519524SHoward Hinnant // equal elements in [f2, l2) 14113e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14123e519524SHoward Hinnant { 14133e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 14143e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14153e519524SHoward Hinnant if (__pred(*__j, *__i)) 14163e519524SHoward Hinnant goto __next_iter; 14173e519524SHoward Hinnant { 14183e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14193e519524SHoward Hinnant _D1 __c2 = 0; 14203e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14213e519524SHoward Hinnant if (__pred(*__i, *__j)) 14223e519524SHoward Hinnant ++__c2; 14233e519524SHoward Hinnant if (__c2 == 0) 14243e519524SHoward Hinnant return false; 14253e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14263e519524SHoward Hinnant _D1 __c1 = 1; 1427ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14283e519524SHoward Hinnant if (__pred(*__i, *__j)) 14293e519524SHoward Hinnant ++__c1; 14303e519524SHoward Hinnant if (__c1 != __c2) 14313e519524SHoward Hinnant return false; 14323e519524SHoward Hinnant } 14333e519524SHoward Hinnant__next_iter:; 14343e519524SHoward Hinnant } 14353e519524SHoward Hinnant return true; 14363e519524SHoward Hinnant} 14373e519524SHoward Hinnant 14383e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 14393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14403e519524SHoward Hinnantbool 14413e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14423e519524SHoward Hinnant _ForwardIterator2 __first2) 14433e519524SHoward Hinnant{ 14443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1446ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14473e519524SHoward Hinnant} 14483e519524SHoward Hinnant 14490b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14500b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14510b0bbd2fSMarshall Clowbool 14520b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14530b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14540b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14550b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14560b0bbd2fSMarshall Clow{ 14570b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1458847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14590b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 14600b0bbd2fSMarshall Clow goto __not_done; 14610b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 14620b0bbd2fSMarshall Clow__not_done: 14630b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 14640b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14650b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14660b0bbd2fSMarshall Clow 14670b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1468fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14690b0bbd2fSMarshall Clow if (__l1 != __l2) 14700b0bbd2fSMarshall Clow return false; 14710b0bbd2fSMarshall Clow 14720b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14730b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14740b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14750b0bbd2fSMarshall Clow { 14760b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 14770b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14780b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 14790b0bbd2fSMarshall Clow goto __next_iter; 14800b0bbd2fSMarshall Clow { 14810b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14820b0bbd2fSMarshall Clow _D1 __c2 = 0; 14830b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14840b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14850b0bbd2fSMarshall Clow ++__c2; 14860b0bbd2fSMarshall Clow if (__c2 == 0) 14870b0bbd2fSMarshall Clow return false; 14880b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14890b0bbd2fSMarshall Clow _D1 __c1 = 1; 14900b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14910b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14920b0bbd2fSMarshall Clow ++__c1; 14930b0bbd2fSMarshall Clow if (__c1 != __c2) 14940b0bbd2fSMarshall Clow return false; 14950b0bbd2fSMarshall Clow } 14960b0bbd2fSMarshall Clow__next_iter:; 14970b0bbd2fSMarshall Clow } 14980b0bbd2fSMarshall Clow return true; 14990b0bbd2fSMarshall Clow} 15000b0bbd2fSMarshall Clow 15010b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 15020b0bbd2fSMarshall Clowbool 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> 15160b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 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> 15290b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 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 15443e519524SHoward Hinnant 15453e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 154628cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 15473e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15483e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 15493e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 15503e519524SHoward Hinnant{ 15513e519524SHoward Hinnant if (__first2 == __last2) 155228cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 15533e519524SHoward Hinnant while (true) 15543e519524SHoward Hinnant { 15553e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 15563e519524SHoward Hinnant while (true) 15573e519524SHoward Hinnant { 15583e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 155928cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15603e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15613e519524SHoward Hinnant break; 15623e519524SHoward Hinnant ++__first1; 15633e519524SHoward Hinnant } 15643e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 15653e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 15663e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 15673e519524SHoward Hinnant while (true) 15683e519524SHoward Hinnant { 15693e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 157028cc4ddeSMarshall Clow return make_pair(__first1, __m1); 15713e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 157228cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15733e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 15743e519524SHoward Hinnant { 15753e519524SHoward Hinnant ++__first1; 15763e519524SHoward Hinnant break; 15773e519524SHoward Hinnant } // else there is a match, check next elements 15783e519524SHoward Hinnant } 15793e519524SHoward Hinnant } 15803e519524SHoward Hinnant} 15813e519524SHoward Hinnant 15823e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 158328cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 158428cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 15853e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 15863e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 15873e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 15883e519524SHoward Hinnant{ 158928cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 159028cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 15913e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 159228cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 15933e519524SHoward Hinnant if (__len2 == 0) 159428cc4ddeSMarshall Clow return make_pair(__first1, __first1); 159528cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 15963e519524SHoward Hinnant if (__len1 < __len2) 159728cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15983e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 1599b9775795SAditya Kumar 16003e519524SHoward Hinnant while (true) 16013e519524SHoward Hinnant { 16023e519524SHoward Hinnant while (true) 16033e519524SHoward Hinnant { 16043e519524SHoward Hinnant if (__first1 == __s) 160528cc4ddeSMarshall Clow return make_pair(__last1, __last1); 16063e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 16073e519524SHoward Hinnant break; 16083e519524SHoward Hinnant ++__first1; 16093e519524SHoward Hinnant } 1610b9775795SAditya Kumar 16113e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 16123e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 16133e519524SHoward Hinnant while (true) 16143e519524SHoward Hinnant { 16153e519524SHoward Hinnant if (++__m2 == __last2) 161628cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 16173e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 16183e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 16193e519524SHoward Hinnant { 16203e519524SHoward Hinnant ++__first1; 16213e519524SHoward Hinnant break; 16223e519524SHoward Hinnant } 16233e519524SHoward Hinnant } 16243e519524SHoward Hinnant } 16253e519524SHoward Hinnant} 16263e519524SHoward Hinnant 16273e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 16283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16293e519524SHoward Hinnant_ForwardIterator1 16303e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16313e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 16323e519524SHoward Hinnant{ 1633ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 16343e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 163528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 163628cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 163728cc4ddeSMarshall Clow .first; 16383e519524SHoward Hinnant} 16393e519524SHoward Hinnant 16403e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16423e519524SHoward Hinnant_ForwardIterator1 16433e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16443e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16453e519524SHoward Hinnant{ 164628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 164728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1648ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16493e519524SHoward Hinnant} 16503e519524SHoward Hinnant 16513e519524SHoward Hinnant// search_n 16523e519524SHoward Hinnant 16533e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16543e519524SHoward Hinnant_ForwardIterator 16553e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1656e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16573e519524SHoward Hinnant{ 16583e519524SHoward Hinnant if (__count <= 0) 16593e519524SHoward Hinnant return __first; 16603e519524SHoward Hinnant while (true) 16613e519524SHoward Hinnant { 1662e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16633e519524SHoward Hinnant while (true) 16643e519524SHoward Hinnant { 1665e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16663e519524SHoward Hinnant return __last; 1667e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16683e519524SHoward Hinnant break; 16693e519524SHoward Hinnant ++__first; 16703e519524SHoward Hinnant } 1671e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16723e519524SHoward Hinnant _ForwardIterator __m = __first; 16733e519524SHoward Hinnant _Size __c(0); 16743e519524SHoward Hinnant while (true) 16753e519524SHoward Hinnant { 16763e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16773e519524SHoward Hinnant return __first; 16783e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16793e519524SHoward Hinnant return __last; 1680e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16813e519524SHoward Hinnant { 16823e519524SHoward Hinnant __first = __m; 16833e519524SHoward Hinnant ++__first; 16843e519524SHoward Hinnant break; 16853e519524SHoward Hinnant } // else there is a match, check next elements 16863e519524SHoward Hinnant } 16873e519524SHoward Hinnant } 16883e519524SHoward Hinnant} 16893e519524SHoward Hinnant 16903e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16913e519524SHoward Hinnant_RandomAccessIterator 16923e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1693e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16943e519524SHoward Hinnant{ 16953e519524SHoward Hinnant if (__count <= 0) 16963e519524SHoward Hinnant return __first; 16973e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16983e519524SHoward Hinnant if (__len < __count) 16993e519524SHoward Hinnant return __last; 17003e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 17013e519524SHoward Hinnant while (true) 17023e519524SHoward Hinnant { 1703e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 17043e519524SHoward Hinnant while (true) 17053e519524SHoward Hinnant { 1706b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 17073e519524SHoward Hinnant return __last; 1708e4383379SHoward Hinnant if (__pred(*__first, __value_)) 17093e519524SHoward Hinnant break; 17103e519524SHoward Hinnant ++__first; 17113e519524SHoward Hinnant } 1712e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 17133e519524SHoward Hinnant _RandomAccessIterator __m = __first; 17143e519524SHoward Hinnant _Size __c(0); 17153e519524SHoward Hinnant while (true) 17163e519524SHoward Hinnant { 17173e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 17183e519524SHoward Hinnant return __first; 17193e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1720e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 17213e519524SHoward Hinnant { 17223e519524SHoward Hinnant __first = __m; 17233e519524SHoward Hinnant ++__first; 17243e519524SHoward Hinnant break; 17253e519524SHoward Hinnant } // else there is a match, check next elements 17263e519524SHoward Hinnant } 17273e519524SHoward Hinnant } 17283e519524SHoward Hinnant} 17293e519524SHoward Hinnant 17303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 17313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17323e519524SHoward Hinnant_ForwardIterator 17333e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1734e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 17353e519524SHoward Hinnant{ 1736ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 173751544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 173851544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 17393e519524SHoward Hinnant} 17403e519524SHoward Hinnant 17413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17433e519524SHoward Hinnant_ForwardIterator 1744e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17453e519524SHoward Hinnant{ 17463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 174751544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 174851544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17493e519524SHoward Hinnant} 17503e519524SHoward Hinnant 17513e519524SHoward Hinnant// copy 17523e519524SHoward Hinnanttemplate <class _Iter> 17533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17543e519524SHoward Hinnant_Iter 17553e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17563e519524SHoward Hinnant{ 17573e519524SHoward Hinnant return __i; 17583e519524SHoward Hinnant} 17593e519524SHoward Hinnant 17603e519524SHoward Hinnanttemplate <class _Tp> 17613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17623e519524SHoward Hinnanttypename enable_if 17633e519524SHoward Hinnant< 1764ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17653e519524SHoward Hinnant _Tp* 17663e519524SHoward Hinnant>::type 17673e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17683e519524SHoward Hinnant{ 17693e519524SHoward Hinnant return __i.base(); 17703e519524SHoward Hinnant} 17713e519524SHoward Hinnant 1772fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1773fc88dbd2SHoward Hinnant 17743e519524SHoward Hinnanttemplate <class _Tp> 17753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17763e519524SHoward Hinnanttypename enable_if 17773e519524SHoward Hinnant< 1778ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17793e519524SHoward Hinnant _Tp* 17803e519524SHoward Hinnant>::type 17813e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17823e519524SHoward Hinnant{ 17833e519524SHoward Hinnant return __i.base(); 17843e519524SHoward Hinnant} 17853e519524SHoward Hinnant 178614bd0bf0SEric Fiselier#else 178714bd0bf0SEric Fiselier 178814bd0bf0SEric Fiseliertemplate <class _Tp> 178914bd0bf0SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 179014bd0bf0SEric Fiseliertypename enable_if 179114bd0bf0SEric Fiselier< 179214bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 179314bd0bf0SEric Fiselier __wrap_iter<_Tp*> 179414bd0bf0SEric Fiselier>::type 179514bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 179614bd0bf0SEric Fiselier{ 179714bd0bf0SEric Fiselier return __i; 179814bd0bf0SEric Fiselier} 179914bd0bf0SEric Fiselier 1800fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1801fc88dbd2SHoward Hinnant 18023e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18043e519524SHoward Hinnant_OutputIterator 18053e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18063e519524SHoward Hinnant{ 1807910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18083e519524SHoward Hinnant *__result = *__first; 18093e519524SHoward Hinnant return __result; 18103e519524SHoward Hinnant} 18113e519524SHoward Hinnant 18123e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18143e519524SHoward Hinnanttypename enable_if 18153e519524SHoward Hinnant< 18163e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1817ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18183e519524SHoward Hinnant _Up* 18193e519524SHoward Hinnant>::type 18203e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 18213e519524SHoward Hinnant{ 18223e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18235b312052SMarshall Clow if (__n > 0) 1824ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18253e519524SHoward Hinnant return __result + __n; 18263e519524SHoward Hinnant} 18273e519524SHoward Hinnant 18283e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18303e519524SHoward Hinnant_OutputIterator 18313e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18323e519524SHoward Hinnant{ 1833ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18343e519524SHoward Hinnant} 18353e519524SHoward Hinnant 18363e519524SHoward Hinnant// copy_backward 18373e519524SHoward Hinnant 1838d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 18393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18403e519524SHoward Hinnant_OutputIterator 1841d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 18423e519524SHoward Hinnant{ 18433e519524SHoward Hinnant while (__first != __last) 18443e519524SHoward Hinnant *--__result = *--__last; 18453e519524SHoward Hinnant return __result; 18463e519524SHoward Hinnant} 18473e519524SHoward Hinnant 18483e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18503e519524SHoward Hinnanttypename enable_if 18513e519524SHoward Hinnant< 18523e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1853ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18543e519524SHoward Hinnant _Up* 18553e519524SHoward Hinnant>::type 18563e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18573e519524SHoward Hinnant{ 18583e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18595b312052SMarshall Clow if (__n > 0) 18605b312052SMarshall Clow { 18613e519524SHoward Hinnant __result -= __n; 1862ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18635b312052SMarshall Clow } 18643e519524SHoward Hinnant return __result; 18653e519524SHoward Hinnant} 18663e519524SHoward Hinnant 18673e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18693e519524SHoward Hinnant_BidirectionalIterator2 18703e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18713e519524SHoward Hinnant _BidirectionalIterator2 __result) 18723e519524SHoward Hinnant{ 1873fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1874fd838227SEric Fiselier __unwrap_iter(__last), 1875fd838227SEric Fiselier __unwrap_iter(__result)); 18763e519524SHoward Hinnant} 18773e519524SHoward Hinnant 18783e519524SHoward Hinnant// copy_if 18793e519524SHoward Hinnant 18803e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18823e519524SHoward Hinnant_OutputIterator 18833e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18843e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18853e519524SHoward Hinnant{ 18863e519524SHoward Hinnant for (; __first != __last; ++__first) 18873e519524SHoward Hinnant { 18883e519524SHoward Hinnant if (__pred(*__first)) 18893e519524SHoward Hinnant { 18903e519524SHoward Hinnant *__result = *__first; 18913e519524SHoward Hinnant ++__result; 18923e519524SHoward Hinnant } 18933e519524SHoward Hinnant } 18943e519524SHoward Hinnant return __result; 18953e519524SHoward Hinnant} 18963e519524SHoward Hinnant 18973e519524SHoward Hinnant// copy_n 18983e519524SHoward Hinnant 18993e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19013e519524SHoward Hinnanttypename enable_if 19023e519524SHoward Hinnant< 19033e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 19043e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 19053e519524SHoward Hinnant _OutputIterator 19063e519524SHoward Hinnant>::type 190751544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19083e519524SHoward Hinnant{ 190951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 191051544023SEric Fiselier _IntegralSize __n = __orig_n; 191199847d2bSHoward Hinnant if (__n > 0) 191299847d2bSHoward Hinnant { 19133e519524SHoward Hinnant *__result = *__first; 191499847d2bSHoward Hinnant ++__result; 191599847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 191699847d2bSHoward Hinnant { 191799847d2bSHoward Hinnant ++__first; 191899847d2bSHoward Hinnant *__result = *__first; 191999847d2bSHoward Hinnant ++__result; 192099847d2bSHoward Hinnant } 192199847d2bSHoward Hinnant } 19223e519524SHoward Hinnant return __result; 19233e519524SHoward Hinnant} 19243e519524SHoward Hinnant 19253e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19273e519524SHoward Hinnanttypename enable_if 19283e519524SHoward Hinnant< 19293e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 19303e519524SHoward Hinnant _OutputIterator 19313e519524SHoward Hinnant>::type 193251544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19333e519524SHoward Hinnant{ 193451544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 193551544023SEric Fiselier _IntegralSize __n = __orig_n; 1936ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 19373e519524SHoward Hinnant} 19383e519524SHoward Hinnant 19393e519524SHoward Hinnant// move 19403e519524SHoward Hinnant 19413e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19433e519524SHoward Hinnant_OutputIterator 19443e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19453e519524SHoward Hinnant{ 1946910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1947ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 19483e519524SHoward Hinnant return __result; 19493e519524SHoward Hinnant} 19503e519524SHoward Hinnant 19513e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19533e519524SHoward Hinnanttypename enable_if 19543e519524SHoward Hinnant< 19553e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1956ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19573e519524SHoward Hinnant _Up* 19583e519524SHoward Hinnant>::type 19593e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19603e519524SHoward Hinnant{ 19613e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19625b312052SMarshall Clow if (__n > 0) 1963ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19643e519524SHoward Hinnant return __result + __n; 19653e519524SHoward Hinnant} 19663e519524SHoward Hinnant 19673e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19693e519524SHoward Hinnant_OutputIterator 19703e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19713e519524SHoward Hinnant{ 1972ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19733e519524SHoward Hinnant} 19743e519524SHoward Hinnant 19753e519524SHoward Hinnant// move_backward 19763e519524SHoward Hinnant 19773e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19793e519524SHoward Hinnant_OutputIterator 19803e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19813e519524SHoward Hinnant{ 19823e519524SHoward Hinnant while (__first != __last) 1983ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19843e519524SHoward Hinnant return __result; 19853e519524SHoward Hinnant} 19863e519524SHoward Hinnant 19873e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19893e519524SHoward Hinnanttypename enable_if 19903e519524SHoward Hinnant< 19913e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1992ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19933e519524SHoward Hinnant _Up* 19943e519524SHoward Hinnant>::type 19953e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19963e519524SHoward Hinnant{ 19973e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19985b312052SMarshall Clow if (__n > 0) 19995b312052SMarshall Clow { 20003e519524SHoward Hinnant __result -= __n; 2001ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 20025b312052SMarshall Clow } 20033e519524SHoward Hinnant return __result; 20043e519524SHoward Hinnant} 20053e519524SHoward Hinnant 20063e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 20073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20083e519524SHoward Hinnant_BidirectionalIterator2 20093e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 20103e519524SHoward Hinnant _BidirectionalIterator2 __result) 20113e519524SHoward Hinnant{ 2012ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 20133e519524SHoward Hinnant} 20143e519524SHoward Hinnant 20153e519524SHoward Hinnant// iter_swap 20163e519524SHoward Hinnant 2017a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 20183e519524SHoward Hinnant 20193e519524SHoward Hinnant// transform 20203e519524SHoward Hinnant 20213e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 20223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20233e519524SHoward Hinnant_OutputIterator 20243e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 20253e519524SHoward Hinnant{ 2026910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20273e519524SHoward Hinnant *__result = __op(*__first); 20283e519524SHoward Hinnant return __result; 20293e519524SHoward Hinnant} 20303e519524SHoward Hinnant 20313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 20323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20333e519524SHoward Hinnant_OutputIterator 20343e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 20353e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 20363e519524SHoward Hinnant{ 2037910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 20383e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 20393e519524SHoward Hinnant return __result; 20403e519524SHoward Hinnant} 20413e519524SHoward Hinnant 20423e519524SHoward Hinnant// replace 20433e519524SHoward Hinnant 20443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20463e519524SHoward Hinnantvoid 20473e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20483e519524SHoward Hinnant{ 20493e519524SHoward Hinnant for (; __first != __last; ++__first) 20503e519524SHoward Hinnant if (*__first == __old_value) 20513e519524SHoward Hinnant *__first = __new_value; 20523e519524SHoward Hinnant} 20533e519524SHoward Hinnant 20543e519524SHoward Hinnant// replace_if 20553e519524SHoward Hinnant 20563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20583e519524SHoward Hinnantvoid 20593e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20603e519524SHoward Hinnant{ 20613e519524SHoward Hinnant for (; __first != __last; ++__first) 20623e519524SHoward Hinnant if (__pred(*__first)) 20633e519524SHoward Hinnant *__first = __new_value; 20643e519524SHoward Hinnant} 20653e519524SHoward Hinnant 20663e519524SHoward Hinnant// replace_copy 20673e519524SHoward Hinnant 20683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20703e519524SHoward Hinnant_OutputIterator 20713e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20723e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20733e519524SHoward Hinnant{ 2074910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20753e519524SHoward Hinnant if (*__first == __old_value) 20763e519524SHoward Hinnant *__result = __new_value; 20773e519524SHoward Hinnant else 20783e519524SHoward Hinnant *__result = *__first; 20793e519524SHoward Hinnant return __result; 20803e519524SHoward Hinnant} 20813e519524SHoward Hinnant 20823e519524SHoward Hinnant// replace_copy_if 20833e519524SHoward Hinnant 20843e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20863e519524SHoward Hinnant_OutputIterator 20873e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20883e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20893e519524SHoward Hinnant{ 2090910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20913e519524SHoward Hinnant if (__pred(*__first)) 20923e519524SHoward Hinnant *__result = __new_value; 20933e519524SHoward Hinnant else 20943e519524SHoward Hinnant *__result = *__first; 20953e519524SHoward Hinnant return __result; 20963e519524SHoward Hinnant} 20973e519524SHoward Hinnant 20983e519524SHoward Hinnant// fill_n 20993e519524SHoward Hinnant 21003e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21023e519524SHoward Hinnant_OutputIterator 21030f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21043e519524SHoward Hinnant{ 2105910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2106e4383379SHoward Hinnant *__first = __value_; 21073e519524SHoward Hinnant return __first; 21083e519524SHoward Hinnant} 21093e519524SHoward Hinnant 21100f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 21113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21120f242beaSHoward Hinnanttypename enable_if 21130f242beaSHoward Hinnant< 21140f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 21150f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 21160f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 21170f242beaSHoward Hinnant _Tp* 21180f242beaSHoward Hinnant>::type 21190f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 21203e519524SHoward Hinnant{ 21213e519524SHoward Hinnant if (__n > 0) 2122e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 21233e519524SHoward Hinnant return __first + __n; 21243e519524SHoward Hinnant} 21253e519524SHoward Hinnant 21263e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21283e519524SHoward Hinnant_OutputIterator 2129e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21303e519524SHoward Hinnant{ 213151544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 21323e519524SHoward Hinnant} 21333e519524SHoward Hinnant 21343e519524SHoward Hinnant// fill 21353e519524SHoward Hinnant 21363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21383e519524SHoward Hinnantvoid 2139e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 21403e519524SHoward Hinnant{ 21413e519524SHoward Hinnant for (; __first != __last; ++__first) 2142e4383379SHoward Hinnant *__first = __value_; 21433e519524SHoward Hinnant} 21443e519524SHoward Hinnant 21453e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 21463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21473e519524SHoward Hinnantvoid 2148e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 21493e519524SHoward Hinnant{ 2150e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 21513e519524SHoward Hinnant} 21523e519524SHoward Hinnant 21533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21553e519524SHoward Hinnantvoid 2156e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21573e519524SHoward Hinnant{ 2158e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21593e519524SHoward Hinnant} 21603e519524SHoward Hinnant 21613e519524SHoward Hinnant// generate 21623e519524SHoward Hinnant 21633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21653e519524SHoward Hinnantvoid 21663e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21673e519524SHoward Hinnant{ 21683e519524SHoward Hinnant for (; __first != __last; ++__first) 21693e519524SHoward Hinnant *__first = __gen(); 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnant// generate_n 21733e519524SHoward Hinnant 21743e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21763e519524SHoward Hinnant_OutputIterator 217751544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21783e519524SHoward Hinnant{ 217951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 218051544023SEric Fiselier _IntegralSize __n = __orig_n; 2181910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21823e519524SHoward Hinnant *__first = __gen(); 21833e519524SHoward Hinnant return __first; 21843e519524SHoward Hinnant} 21853e519524SHoward Hinnant 21863e519524SHoward Hinnant// remove 21873e519524SHoward Hinnant 21883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21893e519524SHoward Hinnant_ForwardIterator 2190e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21913e519524SHoward Hinnant{ 2192e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21933e519524SHoward Hinnant if (__first != __last) 21943e519524SHoward Hinnant { 21953e519524SHoward Hinnant _ForwardIterator __i = __first; 21963e519524SHoward Hinnant while (++__i != __last) 21973e519524SHoward Hinnant { 2198e4383379SHoward Hinnant if (!(*__i == __value_)) 21993e519524SHoward Hinnant { 2200ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22013e519524SHoward Hinnant ++__first; 22023e519524SHoward Hinnant } 22033e519524SHoward Hinnant } 22043e519524SHoward Hinnant } 22053e519524SHoward Hinnant return __first; 22063e519524SHoward Hinnant} 22073e519524SHoward Hinnant 22083e519524SHoward Hinnant// remove_if 22093e519524SHoward Hinnant 22103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 22113e519524SHoward Hinnant_ForwardIterator 22123e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 22133e519524SHoward Hinnant{ 2214ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 22153e519524SHoward Hinnant (__first, __last, __pred); 22163e519524SHoward Hinnant if (__first != __last) 22173e519524SHoward Hinnant { 22183e519524SHoward Hinnant _ForwardIterator __i = __first; 22193e519524SHoward Hinnant while (++__i != __last) 22203e519524SHoward Hinnant { 22213e519524SHoward Hinnant if (!__pred(*__i)) 22223e519524SHoward Hinnant { 2223ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22243e519524SHoward Hinnant ++__first; 22253e519524SHoward Hinnant } 22263e519524SHoward Hinnant } 22273e519524SHoward Hinnant } 22283e519524SHoward Hinnant return __first; 22293e519524SHoward Hinnant} 22303e519524SHoward Hinnant 22313e519524SHoward Hinnant// remove_copy 22323e519524SHoward Hinnant 22333e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 22343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22353e519524SHoward Hinnant_OutputIterator 2236e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 22373e519524SHoward Hinnant{ 22383e519524SHoward Hinnant for (; __first != __last; ++__first) 22393e519524SHoward Hinnant { 2240e4383379SHoward Hinnant if (!(*__first == __value_)) 22413e519524SHoward Hinnant { 22423e519524SHoward Hinnant *__result = *__first; 22433e519524SHoward Hinnant ++__result; 22443e519524SHoward Hinnant } 22453e519524SHoward Hinnant } 22463e519524SHoward Hinnant return __result; 22473e519524SHoward Hinnant} 22483e519524SHoward Hinnant 22493e519524SHoward Hinnant// remove_copy_if 22503e519524SHoward Hinnant 22513e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 22523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22533e519524SHoward Hinnant_OutputIterator 22543e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 22553e519524SHoward Hinnant{ 22563e519524SHoward Hinnant for (; __first != __last; ++__first) 22573e519524SHoward Hinnant { 22583e519524SHoward Hinnant if (!__pred(*__first)) 22593e519524SHoward Hinnant { 22603e519524SHoward Hinnant *__result = *__first; 22613e519524SHoward Hinnant ++__result; 22623e519524SHoward Hinnant } 22633e519524SHoward Hinnant } 22643e519524SHoward Hinnant return __result; 22653e519524SHoward Hinnant} 22663e519524SHoward Hinnant 22673e519524SHoward Hinnant// unique 22683e519524SHoward Hinnant 22693e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22703e519524SHoward Hinnant_ForwardIterator 22713e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22723e519524SHoward Hinnant{ 2273ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22743e519524SHoward Hinnant (__first, __last, __pred); 22753e519524SHoward Hinnant if (__first != __last) 22763e519524SHoward Hinnant { 22773e519524SHoward Hinnant // ... a a ? ... 22783e519524SHoward Hinnant // f i 22793e519524SHoward Hinnant _ForwardIterator __i = __first; 22803e519524SHoward Hinnant for (++__i; ++__i != __last;) 22813e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2282ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22833e519524SHoward Hinnant ++__first; 22843e519524SHoward Hinnant } 22853e519524SHoward Hinnant return __first; 22863e519524SHoward Hinnant} 22873e519524SHoward Hinnant 22883e519524SHoward Hinnanttemplate <class _ForwardIterator> 22893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22903e519524SHoward Hinnant_ForwardIterator 22913e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22923e519524SHoward Hinnant{ 22933e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2294ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22953e519524SHoward Hinnant} 22963e519524SHoward Hinnant 22973e519524SHoward Hinnant// unique_copy 22983e519524SHoward Hinnant 22993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 23003e519524SHoward Hinnant_OutputIterator 23013e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23023e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 23033e519524SHoward Hinnant{ 23043e519524SHoward Hinnant if (__first != __last) 23053e519524SHoward Hinnant { 23063e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 23073e519524SHoward Hinnant *__result = __t; 23083e519524SHoward Hinnant ++__result; 23093e519524SHoward Hinnant while (++__first != __last) 23103e519524SHoward Hinnant { 23113e519524SHoward Hinnant if (!__pred(__t, *__first)) 23123e519524SHoward Hinnant { 23133e519524SHoward Hinnant __t = *__first; 23143e519524SHoward Hinnant *__result = __t; 23153e519524SHoward Hinnant ++__result; 23163e519524SHoward Hinnant } 23173e519524SHoward Hinnant } 23183e519524SHoward Hinnant } 23193e519524SHoward Hinnant return __result; 23203e519524SHoward Hinnant} 23213e519524SHoward Hinnant 23223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 23233e519524SHoward Hinnant_OutputIterator 23243e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23253e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 23263e519524SHoward Hinnant{ 23273e519524SHoward Hinnant if (__first != __last) 23283e519524SHoward Hinnant { 23293e519524SHoward Hinnant _ForwardIterator __i = __first; 23303e519524SHoward Hinnant *__result = *__i; 23313e519524SHoward Hinnant ++__result; 23323e519524SHoward Hinnant while (++__first != __last) 23333e519524SHoward Hinnant { 23343e519524SHoward Hinnant if (!__pred(*__i, *__first)) 23353e519524SHoward Hinnant { 23363e519524SHoward Hinnant *__result = *__first; 23373e519524SHoward Hinnant ++__result; 23383e519524SHoward Hinnant __i = __first; 23393e519524SHoward Hinnant } 23403e519524SHoward Hinnant } 23413e519524SHoward Hinnant } 23423e519524SHoward Hinnant return __result; 23433e519524SHoward Hinnant} 23443e519524SHoward Hinnant 23453e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 23463e519524SHoward Hinnant_ForwardIterator 23473e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 23483e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 23493e519524SHoward Hinnant{ 23503e519524SHoward Hinnant if (__first != __last) 23513e519524SHoward Hinnant { 23523e519524SHoward Hinnant *__result = *__first; 23533e519524SHoward Hinnant while (++__first != __last) 23543e519524SHoward Hinnant if (!__pred(*__result, *__first)) 23553e519524SHoward Hinnant *++__result = *__first; 23563e519524SHoward Hinnant ++__result; 23573e519524SHoward Hinnant } 23583e519524SHoward Hinnant return __result; 23593e519524SHoward Hinnant} 23603e519524SHoward Hinnant 23613e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23633e519524SHoward Hinnant_OutputIterator 23643e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23653e519524SHoward Hinnant{ 2366ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23673e519524SHoward Hinnant (__first, __last, __result, __pred, 23683e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23693e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23703e519524SHoward Hinnant} 23713e519524SHoward Hinnant 23723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23743e519524SHoward Hinnant_OutputIterator 23753e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23763e519524SHoward Hinnant{ 23773e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2378ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23793e519524SHoward Hinnant} 23803e519524SHoward Hinnant 23813e519524SHoward Hinnant// reverse 23823e519524SHoward Hinnant 23833e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23853e519524SHoward Hinnantvoid 23863e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23873e519524SHoward Hinnant{ 23883e519524SHoward Hinnant while (__first != __last) 23893e519524SHoward Hinnant { 23903e519524SHoward Hinnant if (__first == --__last) 23913e519524SHoward Hinnant break; 2392def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23933e519524SHoward Hinnant ++__first; 23943e519524SHoward Hinnant } 23953e519524SHoward Hinnant} 23963e519524SHoward Hinnant 23973e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23993e519524SHoward Hinnantvoid 24003e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 24013e519524SHoward Hinnant{ 24023e519524SHoward Hinnant if (__first != __last) 24033e519524SHoward Hinnant for (; __first < --__last; ++__first) 2404def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 24053e519524SHoward Hinnant} 24063e519524SHoward Hinnant 24073e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 24083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24093e519524SHoward Hinnantvoid 24103e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 24113e519524SHoward Hinnant{ 2412ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 24133e519524SHoward Hinnant} 24143e519524SHoward Hinnant 24153e519524SHoward Hinnant// reverse_copy 24163e519524SHoward Hinnant 24173e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 24183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24193e519524SHoward Hinnant_OutputIterator 24203e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 24213e519524SHoward Hinnant{ 24223e519524SHoward Hinnant for (; __first != __last; ++__result) 24233e519524SHoward Hinnant *__result = *--__last; 24243e519524SHoward Hinnant return __result; 24253e519524SHoward Hinnant} 24263e519524SHoward Hinnant 24273e519524SHoward Hinnant// rotate 24283e519524SHoward Hinnant 24293e519524SHoward Hinnanttemplate <class _ForwardIterator> 24303e519524SHoward Hinnant_ForwardIterator 2431aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 24323e519524SHoward Hinnant{ 2433aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2434aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2435aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2436aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2437aca09de3SHoward Hinnant return __lm1; 2438aca09de3SHoward Hinnant} 2439aca09de3SHoward Hinnant 2440aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2441aca09de3SHoward Hinnant_BidirectionalIterator 2442aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2443aca09de3SHoward Hinnant{ 2444aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2445aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2446aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2447aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2448aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2449aca09de3SHoward Hinnant return __fp1; 2450aca09de3SHoward Hinnant} 2451aca09de3SHoward Hinnant 2452aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2453aca09de3SHoward Hinnant_ForwardIterator 2454aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2455aca09de3SHoward Hinnant{ 24563e519524SHoward Hinnant _ForwardIterator __i = __middle; 24573e519524SHoward Hinnant while (true) 24583e519524SHoward Hinnant { 24593e519524SHoward Hinnant swap(*__first, *__i); 24603e519524SHoward Hinnant ++__first; 24613e519524SHoward Hinnant if (++__i == __last) 24623e519524SHoward Hinnant break; 24633e519524SHoward Hinnant if (__first == __middle) 24643e519524SHoward Hinnant __middle = __i; 24653e519524SHoward Hinnant } 24663e519524SHoward Hinnant _ForwardIterator __r = __first; 24673e519524SHoward Hinnant if (__first != __middle) 24683e519524SHoward Hinnant { 24693e519524SHoward Hinnant __i = __middle; 24703e519524SHoward Hinnant while (true) 24713e519524SHoward Hinnant { 24723e519524SHoward Hinnant swap(*__first, *__i); 24733e519524SHoward Hinnant ++__first; 24743e519524SHoward Hinnant if (++__i == __last) 24753e519524SHoward Hinnant { 24763e519524SHoward Hinnant if (__first == __middle) 24773e519524SHoward Hinnant break; 24783e519524SHoward Hinnant __i = __middle; 24793e519524SHoward Hinnant } 24803e519524SHoward Hinnant else if (__first == __middle) 24813e519524SHoward Hinnant __middle = __i; 24823e519524SHoward Hinnant } 24833e519524SHoward Hinnant } 24843e519524SHoward Hinnant return __r; 24853e519524SHoward Hinnant} 24863e519524SHoward Hinnant 24873e519524SHoward Hinnanttemplate<typename _Integral> 24883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24893e519524SHoward Hinnant_Integral 249019b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24913e519524SHoward Hinnant{ 24923e519524SHoward Hinnant do 24933e519524SHoward Hinnant { 24943e519524SHoward Hinnant _Integral __t = __x % __y; 24953e519524SHoward Hinnant __x = __y; 24963e519524SHoward Hinnant __y = __t; 24973e519524SHoward Hinnant } while (__y); 24983e519524SHoward Hinnant return __x; 24993e519524SHoward Hinnant} 25003e519524SHoward Hinnant 25013e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 25023e519524SHoward Hinnant_RandomAccessIterator 2503aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 25043e519524SHoward Hinnant{ 25053e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 25063e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 25073e519524SHoward Hinnant 25083e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 25093e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 25103e519524SHoward Hinnant if (__m1 == __m2) 25113e519524SHoward Hinnant { 2512ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 25133e519524SHoward Hinnant return __middle; 25143e519524SHoward Hinnant } 251519b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 25163e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 25173e519524SHoward Hinnant { 2518aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 25193e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 25203e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 25213e519524SHoward Hinnant do 25223e519524SHoward Hinnant { 2523aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 25243e519524SHoward Hinnant __p1 = __p2; 25253e519524SHoward Hinnant const difference_type __d = __last - __p2; 25263e519524SHoward Hinnant if (__m1 < __d) 25273e519524SHoward Hinnant __p2 += __m1; 25283e519524SHoward Hinnant else 25293e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 25303e519524SHoward Hinnant } while (__p2 != __p); 2531aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 25323e519524SHoward Hinnant } 25333e519524SHoward Hinnant return __first + __m2; 25343e519524SHoward Hinnant} 25353e519524SHoward Hinnant 25363e519524SHoward Hinnanttemplate <class _ForwardIterator> 25373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25383e519524SHoward Hinnant_ForwardIterator 2539aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2540aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2541aca09de3SHoward Hinnant{ 2542aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2543aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2544aca09de3SHoward Hinnant { 2545aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2546aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2547aca09de3SHoward Hinnant } 2548aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2549aca09de3SHoward Hinnant} 2550aca09de3SHoward Hinnant 2551aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2552aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2553aca09de3SHoward Hinnant_BidirectionalIterator 2554aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2555aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2556aca09de3SHoward Hinnant{ 2557aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2558aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2559aca09de3SHoward Hinnant { 2560aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2561aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2562aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2563aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2564aca09de3SHoward Hinnant } 2565aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2566aca09de3SHoward Hinnant} 2567aca09de3SHoward Hinnant 2568aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2569aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2570aca09de3SHoward Hinnant_RandomAccessIterator 2571aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2572aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2573aca09de3SHoward Hinnant{ 2574aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2575aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2576aca09de3SHoward Hinnant { 2577aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2578aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2579aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2580aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2581aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2582aca09de3SHoward Hinnant } 2583aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2584aca09de3SHoward Hinnant} 2585aca09de3SHoward Hinnant 2586aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2587aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2588aca09de3SHoward Hinnant_ForwardIterator 25893e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25903e519524SHoward Hinnant{ 2591aca09de3SHoward Hinnant if (__first == __middle) 2592aca09de3SHoward Hinnant return __last; 2593aca09de3SHoward Hinnant if (__middle == __last) 2594aca09de3SHoward Hinnant return __first; 2595ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2596aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25973e519524SHoward Hinnant} 25983e519524SHoward Hinnant 25993e519524SHoward Hinnant// rotate_copy 26003e519524SHoward Hinnant 26013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 26023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26033e519524SHoward Hinnant_OutputIterator 26043e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 26053e519524SHoward Hinnant{ 2606ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 26073e519524SHoward Hinnant} 26083e519524SHoward Hinnant 26093e519524SHoward Hinnant// min_element 26103e519524SHoward Hinnant 26113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26129d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26133e519524SHoward Hinnant_ForwardIterator 26140b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26153e519524SHoward Hinnant{ 26163e519524SHoward Hinnant if (__first != __last) 26173e519524SHoward Hinnant { 26183e519524SHoward Hinnant _ForwardIterator __i = __first; 26193e519524SHoward Hinnant while (++__i != __last) 26203e519524SHoward Hinnant if (__comp(*__i, *__first)) 26213e519524SHoward Hinnant __first = __i; 26223e519524SHoward Hinnant } 26233e519524SHoward Hinnant return __first; 26243e519524SHoward Hinnant} 26253e519524SHoward Hinnant 26263e519524SHoward Hinnanttemplate <class _ForwardIterator> 26270b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26283e519524SHoward Hinnant_ForwardIterator 26293e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 26303e519524SHoward Hinnant{ 26310b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 26324eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26334eb27b79SHoward Hinnant} 26344eb27b79SHoward Hinnant 26354eb27b79SHoward Hinnant// min 26364eb27b79SHoward Hinnant 26374eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26389d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26394eb27b79SHoward Hinnantconst _Tp& 26404eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 26414eb27b79SHoward Hinnant{ 26424eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 26434eb27b79SHoward Hinnant} 26444eb27b79SHoward Hinnant 26454eb27b79SHoward Hinnanttemplate <class _Tp> 26469d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26474eb27b79SHoward Hinnantconst _Tp& 26484eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 26494eb27b79SHoward Hinnant{ 2650ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26514eb27b79SHoward Hinnant} 26524eb27b79SHoward Hinnant 2653ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265454976f26SHoward Hinnant 26554eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26569d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26574eb27b79SHoward Hinnant_Tp 26584eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26594eb27b79SHoward Hinnant{ 26600b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26614eb27b79SHoward Hinnant} 26624eb27b79SHoward Hinnant 26634eb27b79SHoward Hinnanttemplate<class _Tp> 26649d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26654eb27b79SHoward Hinnant_Tp 26664eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26674eb27b79SHoward Hinnant{ 26680b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26693e519524SHoward Hinnant} 26703e519524SHoward Hinnant 2671ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 267254976f26SHoward Hinnant 26733e519524SHoward Hinnant// max_element 26743e519524SHoward Hinnant 26753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26769d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26773e519524SHoward Hinnant_ForwardIterator 26780b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26793e519524SHoward Hinnant{ 26803e519524SHoward Hinnant if (__first != __last) 26813e519524SHoward Hinnant { 26823e519524SHoward Hinnant _ForwardIterator __i = __first; 26833e519524SHoward Hinnant while (++__i != __last) 26843e519524SHoward Hinnant if (__comp(*__first, *__i)) 26853e519524SHoward Hinnant __first = __i; 26863e519524SHoward Hinnant } 26873e519524SHoward Hinnant return __first; 26883e519524SHoward Hinnant} 26893e519524SHoward Hinnant 26909d67c6d5SMarshall Clow 26913e519524SHoward Hinnanttemplate <class _ForwardIterator> 26920b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26933e519524SHoward Hinnant_ForwardIterator 26943e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26953e519524SHoward Hinnant{ 26960b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26974eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26984eb27b79SHoward Hinnant} 26994eb27b79SHoward Hinnant 27004eb27b79SHoward Hinnant// max 27014eb27b79SHoward Hinnant 27024eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 27039d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27044eb27b79SHoward Hinnantconst _Tp& 27054eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27064eb27b79SHoward Hinnant{ 27074eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 27084eb27b79SHoward Hinnant} 27094eb27b79SHoward Hinnant 27104eb27b79SHoward Hinnanttemplate <class _Tp> 27119d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27124eb27b79SHoward Hinnantconst _Tp& 27134eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 27144eb27b79SHoward Hinnant{ 2715ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 27164eb27b79SHoward Hinnant} 27174eb27b79SHoward Hinnant 2718ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 271954976f26SHoward Hinnant 27204eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27219d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27224eb27b79SHoward Hinnant_Tp 27234eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 27244eb27b79SHoward Hinnant{ 27250b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 27264eb27b79SHoward Hinnant} 27274eb27b79SHoward Hinnant 27284eb27b79SHoward Hinnanttemplate<class _Tp> 27299d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27304eb27b79SHoward Hinnant_Tp 27314eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 27324eb27b79SHoward Hinnant{ 27330b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 27343e519524SHoward Hinnant} 27353e519524SHoward Hinnant 2736ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 273754976f26SHoward Hinnant 2738146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2739146c14acSMarshall Clow// clamp 2740146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2741146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2742146c14acSMarshall Clowconst _Tp& 2743146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2744146c14acSMarshall Clow{ 2745146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2746146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2747146c14acSMarshall Clow 2748146c14acSMarshall Clow} 2749146c14acSMarshall Clow 2750146c14acSMarshall Clowtemplate<class _Tp> 2751146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2752146c14acSMarshall Clowconst _Tp& 2753146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2754146c14acSMarshall Clow{ 2755146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2756146c14acSMarshall Clow} 2757146c14acSMarshall Clow#endif 2758146c14acSMarshall Clow 27593e519524SHoward Hinnant// minmax_element 27603e519524SHoward Hinnant 27613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27620b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27633e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27643e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27653e519524SHoward Hinnant{ 27663e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27673e519524SHoward Hinnant if (__first != __last) 27683e519524SHoward Hinnant { 27693e519524SHoward Hinnant if (++__first != __last) 27703e519524SHoward Hinnant { 27713e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27723e519524SHoward Hinnant __result.first = __first; 27733e519524SHoward Hinnant else 27743e519524SHoward Hinnant __result.second = __first; 27753e519524SHoward Hinnant while (++__first != __last) 27763e519524SHoward Hinnant { 27773e519524SHoward Hinnant _ForwardIterator __i = __first; 27783e519524SHoward Hinnant if (++__first == __last) 27793e519524SHoward Hinnant { 27803e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27813e519524SHoward Hinnant __result.first = __i; 27823e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27833e519524SHoward Hinnant __result.second = __i; 27843e519524SHoward Hinnant break; 27853e519524SHoward Hinnant } 27863e519524SHoward Hinnant else 27873e519524SHoward Hinnant { 27883e519524SHoward Hinnant if (__comp(*__first, *__i)) 27893e519524SHoward Hinnant { 27903e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27913e519524SHoward Hinnant __result.first = __first; 27923e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27933e519524SHoward Hinnant __result.second = __i; 27943e519524SHoward Hinnant } 27953e519524SHoward Hinnant else 27963e519524SHoward Hinnant { 27973e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27983e519524SHoward Hinnant __result.first = __i; 27993e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 28003e519524SHoward Hinnant __result.second = __first; 28013e519524SHoward Hinnant } 28023e519524SHoward Hinnant } 28033e519524SHoward Hinnant } 28043e519524SHoward Hinnant } 28053e519524SHoward Hinnant } 28063e519524SHoward Hinnant return __result; 28073e519524SHoward Hinnant} 28083e519524SHoward Hinnant 28093e519524SHoward Hinnanttemplate <class _ForwardIterator> 28100b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28113e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 28123e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 28133e519524SHoward Hinnant{ 28149d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 28159d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 28163e519524SHoward Hinnant} 28173e519524SHoward Hinnant 28184eb27b79SHoward Hinnant// minmax 28194eb27b79SHoward Hinnant 28204eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28219d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28224eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28234eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 28244eb27b79SHoward Hinnant{ 28254eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 28264eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 28274eb27b79SHoward Hinnant} 28284eb27b79SHoward Hinnant 28294eb27b79SHoward Hinnanttemplate<class _Tp> 28309d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28314eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28324eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 28334eb27b79SHoward Hinnant{ 2834ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 28354eb27b79SHoward Hinnant} 28364eb27b79SHoward Hinnant 2837ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 283854976f26SHoward Hinnant 28394eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28414eb27b79SHoward Hinnantpair<_Tp, _Tp> 28424eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28434eb27b79SHoward Hinnant{ 28449d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28459d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28469d67c6d5SMarshall Clow _Iter __last = __t.end(); 28479d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 28489d67c6d5SMarshall Clow 28499d67c6d5SMarshall Clow ++__first; 28509d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28519d67c6d5SMarshall Clow { 28529d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28539d67c6d5SMarshall Clow __result.first = *__first; 28549d67c6d5SMarshall Clow else 28559d67c6d5SMarshall Clow __result.second = *__first; 28569d67c6d5SMarshall Clow ++__first; 28579d67c6d5SMarshall Clow } 28589d67c6d5SMarshall Clow 28599d67c6d5SMarshall Clow while (__first != __last) 28609d67c6d5SMarshall Clow { 28619d67c6d5SMarshall Clow _Tp __prev = *__first++; 2862002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2863002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2864002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28659d67c6d5SMarshall Clow } 28669d67c6d5SMarshall Clow else { 2867002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2868002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28699d67c6d5SMarshall Clow } 28709d67c6d5SMarshall Clow 28719d67c6d5SMarshall Clow __first++; 28729d67c6d5SMarshall Clow } 28739d67c6d5SMarshall Clow return __result; 28749d67c6d5SMarshall Clow} 28759d67c6d5SMarshall Clow 28769d67c6d5SMarshall Clowtemplate<class _Tp> 28779d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28789d67c6d5SMarshall Clowpair<_Tp, _Tp> 28799d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28809d67c6d5SMarshall Clow{ 28819d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28824eb27b79SHoward Hinnant} 28834eb27b79SHoward Hinnant 2884ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 288554976f26SHoward Hinnant 28863e519524SHoward Hinnant// random_shuffle 28873e519524SHoward Hinnant 2888f9d540b0SHoward Hinnant// __independent_bits_engine 2889f9d540b0SHoward Hinnant 2890c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2891f9d540b0SHoward Hinnantstruct __log2_imp 28923e519524SHoward Hinnant{ 2893c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2894c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28953e519524SHoward Hinnant}; 28963e519524SHoward Hinnant 2897c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2898c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28993e519524SHoward Hinnant{ 2900f9d540b0SHoward Hinnant static const size_t value = 0; 29013e519524SHoward Hinnant}; 29023e519524SHoward Hinnant 2903c003db1fSHoward Hinnanttemplate <size_t _Rp> 2904c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 29053e519524SHoward Hinnant{ 2906c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 29073e519524SHoward Hinnant}; 29083e519524SHoward Hinnant 2909c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2910f9d540b0SHoward Hinnantstruct __log2 29113e519524SHoward Hinnant{ 2912c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2913f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 29143e519524SHoward Hinnant}; 29153e519524SHoward Hinnant 2916f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2917f9d540b0SHoward Hinnantclass __independent_bits_engine 29183e519524SHoward Hinnant{ 2919f9d540b0SHoward Hinnantpublic: 2920f9d540b0SHoward Hinnant // types 2921f9d540b0SHoward Hinnant typedef _UIntType result_type; 2922f9d540b0SHoward Hinnant 2923f9d540b0SHoward Hinnantprivate: 2924f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2925f9d540b0SHoward Hinnant typedef typename conditional 2926f9d540b0SHoward Hinnant < 2927f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2928f9d540b0SHoward Hinnant result_type, 2929f9d540b0SHoward Hinnant _Engine_result_type 2930f9d540b0SHoward Hinnant >::type _Working_result_type; 2931f9d540b0SHoward Hinnant 2932f9d540b0SHoward Hinnant _Engine& __e_; 2933f9d540b0SHoward Hinnant size_t __w_; 2934f9d540b0SHoward Hinnant size_t __w0_; 2935f9d540b0SHoward Hinnant size_t __n_; 2936f9d540b0SHoward Hinnant size_t __n0_; 2937f9d540b0SHoward Hinnant _Working_result_type __y0_; 2938f9d540b0SHoward Hinnant _Working_result_type __y1_; 2939f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2940f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2941f9d540b0SHoward Hinnant 2942ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2943c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2944f9d540b0SHoward Hinnant + _Working_result_type(1); 2945e386b7b3SHoward Hinnant#else 2946e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2947e386b7b3SHoward Hinnant + _Working_result_type(1); 2948e386b7b3SHoward Hinnant#endif 2949e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2950e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2951e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2952f9d540b0SHoward Hinnant 2953f9d540b0SHoward Hinnantpublic: 2954f9d540b0SHoward Hinnant // constructors and seeding functions 2955f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2956f9d540b0SHoward Hinnant 2957f9d540b0SHoward Hinnant // generating functions 2958c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2959f9d540b0SHoward Hinnant 2960f9d540b0SHoward Hinnantprivate: 2961f9d540b0SHoward Hinnant result_type __eval(false_type); 2962f9d540b0SHoward Hinnant result_type __eval(true_type); 2963f9d540b0SHoward Hinnant}; 2964f9d540b0SHoward Hinnant 2965f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2966f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2967f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2968f9d540b0SHoward Hinnant : __e_(__e), 2969f9d540b0SHoward Hinnant __w_(__w) 2970f9d540b0SHoward Hinnant{ 2971f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2972f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2973c003db1fSHoward Hinnant if (_Rp == 0) 2974c003db1fSHoward Hinnant __y0_ = _Rp; 2975f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2976c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2977f9d540b0SHoward Hinnant else 2978f9d540b0SHoward Hinnant __y0_ = 0; 2979c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2980f9d540b0SHoward Hinnant { 2981f9d540b0SHoward Hinnant ++__n_; 2982f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2983f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2984c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2985f9d540b0SHoward Hinnant else 2986f9d540b0SHoward Hinnant __y0_ = 0; 2987f9d540b0SHoward Hinnant } 2988f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2989f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2990c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2991f9d540b0SHoward Hinnant else 2992f9d540b0SHoward Hinnant __y1_ = 0; 2993f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2994f9d540b0SHoward Hinnant _Engine_result_type(0); 2995f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2996f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2997f9d540b0SHoward Hinnant _Engine_result_type(~0); 29983e519524SHoward Hinnant} 29993e519524SHoward Hinnant 3000f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3001f9d540b0SHoward Hinnantinline 3002f9d540b0SHoward Hinnant_UIntType 3003f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 30043e519524SHoward Hinnant{ 3005f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 30063e519524SHoward Hinnant} 30073e519524SHoward Hinnant 3008f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3009f9d540b0SHoward Hinnant_UIntType 3010f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 30113e519524SHoward Hinnant{ 3012c003db1fSHoward Hinnant result_type _Sp = 0; 3013f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 3014f9d540b0SHoward Hinnant { 3015f9d540b0SHoward Hinnant _Engine_result_type __u; 30163e519524SHoward Hinnant do 3017f9d540b0SHoward Hinnant { 3018f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3019f9d540b0SHoward Hinnant } while (__u >= __y0_); 30200176bc6cSHoward Hinnant if (__w0_ < _WDt) 3021c003db1fSHoward Hinnant _Sp <<= __w0_; 3022f9d540b0SHoward Hinnant else 3023c003db1fSHoward Hinnant _Sp = 0; 3024c003db1fSHoward Hinnant _Sp += __u & __mask0_; 3025f9d540b0SHoward Hinnant } 3026f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 3027f9d540b0SHoward Hinnant { 3028f9d540b0SHoward Hinnant _Engine_result_type __u; 3029f9d540b0SHoward Hinnant do 3030f9d540b0SHoward Hinnant { 3031f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3032f9d540b0SHoward Hinnant } while (__u >= __y1_); 30330176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 3034c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3035f9d540b0SHoward Hinnant else 3036c003db1fSHoward Hinnant _Sp = 0; 3037c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3038f9d540b0SHoward Hinnant } 3039c003db1fSHoward Hinnant return _Sp; 30403e519524SHoward Hinnant} 30413e519524SHoward Hinnant 3042f9d540b0SHoward Hinnant// uniform_int_distribution 30433e519524SHoward Hinnant 3044f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3045f9d540b0SHoward Hinnantclass uniform_int_distribution 30463e519524SHoward Hinnant{ 3047f9d540b0SHoward Hinnantpublic: 3048f9d540b0SHoward Hinnant // types 3049f9d540b0SHoward Hinnant typedef _IntType result_type; 3050f9d540b0SHoward Hinnant 3051f9d540b0SHoward Hinnant class param_type 3052f9d540b0SHoward Hinnant { 3053f9d540b0SHoward Hinnant result_type __a_; 3054f9d540b0SHoward Hinnant result_type __b_; 3055f9d540b0SHoward Hinnant public: 3056f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3057f9d540b0SHoward Hinnant 3058f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3059f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3060f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3061f9d540b0SHoward Hinnant 3062f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3063f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3064f9d540b0SHoward Hinnant 3065f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3066f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3067f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3068f9d540b0SHoward Hinnant {return !(__x == __y);} 30693e519524SHoward Hinnant }; 30703e519524SHoward Hinnant 3071f9d540b0SHoward Hinnantprivate: 3072f9d540b0SHoward Hinnant param_type __p_; 30733e519524SHoward Hinnant 3074f9d540b0SHoward Hinnantpublic: 3075f9d540b0SHoward Hinnant // constructors and reset functions 3076f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3077f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3078f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3079f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3080f9d540b0SHoward Hinnant void reset() {} 3081f9d540b0SHoward Hinnant 3082f9d540b0SHoward Hinnant // generating functions 3083f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3084f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3085f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3086f9d540b0SHoward Hinnant 3087f9d540b0SHoward Hinnant // property functions 3088f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3089f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3090f9d540b0SHoward Hinnant 3091f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3092f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3093f9d540b0SHoward Hinnant 3094f9d540b0SHoward Hinnant result_type min() const {return a();} 3095f9d540b0SHoward Hinnant result_type max() const {return b();} 3096f9d540b0SHoward Hinnant 3097f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3098f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3099f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3100f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3101f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3102f9d540b0SHoward Hinnant {return !(__x == __y);} 31033e519524SHoward Hinnant}; 31043e519524SHoward Hinnant 3105f9d540b0SHoward Hinnanttemplate<class _IntType> 3106f9d540b0SHoward Hinnanttemplate<class _URNG> 3107f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3108f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 31093e519524SHoward Hinnant{ 3110f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3111f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3112c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3113c003db1fSHoward Hinnant if (_Rp == 1) 3114f9d540b0SHoward Hinnant return __p.a(); 3115f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3116f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3117c003db1fSHoward Hinnant if (_Rp == 0) 3118f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3119c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3120a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3121f9d540b0SHoward Hinnant ++__w; 3122f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3123f9d540b0SHoward Hinnant _UIntType __u; 3124f9d540b0SHoward Hinnant do 31253e519524SHoward Hinnant { 3126f9d540b0SHoward Hinnant __u = __e(); 3127c003db1fSHoward Hinnant } while (__u >= _Rp); 3128f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31293e519524SHoward Hinnant} 3130f9d540b0SHoward Hinnant 313166f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 313266f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3133f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3134f9d540b0SHoward Hinnant 3135f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3136f9d540b0SHoward Hinnant 3137f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31383e519524SHoward Hinnant{ 3139f9d540b0SHoward Hinnant static unsigned __c_; 3140f9d540b0SHoward Hinnant 3141f9d540b0SHoward Hinnant __rs_default(); 3142f9d540b0SHoward Hinnantpublic: 3143b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3144f9d540b0SHoward Hinnant 3145f9d540b0SHoward Hinnant static const result_type _Min = 0; 3146f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3147f9d540b0SHoward Hinnant 3148f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3149f9d540b0SHoward Hinnant ~__rs_default(); 3150f9d540b0SHoward Hinnant 3151f9d540b0SHoward Hinnant result_type operator()(); 3152f9d540b0SHoward Hinnant 3153788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3154788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3155f9d540b0SHoward Hinnant 3156f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3157f9d540b0SHoward Hinnant}; 3158f9d540b0SHoward Hinnant 3159f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31603e519524SHoward Hinnant 31613e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31623e519524SHoward Hinnantvoid 31633e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31643e519524SHoward Hinnant{ 31653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3166c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3167c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31683e519524SHoward Hinnant difference_type __d = __last - __first; 31693e519524SHoward Hinnant if (__d > 1) 31703e519524SHoward Hinnant { 3171c003db1fSHoward Hinnant _Dp __uid; 3172f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3173f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3174007b26beSHoward Hinnant { 3175c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3176007b26beSHoward Hinnant if (__i != difference_type(0)) 3177007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3178007b26beSHoward Hinnant } 31793e519524SHoward Hinnant } 31803e519524SHoward Hinnant} 31813e519524SHoward Hinnant 31823e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31833e519524SHoward Hinnantvoid 31843e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3185ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31863e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31873e519524SHoward Hinnant#else 31883e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31893e519524SHoward Hinnant#endif 31903e519524SHoward Hinnant{ 31913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31923e519524SHoward Hinnant difference_type __d = __last - __first; 31933e519524SHoward Hinnant if (__d > 1) 31943e519524SHoward Hinnant { 31953e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3196007b26beSHoward Hinnant { 3197007b26beSHoward Hinnant difference_type __i = __rand(__d); 3198007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3199007b26beSHoward Hinnant } 32003e519524SHoward Hinnant } 32013e519524SHoward Hinnant} 32020f37a410SMarshall Clow#endif 32033e519524SHoward Hinnant 3204e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3205e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3206e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3207e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32085741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3209e7154709SEric Fiselier _Distance __n, 3210e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3211e7154709SEric Fiselier input_iterator_tag) { 3212e7154709SEric Fiselier 3213e7154709SEric Fiselier _Distance __k = 0; 3214e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 32155741d86dSEric Fiselier __output[__k] = *__first; 3216e7154709SEric Fiselier _Distance __sz = __k; 3217e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3218e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3219e7154709SEric Fiselier if (__r < __sz) 32205741d86dSEric Fiselier __output[__r] = *__first; 3221e7154709SEric Fiselier } 32225741d86dSEric Fiselier return __output + _VSTD::min(__n, __k); 3223e7154709SEric Fiselier} 3224e7154709SEric Fiselier 3225e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3226e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3227e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3228e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32295741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3230e7154709SEric Fiselier _Distance __n, 3231e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3232e7154709SEric Fiselier forward_iterator_tag) { 3233e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3234e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3235e7154709SEric Fiselier _Distance __r = 3236e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3237e7154709SEric Fiselier if (__r < __n) { 32385741d86dSEric Fiselier *__output++ = *__first; 3239e7154709SEric Fiselier --__n; 3240e7154709SEric Fiselier } 3241e7154709SEric Fiselier } 32425741d86dSEric Fiselier return __output; 3243e7154709SEric Fiselier} 3244e7154709SEric Fiselier 3245e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3246e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3247e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3248e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32495741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3250e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3251e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3252e7154709SEric Fiselier _PopCategory; 3253e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3254e7154709SEric Fiselier _Difference; 3255e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3256e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3257e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3258e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3259e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3260e7154709SEric Fiselier return _VSTD::__sample( 32615741d86dSEric Fiselier __first, __last, __output, _CommonType(__n), 3262e7154709SEric Fiselier __g, _PopCategory()); 3263e7154709SEric Fiselier} 3264e7154709SEric Fiselier 3265e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3266e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3267e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3268e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3269e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 32705741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3271e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 32725741d86dSEric Fiselier return _VSTD::__sample(__first, __last, __output, __n, __g); 3273e7154709SEric Fiselier} 3274e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3275e7154709SEric Fiselier 3276f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3277f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3278ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3279fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3280fb340102SHoward Hinnant#else 3281f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3282fb340102SHoward Hinnant#endif 3283f9d540b0SHoward Hinnant{ 3284f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3285c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3286c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3287f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3288f9d540b0SHoward Hinnant if (__d > 1) 3289f9d540b0SHoward Hinnant { 3290c003db1fSHoward Hinnant _Dp __uid; 3291f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3292007b26beSHoward Hinnant { 3293c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3294007b26beSHoward Hinnant if (__i != difference_type(0)) 3295007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3296007b26beSHoward Hinnant } 3297f9d540b0SHoward Hinnant } 3298f9d540b0SHoward Hinnant} 3299f9d540b0SHoward Hinnant 33003e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 33013e519524SHoward Hinnantbool 33023e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 33033e519524SHoward Hinnant{ 33043e519524SHoward Hinnant for (; __first != __last; ++__first) 33053e519524SHoward Hinnant if (!__pred(*__first)) 33063e519524SHoward Hinnant break; 3307b9595b79SMarshall Clow if ( __first == __last ) 3308b9595b79SMarshall Clow return true; 3309b9595b79SMarshall Clow ++__first; 33103e519524SHoward Hinnant for (; __first != __last; ++__first) 33113e519524SHoward Hinnant if (__pred(*__first)) 33123e519524SHoward Hinnant return false; 33133e519524SHoward Hinnant return true; 33143e519524SHoward Hinnant} 33153e519524SHoward Hinnant 33163e519524SHoward Hinnant// partition 33173e519524SHoward Hinnant 33183e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33193e519524SHoward Hinnant_ForwardIterator 33203e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 33213e519524SHoward Hinnant{ 33223e519524SHoward Hinnant while (true) 33233e519524SHoward Hinnant { 33243e519524SHoward Hinnant if (__first == __last) 33253e519524SHoward Hinnant return __first; 33263e519524SHoward Hinnant if (!__pred(*__first)) 33273e519524SHoward Hinnant break; 33283e519524SHoward Hinnant ++__first; 33293e519524SHoward Hinnant } 33303e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 33313e519524SHoward Hinnant { 33323e519524SHoward Hinnant if (__pred(*__p)) 33333e519524SHoward Hinnant { 33343e519524SHoward Hinnant swap(*__first, *__p); 33353e519524SHoward Hinnant ++__first; 33363e519524SHoward Hinnant } 33373e519524SHoward Hinnant } 33383e519524SHoward Hinnant return __first; 33393e519524SHoward Hinnant} 33403e519524SHoward Hinnant 33413e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 33423e519524SHoward Hinnant_BidirectionalIterator 33433e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33443e519524SHoward Hinnant bidirectional_iterator_tag) 33453e519524SHoward Hinnant{ 33463e519524SHoward Hinnant while (true) 33473e519524SHoward Hinnant { 33483e519524SHoward Hinnant while (true) 33493e519524SHoward Hinnant { 33503e519524SHoward Hinnant if (__first == __last) 33513e519524SHoward Hinnant return __first; 33523e519524SHoward Hinnant if (!__pred(*__first)) 33533e519524SHoward Hinnant break; 33543e519524SHoward Hinnant ++__first; 33553e519524SHoward Hinnant } 33563e519524SHoward Hinnant do 33573e519524SHoward Hinnant { 33583e519524SHoward Hinnant if (__first == --__last) 33593e519524SHoward Hinnant return __first; 33603e519524SHoward Hinnant } while (!__pred(*__last)); 33613e519524SHoward Hinnant swap(*__first, *__last); 33623e519524SHoward Hinnant ++__first; 33633e519524SHoward Hinnant } 33643e519524SHoward Hinnant} 33653e519524SHoward Hinnant 33663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33683e519524SHoward Hinnant_ForwardIterator 33693e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33703e519524SHoward Hinnant{ 3371ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33723e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33733e519524SHoward Hinnant} 33743e519524SHoward Hinnant 33753e519524SHoward Hinnant// partition_copy 33763e519524SHoward Hinnant 33773e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33783e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33793e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33803e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33813e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33823e519524SHoward Hinnant _Predicate __pred) 33833e519524SHoward Hinnant{ 33843e519524SHoward Hinnant for (; __first != __last; ++__first) 33853e519524SHoward Hinnant { 33863e519524SHoward Hinnant if (__pred(*__first)) 33873e519524SHoward Hinnant { 33883e519524SHoward Hinnant *__out_true = *__first; 33893e519524SHoward Hinnant ++__out_true; 33903e519524SHoward Hinnant } 33913e519524SHoward Hinnant else 33923e519524SHoward Hinnant { 33933e519524SHoward Hinnant *__out_false = *__first; 33943e519524SHoward Hinnant ++__out_false; 33953e519524SHoward Hinnant } 33963e519524SHoward Hinnant } 33973e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33983e519524SHoward Hinnant} 33993e519524SHoward Hinnant 34003e519524SHoward Hinnant// partition_point 34013e519524SHoward Hinnant 34023e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 34033e519524SHoward Hinnant_ForwardIterator 34043e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34053e519524SHoward Hinnant{ 34063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3407ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34083e519524SHoward Hinnant while (__len != 0) 34093e519524SHoward Hinnant { 34103e519524SHoward Hinnant difference_type __l2 = __len / 2; 34113e519524SHoward Hinnant _ForwardIterator __m = __first; 3412ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 34133e519524SHoward Hinnant if (__pred(*__m)) 34143e519524SHoward Hinnant { 34153e519524SHoward Hinnant __first = ++__m; 34163e519524SHoward Hinnant __len -= __l2 + 1; 34173e519524SHoward Hinnant } 34183e519524SHoward Hinnant else 34193e519524SHoward Hinnant __len = __l2; 34203e519524SHoward Hinnant } 34213e519524SHoward Hinnant return __first; 34223e519524SHoward Hinnant} 34233e519524SHoward Hinnant 34243e519524SHoward Hinnant// stable_partition 34253e519524SHoward Hinnant 34263e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 34273e519524SHoward Hinnant_ForwardIterator 34283e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34293e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 34303e519524SHoward Hinnant{ 34313e519524SHoward Hinnant // *__first is known to be false 34323e519524SHoward Hinnant // __len >= 1 34333e519524SHoward Hinnant if (__len == 1) 34343e519524SHoward Hinnant return __first; 34353e519524SHoward Hinnant if (__len == 2) 34363e519524SHoward Hinnant { 34373e519524SHoward Hinnant _ForwardIterator __m = __first; 34383e519524SHoward Hinnant if (__pred(*++__m)) 34393e519524SHoward Hinnant { 34403e519524SHoward Hinnant swap(*__first, *__m); 34413e519524SHoward Hinnant return __m; 34423e519524SHoward Hinnant } 34433e519524SHoward Hinnant return __first; 34443e519524SHoward Hinnant } 34453e519524SHoward Hinnant if (__len <= __p.second) 34463e519524SHoward Hinnant { // The buffer is big enough to use 34473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 34483e519524SHoward Hinnant __destruct_n __d(0); 34493e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34503e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34513e519524SHoward Hinnant // Update __first to always point to the end of the trues 34523e519524SHoward Hinnant value_type* __t = __p.first; 3453ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34543e519524SHoward Hinnant __d.__incr((value_type*)0); 34553e519524SHoward Hinnant ++__t; 34563e519524SHoward Hinnant _ForwardIterator __i = __first; 34573e519524SHoward Hinnant while (++__i != __last) 34583e519524SHoward Hinnant { 34593e519524SHoward Hinnant if (__pred(*__i)) 34603e519524SHoward Hinnant { 3461ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34623e519524SHoward Hinnant ++__first; 34633e519524SHoward Hinnant } 34643e519524SHoward Hinnant else 34653e519524SHoward Hinnant { 3466ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34673e519524SHoward Hinnant __d.__incr((value_type*)0); 34683e519524SHoward Hinnant ++__t; 34693e519524SHoward Hinnant } 34703e519524SHoward Hinnant } 34713e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34723e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34733e519524SHoward Hinnant __i = __first; 34743e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3475ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34763e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34773e519524SHoward Hinnant return __first; 34783e519524SHoward Hinnant } 34793e519524SHoward Hinnant // Else not enough buffer, do in place 34803e519524SHoward Hinnant // __len >= 3 34813e519524SHoward Hinnant _ForwardIterator __m = __first; 34823e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3483ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34843e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34853e519524SHoward Hinnant // F????????????????? 34863e519524SHoward Hinnant // f m l 34873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34883e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34893e519524SHoward Hinnant // TTTFFFFF?????????? 34903e519524SHoward Hinnant // f ff m l 34913e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34923e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34933e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34943e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34953e519524SHoward Hinnant while (__pred(*__m1)) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant if (++__m1 == __last) 34983e519524SHoward Hinnant goto __second_half_done; 34993e519524SHoward Hinnant --__len_half; 35003e519524SHoward Hinnant } 35013e519524SHoward Hinnant // TTTFFFFFTTTF?????? 35023e519524SHoward Hinnant // f ff m m1 l 35033e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 35043e519524SHoward Hinnant__second_half_done: 35053e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35063e519524SHoward Hinnant // f ff m sf l 3507ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35083e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35093e519524SHoward Hinnant // | 35103e519524SHoward Hinnant} 35113e519524SHoward Hinnant 35123e519524SHoward Hinnantstruct __return_temporary_buffer 35133e519524SHoward Hinnant{ 35143e519524SHoward Hinnant template <class _Tp> 3515ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 35163e519524SHoward Hinnant}; 35173e519524SHoward Hinnant 35183e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 35193e519524SHoward Hinnant_ForwardIterator 35203e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35213e519524SHoward Hinnant forward_iterator_tag) 35223e519524SHoward Hinnant{ 35233e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 35243e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35253e519524SHoward Hinnant while (true) 35263e519524SHoward Hinnant { 35273e519524SHoward Hinnant if (__first == __last) 35283e519524SHoward Hinnant return __first; 35293e519524SHoward Hinnant if (!__pred(*__first)) 35303e519524SHoward Hinnant break; 35313e519524SHoward Hinnant ++__first; 35323e519524SHoward Hinnant } 35333e519524SHoward Hinnant // We now have a reduced range [__first, __last) 35343e519524SHoward Hinnant // *__first is known to be false 35353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 35363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3537ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 35383e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35393e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35403e519524SHoward Hinnant if (__len >= __alloc_limit) 35413e519524SHoward Hinnant { 3542ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35433e519524SHoward Hinnant __h.reset(__p.first); 35443e519524SHoward Hinnant } 35453e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35463e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 35473e519524SHoward Hinnant} 35483e519524SHoward Hinnant 35493e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 35503e519524SHoward Hinnant_BidirectionalIterator 35513e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35523e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 35533e519524SHoward Hinnant{ 35543e519524SHoward Hinnant // *__first is known to be false 35553e519524SHoward Hinnant // *__last is known to be true 35563e519524SHoward Hinnant // __len >= 2 35573e519524SHoward Hinnant if (__len == 2) 35583e519524SHoward Hinnant { 35593e519524SHoward Hinnant swap(*__first, *__last); 35603e519524SHoward Hinnant return __last; 35613e519524SHoward Hinnant } 35623e519524SHoward Hinnant if (__len == 3) 35633e519524SHoward Hinnant { 35643e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35653e519524SHoward Hinnant if (__pred(*++__m)) 35663e519524SHoward Hinnant { 35673e519524SHoward Hinnant swap(*__first, *__m); 35683e519524SHoward Hinnant swap(*__m, *__last); 35693e519524SHoward Hinnant return __last; 35703e519524SHoward Hinnant } 35713e519524SHoward Hinnant swap(*__m, *__last); 35723e519524SHoward Hinnant swap(*__first, *__m); 35733e519524SHoward Hinnant return __m; 35743e519524SHoward Hinnant } 35753e519524SHoward Hinnant if (__len <= __p.second) 35763e519524SHoward Hinnant { // The buffer is big enough to use 35773e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35783e519524SHoward Hinnant __destruct_n __d(0); 35793e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35803e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35813e519524SHoward Hinnant // Update __first to always point to the end of the trues 35823e519524SHoward Hinnant value_type* __t = __p.first; 3583ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35843e519524SHoward Hinnant __d.__incr((value_type*)0); 35853e519524SHoward Hinnant ++__t; 35863e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35873e519524SHoward Hinnant while (++__i != __last) 35883e519524SHoward Hinnant { 35893e519524SHoward Hinnant if (__pred(*__i)) 35903e519524SHoward Hinnant { 3591ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35923e519524SHoward Hinnant ++__first; 35933e519524SHoward Hinnant } 35943e519524SHoward Hinnant else 35953e519524SHoward Hinnant { 3596ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35973e519524SHoward Hinnant __d.__incr((value_type*)0); 35983e519524SHoward Hinnant ++__t; 35993e519524SHoward Hinnant } 36003e519524SHoward Hinnant } 36013e519524SHoward Hinnant // move *__last, known to be true 3602ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36033e519524SHoward Hinnant __i = ++__first; 36043e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 36053e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 36063e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3607ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 36083e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 36093e519524SHoward Hinnant return __first; 36103e519524SHoward Hinnant } 36113e519524SHoward Hinnant // Else not enough buffer, do in place 36123e519524SHoward Hinnant // __len >= 4 36133e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36143e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3615ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 36163e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 36173e519524SHoward Hinnant // F????????????????T 36183e519524SHoward Hinnant // f m l 36193e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 36203e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 36213e519524SHoward Hinnant _Distance __len_half = __len2; 36223e519524SHoward Hinnant while (!__pred(*--__m1)) 36233e519524SHoward Hinnant { 36243e519524SHoward Hinnant if (__m1 == __first) 36253e519524SHoward Hinnant goto __first_half_done; 36263e519524SHoward Hinnant --__len_half; 36273e519524SHoward Hinnant } 36283e519524SHoward Hinnant // F???TFFF?????????T 36293e519524SHoward Hinnant // f m1 m l 36303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 36313e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 36323e519524SHoward Hinnant__first_half_done: 36333e519524SHoward Hinnant // TTTFFFFF?????????T 36343e519524SHoward Hinnant // f ff m l 36353e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 36363e519524SHoward Hinnant __m1 = __m; 36373e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 36383e519524SHoward Hinnant ++__second_false; 36393e519524SHoward Hinnant __len_half = __len - __len2; 36403e519524SHoward Hinnant while (__pred(*__m1)) 36413e519524SHoward Hinnant { 36423e519524SHoward Hinnant if (++__m1 == __last) 36433e519524SHoward Hinnant goto __second_half_done; 36443e519524SHoward Hinnant --__len_half; 36453e519524SHoward Hinnant } 36463e519524SHoward Hinnant // TTTFFFFFTTTF?????T 36473e519524SHoward Hinnant // f ff m m1 l 36483e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 36493e519524SHoward Hinnant__second_half_done: 36503e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 36513e519524SHoward Hinnant // f ff m sf l 3652ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 36533e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 36543e519524SHoward Hinnant // | 36553e519524SHoward Hinnant} 36563e519524SHoward Hinnant 36573e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 36583e519524SHoward Hinnant_BidirectionalIterator 36593e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36603e519524SHoward Hinnant bidirectional_iterator_tag) 36613e519524SHoward Hinnant{ 36623e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36633e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36643e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 36653e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36663e519524SHoward Hinnant while (true) 36673e519524SHoward Hinnant { 36683e519524SHoward Hinnant if (__first == __last) 36693e519524SHoward Hinnant return __first; 36703e519524SHoward Hinnant if (!__pred(*__first)) 36713e519524SHoward Hinnant break; 36723e519524SHoward Hinnant ++__first; 36733e519524SHoward Hinnant } 36743e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36753e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36763e519524SHoward Hinnant do 36773e519524SHoward Hinnant { 36783e519524SHoward Hinnant if (__first == --__last) 36793e519524SHoward Hinnant return __first; 36803e519524SHoward Hinnant } while (!__pred(*__last)); 36813e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36823e519524SHoward Hinnant // *__first is known to be false 36833e519524SHoward Hinnant // *__last is known to be true 36843e519524SHoward Hinnant // __len >= 2 3685ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36863e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36873e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36883e519524SHoward Hinnant if (__len >= __alloc_limit) 36893e519524SHoward Hinnant { 3690ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36913e519524SHoward Hinnant __h.reset(__p.first); 36923e519524SHoward Hinnant } 36933e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36943e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36953e519524SHoward Hinnant} 36963e519524SHoward Hinnant 36973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36993e519524SHoward Hinnant_ForwardIterator 37003e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 37013e519524SHoward Hinnant{ 37023e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 37033e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 37043e519524SHoward Hinnant} 37053e519524SHoward Hinnant 37063e519524SHoward Hinnant// is_sorted_until 37073e519524SHoward Hinnant 37083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37093e519524SHoward Hinnant_ForwardIterator 37103e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37113e519524SHoward Hinnant{ 37123e519524SHoward Hinnant if (__first != __last) 37133e519524SHoward Hinnant { 37143e519524SHoward Hinnant _ForwardIterator __i = __first; 37153e519524SHoward Hinnant while (++__i != __last) 37163e519524SHoward Hinnant { 37173e519524SHoward Hinnant if (__comp(*__i, *__first)) 37183e519524SHoward Hinnant return __i; 37193e519524SHoward Hinnant __first = __i; 37203e519524SHoward Hinnant } 37213e519524SHoward Hinnant } 37223e519524SHoward Hinnant return __last; 37233e519524SHoward Hinnant} 37243e519524SHoward Hinnant 37253e519524SHoward Hinnanttemplate<class _ForwardIterator> 37263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37273e519524SHoward Hinnant_ForwardIterator 37283e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 37293e519524SHoward Hinnant{ 3730ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37313e519524SHoward Hinnant} 37323e519524SHoward Hinnant 37333e519524SHoward Hinnant// is_sorted 37343e519524SHoward Hinnant 37353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37373e519524SHoward Hinnantbool 37383e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37393e519524SHoward Hinnant{ 3740ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 37413e519524SHoward Hinnant} 37423e519524SHoward Hinnant 37433e519524SHoward Hinnanttemplate<class _ForwardIterator> 37443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37453e519524SHoward Hinnantbool 37463e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 37473e519524SHoward Hinnant{ 3748ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37493e519524SHoward Hinnant} 37503e519524SHoward Hinnant 37513e519524SHoward Hinnant// sort 37523e519524SHoward Hinnant 37533e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 37543e519524SHoward Hinnant 37553e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37563e519524SHoward Hinnantunsigned 37573e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 37583e519524SHoward Hinnant{ 37593e519524SHoward Hinnant unsigned __r = 0; 37603e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 37613e519524SHoward Hinnant { 37623e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 37633e519524SHoward Hinnant return __r; // x <= y && y <= z 37643e519524SHoward Hinnant // x <= y && y > z 37653e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 37663e519524SHoward Hinnant __r = 1; 37673e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37683e519524SHoward Hinnant { 37693e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37703e519524SHoward Hinnant __r = 2; 37713e519524SHoward Hinnant } 37723e519524SHoward Hinnant return __r; // x <= y && y < z 37733e519524SHoward Hinnant } 37743e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37753e519524SHoward Hinnant { 37763e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37773e519524SHoward Hinnant __r = 1; 37783e519524SHoward Hinnant return __r; 37793e519524SHoward Hinnant } 37803e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37813e519524SHoward Hinnant __r = 1; // x < y && x <= z 37823e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37833e519524SHoward Hinnant { 37843e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37853e519524SHoward Hinnant __r = 2; 37863e519524SHoward Hinnant } 37873e519524SHoward Hinnant return __r; 37883e519524SHoward Hinnant} // x <= y && y <= z 37893e519524SHoward Hinnant 37903e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37913e519524SHoward Hinnant 37923e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37933e519524SHoward Hinnantunsigned 37943e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37953e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37963e519524SHoward Hinnant{ 37973e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37983e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37993e519524SHoward Hinnant { 38003e519524SHoward Hinnant swap(*__x3, *__x4); 38013e519524SHoward Hinnant ++__r; 38023e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38033e519524SHoward Hinnant { 38043e519524SHoward Hinnant swap(*__x2, *__x3); 38053e519524SHoward Hinnant ++__r; 38063e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38073e519524SHoward Hinnant { 38083e519524SHoward Hinnant swap(*__x1, *__x2); 38093e519524SHoward Hinnant ++__r; 38103e519524SHoward Hinnant } 38113e519524SHoward Hinnant } 38123e519524SHoward Hinnant } 38133e519524SHoward Hinnant return __r; 38143e519524SHoward Hinnant} 38153e519524SHoward Hinnant 38163e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 38173e519524SHoward Hinnant 38183e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38193e519524SHoward Hinnantunsigned 38203e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38213e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 38223e519524SHoward Hinnant{ 38233e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 38243e519524SHoward Hinnant if (__c(*__x5, *__x4)) 38253e519524SHoward Hinnant { 38263e519524SHoward Hinnant swap(*__x4, *__x5); 38273e519524SHoward Hinnant ++__r; 38283e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38293e519524SHoward Hinnant { 38303e519524SHoward Hinnant swap(*__x3, *__x4); 38313e519524SHoward Hinnant ++__r; 38323e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38333e519524SHoward Hinnant { 38343e519524SHoward Hinnant swap(*__x2, *__x3); 38353e519524SHoward Hinnant ++__r; 38363e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38373e519524SHoward Hinnant { 38383e519524SHoward Hinnant swap(*__x1, *__x2); 38393e519524SHoward Hinnant ++__r; 38403e519524SHoward Hinnant } 38413e519524SHoward Hinnant } 38423e519524SHoward Hinnant } 38433e519524SHoward Hinnant } 38443e519524SHoward Hinnant return __r; 38453e519524SHoward Hinnant} 38463e519524SHoward Hinnant 38473e519524SHoward Hinnant// Assumes size > 0 38483e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38493e519524SHoward Hinnantvoid 38503e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38513e519524SHoward Hinnant{ 38523e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 38533e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 38543e519524SHoward Hinnant { 3855ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 38563e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 38573e519524SHoward Hinnant (__first, __last, __comp); 38583e519524SHoward Hinnant if (__i != __first) 38593e519524SHoward Hinnant swap(*__first, *__i); 38603e519524SHoward Hinnant } 38613e519524SHoward Hinnant} 38623e519524SHoward Hinnant 38633e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38643e519524SHoward Hinnantvoid 38653e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38663e519524SHoward Hinnant{ 38673e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38683e519524SHoward Hinnant if (__first != __last) 38693e519524SHoward Hinnant { 38703e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38713e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38723e519524SHoward Hinnant { 38733e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3874ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38753e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3876ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3877ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38783e519524SHoward Hinnant } 38793e519524SHoward Hinnant } 38803e519524SHoward Hinnant} 38813e519524SHoward Hinnant 38823e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38833e519524SHoward Hinnantvoid 38843e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38853e519524SHoward Hinnant{ 38863e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38873e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38883e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38893e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38903e519524SHoward Hinnant { 38913e519524SHoward Hinnant if (__comp(*__i, *__j)) 38923e519524SHoward Hinnant { 3893ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38943e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38953e519524SHoward Hinnant __j = __i; 38963e519524SHoward Hinnant do 38973e519524SHoward Hinnant { 3898ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38993e519524SHoward Hinnant __j = __k; 39003e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3901ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39023e519524SHoward Hinnant } 39033e519524SHoward Hinnant __j = __i; 39043e519524SHoward Hinnant } 39053e519524SHoward Hinnant} 39063e519524SHoward Hinnant 39073e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39083e519524SHoward Hinnantbool 39093e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39103e519524SHoward Hinnant{ 39113e519524SHoward Hinnant switch (__last - __first) 39123e519524SHoward Hinnant { 39133e519524SHoward Hinnant case 0: 39143e519524SHoward Hinnant case 1: 39153e519524SHoward Hinnant return true; 39163e519524SHoward Hinnant case 2: 39173e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39183e519524SHoward Hinnant swap(*__first, *__last); 39193e519524SHoward Hinnant return true; 39203e519524SHoward Hinnant case 3: 3921ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39223e519524SHoward Hinnant return true; 39233e519524SHoward Hinnant case 4: 3924ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39253e519524SHoward Hinnant return true; 39263e519524SHoward Hinnant case 5: 3927ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39283e519524SHoward Hinnant return true; 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39313e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39323e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 39333e519524SHoward Hinnant const unsigned __limit = 8; 39343e519524SHoward Hinnant unsigned __count = 0; 39353e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39363e519524SHoward Hinnant { 39373e519524SHoward Hinnant if (__comp(*__i, *__j)) 39383e519524SHoward Hinnant { 3939ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39403e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39413e519524SHoward Hinnant __j = __i; 39423e519524SHoward Hinnant do 39433e519524SHoward Hinnant { 3944ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39453e519524SHoward Hinnant __j = __k; 39463e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3947ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39483e519524SHoward Hinnant if (++__count == __limit) 39493e519524SHoward Hinnant return ++__i == __last; 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant __j = __i; 39523e519524SHoward Hinnant } 39533e519524SHoward Hinnant return true; 39543e519524SHoward Hinnant} 39553e519524SHoward Hinnant 39563e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 39573e519524SHoward Hinnantvoid 39583e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 39593e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 39603e519524SHoward Hinnant{ 39613e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 39623e519524SHoward Hinnant if (__first1 != __last1) 39633e519524SHoward Hinnant { 39643e519524SHoward Hinnant __destruct_n __d(0); 39653e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39663e519524SHoward Hinnant value_type* __last2 = __first2; 3967ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39683e519524SHoward Hinnant __d.__incr((value_type*)0); 39693e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39703e519524SHoward Hinnant { 39713e519524SHoward Hinnant value_type* __j2 = __last2; 39723e519524SHoward Hinnant value_type* __i2 = __j2; 39733e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39743e519524SHoward Hinnant { 3975ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39763e519524SHoward Hinnant __d.__incr((value_type*)0); 39773e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3978ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3979ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant else 39823e519524SHoward Hinnant { 3983ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39843e519524SHoward Hinnant __d.__incr((value_type*)0); 39853e519524SHoward Hinnant } 39863e519524SHoward Hinnant } 39873e519524SHoward Hinnant __h.release(); 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant} 39903e519524SHoward Hinnant 39913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39923e519524SHoward Hinnantvoid 39933e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39943e519524SHoward Hinnant{ 39953e519524SHoward Hinnant // _Compare is known to be a reference type 39963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39973e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3998ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3999ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 40003e519524SHoward Hinnant while (true) 40013e519524SHoward Hinnant { 40023e519524SHoward Hinnant __restart: 40033e519524SHoward Hinnant difference_type __len = __last - __first; 40043e519524SHoward Hinnant switch (__len) 40053e519524SHoward Hinnant { 40063e519524SHoward Hinnant case 0: 40073e519524SHoward Hinnant case 1: 40083e519524SHoward Hinnant return; 40093e519524SHoward Hinnant case 2: 40103e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40113e519524SHoward Hinnant swap(*__first, *__last); 40123e519524SHoward Hinnant return; 40133e519524SHoward Hinnant case 3: 4014ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40153e519524SHoward Hinnant return; 40163e519524SHoward Hinnant case 4: 4017ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40183e519524SHoward Hinnant return; 40193e519524SHoward Hinnant case 5: 4020ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40213e519524SHoward Hinnant return; 40223e519524SHoward Hinnant } 40233e519524SHoward Hinnant if (__len <= __limit) 40243e519524SHoward Hinnant { 4025ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 40263e519524SHoward Hinnant return; 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant // __len > 5 40293e519524SHoward Hinnant _RandomAccessIterator __m = __first; 40303e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 40313e519524SHoward Hinnant --__lm1; 40323e519524SHoward Hinnant unsigned __n_swaps; 40333e519524SHoward Hinnant { 40343e519524SHoward Hinnant difference_type __delta; 40353e519524SHoward Hinnant if (__len >= 1000) 40363e519524SHoward Hinnant { 40373e519524SHoward Hinnant __delta = __len/2; 40383e519524SHoward Hinnant __m += __delta; 40393e519524SHoward Hinnant __delta /= 2; 4040ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 40413e519524SHoward Hinnant } 40423e519524SHoward Hinnant else 40433e519524SHoward Hinnant { 40443e519524SHoward Hinnant __delta = __len/2; 40453e519524SHoward Hinnant __m += __delta; 4046ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 40473e519524SHoward Hinnant } 40483e519524SHoward Hinnant } 40493e519524SHoward Hinnant // *__m is median 40503e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 40513e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 40523e519524SHoward Hinnant _RandomAccessIterator __i = __first; 40533e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 40543e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40553e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 40563e519524SHoward Hinnant // Prime the downward search with a guard. 40573e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 40583e519524SHoward Hinnant { 40593e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 40603e519524SHoward Hinnant // manually guard downward moving __j against __i 40613e519524SHoward Hinnant while (true) 40623e519524SHoward Hinnant { 40633e519524SHoward Hinnant if (__i == --__j) 40643e519524SHoward Hinnant { 40653e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40663e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40673e519524SHoward Hinnant ++__i; // __first + 1 40683e519524SHoward Hinnant __j = __last; 40693e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40703e519524SHoward Hinnant { 40713e519524SHoward Hinnant while (true) 40723e519524SHoward Hinnant { 40733e519524SHoward Hinnant if (__i == __j) 40743e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40753e519524SHoward Hinnant if (__comp(*__first, *__i)) 40763e519524SHoward Hinnant { 40773e519524SHoward Hinnant swap(*__i, *__j); 40783e519524SHoward Hinnant ++__n_swaps; 40793e519524SHoward Hinnant ++__i; 40803e519524SHoward Hinnant break; 40813e519524SHoward Hinnant } 40823e519524SHoward Hinnant ++__i; 40833e519524SHoward Hinnant } 40843e519524SHoward Hinnant } 40853e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40863e519524SHoward Hinnant if (__i == __j) 40873e519524SHoward Hinnant return; 40883e519524SHoward Hinnant while (true) 40893e519524SHoward Hinnant { 40903e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40913e519524SHoward Hinnant ++__i; 40923e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40933e519524SHoward Hinnant ; 40943e519524SHoward Hinnant if (__i >= __j) 40953e519524SHoward Hinnant break; 40963e519524SHoward Hinnant swap(*__i, *__j); 40973e519524SHoward Hinnant ++__n_swaps; 40983e519524SHoward Hinnant ++__i; 40993e519524SHoward Hinnant } 41003e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 41013e519524SHoward Hinnant // The first part is sorted, sort the secod part 4102ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 41033e519524SHoward Hinnant __first = __i; 41043e519524SHoward Hinnant goto __restart; 41053e519524SHoward Hinnant } 41063e519524SHoward Hinnant if (__comp(*__j, *__m)) 41073e519524SHoward Hinnant { 41083e519524SHoward Hinnant swap(*__i, *__j); 41093e519524SHoward Hinnant ++__n_swaps; 41103e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 41113e519524SHoward Hinnant } 41123e519524SHoward Hinnant } 41133e519524SHoward Hinnant } 41143e519524SHoward Hinnant // It is known that *__i < *__m 41153e519524SHoward Hinnant ++__i; 41163e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41173e519524SHoward Hinnant // if not yet partitioned... 41183e519524SHoward Hinnant if (__i < __j) 41193e519524SHoward Hinnant { 41203e519524SHoward Hinnant // known that *(__i - 1) < *__m 41213e519524SHoward Hinnant // known that __i <= __m 41223e519524SHoward Hinnant while (true) 41233e519524SHoward Hinnant { 41243e519524SHoward Hinnant // __m still guards upward moving __i 41253e519524SHoward Hinnant while (__comp(*__i, *__m)) 41263e519524SHoward Hinnant ++__i; 41273e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 41283e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 41293e519524SHoward Hinnant ; 41303e519524SHoward Hinnant if (__i > __j) 41313e519524SHoward Hinnant break; 41323e519524SHoward Hinnant swap(*__i, *__j); 41333e519524SHoward Hinnant ++__n_swaps; 41343e519524SHoward Hinnant // It is known that __m != __j 41353e519524SHoward Hinnant // If __m just moved, follow it 41363e519524SHoward Hinnant if (__m == __i) 41373e519524SHoward Hinnant __m = __j; 41383e519524SHoward Hinnant ++__i; 41393e519524SHoward Hinnant } 41403e519524SHoward Hinnant } 41413e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 41423e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 41433e519524SHoward Hinnant { 41443e519524SHoward Hinnant swap(*__i, *__m); 41453e519524SHoward Hinnant ++__n_swaps; 41463e519524SHoward Hinnant } 41473e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 41483e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 41493e519524SHoward Hinnant if (__n_swaps == 0) 41503e519524SHoward Hinnant { 4151ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4152ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 41533e519524SHoward Hinnant { 41543e519524SHoward Hinnant if (__fs) 41553e519524SHoward Hinnant return; 41563e519524SHoward Hinnant __last = __i; 41573e519524SHoward Hinnant continue; 41583e519524SHoward Hinnant } 41593e519524SHoward Hinnant else 41603e519524SHoward Hinnant { 41613e519524SHoward Hinnant if (__fs) 41623e519524SHoward Hinnant { 41633e519524SHoward Hinnant __first = ++__i; 41643e519524SHoward Hinnant continue; 41653e519524SHoward Hinnant } 41663e519524SHoward Hinnant } 41673e519524SHoward Hinnant } 41683e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41693e519524SHoward Hinnant if (__i - __first < __last - __i) 41703e519524SHoward Hinnant { 4171ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4172ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41733e519524SHoward Hinnant __first = ++__i; 41743e519524SHoward Hinnant } 41753e519524SHoward Hinnant else 41763e519524SHoward Hinnant { 4177ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4178ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41793e519524SHoward Hinnant __last = __i; 41803e519524SHoward Hinnant } 41813e519524SHoward Hinnant } 41823e519524SHoward Hinnant} 41833e519524SHoward Hinnant 41843e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41853e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41873e519524SHoward Hinnantvoid 41883e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41893e519524SHoward Hinnant{ 4190145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41933e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4194145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41963e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4197145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41983e519524SHoward Hinnant} 41993e519524SHoward Hinnant 42003e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42023e519524SHoward Hinnantvoid 42033e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 42043e519524SHoward Hinnant{ 4205ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42063e519524SHoward Hinnant} 42073e519524SHoward Hinnant 42083e519524SHoward Hinnanttemplate <class _Tp> 42093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42103e519524SHoward Hinnantvoid 42113e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 42123e519524SHoward Hinnant{ 4213ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 42143e519524SHoward Hinnant} 42153e519524SHoward Hinnant 42163e519524SHoward Hinnanttemplate <class _Tp> 42173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42183e519524SHoward Hinnantvoid 42193e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 42203e519524SHoward Hinnant{ 4221ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 42223e519524SHoward Hinnant} 42233e519524SHoward Hinnant 4224f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4225f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4226f554add5SHoward Hinnantvoid 4227f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4228f554add5SHoward Hinnant{ 4229f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4230f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4231f554add5SHoward Hinnant} 4232f554add5SHoward Hinnant 42330be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4234e4383379SHoward Hinnant#pragma warning( push ) 4235e4383379SHoward Hinnant#pragma warning( disable: 4231) 42360be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4237f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4238f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4239f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4240f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4241f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4242f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4243f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4244f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4245f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4246f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4247f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4248f0544c20SHoward 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>&)) 4249f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4250f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4251f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42523e519524SHoward Hinnant 4253f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4254f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4255f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4256f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4257f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4258f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4259f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4260f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4261f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4262f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4263f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4264f0544c20SHoward 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>&)) 4265f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4266f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4267f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42683e519524SHoward Hinnant 4269f0544c20SHoward 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>&)) 42700be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4271e4383379SHoward Hinnant#pragma warning( pop ) 42720be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 42733e519524SHoward Hinnant 42743e519524SHoward Hinnant// lower_bound 42753e519524SHoward Hinnant 42763e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42773e519524SHoward Hinnant_ForwardIterator 4278e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42793e519524SHoward Hinnant{ 42803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4281ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42823e519524SHoward Hinnant while (__len != 0) 42833e519524SHoward Hinnant { 42843e519524SHoward Hinnant difference_type __l2 = __len / 2; 42853e519524SHoward Hinnant _ForwardIterator __m = __first; 4286ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4287e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42883e519524SHoward Hinnant { 42893e519524SHoward Hinnant __first = ++__m; 42903e519524SHoward Hinnant __len -= __l2 + 1; 42913e519524SHoward Hinnant } 42923e519524SHoward Hinnant else 42933e519524SHoward Hinnant __len = __l2; 42943e519524SHoward Hinnant } 42953e519524SHoward Hinnant return __first; 42963e519524SHoward Hinnant} 42973e519524SHoward Hinnant 42983e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43003e519524SHoward Hinnant_ForwardIterator 4301e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43023e519524SHoward Hinnant{ 4303145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43043e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43053e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4306e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4307145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4309e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4310145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43113e519524SHoward Hinnant} 43123e519524SHoward Hinnant 43133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43153e519524SHoward Hinnant_ForwardIterator 4316e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43173e519524SHoward Hinnant{ 4318e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 43193e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43203e519524SHoward Hinnant} 43213e519524SHoward Hinnant 43223e519524SHoward Hinnant// upper_bound 43233e519524SHoward Hinnant 43243e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43253e519524SHoward Hinnant_ForwardIterator 4326e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43273e519524SHoward Hinnant{ 43283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4329ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43303e519524SHoward Hinnant while (__len != 0) 43313e519524SHoward Hinnant { 43323e519524SHoward Hinnant difference_type __l2 = __len / 2; 43333e519524SHoward Hinnant _ForwardIterator __m = __first; 4334ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4335e4383379SHoward Hinnant if (__comp(__value_, *__m)) 43363e519524SHoward Hinnant __len = __l2; 43373e519524SHoward Hinnant else 43383e519524SHoward Hinnant { 43393e519524SHoward Hinnant __first = ++__m; 43403e519524SHoward Hinnant __len -= __l2 + 1; 43413e519524SHoward Hinnant } 43423e519524SHoward Hinnant } 43433e519524SHoward Hinnant return __first; 43443e519524SHoward Hinnant} 43453e519524SHoward Hinnant 43463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43483e519524SHoward Hinnant_ForwardIterator 4349e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43503e519524SHoward Hinnant{ 4351145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43523e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43533e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4354e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4355145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4357e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4358145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43593e519524SHoward Hinnant} 43603e519524SHoward Hinnant 43613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43633e519524SHoward Hinnant_ForwardIterator 4364e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43653e519524SHoward Hinnant{ 4366e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43673e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43683e519524SHoward Hinnant} 43693e519524SHoward Hinnant 43703e519524SHoward Hinnant// equal_range 43713e519524SHoward Hinnant 43723e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43733e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4374e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43753e519524SHoward Hinnant{ 43763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4377ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43783e519524SHoward Hinnant while (__len != 0) 43793e519524SHoward Hinnant { 43803e519524SHoward Hinnant difference_type __l2 = __len / 2; 43813e519524SHoward Hinnant _ForwardIterator __m = __first; 4382ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4383e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43843e519524SHoward Hinnant { 43853e519524SHoward Hinnant __first = ++__m; 43863e519524SHoward Hinnant __len -= __l2 + 1; 43873e519524SHoward Hinnant } 4388e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43893e519524SHoward Hinnant { 43903e519524SHoward Hinnant __last = __m; 43913e519524SHoward Hinnant __len = __l2; 43923e519524SHoward Hinnant } 43933e519524SHoward Hinnant else 43943e519524SHoward Hinnant { 43953e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43963e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43973e519524SHoward Hinnant ( 4398e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4399e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 44003e519524SHoward Hinnant ); 44013e519524SHoward Hinnant } 44023e519524SHoward Hinnant } 44033e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 44043e519524SHoward Hinnant} 44053e519524SHoward Hinnant 44063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44083e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4409e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44103e519524SHoward Hinnant{ 4411145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4414e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4415145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4417e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4418145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44193e519524SHoward Hinnant} 44203e519524SHoward Hinnant 44213e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44233e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4424e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44253e519524SHoward Hinnant{ 4426e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44273e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44283e519524SHoward Hinnant} 44293e519524SHoward Hinnant 44303e519524SHoward Hinnant// binary_search 44313e519524SHoward Hinnant 44323e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 44333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44343e519524SHoward Hinnantbool 4435e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44363e519524SHoward Hinnant{ 4437e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4438e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44393e519524SHoward Hinnant} 44403e519524SHoward Hinnant 44413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44433e519524SHoward Hinnantbool 4444e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44453e519524SHoward Hinnant{ 4446145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4449e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4450145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4452e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4453145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44543e519524SHoward Hinnant} 44553e519524SHoward Hinnant 44563e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44583e519524SHoward Hinnantbool 4459e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44603e519524SHoward Hinnant{ 4461e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44623e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44633e519524SHoward Hinnant} 44643e519524SHoward Hinnant 44653e519524SHoward Hinnant// merge 44663e519524SHoward Hinnant 44673e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44683e519524SHoward Hinnant_OutputIterator 44693e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44703e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44713e519524SHoward Hinnant{ 44723e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44733e519524SHoward Hinnant { 44743e519524SHoward Hinnant if (__first2 == __last2) 4475ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44763e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44773e519524SHoward Hinnant { 44783e519524SHoward Hinnant *__result = *__first2; 44793e519524SHoward Hinnant ++__first2; 44803e519524SHoward Hinnant } 44813e519524SHoward Hinnant else 44823e519524SHoward Hinnant { 44833e519524SHoward Hinnant *__result = *__first1; 44843e519524SHoward Hinnant ++__first1; 44853e519524SHoward Hinnant } 44863e519524SHoward Hinnant } 4487ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44883e519524SHoward Hinnant} 44893e519524SHoward Hinnant 44903e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44923e519524SHoward Hinnant_OutputIterator 44933e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44943e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44953e519524SHoward Hinnant{ 4496145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4499ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4500145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45013e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4502ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4503145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45043e519524SHoward Hinnant} 45053e519524SHoward Hinnant 45063e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 45073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45083e519524SHoward Hinnant_OutputIterator 45093e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45103e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 45113e519524SHoward Hinnant{ 45123e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 45133e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 45143e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 45153e519524SHoward Hinnant} 45163e519524SHoward Hinnant 45173e519524SHoward Hinnant// inplace_merge 45183e519524SHoward Hinnant 4519adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4520adfdae18SMarshall Clow class _OutputIterator> 4521adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4522adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4523adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4524adfdae18SMarshall Clow{ 4525adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4526adfdae18SMarshall Clow { 4527adfdae18SMarshall Clow if (__first2 == __last2) 4528adfdae18SMarshall Clow { 4529adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4530adfdae18SMarshall Clow return; 4531adfdae18SMarshall Clow } 4532adfdae18SMarshall Clow 4533adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4534adfdae18SMarshall Clow { 4535adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4536adfdae18SMarshall Clow ++__first2; 4537adfdae18SMarshall Clow } 4538adfdae18SMarshall Clow else 4539adfdae18SMarshall Clow { 4540adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4541adfdae18SMarshall Clow ++__first1; 4542adfdae18SMarshall Clow } 4543adfdae18SMarshall Clow } 4544adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4545adfdae18SMarshall Clow} 4546adfdae18SMarshall Clow 45473e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45483e519524SHoward Hinnantvoid 45493e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45503e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45513e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45523e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45533e519524SHoward Hinnant{ 45543e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45553e519524SHoward Hinnant __destruct_n __d(0); 45563e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45573e519524SHoward Hinnant if (__len1 <= __len2) 45583e519524SHoward Hinnant { 45593e519524SHoward Hinnant value_type* __p = __buff; 4560910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4561ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4562adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 45633e519524SHoward Hinnant } 45643e519524SHoward Hinnant else 45653e519524SHoward Hinnant { 45663e519524SHoward Hinnant value_type* __p = __buff; 4567910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4568ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 45693e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45703e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4571adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4572adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 45733e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 45743e519524SHoward Hinnant } 45753e519524SHoward Hinnant} 45763e519524SHoward Hinnant 45773e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45783e519524SHoward Hinnantvoid 45793e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45803e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45813e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45823e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45833e519524SHoward Hinnant{ 45843e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45853e519524SHoward Hinnant while (true) 45863e519524SHoward Hinnant { 45873e519524SHoward Hinnant // if __middle == __last, we're done 45883e519524SHoward Hinnant if (__len2 == 0) 45893e519524SHoward Hinnant return; 4590526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4591526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4592526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45933e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4594910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45953e519524SHoward Hinnant { 45963e519524SHoward Hinnant if (__len1 == 0) 45973e519524SHoward Hinnant return; 45983e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45993e519524SHoward Hinnant break; 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant // __first < __middle < __last 46023e519524SHoward Hinnant // *__first > *__middle 46033e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 46043e519524SHoward Hinnant // all elements in: 46053e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 46063e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 46073e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 46083e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 46093e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 46103e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 46113e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 46123e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 46133e519524SHoward Hinnant // binary search smaller range 46143e519524SHoward Hinnant if (__len1 < __len2) 46153e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 46163e519524SHoward Hinnant __len21 = __len2 / 2; 46173e519524SHoward Hinnant __m2 = __middle; 4618ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 46193e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4620ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46213e519524SHoward Hinnant } 46223e519524SHoward Hinnant else 46233e519524SHoward Hinnant { 46243e519524SHoward Hinnant if (__len1 == 1) 46253e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46263e519524SHoward Hinnant // It is known *__first > *__middle 46273e519524SHoward Hinnant swap(*__first, *__middle); 46283e519524SHoward Hinnant return; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46313e519524SHoward Hinnant __len11 = __len1 / 2; 46323e519524SHoward Hinnant __m1 = __first; 4633ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46343e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4635ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46363e519524SHoward Hinnant } 46373e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46383e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46393e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46403e519524SHoward Hinnant // swap middle two partitions 4641ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46423e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 46433e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 46443e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46453e519524SHoward Hinnant { 46463e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46473e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46483e519524SHoward Hinnant __first = __middle; 46493e519524SHoward Hinnant __middle = __m2; 46503e519524SHoward Hinnant __len1 = __len12; 46513e519524SHoward Hinnant __len2 = __len22; 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant else 46543e519524SHoward Hinnant { 46553e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46563e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46573e519524SHoward Hinnant __last = __middle; 46583e519524SHoward Hinnant __middle = __m1; 46593e519524SHoward Hinnant __len1 = __len11; 46603e519524SHoward Hinnant __len2 = __len21; 46613e519524SHoward Hinnant } 46623e519524SHoward Hinnant } 46633e519524SHoward Hinnant} 46643e519524SHoward Hinnant 46653e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46673e519524SHoward Hinnantvoid 46683e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46693e519524SHoward Hinnant _Compare __comp) 46703e519524SHoward Hinnant{ 46713e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46723e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4673ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4674ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4675ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46760b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46770b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46780b48cf9aSMarshall Clow 4679145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46803e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46813e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4682ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46833e519524SHoward Hinnant __buf.first, __buf.second); 4684145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4686ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46873e519524SHoward Hinnant __buf.first, __buf.second); 4688145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46893e519524SHoward Hinnant} 46903e519524SHoward Hinnant 46913e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46933e519524SHoward Hinnantvoid 46943e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46953e519524SHoward Hinnant{ 4696ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46973e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46983e519524SHoward Hinnant} 46993e519524SHoward Hinnant 47003e519524SHoward Hinnant// stable_sort 47013e519524SHoward Hinnant 47023e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47033e519524SHoward Hinnantvoid 47043e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 47053e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47063e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 47073e519524SHoward Hinnant{ 47083e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 47093e519524SHoward Hinnant __destruct_n __d(0); 47103e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 47113e519524SHoward Hinnant for (; true; ++__result) 47123e519524SHoward Hinnant { 47133e519524SHoward Hinnant if (__first1 == __last1) 47143e519524SHoward Hinnant { 47153e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4716ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47173e519524SHoward Hinnant __h.release(); 47183e519524SHoward Hinnant return; 47193e519524SHoward Hinnant } 47203e519524SHoward Hinnant if (__first2 == __last2) 47213e519524SHoward Hinnant { 47223e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4723ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47243e519524SHoward Hinnant __h.release(); 47253e519524SHoward Hinnant return; 47263e519524SHoward Hinnant } 47273e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47283e519524SHoward Hinnant { 4729ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47303e519524SHoward Hinnant __d.__incr((value_type*)0); 47313e519524SHoward Hinnant ++__first2; 47323e519524SHoward Hinnant } 47333e519524SHoward Hinnant else 47343e519524SHoward Hinnant { 4735ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47363e519524SHoward Hinnant __d.__incr((value_type*)0); 47373e519524SHoward Hinnant ++__first1; 47383e519524SHoward Hinnant } 47393e519524SHoward Hinnant } 47403e519524SHoward Hinnant} 47413e519524SHoward Hinnant 47423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47433e519524SHoward Hinnantvoid 47443e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47463e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47473e519524SHoward Hinnant{ 47483e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47493e519524SHoward Hinnant { 47503e519524SHoward Hinnant if (__first2 == __last2) 47513e519524SHoward Hinnant { 47523e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4753ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47543e519524SHoward Hinnant return; 47553e519524SHoward Hinnant } 47563e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47573e519524SHoward Hinnant { 4758ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47593e519524SHoward Hinnant ++__first2; 47603e519524SHoward Hinnant } 47613e519524SHoward Hinnant else 47623e519524SHoward Hinnant { 4763ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47643e519524SHoward Hinnant ++__first1; 47653e519524SHoward Hinnant } 47663e519524SHoward Hinnant } 47673e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4768ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47693e519524SHoward Hinnant} 47703e519524SHoward Hinnant 47713e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47723e519524SHoward Hinnantvoid 47733e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47743e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47753e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47763e519524SHoward Hinnant 47773e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47783e519524SHoward Hinnantvoid 47793e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47803e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47813e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47823e519524SHoward Hinnant{ 47833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47843e519524SHoward Hinnant switch (__len) 47853e519524SHoward Hinnant { 47863e519524SHoward Hinnant case 0: 47873e519524SHoward Hinnant return; 47883e519524SHoward Hinnant case 1: 4789ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47903e519524SHoward Hinnant return; 47913e519524SHoward Hinnant case 2: 47923e519524SHoward Hinnant __destruct_n __d(0); 47933e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47943e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47953e519524SHoward Hinnant { 4796ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47973e519524SHoward Hinnant __d.__incr((value_type*)0); 47983e519524SHoward Hinnant ++__first2; 4799ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 48003e519524SHoward Hinnant } 48013e519524SHoward Hinnant else 48023e519524SHoward Hinnant { 4803ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 48043e519524SHoward Hinnant __d.__incr((value_type*)0); 48053e519524SHoward Hinnant ++__first2; 4806ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 48073e519524SHoward Hinnant } 48083e519524SHoward Hinnant __h2.release(); 48093e519524SHoward Hinnant return; 48103e519524SHoward Hinnant } 48113e519524SHoward Hinnant if (__len <= 8) 48123e519524SHoward Hinnant { 48133e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 48143e519524SHoward Hinnant return; 48153e519524SHoward Hinnant } 48163e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48173e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 48183e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 48193e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 48203e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48213e519524SHoward Hinnant} 48223e519524SHoward Hinnant 48233e519524SHoward Hinnanttemplate <class _Tp> 48243e519524SHoward Hinnantstruct __stable_sort_switch 48253e519524SHoward Hinnant{ 4826ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48273e519524SHoward Hinnant}; 48283e519524SHoward Hinnant 48293e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48303e519524SHoward Hinnantvoid 48313e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48323e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48333e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48343e519524SHoward Hinnant{ 48353e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48363e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48373e519524SHoward Hinnant switch (__len) 48383e519524SHoward Hinnant { 48393e519524SHoward Hinnant case 0: 48403e519524SHoward Hinnant case 1: 48413e519524SHoward Hinnant return; 48423e519524SHoward Hinnant case 2: 48433e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48443e519524SHoward Hinnant swap(*__first, *__last); 48453e519524SHoward Hinnant return; 48463e519524SHoward Hinnant } 48473e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48483e519524SHoward Hinnant { 48493e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 48503e519524SHoward Hinnant return; 48513e519524SHoward Hinnant } 48523e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48533e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48543e519524SHoward Hinnant if (__len <= __buff_size) 48553e519524SHoward Hinnant { 48563e519524SHoward Hinnant __destruct_n __d(0); 48573e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48583e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 48593e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 48603e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 48613e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 48623e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48633e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 48643e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48653e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48663e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48673e519524SHoward Hinnant// __first, __comp); 48683e519524SHoward Hinnant return; 48693e519524SHoward Hinnant } 48703e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48713e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48723e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48733e519524SHoward Hinnant} 48743e519524SHoward Hinnant 48753e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48773e519524SHoward Hinnantvoid 48783e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48793e519524SHoward Hinnant{ 48803e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48813e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48823e519524SHoward Hinnant difference_type __len = __last - __first; 48833e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48843e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48853e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48863e519524SHoward Hinnant { 4887ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48883e519524SHoward Hinnant __h.reset(__buf.first); 48893e519524SHoward Hinnant } 4890145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48933e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4894145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48963e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4897145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48983e519524SHoward Hinnant} 48993e519524SHoward Hinnant 49003e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49023e519524SHoward Hinnantvoid 49033e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 49043e519524SHoward Hinnant{ 4905ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49063e519524SHoward Hinnant} 49073e519524SHoward Hinnant 49083e519524SHoward Hinnant// is_heap_until 49093e519524SHoward Hinnant 49103e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49113e519524SHoward Hinnant_RandomAccessIterator 49123e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49133e519524SHoward Hinnant{ 4914ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49153e519524SHoward Hinnant difference_type __len = __last - __first; 49163e519524SHoward Hinnant difference_type __p = 0; 49173e519524SHoward Hinnant difference_type __c = 1; 49183e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 49193e519524SHoward Hinnant while (__c < __len) 49203e519524SHoward Hinnant { 49213e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49223e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49233e519524SHoward Hinnant return __cp; 49243e519524SHoward Hinnant ++__c; 49253e519524SHoward Hinnant ++__cp; 49263e519524SHoward Hinnant if (__c == __len) 49273e519524SHoward Hinnant return __last; 49283e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49293e519524SHoward Hinnant return __cp; 49303e519524SHoward Hinnant ++__p; 49313e519524SHoward Hinnant ++__pp; 49323e519524SHoward Hinnant __c = 2 * __p + 1; 49333e519524SHoward Hinnant } 49343e519524SHoward Hinnant return __last; 49353e519524SHoward Hinnant} 49363e519524SHoward Hinnant 49373e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49393e519524SHoward Hinnant_RandomAccessIterator 49403e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49413e519524SHoward Hinnant{ 4942ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49433e519524SHoward Hinnant} 49443e519524SHoward Hinnant 49453e519524SHoward Hinnant// is_heap 49463e519524SHoward Hinnant 49473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49493e519524SHoward Hinnantbool 49503e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49513e519524SHoward Hinnant{ 4952ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49533e519524SHoward Hinnant} 49543e519524SHoward Hinnant 49553e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49573e519524SHoward Hinnantbool 49583e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49593e519524SHoward Hinnant{ 4960ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49613e519524SHoward Hinnant} 49623e519524SHoward Hinnant 49633e519524SHoward Hinnant// push_heap 49643e519524SHoward Hinnant 49653e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49663e519524SHoward Hinnantvoid 49678b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49683e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49693e519524SHoward Hinnant{ 49703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49713e519524SHoward Hinnant if (__len > 1) 49723e519524SHoward Hinnant { 49733e519524SHoward Hinnant __len = (__len - 2) / 2; 49743e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49753e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49763e519524SHoward Hinnant { 4977ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49783e519524SHoward Hinnant do 49793e519524SHoward Hinnant { 4980ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49813e519524SHoward Hinnant __last = __ptr; 49823e519524SHoward Hinnant if (__len == 0) 49833e519524SHoward Hinnant break; 49843e519524SHoward Hinnant __len = (__len - 1) / 2; 49853e519524SHoward Hinnant __ptr = __first + __len; 49863e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4987ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49883e519524SHoward Hinnant } 49893e519524SHoward Hinnant } 49903e519524SHoward Hinnant} 49913e519524SHoward Hinnant 49923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49943e519524SHoward Hinnantvoid 49953e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49963e519524SHoward Hinnant{ 4997145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49983e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49993e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50008b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 5001145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50038b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 5004145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50053e519524SHoward Hinnant} 50063e519524SHoward Hinnant 50073e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50093e519524SHoward Hinnantvoid 50103e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50113e519524SHoward Hinnant{ 5012ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50133e519524SHoward Hinnant} 50143e519524SHoward Hinnant 50153e519524SHoward Hinnant// pop_heap 50163e519524SHoward Hinnant 50173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50188b512602SDavid Majnemervoid 5019fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 5020fd838227SEric Fiselier _Compare __comp, 50218b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50228b512602SDavid Majnemer _RandomAccessIterator __start) 50238b512602SDavid Majnemer{ 50248b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50258b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50268b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50278b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50288b512602SDavid Majnemer difference_type __child = __start - __first; 50298b512602SDavid Majnemer 50308b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50318b512602SDavid Majnemer return; 50328b512602SDavid Majnemer 50338b512602SDavid Majnemer __child = 2 * __child + 1; 50348b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50358b512602SDavid Majnemer 50368b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50378b512602SDavid Majnemer // right-child exists and is greater than left-child 50388b512602SDavid Majnemer ++__child_i; 50398b512602SDavid Majnemer ++__child; 50408b512602SDavid Majnemer } 50418b512602SDavid Majnemer 50428b512602SDavid Majnemer // check if we are in heap-order 50438b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50448b512602SDavid Majnemer // we are, __start is larger than it's largest child 50458b512602SDavid Majnemer return; 50468b512602SDavid Majnemer 50478b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50488b512602SDavid Majnemer do 50498b512602SDavid Majnemer { 50508b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 50518b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50528b512602SDavid Majnemer __start = __child_i; 50538b512602SDavid Majnemer 50548b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50558b512602SDavid Majnemer break; 50568b512602SDavid Majnemer 50578b512602SDavid Majnemer // recompute the child based off of the updated parent 50588b512602SDavid Majnemer __child = 2 * __child + 1; 50598b512602SDavid Majnemer __child_i = __first + __child; 50608b512602SDavid Majnemer 50618b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50628b512602SDavid Majnemer // right-child exists and is greater than left-child 50638b512602SDavid Majnemer ++__child_i; 50648b512602SDavid Majnemer ++__child; 50658b512602SDavid Majnemer } 50668b512602SDavid Majnemer 50678b512602SDavid Majnemer // check if we are in heap-order 50688b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50698b512602SDavid Majnemer *__start = _VSTD::move(__top); 50708b512602SDavid Majnemer} 50718b512602SDavid Majnemer 50728b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50743e519524SHoward Hinnantvoid 50753e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50773e519524SHoward Hinnant{ 50783e519524SHoward Hinnant if (__len > 1) 50793e519524SHoward Hinnant { 50803e519524SHoward Hinnant swap(*__first, *--__last); 50818b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50823e519524SHoward Hinnant } 50833e519524SHoward Hinnant} 50843e519524SHoward Hinnant 50853e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50873e519524SHoward Hinnantvoid 50883e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50893e519524SHoward Hinnant{ 5090145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50933e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5094145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50963e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5097145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50983e519524SHoward Hinnant} 50993e519524SHoward Hinnant 51003e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51023e519524SHoward Hinnantvoid 51033e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51043e519524SHoward Hinnant{ 5105ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51063e519524SHoward Hinnant} 51073e519524SHoward Hinnant 51083e519524SHoward Hinnant// make_heap 51093e519524SHoward Hinnant 51103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51113e519524SHoward Hinnantvoid 51123e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51133e519524SHoward Hinnant{ 51143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51153e519524SHoward Hinnant difference_type __n = __last - __first; 51163e519524SHoward Hinnant if (__n > 1) 51173e519524SHoward Hinnant { 51188b512602SDavid Majnemer // start from the first parent, there is no need to consider children 51198b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 51208b512602SDavid Majnemer { 51218b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51228b512602SDavid Majnemer } 51233e519524SHoward Hinnant } 51243e519524SHoward Hinnant} 51253e519524SHoward Hinnant 51263e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51283e519524SHoward Hinnantvoid 51293e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51303e519524SHoward Hinnant{ 5131145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51323e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51333e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51343e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5135145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51363e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51373e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5138145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51393e519524SHoward Hinnant} 51403e519524SHoward Hinnant 51413e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51433e519524SHoward Hinnantvoid 51443e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51453e519524SHoward Hinnant{ 5146ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51473e519524SHoward Hinnant} 51483e519524SHoward Hinnant 51493e519524SHoward Hinnant// sort_heap 51503e519524SHoward Hinnant 51513e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51523e519524SHoward Hinnantvoid 51533e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51543e519524SHoward Hinnant{ 51553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51563e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 51573e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 51583e519524SHoward Hinnant} 51593e519524SHoward Hinnant 51603e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51623e519524SHoward Hinnantvoid 51633e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51643e519524SHoward Hinnant{ 5165145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51683e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5169145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51713e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5172145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51733e519524SHoward Hinnant} 51743e519524SHoward Hinnant 51753e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51773e519524SHoward Hinnantvoid 51783e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51793e519524SHoward Hinnant{ 5180ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51813e519524SHoward Hinnant} 51823e519524SHoward Hinnant 51833e519524SHoward Hinnant// partial_sort 51843e519524SHoward Hinnant 51853e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51863e519524SHoward Hinnantvoid 51873e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51883e519524SHoward Hinnant _Compare __comp) 51893e519524SHoward Hinnant{ 51903e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51913e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51923e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51933e519524SHoward Hinnant { 51943e519524SHoward Hinnant if (__comp(*__i, *__first)) 51953e519524SHoward Hinnant { 51963e519524SHoward Hinnant swap(*__i, *__first); 51978b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51983e519524SHoward Hinnant } 51993e519524SHoward Hinnant } 52003e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 52013e519524SHoward Hinnant} 52023e519524SHoward Hinnant 52033e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52053e519524SHoward Hinnantvoid 52063e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 52073e519524SHoward Hinnant _Compare __comp) 52083e519524SHoward Hinnant{ 5209145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52103e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52113e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52123e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5213145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52143e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52153e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5216145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52173e519524SHoward Hinnant} 52183e519524SHoward Hinnant 52193e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52213e519524SHoward Hinnantvoid 52223e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 52233e519524SHoward Hinnant{ 5224ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52253e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52263e519524SHoward Hinnant} 52273e519524SHoward Hinnant 52283e519524SHoward Hinnant// partial_sort_copy 52293e519524SHoward Hinnant 52303e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52313e519524SHoward Hinnant_RandomAccessIterator 52323e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52333e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52343e519524SHoward Hinnant{ 52353e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52363e519524SHoward Hinnant if (__r != __result_last) 52373e519524SHoward Hinnant { 5238910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 52393e519524SHoward Hinnant *__r = *__first; 52403e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 52418b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52423e519524SHoward Hinnant for (; __first != __last; ++__first) 52433e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52443e519524SHoward Hinnant { 52453e519524SHoward Hinnant *__result_first = *__first; 52468b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52473e519524SHoward Hinnant } 52483e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 52493e519524SHoward Hinnant } 52503e519524SHoward Hinnant return __r; 52513e519524SHoward Hinnant} 52523e519524SHoward Hinnant 52533e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52553e519524SHoward Hinnant_RandomAccessIterator 52563e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52573e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52583e519524SHoward Hinnant{ 5259145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52623e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5263145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52653e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5266145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52673e519524SHoward Hinnant} 52683e519524SHoward Hinnant 52693e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52713e519524SHoward Hinnant_RandomAccessIterator 52723e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52733e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52743e519524SHoward Hinnant{ 5275ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52763e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52773e519524SHoward Hinnant} 52783e519524SHoward Hinnant 52793e519524SHoward Hinnant// nth_element 52803e519524SHoward Hinnant 52813e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52823e519524SHoward Hinnantvoid 52833e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52843e519524SHoward Hinnant{ 52853e519524SHoward Hinnant // _Compare is known to be a reference type 52863e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52873e519524SHoward Hinnant const difference_type __limit = 7; 52883e519524SHoward Hinnant while (true) 52893e519524SHoward Hinnant { 52903e519524SHoward Hinnant __restart: 5291b34b4819SHoward Hinnant if (__nth == __last) 5292b34b4819SHoward Hinnant return; 52933e519524SHoward Hinnant difference_type __len = __last - __first; 52943e519524SHoward Hinnant switch (__len) 52953e519524SHoward Hinnant { 52963e519524SHoward Hinnant case 0: 52973e519524SHoward Hinnant case 1: 52983e519524SHoward Hinnant return; 52993e519524SHoward Hinnant case 2: 53003e519524SHoward Hinnant if (__comp(*--__last, *__first)) 53013e519524SHoward Hinnant swap(*__first, *__last); 53023e519524SHoward Hinnant return; 53033e519524SHoward Hinnant case 3: 53043e519524SHoward Hinnant { 53053e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5306ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 53073e519524SHoward Hinnant return; 53083e519524SHoward Hinnant } 53093e519524SHoward Hinnant } 53103e519524SHoward Hinnant if (__len <= __limit) 53113e519524SHoward Hinnant { 53123e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 53133e519524SHoward Hinnant return; 53143e519524SHoward Hinnant } 53153e519524SHoward Hinnant // __len > __limit >= 3 53163e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 53173e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5318ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 53193e519524SHoward Hinnant // *__m is median 53203e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53213e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53223e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53233e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53243e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53253e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53263e519524SHoward Hinnant // Prime the downward search with a guard. 53273e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53283e519524SHoward Hinnant { 53293e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53303e519524SHoward Hinnant // manually guard downward moving __j against __i 53313e519524SHoward Hinnant while (true) 53323e519524SHoward Hinnant { 53333e519524SHoward Hinnant if (__i == --__j) 53343e519524SHoward Hinnant { 53353e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 53363e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 53373e519524SHoward Hinnant ++__i; // __first + 1 53383e519524SHoward Hinnant __j = __last; 53393e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 53403e519524SHoward Hinnant { 53413e519524SHoward Hinnant while (true) 53423e519524SHoward Hinnant { 53433e519524SHoward Hinnant if (__i == __j) 53443e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 53453e519524SHoward Hinnant if (__comp(*__first, *__i)) 53463e519524SHoward Hinnant { 53473e519524SHoward Hinnant swap(*__i, *__j); 53483e519524SHoward Hinnant ++__n_swaps; 53493e519524SHoward Hinnant ++__i; 53503e519524SHoward Hinnant break; 53513e519524SHoward Hinnant } 53523e519524SHoward Hinnant ++__i; 53533e519524SHoward Hinnant } 53543e519524SHoward Hinnant } 53553e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53563e519524SHoward Hinnant if (__i == __j) 53573e519524SHoward Hinnant return; 53583e519524SHoward Hinnant while (true) 53593e519524SHoward Hinnant { 53603e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53613e519524SHoward Hinnant ++__i; 53623e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53633e519524SHoward Hinnant ; 53643e519524SHoward Hinnant if (__i >= __j) 53653e519524SHoward Hinnant break; 53663e519524SHoward Hinnant swap(*__i, *__j); 53673e519524SHoward Hinnant ++__n_swaps; 53683e519524SHoward Hinnant ++__i; 53693e519524SHoward Hinnant } 53703e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53713e519524SHoward Hinnant // The first part is sorted, 53723e519524SHoward Hinnant if (__nth < __i) 53733e519524SHoward Hinnant return; 53743e519524SHoward Hinnant // __nth_element the secod part 53753e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53763e519524SHoward Hinnant __first = __i; 53773e519524SHoward Hinnant goto __restart; 53783e519524SHoward Hinnant } 53793e519524SHoward Hinnant if (__comp(*__j, *__m)) 53803e519524SHoward Hinnant { 53813e519524SHoward Hinnant swap(*__i, *__j); 53823e519524SHoward Hinnant ++__n_swaps; 53833e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53843e519524SHoward Hinnant } 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant } 53873e519524SHoward Hinnant ++__i; 53883e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53893e519524SHoward Hinnant // if not yet partitioned... 53903e519524SHoward Hinnant if (__i < __j) 53913e519524SHoward Hinnant { 53923e519524SHoward Hinnant // known that *(__i - 1) < *__m 53933e519524SHoward Hinnant while (true) 53943e519524SHoward Hinnant { 53953e519524SHoward Hinnant // __m still guards upward moving __i 53963e519524SHoward Hinnant while (__comp(*__i, *__m)) 53973e519524SHoward Hinnant ++__i; 53983e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53993e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 54003e519524SHoward Hinnant ; 54013e519524SHoward Hinnant if (__i >= __j) 54023e519524SHoward Hinnant break; 54033e519524SHoward Hinnant swap(*__i, *__j); 54043e519524SHoward Hinnant ++__n_swaps; 54053e519524SHoward Hinnant // It is known that __m != __j 54063e519524SHoward Hinnant // If __m just moved, follow it 54073e519524SHoward Hinnant if (__m == __i) 54083e519524SHoward Hinnant __m = __j; 54093e519524SHoward Hinnant ++__i; 54103e519524SHoward Hinnant } 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 54133e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 54143e519524SHoward Hinnant { 54153e519524SHoward Hinnant swap(*__i, *__m); 54163e519524SHoward Hinnant ++__n_swaps; 54173e519524SHoward Hinnant } 54183e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 54193e519524SHoward Hinnant if (__nth == __i) 54203e519524SHoward Hinnant return; 54213e519524SHoward Hinnant if (__n_swaps == 0) 54223e519524SHoward Hinnant { 54233e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 54243e519524SHoward Hinnant if (__nth < __i) 54253e519524SHoward Hinnant { 54263e519524SHoward Hinnant // Check for [__first, __i) already sorted 54273e519524SHoward Hinnant __j = __m = __first; 54283e519524SHoward Hinnant while (++__j != __i) 54293e519524SHoward Hinnant { 54303e519524SHoward Hinnant if (__comp(*__j, *__m)) 54313e519524SHoward Hinnant // not yet sorted, so sort 54323e519524SHoward Hinnant goto not_sorted; 54333e519524SHoward Hinnant __m = __j; 54343e519524SHoward Hinnant } 54353e519524SHoward Hinnant // [__first, __i) sorted 54363e519524SHoward Hinnant return; 54373e519524SHoward Hinnant } 54383e519524SHoward Hinnant else 54393e519524SHoward Hinnant { 54403e519524SHoward Hinnant // Check for [__i, __last) already sorted 54413e519524SHoward Hinnant __j = __m = __i; 54423e519524SHoward Hinnant while (++__j != __last) 54433e519524SHoward Hinnant { 54443e519524SHoward Hinnant if (__comp(*__j, *__m)) 54453e519524SHoward Hinnant // not yet sorted, so sort 54463e519524SHoward Hinnant goto not_sorted; 54473e519524SHoward Hinnant __m = __j; 54483e519524SHoward Hinnant } 54493e519524SHoward Hinnant // [__i, __last) sorted 54503e519524SHoward Hinnant return; 54513e519524SHoward Hinnant } 54523e519524SHoward Hinnant } 54533e519524SHoward Hinnantnot_sorted: 54543e519524SHoward Hinnant // __nth_element on range containing __nth 54553e519524SHoward Hinnant if (__nth < __i) 54563e519524SHoward Hinnant { 54573e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 54583e519524SHoward Hinnant __last = __i; 54593e519524SHoward Hinnant } 54603e519524SHoward Hinnant else 54613e519524SHoward Hinnant { 54623e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 54633e519524SHoward Hinnant __first = ++__i; 54643e519524SHoward Hinnant } 54653e519524SHoward Hinnant } 54663e519524SHoward Hinnant} 54673e519524SHoward Hinnant 54683e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54703e519524SHoward Hinnantvoid 54713e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54723e519524SHoward Hinnant{ 5473145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54763e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5477145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54793e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5480145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54813e519524SHoward Hinnant} 54823e519524SHoward Hinnant 54833e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54853e519524SHoward Hinnantvoid 54863e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54873e519524SHoward Hinnant{ 5488ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54893e519524SHoward Hinnant} 54903e519524SHoward Hinnant 54913e519524SHoward Hinnant// includes 54923e519524SHoward Hinnant 54933e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54943e519524SHoward Hinnantbool 54953e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54963e519524SHoward Hinnant _Compare __comp) 54973e519524SHoward Hinnant{ 54983e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54993e519524SHoward Hinnant { 55003e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 55013e519524SHoward Hinnant return false; 55023e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55033e519524SHoward Hinnant ++__first2; 55043e519524SHoward Hinnant } 55053e519524SHoward Hinnant return true; 55063e519524SHoward Hinnant} 55073e519524SHoward Hinnant 55083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55103e519524SHoward Hinnantbool 55113e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 55123e519524SHoward Hinnant _Compare __comp) 55133e519524SHoward Hinnant{ 5514145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55153e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55163e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55173e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5518145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55193e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55203e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5521145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55223e519524SHoward Hinnant} 55233e519524SHoward Hinnant 55243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55263e519524SHoward Hinnantbool 55273e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55283e519524SHoward Hinnant{ 5529ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55303e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55313e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55323e519524SHoward Hinnant} 55333e519524SHoward Hinnant 55343e519524SHoward Hinnant// set_union 55353e519524SHoward Hinnant 55363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55373e519524SHoward Hinnant_OutputIterator 55383e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55403e519524SHoward Hinnant{ 55413e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55423e519524SHoward Hinnant { 55433e519524SHoward Hinnant if (__first2 == __last2) 5544ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55463e519524SHoward Hinnant { 55473e519524SHoward Hinnant *__result = *__first2; 55483e519524SHoward Hinnant ++__first2; 55493e519524SHoward Hinnant } 55503e519524SHoward Hinnant else 55513e519524SHoward Hinnant { 55523e519524SHoward Hinnant *__result = *__first1; 55533e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55543e519524SHoward Hinnant ++__first2; 55553e519524SHoward Hinnant ++__first1; 55563e519524SHoward Hinnant } 55573e519524SHoward Hinnant } 5558ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55593e519524SHoward Hinnant} 55603e519524SHoward Hinnant 55613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55633e519524SHoward Hinnant_OutputIterator 55643e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55663e519524SHoward Hinnant{ 5567145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55683e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55693e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55703e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5571145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55733e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5574145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55753e519524SHoward Hinnant} 55763e519524SHoward Hinnant 55773e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55793e519524SHoward Hinnant_OutputIterator 55803e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55813e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55823e519524SHoward Hinnant{ 5583ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55843e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55853e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55863e519524SHoward Hinnant} 55873e519524SHoward Hinnant 55883e519524SHoward Hinnant// set_intersection 55893e519524SHoward Hinnant 55903e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55913e519524SHoward Hinnant_OutputIterator 55923e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55933e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55943e519524SHoward Hinnant{ 55953e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55963e519524SHoward Hinnant { 55973e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55983e519524SHoward Hinnant ++__first1; 55993e519524SHoward Hinnant else 56003e519524SHoward Hinnant { 56013e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56023e519524SHoward Hinnant { 56033e519524SHoward Hinnant *__result = *__first1; 56043e519524SHoward Hinnant ++__result; 56053e519524SHoward Hinnant ++__first1; 56063e519524SHoward Hinnant } 56073e519524SHoward Hinnant ++__first2; 56083e519524SHoward Hinnant } 56093e519524SHoward Hinnant } 56103e519524SHoward Hinnant return __result; 56113e519524SHoward Hinnant} 56123e519524SHoward Hinnant 56133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56153e519524SHoward Hinnant_OutputIterator 56163e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56183e519524SHoward Hinnant{ 5619145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56223e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5623145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56253e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5626145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56273e519524SHoward Hinnant} 56283e519524SHoward Hinnant 56293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56313e519524SHoward Hinnant_OutputIterator 56323e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56343e519524SHoward Hinnant{ 5635ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnant// set_difference 56413e519524SHoward Hinnant 56423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56433e519524SHoward Hinnant_OutputIterator 56443e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56463e519524SHoward Hinnant{ 56473e519524SHoward Hinnant while (__first1 != __last1) 56483e519524SHoward Hinnant { 56493e519524SHoward Hinnant if (__first2 == __last2) 5650ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56513e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56523e519524SHoward Hinnant { 56533e519524SHoward Hinnant *__result = *__first1; 56543e519524SHoward Hinnant ++__result; 56553e519524SHoward Hinnant ++__first1; 56563e519524SHoward Hinnant } 56573e519524SHoward Hinnant else 56583e519524SHoward Hinnant { 56593e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56603e519524SHoward Hinnant ++__first1; 56613e519524SHoward Hinnant ++__first2; 56623e519524SHoward Hinnant } 56633e519524SHoward Hinnant } 56643e519524SHoward Hinnant return __result; 56653e519524SHoward Hinnant} 56663e519524SHoward Hinnant 56673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56693e519524SHoward Hinnant_OutputIterator 56703e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56723e519524SHoward Hinnant{ 5673145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56743e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56753e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56763e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5677145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56783e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56793e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5680145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56813e519524SHoward Hinnant} 56823e519524SHoward Hinnant 56833e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56853e519524SHoward Hinnant_OutputIterator 56863e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56873e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56883e519524SHoward Hinnant{ 5689ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56903e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56913e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56923e519524SHoward Hinnant} 56933e519524SHoward Hinnant 56943e519524SHoward Hinnant// set_symmetric_difference 56953e519524SHoward Hinnant 56963e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56973e519524SHoward Hinnant_OutputIterator 56983e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56993e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57003e519524SHoward Hinnant{ 57013e519524SHoward Hinnant while (__first1 != __last1) 57023e519524SHoward Hinnant { 57033e519524SHoward Hinnant if (__first2 == __last2) 5704ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 57053e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 57063e519524SHoward Hinnant { 57073e519524SHoward Hinnant *__result = *__first1; 57083e519524SHoward Hinnant ++__result; 57093e519524SHoward Hinnant ++__first1; 57103e519524SHoward Hinnant } 57113e519524SHoward Hinnant else 57123e519524SHoward Hinnant { 57133e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57143e519524SHoward Hinnant { 57153e519524SHoward Hinnant *__result = *__first2; 57163e519524SHoward Hinnant ++__result; 57173e519524SHoward Hinnant } 57183e519524SHoward Hinnant else 57193e519524SHoward Hinnant ++__first1; 57203e519524SHoward Hinnant ++__first2; 57213e519524SHoward Hinnant } 57223e519524SHoward Hinnant } 5723ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 57243e519524SHoward Hinnant} 57253e519524SHoward Hinnant 57263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 57273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57283e519524SHoward Hinnant_OutputIterator 57293e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57303e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57313e519524SHoward Hinnant{ 5732145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57353e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5736145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57383e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5739145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57403e519524SHoward Hinnant} 57413e519524SHoward Hinnant 57423e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 57433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57443e519524SHoward Hinnant_OutputIterator 57453e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57463e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57473e519524SHoward Hinnant{ 5748ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57493e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57503e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57513e519524SHoward Hinnant} 57523e519524SHoward Hinnant 57533e519524SHoward Hinnant// lexicographical_compare 57543e519524SHoward Hinnant 57553e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57563e519524SHoward Hinnantbool 57573e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57583e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57593e519524SHoward Hinnant{ 5760910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57613e519524SHoward Hinnant { 57623e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57633e519524SHoward Hinnant return true; 57643e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57653e519524SHoward Hinnant return false; 57663e519524SHoward Hinnant } 57673e519524SHoward Hinnant return false; 57683e519524SHoward Hinnant} 57693e519524SHoward Hinnant 57703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57723e519524SHoward Hinnantbool 57733e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57753e519524SHoward Hinnant{ 5776145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57773e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57783e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57793e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5780145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57813e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57823e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5783145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57843e519524SHoward Hinnant} 57853e519524SHoward Hinnant 57863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57883e519524SHoward Hinnantbool 57893e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57913e519524SHoward Hinnant{ 5792ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57933e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57943e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57953e519524SHoward Hinnant} 57963e519524SHoward Hinnant 57973e519524SHoward Hinnant// next_permutation 57983e519524SHoward Hinnant 57993e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58003e519524SHoward Hinnantbool 58013e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58023e519524SHoward Hinnant{ 58033e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58043e519524SHoward Hinnant if (__first == __last || __first == --__i) 58053e519524SHoward Hinnant return false; 58063e519524SHoward Hinnant while (true) 58073e519524SHoward Hinnant { 58083e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58093e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 58103e519524SHoward Hinnant { 58113e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58123e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 58133e519524SHoward Hinnant ; 58143e519524SHoward Hinnant swap(*__i, *__j); 5815ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58163e519524SHoward Hinnant return true; 58173e519524SHoward Hinnant } 58183e519524SHoward Hinnant if (__i == __first) 58193e519524SHoward Hinnant { 5820ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58213e519524SHoward Hinnant return false; 58223e519524SHoward Hinnant } 58233e519524SHoward Hinnant } 58243e519524SHoward Hinnant} 58253e519524SHoward Hinnant 58263e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58283e519524SHoward Hinnantbool 58293e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58303e519524SHoward Hinnant{ 5831145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58323e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58333e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58343e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5835145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58363e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58373e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5838145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58393e519524SHoward Hinnant} 58403e519524SHoward Hinnant 58413e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58433e519524SHoward Hinnantbool 58443e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58453e519524SHoward Hinnant{ 5846ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58473e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58483e519524SHoward Hinnant} 58493e519524SHoward Hinnant 58503e519524SHoward Hinnant// prev_permutation 58513e519524SHoward Hinnant 58523e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58533e519524SHoward Hinnantbool 58543e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58553e519524SHoward Hinnant{ 58563e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58573e519524SHoward Hinnant if (__first == __last || __first == --__i) 58583e519524SHoward Hinnant return false; 58593e519524SHoward Hinnant while (true) 58603e519524SHoward Hinnant { 58613e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58623e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58633e519524SHoward Hinnant { 58643e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58653e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58663e519524SHoward Hinnant ; 58673e519524SHoward Hinnant swap(*__i, *__j); 5868ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58693e519524SHoward Hinnant return true; 58703e519524SHoward Hinnant } 58713e519524SHoward Hinnant if (__i == __first) 58723e519524SHoward Hinnant { 5873ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58743e519524SHoward Hinnant return false; 58753e519524SHoward Hinnant } 58763e519524SHoward Hinnant } 58773e519524SHoward Hinnant} 58783e519524SHoward Hinnant 58793e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58813e519524SHoward Hinnantbool 58823e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58833e519524SHoward Hinnant{ 5884145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58853e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58863e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58873e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5888145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58893e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58903e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5891145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58923e519524SHoward Hinnant} 58933e519524SHoward Hinnant 58943e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58963e519524SHoward Hinnantbool 58973e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58983e519524SHoward Hinnant{ 5899ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 59003e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 59013e519524SHoward Hinnant} 59023e519524SHoward Hinnant 59033e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 59043e519524SHoward Hinnant 59053e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5906