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 38d5c65ffaSMarshall Clowtemplate<class InputIterator, class Size, class Function> 39d5c65ffaSMarshall Clow InputIterator for_each_n(InputIterator first, Size n, Function f); // C++17 40d5c65ffaSMarshall Clow 413e519524SHoward Hinnanttemplate <class InputIterator, class T> 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 9671d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 968d5c65ffaSMarshall Clow// for_each_n 969d5c65ffaSMarshall Clow 970d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 971d5c65ffaSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 972d5c65ffaSMarshall Clow_InputIterator 973d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 974d5c65ffaSMarshall Clow{ 975d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 976d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 977d5c65ffaSMarshall Clow while (__n > 0) 978d5c65ffaSMarshall Clow { 979d5c65ffaSMarshall Clow __f(*__first); 980d5c65ffaSMarshall Clow ++__first; 981d5c65ffaSMarshall Clow --__n; 982d5c65ffaSMarshall Clow } 983d5c65ffaSMarshall Clow return __first; 984d5c65ffaSMarshall Clow} 9851d02996dSMarshall Clow#endif 986d5c65ffaSMarshall Clow 9873e519524SHoward Hinnant// find 9883e519524SHoward Hinnant 9893e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9913e519524SHoward Hinnant_InputIterator 992e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9933e519524SHoward Hinnant{ 9943e519524SHoward Hinnant for (; __first != __last; ++__first) 995e4383379SHoward Hinnant if (*__first == __value_) 9963e519524SHoward Hinnant break; 9973e519524SHoward Hinnant return __first; 9983e519524SHoward Hinnant} 9993e519524SHoward Hinnant 10003e519524SHoward Hinnant// find_if 10013e519524SHoward Hinnant 10023e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10043e519524SHoward Hinnant_InputIterator 10053e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10063e519524SHoward Hinnant{ 10073e519524SHoward Hinnant for (; __first != __last; ++__first) 10083e519524SHoward Hinnant if (__pred(*__first)) 10093e519524SHoward Hinnant break; 10103e519524SHoward Hinnant return __first; 10113e519524SHoward Hinnant} 10123e519524SHoward Hinnant 10133e519524SHoward Hinnant// find_if_not 10143e519524SHoward Hinnant 10153e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10173e519524SHoward Hinnant_InputIterator 10183e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10193e519524SHoward Hinnant{ 10203e519524SHoward Hinnant for (; __first != __last; ++__first) 10213e519524SHoward Hinnant if (!__pred(*__first)) 10223e519524SHoward Hinnant break; 10233e519524SHoward Hinnant return __first; 10243e519524SHoward Hinnant} 10253e519524SHoward Hinnant 10263e519524SHoward Hinnant// find_end 10273e519524SHoward Hinnant 10283e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10293e519524SHoward Hinnant_ForwardIterator1 10303e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10313e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10323e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10333e519524SHoward Hinnant{ 10343e519524SHoward Hinnant // modeled after search algorithm 10353e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10363e519524SHoward Hinnant if (__first2 == __last2) 10373e519524SHoward Hinnant return __r; 10383e519524SHoward Hinnant while (true) 10393e519524SHoward Hinnant { 10403e519524SHoward Hinnant while (true) 10413e519524SHoward Hinnant { 10423e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10433e519524SHoward Hinnant return __r; // (or __last1 if never found) 10443e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10453e519524SHoward Hinnant break; 10463e519524SHoward Hinnant ++__first1; 10473e519524SHoward Hinnant } 10483e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10493e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10503e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10513e519524SHoward Hinnant while (true) 10523e519524SHoward Hinnant { 10533e519524SHoward Hinnant if (++__m2 == __last2) 10543e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10553e519524SHoward Hinnant __r = __first1; 10563e519524SHoward Hinnant ++__first1; 10573e519524SHoward Hinnant break; 10583e519524SHoward Hinnant } 10593e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10603e519524SHoward Hinnant return __r; 10613e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10623e519524SHoward Hinnant { 10633e519524SHoward Hinnant ++__first1; 10643e519524SHoward Hinnant break; 10653e519524SHoward Hinnant } // else there is a match, check next elements 10663e519524SHoward Hinnant } 10673e519524SHoward Hinnant } 10683e519524SHoward Hinnant} 10693e519524SHoward Hinnant 10703e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10713e519524SHoward Hinnant_BidirectionalIterator1 10723e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10733e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10743e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10753e519524SHoward Hinnant{ 10763e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10773e519524SHoward Hinnant if (__first2 == __last2) 10783e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10793e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10803e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10813e519524SHoward Hinnant --__l2; 10823e519524SHoward Hinnant while (true) 10833e519524SHoward Hinnant { 10843e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10853e519524SHoward Hinnant while (true) 10863e519524SHoward Hinnant { 10873e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10883e519524SHoward Hinnant return __last1; 10893e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10903e519524SHoward Hinnant break; 10913e519524SHoward Hinnant } 10923e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10933e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10943e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10953e519524SHoward Hinnant while (true) 10963e519524SHoward Hinnant { 10973e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10983e519524SHoward Hinnant return __m1; 10993e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 11003e519524SHoward Hinnant return __last1; 11013e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11023e519524SHoward Hinnant { 11033e519524SHoward Hinnant break; 11043e519524SHoward Hinnant } // else there is a match, check next elements 11053e519524SHoward Hinnant } 11063e519524SHoward Hinnant } 11073e519524SHoward Hinnant} 11083e519524SHoward Hinnant 11093e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11109b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11113e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11123e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11133e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11143e519524SHoward Hinnant{ 11153e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11163e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11173e519524SHoward Hinnant if (__len2 == 0) 11183e519524SHoward Hinnant return __last1; 11193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11203e519524SHoward Hinnant if (__len1 < __len2) 11213e519524SHoward Hinnant return __last1; 11223e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11233e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11243e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11253e519524SHoward Hinnant --__l2; 11263e519524SHoward Hinnant while (true) 11273e519524SHoward Hinnant { 11283e519524SHoward Hinnant while (true) 11293e519524SHoward Hinnant { 11303e519524SHoward Hinnant if (__s == __l1) 11313e519524SHoward Hinnant return __last1; 11323e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11333e519524SHoward Hinnant break; 11343e519524SHoward Hinnant } 11353e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11363e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11373e519524SHoward Hinnant while (true) 11383e519524SHoward Hinnant { 11393e519524SHoward Hinnant if (__m2 == __first2) 11403e519524SHoward Hinnant return __m1; 11413e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11423e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11433e519524SHoward Hinnant { 11443e519524SHoward Hinnant break; 11453e519524SHoward Hinnant } 11463e519524SHoward Hinnant } 11473e519524SHoward Hinnant } 11483e519524SHoward Hinnant} 11493e519524SHoward Hinnant 11503e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11523e519524SHoward Hinnant_ForwardIterator1 11533e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11543e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11553e519524SHoward Hinnant{ 1156ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11573e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11583e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11593e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11603e519524SHoward Hinnant} 11613e519524SHoward Hinnant 11623e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11643e519524SHoward Hinnant_ForwardIterator1 11653e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11663e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11673e519524SHoward Hinnant{ 11683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11693e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1170ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11713e519524SHoward Hinnant} 11723e519524SHoward Hinnant 11733e519524SHoward Hinnant// find_first_of 11743e519524SHoward Hinnant 11753e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11769b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11779b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11783e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11813e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11823e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11833e519524SHoward Hinnant return __first1; 11843e519524SHoward Hinnant return __last1; 11853e519524SHoward Hinnant} 11863e519524SHoward Hinnant 11879b0af34dSMarshall Clow 11889b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11899b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11909b0af34dSMarshall Clow_ForwardIterator1 11919b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11929b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11939b0af34dSMarshall Clow{ 11949b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11959b0af34dSMarshall Clow} 11969b0af34dSMarshall Clow 11973e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11993e519524SHoward Hinnant_ForwardIterator1 12003e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12013e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12023e519524SHoward Hinnant{ 12033e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12059b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12063e519524SHoward Hinnant} 12073e519524SHoward Hinnant 12083e519524SHoward Hinnant// adjacent_find 12093e519524SHoward Hinnant 12103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12123e519524SHoward Hinnant_ForwardIterator 12133e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12143e519524SHoward Hinnant{ 12153e519524SHoward Hinnant if (__first != __last) 12163e519524SHoward Hinnant { 12173e519524SHoward Hinnant _ForwardIterator __i = __first; 12183e519524SHoward Hinnant while (++__i != __last) 12193e519524SHoward Hinnant { 12203e519524SHoward Hinnant if (__pred(*__first, *__i)) 12213e519524SHoward Hinnant return __first; 12223e519524SHoward Hinnant __first = __i; 12233e519524SHoward Hinnant } 12243e519524SHoward Hinnant } 12253e519524SHoward Hinnant return __last; 12263e519524SHoward Hinnant} 12273e519524SHoward Hinnant 12283e519524SHoward Hinnanttemplate <class _ForwardIterator> 12293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12303e519524SHoward Hinnant_ForwardIterator 12313e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12323e519524SHoward Hinnant{ 12333e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1234ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12353e519524SHoward Hinnant} 12363e519524SHoward Hinnant 12373e519524SHoward Hinnant// count 12383e519524SHoward Hinnant 12393e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12413e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1242e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12433e519524SHoward Hinnant{ 12443e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12453e519524SHoward Hinnant for (; __first != __last; ++__first) 1246e4383379SHoward Hinnant if (*__first == __value_) 12473e519524SHoward Hinnant ++__r; 12483e519524SHoward Hinnant return __r; 12493e519524SHoward Hinnant} 12503e519524SHoward Hinnant 12513e519524SHoward Hinnant// count_if 12523e519524SHoward Hinnant 12533e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12553e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12563e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12573e519524SHoward Hinnant{ 12583e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12593e519524SHoward Hinnant for (; __first != __last; ++__first) 12603e519524SHoward Hinnant if (__pred(*__first)) 12613e519524SHoward Hinnant ++__r; 12623e519524SHoward Hinnant return __r; 12633e519524SHoward Hinnant} 12643e519524SHoward Hinnant 12653e519524SHoward Hinnant// mismatch 12663e519524SHoward Hinnant 12673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12693e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12703e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12713e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12723e519524SHoward Hinnant{ 1273bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12743e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12753e519524SHoward Hinnant break; 12763e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12773e519524SHoward Hinnant} 12783e519524SHoward Hinnant 12793e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12813e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12823e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12833e519524SHoward Hinnant{ 12843e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12853e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1286ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12873e519524SHoward Hinnant} 12883e519524SHoward Hinnant 12890b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12900b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12910b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12920b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12930b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12940b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12950b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12960b0bbd2fSMarshall Clow{ 1297bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12980b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12990b0bbd2fSMarshall Clow break; 13000b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 13010b0bbd2fSMarshall Clow} 13020b0bbd2fSMarshall Clow 13030b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13040b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13050b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13060b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13070b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13080b0bbd2fSMarshall Clow{ 13090b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13100b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13110b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13120b0bbd2fSMarshall Clow} 13130b0bbd2fSMarshall Clow#endif 13140b0bbd2fSMarshall Clow 13153e519524SHoward Hinnant// equal 13163e519524SHoward Hinnant 13173e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13193e519524SHoward Hinnantbool 13203e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13213e519524SHoward Hinnant{ 1322910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13233e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13243e519524SHoward Hinnant return false; 13253e519524SHoward Hinnant return true; 13263e519524SHoward Hinnant} 13273e519524SHoward Hinnant 13283e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13303e519524SHoward Hinnantbool 13313e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13323e519524SHoward Hinnant{ 13333e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13343e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1335ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13363e519524SHoward Hinnant} 13373e519524SHoward Hinnant 13380b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13390b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13400b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13410b0bbd2fSMarshall Clowbool 13420b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13430b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13440b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13450b0bbd2fSMarshall Clow{ 1346910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13470b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13480b0bbd2fSMarshall Clow return false; 13490b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13500b0bbd2fSMarshall Clow} 13510b0bbd2fSMarshall Clow 13520b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13530b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13540b0bbd2fSMarshall Clowbool 13550b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13560b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13570b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13580b0bbd2fSMarshall Clow{ 13590b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13600b0bbd2fSMarshall Clow return false; 13610b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13620b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13630b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13640b0bbd2fSMarshall Clow} 13650b0bbd2fSMarshall Clow 13660b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13670b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13680b0bbd2fSMarshall Clowbool 13690b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13700b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13710b0bbd2fSMarshall Clow{ 13720b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13730b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13740b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13750b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13760b0bbd2fSMarshall Clow} 13770b0bbd2fSMarshall Clow 13780b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13790b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13800b0bbd2fSMarshall Clowbool 13810b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13820b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13830b0bbd2fSMarshall Clow{ 13840b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13850b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13860b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13870b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13880b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13890b0bbd2fSMarshall Clow} 13900b0bbd2fSMarshall Clow#endif 13910b0bbd2fSMarshall Clow 13923e519524SHoward Hinnant// is_permutation 13933e519524SHoward Hinnant 13943e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13953e519524SHoward Hinnantbool 13963e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13973e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13983e519524SHoward Hinnant{ 13993e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1400910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 14013e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 14023e519524SHoward Hinnant goto __not_done; 14033e519524SHoward Hinnant return true; 14043e519524SHoward Hinnant__not_done: 14053e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 14063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1407ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14083e519524SHoward Hinnant if (__l1 == _D1(1)) 14093e519524SHoward Hinnant return false; 1410ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14113e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14123e519524SHoward Hinnant // equal elements in [f2, l2) 14133e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14143e519524SHoward Hinnant { 14153e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 14163e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14173e519524SHoward Hinnant if (__pred(*__j, *__i)) 14183e519524SHoward Hinnant goto __next_iter; 14193e519524SHoward Hinnant { 14203e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14213e519524SHoward Hinnant _D1 __c2 = 0; 14223e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14233e519524SHoward Hinnant if (__pred(*__i, *__j)) 14243e519524SHoward Hinnant ++__c2; 14253e519524SHoward Hinnant if (__c2 == 0) 14263e519524SHoward Hinnant return false; 14273e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14283e519524SHoward Hinnant _D1 __c1 = 1; 1429ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14303e519524SHoward Hinnant if (__pred(*__i, *__j)) 14313e519524SHoward Hinnant ++__c1; 14323e519524SHoward Hinnant if (__c1 != __c2) 14333e519524SHoward Hinnant return false; 14343e519524SHoward Hinnant } 14353e519524SHoward Hinnant__next_iter:; 14363e519524SHoward Hinnant } 14373e519524SHoward Hinnant return true; 14383e519524SHoward Hinnant} 14393e519524SHoward Hinnant 14403e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 14413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14423e519524SHoward Hinnantbool 14433e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14443e519524SHoward Hinnant _ForwardIterator2 __first2) 14453e519524SHoward Hinnant{ 14463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1448ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14493e519524SHoward Hinnant} 14503e519524SHoward Hinnant 14510b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14520b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14530b0bbd2fSMarshall Clowbool 14540b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14550b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14560b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14570b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14580b0bbd2fSMarshall Clow{ 14590b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1460847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14610b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 14620b0bbd2fSMarshall Clow goto __not_done; 14630b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 14640b0bbd2fSMarshall Clow__not_done: 14650b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 14660b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14670b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14680b0bbd2fSMarshall Clow 14690b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1470fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14710b0bbd2fSMarshall Clow if (__l1 != __l2) 14720b0bbd2fSMarshall Clow return false; 14730b0bbd2fSMarshall Clow 14740b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14750b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14760b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14770b0bbd2fSMarshall Clow { 14780b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 14790b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14800b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 14810b0bbd2fSMarshall Clow goto __next_iter; 14820b0bbd2fSMarshall Clow { 14830b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14840b0bbd2fSMarshall Clow _D1 __c2 = 0; 14850b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14860b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14870b0bbd2fSMarshall Clow ++__c2; 14880b0bbd2fSMarshall Clow if (__c2 == 0) 14890b0bbd2fSMarshall Clow return false; 14900b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14910b0bbd2fSMarshall Clow _D1 __c1 = 1; 14920b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14930b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14940b0bbd2fSMarshall Clow ++__c1; 14950b0bbd2fSMarshall Clow if (__c1 != __c2) 14960b0bbd2fSMarshall Clow return false; 14970b0bbd2fSMarshall Clow } 14980b0bbd2fSMarshall Clow__next_iter:; 14990b0bbd2fSMarshall Clow } 15000b0bbd2fSMarshall Clow return true; 15010b0bbd2fSMarshall Clow} 15020b0bbd2fSMarshall Clow 15030b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 15040b0bbd2fSMarshall Clowbool 15050b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 15060b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 15070b0bbd2fSMarshall Clow _BinaryPredicate __pred, 15080b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 15090b0bbd2fSMarshall Clow{ 15100b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 15110b0bbd2fSMarshall Clow return false; 15120b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 15130b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 15140b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 15150b0bbd2fSMarshall Clow} 15160b0bbd2fSMarshall Clow 15170b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15180b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15190b0bbd2fSMarshall Clowbool 15200b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15210b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 15220b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15230b0bbd2fSMarshall Clow{ 15240b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15250b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15260b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15270b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15280b0bbd2fSMarshall Clow} 15290b0bbd2fSMarshall Clow 15300b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 15310b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15320b0bbd2fSMarshall Clowbool 15330b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15340b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15350b0bbd2fSMarshall Clow{ 15360b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15370b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15380b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15390b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15400b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15410b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15420b0bbd2fSMarshall Clow} 15430b0bbd2fSMarshall Clow#endif 15440b0bbd2fSMarshall Clow 15453e519524SHoward Hinnant// search 15463e519524SHoward Hinnant 15473e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 154828cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 15493e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 15513e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 15523e519524SHoward Hinnant{ 15533e519524SHoward Hinnant if (__first2 == __last2) 155428cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 15553e519524SHoward Hinnant while (true) 15563e519524SHoward Hinnant { 15573e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 15583e519524SHoward Hinnant while (true) 15593e519524SHoward Hinnant { 15603e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 156128cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15623e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15633e519524SHoward Hinnant break; 15643e519524SHoward Hinnant ++__first1; 15653e519524SHoward Hinnant } 15663e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 15673e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 15683e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 15693e519524SHoward Hinnant while (true) 15703e519524SHoward Hinnant { 15713e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 157228cc4ddeSMarshall Clow return make_pair(__first1, __m1); 15733e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 157428cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15753e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 15763e519524SHoward Hinnant { 15773e519524SHoward Hinnant ++__first1; 15783e519524SHoward Hinnant break; 15793e519524SHoward Hinnant } // else there is a match, check next elements 15803e519524SHoward Hinnant } 15813e519524SHoward Hinnant } 15823e519524SHoward Hinnant} 15833e519524SHoward Hinnant 15843e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 158528cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 158628cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 15873e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 15883e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 15893e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 15903e519524SHoward Hinnant{ 159128cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 159228cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 15933e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 159428cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 15953e519524SHoward Hinnant if (__len2 == 0) 159628cc4ddeSMarshall Clow return make_pair(__first1, __first1); 159728cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 15983e519524SHoward Hinnant if (__len1 < __len2) 159928cc4ddeSMarshall Clow return make_pair(__last1, __last1); 16003e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 1601b9775795SAditya Kumar 16023e519524SHoward Hinnant while (true) 16033e519524SHoward Hinnant { 16043e519524SHoward Hinnant while (true) 16053e519524SHoward Hinnant { 16063e519524SHoward Hinnant if (__first1 == __s) 160728cc4ddeSMarshall Clow return make_pair(__last1, __last1); 16083e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 16093e519524SHoward Hinnant break; 16103e519524SHoward Hinnant ++__first1; 16113e519524SHoward Hinnant } 1612b9775795SAditya Kumar 16133e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 16143e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 16153e519524SHoward Hinnant while (true) 16163e519524SHoward Hinnant { 16173e519524SHoward Hinnant if (++__m2 == __last2) 161828cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 16193e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 16203e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 16213e519524SHoward Hinnant { 16223e519524SHoward Hinnant ++__first1; 16233e519524SHoward Hinnant break; 16243e519524SHoward Hinnant } 16253e519524SHoward Hinnant } 16263e519524SHoward Hinnant } 16273e519524SHoward Hinnant} 16283e519524SHoward Hinnant 16293e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 16303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16313e519524SHoward Hinnant_ForwardIterator1 16323e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16333e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 16343e519524SHoward Hinnant{ 1635ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 16363e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 163728cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 163828cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 163928cc4ddeSMarshall Clow .first; 16403e519524SHoward Hinnant} 16413e519524SHoward Hinnant 16423e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16443e519524SHoward Hinnant_ForwardIterator1 16453e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16463e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16473e519524SHoward Hinnant{ 164828cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 164928cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1650ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16513e519524SHoward Hinnant} 16523e519524SHoward Hinnant 16533e519524SHoward Hinnant// search_n 16543e519524SHoward Hinnant 16553e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16563e519524SHoward Hinnant_ForwardIterator 16573e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1658e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16593e519524SHoward Hinnant{ 16603e519524SHoward Hinnant if (__count <= 0) 16613e519524SHoward Hinnant return __first; 16623e519524SHoward Hinnant while (true) 16633e519524SHoward Hinnant { 1664e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16653e519524SHoward Hinnant while (true) 16663e519524SHoward Hinnant { 1667e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16683e519524SHoward Hinnant return __last; 1669e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16703e519524SHoward Hinnant break; 16713e519524SHoward Hinnant ++__first; 16723e519524SHoward Hinnant } 1673e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16743e519524SHoward Hinnant _ForwardIterator __m = __first; 16753e519524SHoward Hinnant _Size __c(0); 16763e519524SHoward Hinnant while (true) 16773e519524SHoward Hinnant { 16783e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16793e519524SHoward Hinnant return __first; 16803e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16813e519524SHoward Hinnant return __last; 1682e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16833e519524SHoward Hinnant { 16843e519524SHoward Hinnant __first = __m; 16853e519524SHoward Hinnant ++__first; 16863e519524SHoward Hinnant break; 16873e519524SHoward Hinnant } // else there is a match, check next elements 16883e519524SHoward Hinnant } 16893e519524SHoward Hinnant } 16903e519524SHoward Hinnant} 16913e519524SHoward Hinnant 16923e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16933e519524SHoward Hinnant_RandomAccessIterator 16943e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1695e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16963e519524SHoward Hinnant{ 16973e519524SHoward Hinnant if (__count <= 0) 16983e519524SHoward Hinnant return __first; 16993e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 17003e519524SHoward Hinnant if (__len < __count) 17013e519524SHoward Hinnant return __last; 17023e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 17033e519524SHoward Hinnant while (true) 17043e519524SHoward Hinnant { 1705e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 17063e519524SHoward Hinnant while (true) 17073e519524SHoward Hinnant { 1708b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 17093e519524SHoward Hinnant return __last; 1710e4383379SHoward Hinnant if (__pred(*__first, __value_)) 17113e519524SHoward Hinnant break; 17123e519524SHoward Hinnant ++__first; 17133e519524SHoward Hinnant } 1714e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 17153e519524SHoward Hinnant _RandomAccessIterator __m = __first; 17163e519524SHoward Hinnant _Size __c(0); 17173e519524SHoward Hinnant while (true) 17183e519524SHoward Hinnant { 17193e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 17203e519524SHoward Hinnant return __first; 17213e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1722e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 17233e519524SHoward Hinnant { 17243e519524SHoward Hinnant __first = __m; 17253e519524SHoward Hinnant ++__first; 17263e519524SHoward Hinnant break; 17273e519524SHoward Hinnant } // else there is a match, check next elements 17283e519524SHoward Hinnant } 17293e519524SHoward Hinnant } 17303e519524SHoward Hinnant} 17313e519524SHoward Hinnant 17323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 17333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17343e519524SHoward Hinnant_ForwardIterator 17353e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1736e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 17373e519524SHoward Hinnant{ 1738ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 173951544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 174051544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 17413e519524SHoward Hinnant} 17423e519524SHoward Hinnant 17433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17453e519524SHoward Hinnant_ForwardIterator 1746e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17473e519524SHoward Hinnant{ 17483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 174951544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 175051544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17513e519524SHoward Hinnant} 17523e519524SHoward Hinnant 17533e519524SHoward Hinnant// copy 17543e519524SHoward Hinnanttemplate <class _Iter> 17553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17563e519524SHoward Hinnant_Iter 17573e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17583e519524SHoward Hinnant{ 17593e519524SHoward Hinnant return __i; 17603e519524SHoward Hinnant} 17613e519524SHoward Hinnant 17623e519524SHoward Hinnanttemplate <class _Tp> 17635b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17643e519524SHoward Hinnanttypename enable_if 17653e519524SHoward Hinnant< 1766ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17673e519524SHoward Hinnant _Tp* 17683e519524SHoward Hinnant>::type 17693e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17703e519524SHoward Hinnant{ 17713e519524SHoward Hinnant return __i.base(); 17723e519524SHoward Hinnant} 17733e519524SHoward Hinnant 1774fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1775fc88dbd2SHoward Hinnant 17763e519524SHoward Hinnanttemplate <class _Tp> 17775b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17783e519524SHoward Hinnanttypename enable_if 17793e519524SHoward Hinnant< 1780ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17813e519524SHoward Hinnant _Tp* 17823e519524SHoward Hinnant>::type 17833e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17843e519524SHoward Hinnant{ 17853e519524SHoward Hinnant return __i.base(); 17863e519524SHoward Hinnant} 17873e519524SHoward Hinnant 178814bd0bf0SEric Fiselier#else 178914bd0bf0SEric Fiselier 179014bd0bf0SEric Fiseliertemplate <class _Tp> 17915b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 179214bd0bf0SEric Fiseliertypename enable_if 179314bd0bf0SEric Fiselier< 179414bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 179514bd0bf0SEric Fiselier __wrap_iter<_Tp*> 179614bd0bf0SEric Fiselier>::type 179714bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 179814bd0bf0SEric Fiselier{ 179914bd0bf0SEric Fiselier return __i; 180014bd0bf0SEric Fiselier} 180114bd0bf0SEric Fiselier 1802fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1803fc88dbd2SHoward Hinnant 18043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18063e519524SHoward Hinnant_OutputIterator 18073e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18083e519524SHoward Hinnant{ 1809910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18103e519524SHoward Hinnant *__result = *__first; 18113e519524SHoward Hinnant return __result; 18123e519524SHoward Hinnant} 18133e519524SHoward Hinnant 18143e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18163e519524SHoward Hinnanttypename enable_if 18173e519524SHoward Hinnant< 18183e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1819ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18203e519524SHoward Hinnant _Up* 18213e519524SHoward Hinnant>::type 18223e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 18233e519524SHoward Hinnant{ 18243e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18255b312052SMarshall Clow if (__n > 0) 1826ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18273e519524SHoward Hinnant return __result + __n; 18283e519524SHoward Hinnant} 18293e519524SHoward Hinnant 18303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18323e519524SHoward Hinnant_OutputIterator 18333e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18343e519524SHoward Hinnant{ 1835ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18363e519524SHoward Hinnant} 18373e519524SHoward Hinnant 18383e519524SHoward Hinnant// copy_backward 18393e519524SHoward Hinnant 1840d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 18413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18423e519524SHoward Hinnant_OutputIterator 1843d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 18443e519524SHoward Hinnant{ 18453e519524SHoward Hinnant while (__first != __last) 18463e519524SHoward Hinnant *--__result = *--__last; 18473e519524SHoward Hinnant return __result; 18483e519524SHoward Hinnant} 18493e519524SHoward Hinnant 18503e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18523e519524SHoward Hinnanttypename enable_if 18533e519524SHoward Hinnant< 18543e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1855ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18563e519524SHoward Hinnant _Up* 18573e519524SHoward Hinnant>::type 18583e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18593e519524SHoward Hinnant{ 18603e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18615b312052SMarshall Clow if (__n > 0) 18625b312052SMarshall Clow { 18633e519524SHoward Hinnant __result -= __n; 1864ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18655b312052SMarshall Clow } 18663e519524SHoward Hinnant return __result; 18673e519524SHoward Hinnant} 18683e519524SHoward Hinnant 18693e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18713e519524SHoward Hinnant_BidirectionalIterator2 18723e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18733e519524SHoward Hinnant _BidirectionalIterator2 __result) 18743e519524SHoward Hinnant{ 1875fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1876fd838227SEric Fiselier __unwrap_iter(__last), 1877fd838227SEric Fiselier __unwrap_iter(__result)); 18783e519524SHoward Hinnant} 18793e519524SHoward Hinnant 18803e519524SHoward Hinnant// copy_if 18813e519524SHoward Hinnant 18823e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18843e519524SHoward Hinnant_OutputIterator 18853e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18863e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18873e519524SHoward Hinnant{ 18883e519524SHoward Hinnant for (; __first != __last; ++__first) 18893e519524SHoward Hinnant { 18903e519524SHoward Hinnant if (__pred(*__first)) 18913e519524SHoward Hinnant { 18923e519524SHoward Hinnant *__result = *__first; 18933e519524SHoward Hinnant ++__result; 18943e519524SHoward Hinnant } 18953e519524SHoward Hinnant } 18963e519524SHoward Hinnant return __result; 18973e519524SHoward Hinnant} 18983e519524SHoward Hinnant 18993e519524SHoward Hinnant// copy_n 19003e519524SHoward Hinnant 19013e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19033e519524SHoward Hinnanttypename enable_if 19043e519524SHoward Hinnant< 19053e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 19063e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 19073e519524SHoward Hinnant _OutputIterator 19083e519524SHoward Hinnant>::type 190951544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19103e519524SHoward Hinnant{ 191151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 191251544023SEric Fiselier _IntegralSize __n = __orig_n; 191399847d2bSHoward Hinnant if (__n > 0) 191499847d2bSHoward Hinnant { 19153e519524SHoward Hinnant *__result = *__first; 191699847d2bSHoward Hinnant ++__result; 191799847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 191899847d2bSHoward Hinnant { 191999847d2bSHoward Hinnant ++__first; 192099847d2bSHoward Hinnant *__result = *__first; 192199847d2bSHoward Hinnant ++__result; 192299847d2bSHoward Hinnant } 192399847d2bSHoward Hinnant } 19243e519524SHoward Hinnant return __result; 19253e519524SHoward Hinnant} 19263e519524SHoward Hinnant 19273e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19293e519524SHoward Hinnanttypename enable_if 19303e519524SHoward Hinnant< 19313e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 19323e519524SHoward Hinnant _OutputIterator 19333e519524SHoward Hinnant>::type 193451544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19353e519524SHoward Hinnant{ 193651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 193751544023SEric Fiselier _IntegralSize __n = __orig_n; 1938ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 19393e519524SHoward Hinnant} 19403e519524SHoward Hinnant 19413e519524SHoward Hinnant// move 19423e519524SHoward Hinnant 19433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19453e519524SHoward Hinnant_OutputIterator 19463e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19473e519524SHoward Hinnant{ 1948910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1949ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 19503e519524SHoward Hinnant return __result; 19513e519524SHoward Hinnant} 19523e519524SHoward Hinnant 19533e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19553e519524SHoward Hinnanttypename enable_if 19563e519524SHoward Hinnant< 19573e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1958ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19593e519524SHoward Hinnant _Up* 19603e519524SHoward Hinnant>::type 19613e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19623e519524SHoward Hinnant{ 19633e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19645b312052SMarshall Clow if (__n > 0) 1965ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19663e519524SHoward Hinnant return __result + __n; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19713e519524SHoward Hinnant_OutputIterator 19723e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19733e519524SHoward Hinnant{ 1974ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19753e519524SHoward Hinnant} 19763e519524SHoward Hinnant 19773e519524SHoward Hinnant// move_backward 19783e519524SHoward Hinnant 19793e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19813e519524SHoward Hinnant_OutputIterator 19823e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19833e519524SHoward Hinnant{ 19843e519524SHoward Hinnant while (__first != __last) 1985ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19863e519524SHoward Hinnant return __result; 19873e519524SHoward Hinnant} 19883e519524SHoward Hinnant 19893e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19913e519524SHoward Hinnanttypename enable_if 19923e519524SHoward Hinnant< 19933e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1994ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19953e519524SHoward Hinnant _Up* 19963e519524SHoward Hinnant>::type 19973e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19983e519524SHoward Hinnant{ 19993e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 20005b312052SMarshall Clow if (__n > 0) 20015b312052SMarshall Clow { 20023e519524SHoward Hinnant __result -= __n; 2003ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 20045b312052SMarshall Clow } 20053e519524SHoward Hinnant return __result; 20063e519524SHoward Hinnant} 20073e519524SHoward Hinnant 20083e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 20093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20103e519524SHoward Hinnant_BidirectionalIterator2 20113e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 20123e519524SHoward Hinnant _BidirectionalIterator2 __result) 20133e519524SHoward Hinnant{ 2014ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 20153e519524SHoward Hinnant} 20163e519524SHoward Hinnant 20173e519524SHoward Hinnant// iter_swap 20183e519524SHoward Hinnant 2019a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 20203e519524SHoward Hinnant 20213e519524SHoward Hinnant// transform 20223e519524SHoward Hinnant 20233e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 20243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20253e519524SHoward Hinnant_OutputIterator 20263e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 20273e519524SHoward Hinnant{ 2028910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20293e519524SHoward Hinnant *__result = __op(*__first); 20303e519524SHoward Hinnant return __result; 20313e519524SHoward Hinnant} 20323e519524SHoward Hinnant 20333e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 20343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20353e519524SHoward Hinnant_OutputIterator 20363e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 20373e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 20383e519524SHoward Hinnant{ 2039910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 20403e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 20413e519524SHoward Hinnant return __result; 20423e519524SHoward Hinnant} 20433e519524SHoward Hinnant 20443e519524SHoward Hinnant// replace 20453e519524SHoward Hinnant 20463e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20483e519524SHoward Hinnantvoid 20493e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20503e519524SHoward Hinnant{ 20513e519524SHoward Hinnant for (; __first != __last; ++__first) 20523e519524SHoward Hinnant if (*__first == __old_value) 20533e519524SHoward Hinnant *__first = __new_value; 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// replace_if 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnantvoid 20613e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20623e519524SHoward Hinnant{ 20633e519524SHoward Hinnant for (; __first != __last; ++__first) 20643e519524SHoward Hinnant if (__pred(*__first)) 20653e519524SHoward Hinnant *__first = __new_value; 20663e519524SHoward Hinnant} 20673e519524SHoward Hinnant 20683e519524SHoward Hinnant// replace_copy 20693e519524SHoward Hinnant 20703e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20723e519524SHoward Hinnant_OutputIterator 20733e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20743e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20753e519524SHoward Hinnant{ 2076910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20773e519524SHoward Hinnant if (*__first == __old_value) 20783e519524SHoward Hinnant *__result = __new_value; 20793e519524SHoward Hinnant else 20803e519524SHoward Hinnant *__result = *__first; 20813e519524SHoward Hinnant return __result; 20823e519524SHoward Hinnant} 20833e519524SHoward Hinnant 20843e519524SHoward Hinnant// replace_copy_if 20853e519524SHoward Hinnant 20863e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20883e519524SHoward Hinnant_OutputIterator 20893e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20903e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20913e519524SHoward Hinnant{ 2092910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20933e519524SHoward Hinnant if (__pred(*__first)) 20943e519524SHoward Hinnant *__result = __new_value; 20953e519524SHoward Hinnant else 20963e519524SHoward Hinnant *__result = *__first; 20973e519524SHoward Hinnant return __result; 20983e519524SHoward Hinnant} 20993e519524SHoward Hinnant 21003e519524SHoward Hinnant// fill_n 21013e519524SHoward Hinnant 21023e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21043e519524SHoward Hinnant_OutputIterator 21050f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21063e519524SHoward Hinnant{ 2107910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2108e4383379SHoward Hinnant *__first = __value_; 21093e519524SHoward Hinnant return __first; 21103e519524SHoward Hinnant} 21113e519524SHoward Hinnant 21120f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 21133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21140f242beaSHoward Hinnanttypename enable_if 21150f242beaSHoward Hinnant< 21160f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 21170f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 21180f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 21190f242beaSHoward Hinnant _Tp* 21200f242beaSHoward Hinnant>::type 21210f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 21223e519524SHoward Hinnant{ 21233e519524SHoward Hinnant if (__n > 0) 2124e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 21253e519524SHoward Hinnant return __first + __n; 21263e519524SHoward Hinnant} 21273e519524SHoward Hinnant 21283e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21303e519524SHoward Hinnant_OutputIterator 2131e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21323e519524SHoward Hinnant{ 213351544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 21343e519524SHoward Hinnant} 21353e519524SHoward Hinnant 21363e519524SHoward Hinnant// fill 21373e519524SHoward Hinnant 21383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21403e519524SHoward Hinnantvoid 2141e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 21423e519524SHoward Hinnant{ 21433e519524SHoward Hinnant for (; __first != __last; ++__first) 2144e4383379SHoward Hinnant *__first = __value_; 21453e519524SHoward Hinnant} 21463e519524SHoward Hinnant 21473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 21483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21493e519524SHoward Hinnantvoid 2150e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 21513e519524SHoward Hinnant{ 2152e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 21533e519524SHoward Hinnant} 21543e519524SHoward Hinnant 21553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21573e519524SHoward Hinnantvoid 2158e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21593e519524SHoward Hinnant{ 2160e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21613e519524SHoward Hinnant} 21623e519524SHoward Hinnant 21633e519524SHoward Hinnant// generate 21643e519524SHoward Hinnant 21653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21673e519524SHoward Hinnantvoid 21683e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21693e519524SHoward Hinnant{ 21703e519524SHoward Hinnant for (; __first != __last; ++__first) 21713e519524SHoward Hinnant *__first = __gen(); 21723e519524SHoward Hinnant} 21733e519524SHoward Hinnant 21743e519524SHoward Hinnant// generate_n 21753e519524SHoward Hinnant 21763e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21783e519524SHoward Hinnant_OutputIterator 217951544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21803e519524SHoward Hinnant{ 218151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 218251544023SEric Fiselier _IntegralSize __n = __orig_n; 2183910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21843e519524SHoward Hinnant *__first = __gen(); 21853e519524SHoward Hinnant return __first; 21863e519524SHoward Hinnant} 21873e519524SHoward Hinnant 21883e519524SHoward Hinnant// remove 21893e519524SHoward Hinnant 21903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21913e519524SHoward Hinnant_ForwardIterator 2192e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21933e519524SHoward Hinnant{ 2194e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21953e519524SHoward Hinnant if (__first != __last) 21963e519524SHoward Hinnant { 21973e519524SHoward Hinnant _ForwardIterator __i = __first; 21983e519524SHoward Hinnant while (++__i != __last) 21993e519524SHoward Hinnant { 2200e4383379SHoward Hinnant if (!(*__i == __value_)) 22013e519524SHoward Hinnant { 2202ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22033e519524SHoward Hinnant ++__first; 22043e519524SHoward Hinnant } 22053e519524SHoward Hinnant } 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant return __first; 22083e519524SHoward Hinnant} 22093e519524SHoward Hinnant 22103e519524SHoward Hinnant// remove_if 22113e519524SHoward Hinnant 22123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 22133e519524SHoward Hinnant_ForwardIterator 22143e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 22153e519524SHoward Hinnant{ 2216ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 22173e519524SHoward Hinnant (__first, __last, __pred); 22183e519524SHoward Hinnant if (__first != __last) 22193e519524SHoward Hinnant { 22203e519524SHoward Hinnant _ForwardIterator __i = __first; 22213e519524SHoward Hinnant while (++__i != __last) 22223e519524SHoward Hinnant { 22233e519524SHoward Hinnant if (!__pred(*__i)) 22243e519524SHoward Hinnant { 2225ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22263e519524SHoward Hinnant ++__first; 22273e519524SHoward Hinnant } 22283e519524SHoward Hinnant } 22293e519524SHoward Hinnant } 22303e519524SHoward Hinnant return __first; 22313e519524SHoward Hinnant} 22323e519524SHoward Hinnant 22333e519524SHoward Hinnant// remove_copy 22343e519524SHoward Hinnant 22353e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 22363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22373e519524SHoward Hinnant_OutputIterator 2238e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 22393e519524SHoward Hinnant{ 22403e519524SHoward Hinnant for (; __first != __last; ++__first) 22413e519524SHoward Hinnant { 2242e4383379SHoward Hinnant if (!(*__first == __value_)) 22433e519524SHoward Hinnant { 22443e519524SHoward Hinnant *__result = *__first; 22453e519524SHoward Hinnant ++__result; 22463e519524SHoward Hinnant } 22473e519524SHoward Hinnant } 22483e519524SHoward Hinnant return __result; 22493e519524SHoward Hinnant} 22503e519524SHoward Hinnant 22513e519524SHoward Hinnant// remove_copy_if 22523e519524SHoward Hinnant 22533e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 22543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22553e519524SHoward Hinnant_OutputIterator 22563e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 22573e519524SHoward Hinnant{ 22583e519524SHoward Hinnant for (; __first != __last; ++__first) 22593e519524SHoward Hinnant { 22603e519524SHoward Hinnant if (!__pred(*__first)) 22613e519524SHoward Hinnant { 22623e519524SHoward Hinnant *__result = *__first; 22633e519524SHoward Hinnant ++__result; 22643e519524SHoward Hinnant } 22653e519524SHoward Hinnant } 22663e519524SHoward Hinnant return __result; 22673e519524SHoward Hinnant} 22683e519524SHoward Hinnant 22693e519524SHoward Hinnant// unique 22703e519524SHoward Hinnant 22713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22723e519524SHoward Hinnant_ForwardIterator 22733e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22743e519524SHoward Hinnant{ 2275ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22763e519524SHoward Hinnant (__first, __last, __pred); 22773e519524SHoward Hinnant if (__first != __last) 22783e519524SHoward Hinnant { 22793e519524SHoward Hinnant // ... a a ? ... 22803e519524SHoward Hinnant // f i 22813e519524SHoward Hinnant _ForwardIterator __i = __first; 22823e519524SHoward Hinnant for (++__i; ++__i != __last;) 22833e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2284ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22853e519524SHoward Hinnant ++__first; 22863e519524SHoward Hinnant } 22873e519524SHoward Hinnant return __first; 22883e519524SHoward Hinnant} 22893e519524SHoward Hinnant 22903e519524SHoward Hinnanttemplate <class _ForwardIterator> 22913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22923e519524SHoward Hinnant_ForwardIterator 22933e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22943e519524SHoward Hinnant{ 22953e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2296ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22973e519524SHoward Hinnant} 22983e519524SHoward Hinnant 22993e519524SHoward Hinnant// unique_copy 23003e519524SHoward Hinnant 23013e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 23023e519524SHoward Hinnant_OutputIterator 23033e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23043e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 23053e519524SHoward Hinnant{ 23063e519524SHoward Hinnant if (__first != __last) 23073e519524SHoward Hinnant { 23083e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 23093e519524SHoward Hinnant *__result = __t; 23103e519524SHoward Hinnant ++__result; 23113e519524SHoward Hinnant while (++__first != __last) 23123e519524SHoward Hinnant { 23133e519524SHoward Hinnant if (!__pred(__t, *__first)) 23143e519524SHoward Hinnant { 23153e519524SHoward Hinnant __t = *__first; 23163e519524SHoward Hinnant *__result = __t; 23173e519524SHoward Hinnant ++__result; 23183e519524SHoward Hinnant } 23193e519524SHoward Hinnant } 23203e519524SHoward Hinnant } 23213e519524SHoward Hinnant return __result; 23223e519524SHoward Hinnant} 23233e519524SHoward Hinnant 23243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 23253e519524SHoward Hinnant_OutputIterator 23263e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23273e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 23283e519524SHoward Hinnant{ 23293e519524SHoward Hinnant if (__first != __last) 23303e519524SHoward Hinnant { 23313e519524SHoward Hinnant _ForwardIterator __i = __first; 23323e519524SHoward Hinnant *__result = *__i; 23333e519524SHoward Hinnant ++__result; 23343e519524SHoward Hinnant while (++__first != __last) 23353e519524SHoward Hinnant { 23363e519524SHoward Hinnant if (!__pred(*__i, *__first)) 23373e519524SHoward Hinnant { 23383e519524SHoward Hinnant *__result = *__first; 23393e519524SHoward Hinnant ++__result; 23403e519524SHoward Hinnant __i = __first; 23413e519524SHoward Hinnant } 23423e519524SHoward Hinnant } 23433e519524SHoward Hinnant } 23443e519524SHoward Hinnant return __result; 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 23483e519524SHoward Hinnant_ForwardIterator 23493e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 23503e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 23513e519524SHoward Hinnant{ 23523e519524SHoward Hinnant if (__first != __last) 23533e519524SHoward Hinnant { 23543e519524SHoward Hinnant *__result = *__first; 23553e519524SHoward Hinnant while (++__first != __last) 23563e519524SHoward Hinnant if (!__pred(*__result, *__first)) 23573e519524SHoward Hinnant *++__result = *__first; 23583e519524SHoward Hinnant ++__result; 23593e519524SHoward Hinnant } 23603e519524SHoward Hinnant return __result; 23613e519524SHoward Hinnant} 23623e519524SHoward Hinnant 23633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23653e519524SHoward Hinnant_OutputIterator 23663e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23673e519524SHoward Hinnant{ 2368ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23693e519524SHoward Hinnant (__first, __last, __result, __pred, 23703e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23713e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23723e519524SHoward Hinnant} 23733e519524SHoward Hinnant 23743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23763e519524SHoward Hinnant_OutputIterator 23773e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23783e519524SHoward Hinnant{ 23793e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2380ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23813e519524SHoward Hinnant} 23823e519524SHoward Hinnant 23833e519524SHoward Hinnant// reverse 23843e519524SHoward Hinnant 23853e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23873e519524SHoward Hinnantvoid 23883e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23893e519524SHoward Hinnant{ 23903e519524SHoward Hinnant while (__first != __last) 23913e519524SHoward Hinnant { 23923e519524SHoward Hinnant if (__first == --__last) 23933e519524SHoward Hinnant break; 2394def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23953e519524SHoward Hinnant ++__first; 23963e519524SHoward Hinnant } 23973e519524SHoward Hinnant} 23983e519524SHoward Hinnant 23993e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 24003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24013e519524SHoward Hinnantvoid 24023e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 24033e519524SHoward Hinnant{ 24043e519524SHoward Hinnant if (__first != __last) 24053e519524SHoward Hinnant for (; __first < --__last; ++__first) 2406def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 24073e519524SHoward Hinnant} 24083e519524SHoward Hinnant 24093e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 24103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24113e519524SHoward Hinnantvoid 24123e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 24133e519524SHoward Hinnant{ 2414ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 24153e519524SHoward Hinnant} 24163e519524SHoward Hinnant 24173e519524SHoward Hinnant// reverse_copy 24183e519524SHoward Hinnant 24193e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 24203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24213e519524SHoward Hinnant_OutputIterator 24223e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 24233e519524SHoward Hinnant{ 24243e519524SHoward Hinnant for (; __first != __last; ++__result) 24253e519524SHoward Hinnant *__result = *--__last; 24263e519524SHoward Hinnant return __result; 24273e519524SHoward Hinnant} 24283e519524SHoward Hinnant 24293e519524SHoward Hinnant// rotate 24303e519524SHoward Hinnant 24313e519524SHoward Hinnanttemplate <class _ForwardIterator> 24323e519524SHoward Hinnant_ForwardIterator 2433aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 24343e519524SHoward Hinnant{ 2435aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2436aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2437aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2438aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2439aca09de3SHoward Hinnant return __lm1; 2440aca09de3SHoward Hinnant} 2441aca09de3SHoward Hinnant 2442aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2443aca09de3SHoward Hinnant_BidirectionalIterator 2444aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2445aca09de3SHoward Hinnant{ 2446aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2447aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2448aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2449aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2450aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2451aca09de3SHoward Hinnant return __fp1; 2452aca09de3SHoward Hinnant} 2453aca09de3SHoward Hinnant 2454aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2455aca09de3SHoward Hinnant_ForwardIterator 2456aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2457aca09de3SHoward Hinnant{ 24583e519524SHoward Hinnant _ForwardIterator __i = __middle; 24593e519524SHoward Hinnant while (true) 24603e519524SHoward Hinnant { 24613e519524SHoward Hinnant swap(*__first, *__i); 24623e519524SHoward Hinnant ++__first; 24633e519524SHoward Hinnant if (++__i == __last) 24643e519524SHoward Hinnant break; 24653e519524SHoward Hinnant if (__first == __middle) 24663e519524SHoward Hinnant __middle = __i; 24673e519524SHoward Hinnant } 24683e519524SHoward Hinnant _ForwardIterator __r = __first; 24693e519524SHoward Hinnant if (__first != __middle) 24703e519524SHoward Hinnant { 24713e519524SHoward Hinnant __i = __middle; 24723e519524SHoward Hinnant while (true) 24733e519524SHoward Hinnant { 24743e519524SHoward Hinnant swap(*__first, *__i); 24753e519524SHoward Hinnant ++__first; 24763e519524SHoward Hinnant if (++__i == __last) 24773e519524SHoward Hinnant { 24783e519524SHoward Hinnant if (__first == __middle) 24793e519524SHoward Hinnant break; 24803e519524SHoward Hinnant __i = __middle; 24813e519524SHoward Hinnant } 24823e519524SHoward Hinnant else if (__first == __middle) 24833e519524SHoward Hinnant __middle = __i; 24843e519524SHoward Hinnant } 24853e519524SHoward Hinnant } 24863e519524SHoward Hinnant return __r; 24873e519524SHoward Hinnant} 24883e519524SHoward Hinnant 24893e519524SHoward Hinnanttemplate<typename _Integral> 24903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24913e519524SHoward Hinnant_Integral 249219b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24933e519524SHoward Hinnant{ 24943e519524SHoward Hinnant do 24953e519524SHoward Hinnant { 24963e519524SHoward Hinnant _Integral __t = __x % __y; 24973e519524SHoward Hinnant __x = __y; 24983e519524SHoward Hinnant __y = __t; 24993e519524SHoward Hinnant } while (__y); 25003e519524SHoward Hinnant return __x; 25013e519524SHoward Hinnant} 25023e519524SHoward Hinnant 25033e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 25043e519524SHoward Hinnant_RandomAccessIterator 2505aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 25063e519524SHoward Hinnant{ 25073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 25083e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 25093e519524SHoward Hinnant 25103e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 25113e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 25123e519524SHoward Hinnant if (__m1 == __m2) 25133e519524SHoward Hinnant { 2514ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 25153e519524SHoward Hinnant return __middle; 25163e519524SHoward Hinnant } 251719b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 25183e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 25193e519524SHoward Hinnant { 2520aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 25213e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 25223e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 25233e519524SHoward Hinnant do 25243e519524SHoward Hinnant { 2525aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 25263e519524SHoward Hinnant __p1 = __p2; 25273e519524SHoward Hinnant const difference_type __d = __last - __p2; 25283e519524SHoward Hinnant if (__m1 < __d) 25293e519524SHoward Hinnant __p2 += __m1; 25303e519524SHoward Hinnant else 25313e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 25323e519524SHoward Hinnant } while (__p2 != __p); 2533aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 25343e519524SHoward Hinnant } 25353e519524SHoward Hinnant return __first + __m2; 25363e519524SHoward Hinnant} 25373e519524SHoward Hinnant 25383e519524SHoward Hinnanttemplate <class _ForwardIterator> 25393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25403e519524SHoward Hinnant_ForwardIterator 2541aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2542aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2543aca09de3SHoward Hinnant{ 2544aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2545aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2546aca09de3SHoward Hinnant { 2547aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2548aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2549aca09de3SHoward Hinnant } 2550aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2551aca09de3SHoward Hinnant} 2552aca09de3SHoward Hinnant 2553aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2554aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2555aca09de3SHoward Hinnant_BidirectionalIterator 2556aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2557aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2558aca09de3SHoward Hinnant{ 2559aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2560aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2561aca09de3SHoward Hinnant { 2562aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2563aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2564aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2565aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2566aca09de3SHoward Hinnant } 2567aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2568aca09de3SHoward Hinnant} 2569aca09de3SHoward Hinnant 2570aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2571aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2572aca09de3SHoward Hinnant_RandomAccessIterator 2573aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2574aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2575aca09de3SHoward Hinnant{ 2576aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2577aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2578aca09de3SHoward Hinnant { 2579aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2580aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2581aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2582aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2583aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2584aca09de3SHoward Hinnant } 2585aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2586aca09de3SHoward Hinnant} 2587aca09de3SHoward Hinnant 2588aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2589aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2590aca09de3SHoward Hinnant_ForwardIterator 25913e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25923e519524SHoward Hinnant{ 2593aca09de3SHoward Hinnant if (__first == __middle) 2594aca09de3SHoward Hinnant return __last; 2595aca09de3SHoward Hinnant if (__middle == __last) 2596aca09de3SHoward Hinnant return __first; 2597ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2598aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25993e519524SHoward Hinnant} 26003e519524SHoward Hinnant 26013e519524SHoward Hinnant// rotate_copy 26023e519524SHoward Hinnant 26033e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 26043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26053e519524SHoward Hinnant_OutputIterator 26063e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 26073e519524SHoward Hinnant{ 2608ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 26093e519524SHoward Hinnant} 26103e519524SHoward Hinnant 26113e519524SHoward Hinnant// min_element 26123e519524SHoward Hinnant 26133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26149d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26153e519524SHoward Hinnant_ForwardIterator 26160b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26173e519524SHoward Hinnant{ 26183e519524SHoward Hinnant if (__first != __last) 26193e519524SHoward Hinnant { 26203e519524SHoward Hinnant _ForwardIterator __i = __first; 26213e519524SHoward Hinnant while (++__i != __last) 26223e519524SHoward Hinnant if (__comp(*__i, *__first)) 26233e519524SHoward Hinnant __first = __i; 26243e519524SHoward Hinnant } 26253e519524SHoward Hinnant return __first; 26263e519524SHoward Hinnant} 26273e519524SHoward Hinnant 26283e519524SHoward Hinnanttemplate <class _ForwardIterator> 26290b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26303e519524SHoward Hinnant_ForwardIterator 26313e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 26323e519524SHoward Hinnant{ 26330b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 26344eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26354eb27b79SHoward Hinnant} 26364eb27b79SHoward Hinnant 26374eb27b79SHoward Hinnant// min 26384eb27b79SHoward Hinnant 26394eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26414eb27b79SHoward Hinnantconst _Tp& 26424eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 26434eb27b79SHoward Hinnant{ 26444eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 26454eb27b79SHoward Hinnant} 26464eb27b79SHoward Hinnant 26474eb27b79SHoward Hinnanttemplate <class _Tp> 26489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26494eb27b79SHoward Hinnantconst _Tp& 26504eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 26514eb27b79SHoward Hinnant{ 2652ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26534eb27b79SHoward Hinnant} 26544eb27b79SHoward Hinnant 2655ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265654976f26SHoward Hinnant 26574eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26589d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26594eb27b79SHoward Hinnant_Tp 26604eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26614eb27b79SHoward Hinnant{ 26620b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26634eb27b79SHoward Hinnant} 26644eb27b79SHoward Hinnant 26654eb27b79SHoward Hinnanttemplate<class _Tp> 26669d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26674eb27b79SHoward Hinnant_Tp 26684eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26694eb27b79SHoward Hinnant{ 26700b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26713e519524SHoward Hinnant} 26723e519524SHoward Hinnant 2673ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 267454976f26SHoward Hinnant 26753e519524SHoward Hinnant// max_element 26763e519524SHoward Hinnant 26773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26789d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26793e519524SHoward Hinnant_ForwardIterator 26800b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26813e519524SHoward Hinnant{ 26823e519524SHoward Hinnant if (__first != __last) 26833e519524SHoward Hinnant { 26843e519524SHoward Hinnant _ForwardIterator __i = __first; 26853e519524SHoward Hinnant while (++__i != __last) 26863e519524SHoward Hinnant if (__comp(*__first, *__i)) 26873e519524SHoward Hinnant __first = __i; 26883e519524SHoward Hinnant } 26893e519524SHoward Hinnant return __first; 26903e519524SHoward Hinnant} 26913e519524SHoward Hinnant 26929d67c6d5SMarshall Clow 26933e519524SHoward Hinnanttemplate <class _ForwardIterator> 26940b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26953e519524SHoward Hinnant_ForwardIterator 26963e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26973e519524SHoward Hinnant{ 26980b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26994eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27004eb27b79SHoward Hinnant} 27014eb27b79SHoward Hinnant 27024eb27b79SHoward Hinnant// max 27034eb27b79SHoward Hinnant 27044eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 27059d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27064eb27b79SHoward Hinnantconst _Tp& 27074eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27084eb27b79SHoward Hinnant{ 27094eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 27104eb27b79SHoward Hinnant} 27114eb27b79SHoward Hinnant 27124eb27b79SHoward Hinnanttemplate <class _Tp> 27139d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27144eb27b79SHoward Hinnantconst _Tp& 27154eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 27164eb27b79SHoward Hinnant{ 2717ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 27184eb27b79SHoward Hinnant} 27194eb27b79SHoward Hinnant 2720ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 272154976f26SHoward Hinnant 27224eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27239d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27244eb27b79SHoward Hinnant_Tp 27254eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 27264eb27b79SHoward Hinnant{ 27270b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 27284eb27b79SHoward Hinnant} 27294eb27b79SHoward Hinnant 27304eb27b79SHoward Hinnanttemplate<class _Tp> 27319d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27324eb27b79SHoward Hinnant_Tp 27334eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 27344eb27b79SHoward Hinnant{ 27350b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 27363e519524SHoward Hinnant} 27373e519524SHoward Hinnant 2738ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 273954976f26SHoward Hinnant 2740146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2741146c14acSMarshall Clow// clamp 2742146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2743146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2744146c14acSMarshall Clowconst _Tp& 2745146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2746146c14acSMarshall Clow{ 2747146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2748146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2749146c14acSMarshall Clow 2750146c14acSMarshall Clow} 2751146c14acSMarshall Clow 2752146c14acSMarshall Clowtemplate<class _Tp> 2753146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2754146c14acSMarshall Clowconst _Tp& 2755146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2756146c14acSMarshall Clow{ 2757146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2758146c14acSMarshall Clow} 2759146c14acSMarshall Clow#endif 2760146c14acSMarshall Clow 27613e519524SHoward Hinnant// minmax_element 27623e519524SHoward Hinnant 27633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27640b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27653e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27663e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27673e519524SHoward Hinnant{ 27683e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27693e519524SHoward Hinnant if (__first != __last) 27703e519524SHoward Hinnant { 27713e519524SHoward Hinnant if (++__first != __last) 27723e519524SHoward Hinnant { 27733e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27743e519524SHoward Hinnant __result.first = __first; 27753e519524SHoward Hinnant else 27763e519524SHoward Hinnant __result.second = __first; 27773e519524SHoward Hinnant while (++__first != __last) 27783e519524SHoward Hinnant { 27793e519524SHoward Hinnant _ForwardIterator __i = __first; 27803e519524SHoward Hinnant if (++__first == __last) 27813e519524SHoward Hinnant { 27823e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27833e519524SHoward Hinnant __result.first = __i; 27843e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27853e519524SHoward Hinnant __result.second = __i; 27863e519524SHoward Hinnant break; 27873e519524SHoward Hinnant } 27883e519524SHoward Hinnant else 27893e519524SHoward Hinnant { 27903e519524SHoward Hinnant if (__comp(*__first, *__i)) 27913e519524SHoward Hinnant { 27923e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27933e519524SHoward Hinnant __result.first = __first; 27943e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27953e519524SHoward Hinnant __result.second = __i; 27963e519524SHoward Hinnant } 27973e519524SHoward Hinnant else 27983e519524SHoward Hinnant { 27993e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 28003e519524SHoward Hinnant __result.first = __i; 28013e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 28023e519524SHoward Hinnant __result.second = __first; 28033e519524SHoward Hinnant } 28043e519524SHoward Hinnant } 28053e519524SHoward Hinnant } 28063e519524SHoward Hinnant } 28073e519524SHoward Hinnant } 28083e519524SHoward Hinnant return __result; 28093e519524SHoward Hinnant} 28103e519524SHoward Hinnant 28113e519524SHoward Hinnanttemplate <class _ForwardIterator> 28120b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28133e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 28143e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 28153e519524SHoward Hinnant{ 28169d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 28179d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 28183e519524SHoward Hinnant} 28193e519524SHoward Hinnant 28204eb27b79SHoward Hinnant// minmax 28214eb27b79SHoward Hinnant 28224eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28239d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28244eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28254eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 28264eb27b79SHoward Hinnant{ 28274eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 28284eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 28294eb27b79SHoward Hinnant} 28304eb27b79SHoward Hinnant 28314eb27b79SHoward Hinnanttemplate<class _Tp> 28329d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28334eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28344eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 28354eb27b79SHoward Hinnant{ 2836ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 28374eb27b79SHoward Hinnant} 28384eb27b79SHoward Hinnant 2839ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 284054976f26SHoward Hinnant 28414eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28429d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28434eb27b79SHoward Hinnantpair<_Tp, _Tp> 28444eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28454eb27b79SHoward Hinnant{ 28469d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28479d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28489d67c6d5SMarshall Clow _Iter __last = __t.end(); 28499d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 28509d67c6d5SMarshall Clow 28519d67c6d5SMarshall Clow ++__first; 28529d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28539d67c6d5SMarshall Clow { 28549d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28559d67c6d5SMarshall Clow __result.first = *__first; 28569d67c6d5SMarshall Clow else 28579d67c6d5SMarshall Clow __result.second = *__first; 28589d67c6d5SMarshall Clow ++__first; 28599d67c6d5SMarshall Clow } 28609d67c6d5SMarshall Clow 28619d67c6d5SMarshall Clow while (__first != __last) 28629d67c6d5SMarshall Clow { 28639d67c6d5SMarshall Clow _Tp __prev = *__first++; 2864002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2865002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2866002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28679d67c6d5SMarshall Clow } 28689d67c6d5SMarshall Clow else { 2869002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2870002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28719d67c6d5SMarshall Clow } 28729d67c6d5SMarshall Clow 28739d67c6d5SMarshall Clow __first++; 28749d67c6d5SMarshall Clow } 28759d67c6d5SMarshall Clow return __result; 28769d67c6d5SMarshall Clow} 28779d67c6d5SMarshall Clow 28789d67c6d5SMarshall Clowtemplate<class _Tp> 28799d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28809d67c6d5SMarshall Clowpair<_Tp, _Tp> 28819d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28829d67c6d5SMarshall Clow{ 28839d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28844eb27b79SHoward Hinnant} 28854eb27b79SHoward Hinnant 2886ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 288754976f26SHoward Hinnant 28883e519524SHoward Hinnant// random_shuffle 28893e519524SHoward Hinnant 2890f9d540b0SHoward Hinnant// __independent_bits_engine 2891f9d540b0SHoward Hinnant 2892c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2893f9d540b0SHoward Hinnantstruct __log2_imp 28943e519524SHoward Hinnant{ 2895c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2896c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28973e519524SHoward Hinnant}; 28983e519524SHoward Hinnant 2899c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2900c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 29013e519524SHoward Hinnant{ 2902f9d540b0SHoward Hinnant static const size_t value = 0; 29033e519524SHoward Hinnant}; 29043e519524SHoward Hinnant 2905c003db1fSHoward Hinnanttemplate <size_t _Rp> 2906c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 29073e519524SHoward Hinnant{ 2908c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 29093e519524SHoward Hinnant}; 29103e519524SHoward Hinnant 2911*89918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2912f9d540b0SHoward Hinnantstruct __log2 29133e519524SHoward Hinnant{ 2914c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2915*89918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 29163e519524SHoward Hinnant}; 29173e519524SHoward Hinnant 2918f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2919f9d540b0SHoward Hinnantclass __independent_bits_engine 29203e519524SHoward Hinnant{ 2921f9d540b0SHoward Hinnantpublic: 2922f9d540b0SHoward Hinnant // types 2923f9d540b0SHoward Hinnant typedef _UIntType result_type; 2924f9d540b0SHoward Hinnant 2925f9d540b0SHoward Hinnantprivate: 2926f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2927f9d540b0SHoward Hinnant typedef typename conditional 2928f9d540b0SHoward Hinnant < 2929f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2930f9d540b0SHoward Hinnant result_type, 2931f9d540b0SHoward Hinnant _Engine_result_type 2932f9d540b0SHoward Hinnant >::type _Working_result_type; 2933f9d540b0SHoward Hinnant 2934f9d540b0SHoward Hinnant _Engine& __e_; 2935f9d540b0SHoward Hinnant size_t __w_; 2936f9d540b0SHoward Hinnant size_t __w0_; 2937f9d540b0SHoward Hinnant size_t __n_; 2938f9d540b0SHoward Hinnant size_t __n0_; 2939f9d540b0SHoward Hinnant _Working_result_type __y0_; 2940f9d540b0SHoward Hinnant _Working_result_type __y1_; 2941f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2942f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2943f9d540b0SHoward Hinnant 2944ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2945c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2946f9d540b0SHoward Hinnant + _Working_result_type(1); 2947e386b7b3SHoward Hinnant#else 2948e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2949e386b7b3SHoward Hinnant + _Working_result_type(1); 2950e386b7b3SHoward Hinnant#endif 2951e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2952e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2953e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2954f9d540b0SHoward Hinnant 2955f9d540b0SHoward Hinnantpublic: 2956f9d540b0SHoward Hinnant // constructors and seeding functions 2957f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2958f9d540b0SHoward Hinnant 2959f9d540b0SHoward Hinnant // generating functions 2960c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2961f9d540b0SHoward Hinnant 2962f9d540b0SHoward Hinnantprivate: 2963f9d540b0SHoward Hinnant result_type __eval(false_type); 2964f9d540b0SHoward Hinnant result_type __eval(true_type); 2965f9d540b0SHoward Hinnant}; 2966f9d540b0SHoward Hinnant 2967f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2968f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2969f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2970f9d540b0SHoward Hinnant : __e_(__e), 2971f9d540b0SHoward Hinnant __w_(__w) 2972f9d540b0SHoward Hinnant{ 2973f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2974f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2975c003db1fSHoward Hinnant if (_Rp == 0) 2976c003db1fSHoward Hinnant __y0_ = _Rp; 2977f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2978c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2979f9d540b0SHoward Hinnant else 2980f9d540b0SHoward Hinnant __y0_ = 0; 2981c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2982f9d540b0SHoward Hinnant { 2983f9d540b0SHoward Hinnant ++__n_; 2984f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2985f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2986c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2987f9d540b0SHoward Hinnant else 2988f9d540b0SHoward Hinnant __y0_ = 0; 2989f9d540b0SHoward Hinnant } 2990f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2991f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2992c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2993f9d540b0SHoward Hinnant else 2994f9d540b0SHoward Hinnant __y1_ = 0; 2995f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2996f9d540b0SHoward Hinnant _Engine_result_type(0); 2997f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2998f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2999f9d540b0SHoward Hinnant _Engine_result_type(~0); 30003e519524SHoward Hinnant} 30013e519524SHoward Hinnant 3002f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3003f9d540b0SHoward Hinnantinline 3004f9d540b0SHoward Hinnant_UIntType 3005f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 30063e519524SHoward Hinnant{ 3007f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 30083e519524SHoward Hinnant} 30093e519524SHoward Hinnant 3010f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3011f9d540b0SHoward Hinnant_UIntType 3012f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 30133e519524SHoward Hinnant{ 3014c003db1fSHoward Hinnant result_type _Sp = 0; 3015f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 3016f9d540b0SHoward Hinnant { 3017f9d540b0SHoward Hinnant _Engine_result_type __u; 30183e519524SHoward Hinnant do 3019f9d540b0SHoward Hinnant { 3020f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3021f9d540b0SHoward Hinnant } while (__u >= __y0_); 30220176bc6cSHoward Hinnant if (__w0_ < _WDt) 3023c003db1fSHoward Hinnant _Sp <<= __w0_; 3024f9d540b0SHoward Hinnant else 3025c003db1fSHoward Hinnant _Sp = 0; 3026c003db1fSHoward Hinnant _Sp += __u & __mask0_; 3027f9d540b0SHoward Hinnant } 3028f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 3029f9d540b0SHoward Hinnant { 3030f9d540b0SHoward Hinnant _Engine_result_type __u; 3031f9d540b0SHoward Hinnant do 3032f9d540b0SHoward Hinnant { 3033f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3034f9d540b0SHoward Hinnant } while (__u >= __y1_); 30350176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 3036c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3037f9d540b0SHoward Hinnant else 3038c003db1fSHoward Hinnant _Sp = 0; 3039c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3040f9d540b0SHoward Hinnant } 3041c003db1fSHoward Hinnant return _Sp; 30423e519524SHoward Hinnant} 30433e519524SHoward Hinnant 3044f9d540b0SHoward Hinnant// uniform_int_distribution 30453e519524SHoward Hinnant 3046f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3047f9d540b0SHoward Hinnantclass uniform_int_distribution 30483e519524SHoward Hinnant{ 3049f9d540b0SHoward Hinnantpublic: 3050f9d540b0SHoward Hinnant // types 3051f9d540b0SHoward Hinnant typedef _IntType result_type; 3052f9d540b0SHoward Hinnant 3053f9d540b0SHoward Hinnant class param_type 3054f9d540b0SHoward Hinnant { 3055f9d540b0SHoward Hinnant result_type __a_; 3056f9d540b0SHoward Hinnant result_type __b_; 3057f9d540b0SHoward Hinnant public: 3058f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3059f9d540b0SHoward Hinnant 3060f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3061f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3062f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3063f9d540b0SHoward Hinnant 3064f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3065f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3066f9d540b0SHoward Hinnant 3067f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3068f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3069f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3070f9d540b0SHoward Hinnant {return !(__x == __y);} 30713e519524SHoward Hinnant }; 30723e519524SHoward Hinnant 3073f9d540b0SHoward Hinnantprivate: 3074f9d540b0SHoward Hinnant param_type __p_; 30753e519524SHoward Hinnant 3076f9d540b0SHoward Hinnantpublic: 3077f9d540b0SHoward Hinnant // constructors and reset functions 3078f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3079f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3080f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3081f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3082f9d540b0SHoward Hinnant void reset() {} 3083f9d540b0SHoward Hinnant 3084f9d540b0SHoward Hinnant // generating functions 3085f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3086f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3087f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3088f9d540b0SHoward Hinnant 3089f9d540b0SHoward Hinnant // property functions 3090f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3091f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3092f9d540b0SHoward Hinnant 3093f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3094f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3095f9d540b0SHoward Hinnant 3096f9d540b0SHoward Hinnant result_type min() const {return a();} 3097f9d540b0SHoward Hinnant result_type max() const {return b();} 3098f9d540b0SHoward Hinnant 3099f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3100f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3101f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3102f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3103f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3104f9d540b0SHoward Hinnant {return !(__x == __y);} 31053e519524SHoward Hinnant}; 31063e519524SHoward Hinnant 3107f9d540b0SHoward Hinnanttemplate<class _IntType> 3108f9d540b0SHoward Hinnanttemplate<class _URNG> 3109f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3110f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 31113e519524SHoward Hinnant{ 3112f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3113f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3114c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3115c003db1fSHoward Hinnant if (_Rp == 1) 3116f9d540b0SHoward Hinnant return __p.a(); 3117f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3118f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3119c003db1fSHoward Hinnant if (_Rp == 0) 3120f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3121c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3122a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3123f9d540b0SHoward Hinnant ++__w; 3124f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3125f9d540b0SHoward Hinnant _UIntType __u; 3126f9d540b0SHoward Hinnant do 31273e519524SHoward Hinnant { 3128f9d540b0SHoward Hinnant __u = __e(); 3129c003db1fSHoward Hinnant } while (__u >= _Rp); 3130f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31313e519524SHoward Hinnant} 3132f9d540b0SHoward Hinnant 313366f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 313466f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3135f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3136f9d540b0SHoward Hinnant 3137f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3138f9d540b0SHoward Hinnant 3139f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31403e519524SHoward Hinnant{ 3141f9d540b0SHoward Hinnant static unsigned __c_; 3142f9d540b0SHoward Hinnant 3143f9d540b0SHoward Hinnant __rs_default(); 3144f9d540b0SHoward Hinnantpublic: 3145b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3146f9d540b0SHoward Hinnant 3147f9d540b0SHoward Hinnant static const result_type _Min = 0; 3148f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3149f9d540b0SHoward Hinnant 3150f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3151f9d540b0SHoward Hinnant ~__rs_default(); 3152f9d540b0SHoward Hinnant 3153f9d540b0SHoward Hinnant result_type operator()(); 3154f9d540b0SHoward Hinnant 3155788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3156788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3157f9d540b0SHoward Hinnant 3158f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3159f9d540b0SHoward Hinnant}; 3160f9d540b0SHoward Hinnant 3161f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31623e519524SHoward Hinnant 31633e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31643e519524SHoward Hinnantvoid 31653e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31663e519524SHoward Hinnant{ 31673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3168c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3169c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31703e519524SHoward Hinnant difference_type __d = __last - __first; 31713e519524SHoward Hinnant if (__d > 1) 31723e519524SHoward Hinnant { 3173c003db1fSHoward Hinnant _Dp __uid; 3174f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3175f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3176007b26beSHoward Hinnant { 3177c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3178007b26beSHoward Hinnant if (__i != difference_type(0)) 3179007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3180007b26beSHoward Hinnant } 31813e519524SHoward Hinnant } 31823e519524SHoward Hinnant} 31833e519524SHoward Hinnant 31843e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31853e519524SHoward Hinnantvoid 31863e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3187ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31883e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31893e519524SHoward Hinnant#else 31903e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31913e519524SHoward Hinnant#endif 31923e519524SHoward Hinnant{ 31933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31943e519524SHoward Hinnant difference_type __d = __last - __first; 31953e519524SHoward Hinnant if (__d > 1) 31963e519524SHoward Hinnant { 31973e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3198007b26beSHoward Hinnant { 3199007b26beSHoward Hinnant difference_type __i = __rand(__d); 3200007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3201007b26beSHoward Hinnant } 32023e519524SHoward Hinnant } 32033e519524SHoward Hinnant} 32040f37a410SMarshall Clow#endif 32053e519524SHoward Hinnant 3206e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3207e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3208e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3209e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32105741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3211e7154709SEric Fiselier _Distance __n, 3212e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3213e7154709SEric Fiselier input_iterator_tag) { 3214e7154709SEric Fiselier 3215e7154709SEric Fiselier _Distance __k = 0; 3216e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 32175741d86dSEric Fiselier __output[__k] = *__first; 3218e7154709SEric Fiselier _Distance __sz = __k; 3219e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3220e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3221e7154709SEric Fiselier if (__r < __sz) 32225741d86dSEric Fiselier __output[__r] = *__first; 3223e7154709SEric Fiselier } 32245741d86dSEric Fiselier return __output + _VSTD::min(__n, __k); 3225e7154709SEric Fiselier} 3226e7154709SEric Fiselier 3227e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3228e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3229e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3230e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32315741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3232e7154709SEric Fiselier _Distance __n, 3233e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3234e7154709SEric Fiselier forward_iterator_tag) { 3235e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3236e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3237e7154709SEric Fiselier _Distance __r = 3238e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3239e7154709SEric Fiselier if (__r < __n) { 32405741d86dSEric Fiselier *__output++ = *__first; 3241e7154709SEric Fiselier --__n; 3242e7154709SEric Fiselier } 3243e7154709SEric Fiselier } 32445741d86dSEric Fiselier return __output; 3245e7154709SEric Fiselier} 3246e7154709SEric Fiselier 3247e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3248e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3249e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3250e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32515741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3252e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3253e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3254e7154709SEric Fiselier _PopCategory; 3255e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3256e7154709SEric Fiselier _Difference; 3257e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3258e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3259e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3260e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3261e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3262e7154709SEric Fiselier return _VSTD::__sample( 32635741d86dSEric Fiselier __first, __last, __output, _CommonType(__n), 3264e7154709SEric Fiselier __g, _PopCategory()); 3265e7154709SEric Fiselier} 3266e7154709SEric Fiselier 3267e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3268e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3269e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3270e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3271e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 32725741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3273e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 32745741d86dSEric Fiselier return _VSTD::__sample(__first, __last, __output, __n, __g); 3275e7154709SEric Fiselier} 3276e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3277e7154709SEric Fiselier 3278f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3279f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3280ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3281fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3282fb340102SHoward Hinnant#else 3283f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3284fb340102SHoward Hinnant#endif 3285f9d540b0SHoward Hinnant{ 3286f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3287c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3288c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3289f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3290f9d540b0SHoward Hinnant if (__d > 1) 3291f9d540b0SHoward Hinnant { 3292c003db1fSHoward Hinnant _Dp __uid; 3293f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3294007b26beSHoward Hinnant { 3295c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3296007b26beSHoward Hinnant if (__i != difference_type(0)) 3297007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3298007b26beSHoward Hinnant } 3299f9d540b0SHoward Hinnant } 3300f9d540b0SHoward Hinnant} 3301f9d540b0SHoward Hinnant 33023e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 33033e519524SHoward Hinnantbool 33043e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 33053e519524SHoward Hinnant{ 33063e519524SHoward Hinnant for (; __first != __last; ++__first) 33073e519524SHoward Hinnant if (!__pred(*__first)) 33083e519524SHoward Hinnant break; 3309b9595b79SMarshall Clow if ( __first == __last ) 3310b9595b79SMarshall Clow return true; 3311b9595b79SMarshall Clow ++__first; 33123e519524SHoward Hinnant for (; __first != __last; ++__first) 33133e519524SHoward Hinnant if (__pred(*__first)) 33143e519524SHoward Hinnant return false; 33153e519524SHoward Hinnant return true; 33163e519524SHoward Hinnant} 33173e519524SHoward Hinnant 33183e519524SHoward Hinnant// partition 33193e519524SHoward Hinnant 33203e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33213e519524SHoward Hinnant_ForwardIterator 33223e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 33233e519524SHoward Hinnant{ 33243e519524SHoward Hinnant while (true) 33253e519524SHoward Hinnant { 33263e519524SHoward Hinnant if (__first == __last) 33273e519524SHoward Hinnant return __first; 33283e519524SHoward Hinnant if (!__pred(*__first)) 33293e519524SHoward Hinnant break; 33303e519524SHoward Hinnant ++__first; 33313e519524SHoward Hinnant } 33323e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 33333e519524SHoward Hinnant { 33343e519524SHoward Hinnant if (__pred(*__p)) 33353e519524SHoward Hinnant { 33363e519524SHoward Hinnant swap(*__first, *__p); 33373e519524SHoward Hinnant ++__first; 33383e519524SHoward Hinnant } 33393e519524SHoward Hinnant } 33403e519524SHoward Hinnant return __first; 33413e519524SHoward Hinnant} 33423e519524SHoward Hinnant 33433e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 33443e519524SHoward Hinnant_BidirectionalIterator 33453e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33463e519524SHoward Hinnant bidirectional_iterator_tag) 33473e519524SHoward Hinnant{ 33483e519524SHoward Hinnant while (true) 33493e519524SHoward Hinnant { 33503e519524SHoward Hinnant while (true) 33513e519524SHoward Hinnant { 33523e519524SHoward Hinnant if (__first == __last) 33533e519524SHoward Hinnant return __first; 33543e519524SHoward Hinnant if (!__pred(*__first)) 33553e519524SHoward Hinnant break; 33563e519524SHoward Hinnant ++__first; 33573e519524SHoward Hinnant } 33583e519524SHoward Hinnant do 33593e519524SHoward Hinnant { 33603e519524SHoward Hinnant if (__first == --__last) 33613e519524SHoward Hinnant return __first; 33623e519524SHoward Hinnant } while (!__pred(*__last)); 33633e519524SHoward Hinnant swap(*__first, *__last); 33643e519524SHoward Hinnant ++__first; 33653e519524SHoward Hinnant } 33663e519524SHoward Hinnant} 33673e519524SHoward Hinnant 33683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33703e519524SHoward Hinnant_ForwardIterator 33713e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33723e519524SHoward Hinnant{ 3373ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33743e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33753e519524SHoward Hinnant} 33763e519524SHoward Hinnant 33773e519524SHoward Hinnant// partition_copy 33783e519524SHoward Hinnant 33793e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33803e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33813e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33823e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33833e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33843e519524SHoward Hinnant _Predicate __pred) 33853e519524SHoward Hinnant{ 33863e519524SHoward Hinnant for (; __first != __last; ++__first) 33873e519524SHoward Hinnant { 33883e519524SHoward Hinnant if (__pred(*__first)) 33893e519524SHoward Hinnant { 33903e519524SHoward Hinnant *__out_true = *__first; 33913e519524SHoward Hinnant ++__out_true; 33923e519524SHoward Hinnant } 33933e519524SHoward Hinnant else 33943e519524SHoward Hinnant { 33953e519524SHoward Hinnant *__out_false = *__first; 33963e519524SHoward Hinnant ++__out_false; 33973e519524SHoward Hinnant } 33983e519524SHoward Hinnant } 33993e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 34003e519524SHoward Hinnant} 34013e519524SHoward Hinnant 34023e519524SHoward Hinnant// partition_point 34033e519524SHoward Hinnant 34043e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 34053e519524SHoward Hinnant_ForwardIterator 34063e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34073e519524SHoward Hinnant{ 34083e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3409ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34103e519524SHoward Hinnant while (__len != 0) 34113e519524SHoward Hinnant { 34123e519524SHoward Hinnant difference_type __l2 = __len / 2; 34133e519524SHoward Hinnant _ForwardIterator __m = __first; 3414ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 34153e519524SHoward Hinnant if (__pred(*__m)) 34163e519524SHoward Hinnant { 34173e519524SHoward Hinnant __first = ++__m; 34183e519524SHoward Hinnant __len -= __l2 + 1; 34193e519524SHoward Hinnant } 34203e519524SHoward Hinnant else 34213e519524SHoward Hinnant __len = __l2; 34223e519524SHoward Hinnant } 34233e519524SHoward Hinnant return __first; 34243e519524SHoward Hinnant} 34253e519524SHoward Hinnant 34263e519524SHoward Hinnant// stable_partition 34273e519524SHoward Hinnant 34283e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 34293e519524SHoward Hinnant_ForwardIterator 34303e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34313e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 34323e519524SHoward Hinnant{ 34333e519524SHoward Hinnant // *__first is known to be false 34343e519524SHoward Hinnant // __len >= 1 34353e519524SHoward Hinnant if (__len == 1) 34363e519524SHoward Hinnant return __first; 34373e519524SHoward Hinnant if (__len == 2) 34383e519524SHoward Hinnant { 34393e519524SHoward Hinnant _ForwardIterator __m = __first; 34403e519524SHoward Hinnant if (__pred(*++__m)) 34413e519524SHoward Hinnant { 34423e519524SHoward Hinnant swap(*__first, *__m); 34433e519524SHoward Hinnant return __m; 34443e519524SHoward Hinnant } 34453e519524SHoward Hinnant return __first; 34463e519524SHoward Hinnant } 34473e519524SHoward Hinnant if (__len <= __p.second) 34483e519524SHoward Hinnant { // The buffer is big enough to use 34493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 34503e519524SHoward Hinnant __destruct_n __d(0); 34513e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34523e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34533e519524SHoward Hinnant // Update __first to always point to the end of the trues 34543e519524SHoward Hinnant value_type* __t = __p.first; 3455ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34563e519524SHoward Hinnant __d.__incr((value_type*)0); 34573e519524SHoward Hinnant ++__t; 34583e519524SHoward Hinnant _ForwardIterator __i = __first; 34593e519524SHoward Hinnant while (++__i != __last) 34603e519524SHoward Hinnant { 34613e519524SHoward Hinnant if (__pred(*__i)) 34623e519524SHoward Hinnant { 3463ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34643e519524SHoward Hinnant ++__first; 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant else 34673e519524SHoward Hinnant { 3468ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34693e519524SHoward Hinnant __d.__incr((value_type*)0); 34703e519524SHoward Hinnant ++__t; 34713e519524SHoward Hinnant } 34723e519524SHoward Hinnant } 34733e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34743e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34753e519524SHoward Hinnant __i = __first; 34763e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3477ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34783e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34793e519524SHoward Hinnant return __first; 34803e519524SHoward Hinnant } 34813e519524SHoward Hinnant // Else not enough buffer, do in place 34823e519524SHoward Hinnant // __len >= 3 34833e519524SHoward Hinnant _ForwardIterator __m = __first; 34843e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3485ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34863e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34873e519524SHoward Hinnant // F????????????????? 34883e519524SHoward Hinnant // f m l 34893e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34903e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34913e519524SHoward Hinnant // TTTFFFFF?????????? 34923e519524SHoward Hinnant // f ff m l 34933e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34943e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34953e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34963e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34973e519524SHoward Hinnant while (__pred(*__m1)) 34983e519524SHoward Hinnant { 34993e519524SHoward Hinnant if (++__m1 == __last) 35003e519524SHoward Hinnant goto __second_half_done; 35013e519524SHoward Hinnant --__len_half; 35023e519524SHoward Hinnant } 35033e519524SHoward Hinnant // TTTFFFFFTTTF?????? 35043e519524SHoward Hinnant // f ff m m1 l 35053e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 35063e519524SHoward Hinnant__second_half_done: 35073e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35083e519524SHoward Hinnant // f ff m sf l 3509ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35103e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35113e519524SHoward Hinnant // | 35123e519524SHoward Hinnant} 35133e519524SHoward Hinnant 35143e519524SHoward Hinnantstruct __return_temporary_buffer 35153e519524SHoward Hinnant{ 35163e519524SHoward Hinnant template <class _Tp> 3517ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 35183e519524SHoward Hinnant}; 35193e519524SHoward Hinnant 35203e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 35213e519524SHoward Hinnant_ForwardIterator 35223e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35233e519524SHoward Hinnant forward_iterator_tag) 35243e519524SHoward Hinnant{ 35253e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 35263e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35273e519524SHoward Hinnant while (true) 35283e519524SHoward Hinnant { 35293e519524SHoward Hinnant if (__first == __last) 35303e519524SHoward Hinnant return __first; 35313e519524SHoward Hinnant if (!__pred(*__first)) 35323e519524SHoward Hinnant break; 35333e519524SHoward Hinnant ++__first; 35343e519524SHoward Hinnant } 35353e519524SHoward Hinnant // We now have a reduced range [__first, __last) 35363e519524SHoward Hinnant // *__first is known to be false 35373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 35383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3539ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 35403e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35413e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35423e519524SHoward Hinnant if (__len >= __alloc_limit) 35433e519524SHoward Hinnant { 3544ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35453e519524SHoward Hinnant __h.reset(__p.first); 35463e519524SHoward Hinnant } 35473e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35483e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 35493e519524SHoward Hinnant} 35503e519524SHoward Hinnant 35513e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 35523e519524SHoward Hinnant_BidirectionalIterator 35533e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35543e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 35553e519524SHoward Hinnant{ 35563e519524SHoward Hinnant // *__first is known to be false 35573e519524SHoward Hinnant // *__last is known to be true 35583e519524SHoward Hinnant // __len >= 2 35593e519524SHoward Hinnant if (__len == 2) 35603e519524SHoward Hinnant { 35613e519524SHoward Hinnant swap(*__first, *__last); 35623e519524SHoward Hinnant return __last; 35633e519524SHoward Hinnant } 35643e519524SHoward Hinnant if (__len == 3) 35653e519524SHoward Hinnant { 35663e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35673e519524SHoward Hinnant if (__pred(*++__m)) 35683e519524SHoward Hinnant { 35693e519524SHoward Hinnant swap(*__first, *__m); 35703e519524SHoward Hinnant swap(*__m, *__last); 35713e519524SHoward Hinnant return __last; 35723e519524SHoward Hinnant } 35733e519524SHoward Hinnant swap(*__m, *__last); 35743e519524SHoward Hinnant swap(*__first, *__m); 35753e519524SHoward Hinnant return __m; 35763e519524SHoward Hinnant } 35773e519524SHoward Hinnant if (__len <= __p.second) 35783e519524SHoward Hinnant { // The buffer is big enough to use 35793e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35803e519524SHoward Hinnant __destruct_n __d(0); 35813e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35823e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35833e519524SHoward Hinnant // Update __first to always point to the end of the trues 35843e519524SHoward Hinnant value_type* __t = __p.first; 3585ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35863e519524SHoward Hinnant __d.__incr((value_type*)0); 35873e519524SHoward Hinnant ++__t; 35883e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35893e519524SHoward Hinnant while (++__i != __last) 35903e519524SHoward Hinnant { 35913e519524SHoward Hinnant if (__pred(*__i)) 35923e519524SHoward Hinnant { 3593ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35943e519524SHoward Hinnant ++__first; 35953e519524SHoward Hinnant } 35963e519524SHoward Hinnant else 35973e519524SHoward Hinnant { 3598ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35993e519524SHoward Hinnant __d.__incr((value_type*)0); 36003e519524SHoward Hinnant ++__t; 36013e519524SHoward Hinnant } 36023e519524SHoward Hinnant } 36033e519524SHoward Hinnant // move *__last, known to be true 3604ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36053e519524SHoward Hinnant __i = ++__first; 36063e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 36073e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 36083e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3609ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 36103e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 36113e519524SHoward Hinnant return __first; 36123e519524SHoward Hinnant } 36133e519524SHoward Hinnant // Else not enough buffer, do in place 36143e519524SHoward Hinnant // __len >= 4 36153e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36163e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3617ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 36183e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 36193e519524SHoward Hinnant // F????????????????T 36203e519524SHoward Hinnant // f m l 36213e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 36223e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 36233e519524SHoward Hinnant _Distance __len_half = __len2; 36243e519524SHoward Hinnant while (!__pred(*--__m1)) 36253e519524SHoward Hinnant { 36263e519524SHoward Hinnant if (__m1 == __first) 36273e519524SHoward Hinnant goto __first_half_done; 36283e519524SHoward Hinnant --__len_half; 36293e519524SHoward Hinnant } 36303e519524SHoward Hinnant // F???TFFF?????????T 36313e519524SHoward Hinnant // f m1 m l 36323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 36333e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 36343e519524SHoward Hinnant__first_half_done: 36353e519524SHoward Hinnant // TTTFFFFF?????????T 36363e519524SHoward Hinnant // f ff m l 36373e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 36383e519524SHoward Hinnant __m1 = __m; 36393e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 36403e519524SHoward Hinnant ++__second_false; 36413e519524SHoward Hinnant __len_half = __len - __len2; 36423e519524SHoward Hinnant while (__pred(*__m1)) 36433e519524SHoward Hinnant { 36443e519524SHoward Hinnant if (++__m1 == __last) 36453e519524SHoward Hinnant goto __second_half_done; 36463e519524SHoward Hinnant --__len_half; 36473e519524SHoward Hinnant } 36483e519524SHoward Hinnant // TTTFFFFFTTTF?????T 36493e519524SHoward Hinnant // f ff m m1 l 36503e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 36513e519524SHoward Hinnant__second_half_done: 36523e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 36533e519524SHoward Hinnant // f ff m sf l 3654ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 36553e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 36563e519524SHoward Hinnant // | 36573e519524SHoward Hinnant} 36583e519524SHoward Hinnant 36593e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 36603e519524SHoward Hinnant_BidirectionalIterator 36613e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36623e519524SHoward Hinnant bidirectional_iterator_tag) 36633e519524SHoward Hinnant{ 36643e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36653e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36663e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 36673e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36683e519524SHoward Hinnant while (true) 36693e519524SHoward Hinnant { 36703e519524SHoward Hinnant if (__first == __last) 36713e519524SHoward Hinnant return __first; 36723e519524SHoward Hinnant if (!__pred(*__first)) 36733e519524SHoward Hinnant break; 36743e519524SHoward Hinnant ++__first; 36753e519524SHoward Hinnant } 36763e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36773e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36783e519524SHoward Hinnant do 36793e519524SHoward Hinnant { 36803e519524SHoward Hinnant if (__first == --__last) 36813e519524SHoward Hinnant return __first; 36823e519524SHoward Hinnant } while (!__pred(*__last)); 36833e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36843e519524SHoward Hinnant // *__first is known to be false 36853e519524SHoward Hinnant // *__last is known to be true 36863e519524SHoward Hinnant // __len >= 2 3687ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36883e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36893e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36903e519524SHoward Hinnant if (__len >= __alloc_limit) 36913e519524SHoward Hinnant { 3692ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36933e519524SHoward Hinnant __h.reset(__p.first); 36943e519524SHoward Hinnant } 36953e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36963e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36973e519524SHoward Hinnant} 36983e519524SHoward Hinnant 36993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 37003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37013e519524SHoward Hinnant_ForwardIterator 37023e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 37033e519524SHoward Hinnant{ 37043e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 37053e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 37063e519524SHoward Hinnant} 37073e519524SHoward Hinnant 37083e519524SHoward Hinnant// is_sorted_until 37093e519524SHoward Hinnant 37103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37113e519524SHoward Hinnant_ForwardIterator 37123e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37133e519524SHoward Hinnant{ 37143e519524SHoward Hinnant if (__first != __last) 37153e519524SHoward Hinnant { 37163e519524SHoward Hinnant _ForwardIterator __i = __first; 37173e519524SHoward Hinnant while (++__i != __last) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant if (__comp(*__i, *__first)) 37203e519524SHoward Hinnant return __i; 37213e519524SHoward Hinnant __first = __i; 37223e519524SHoward Hinnant } 37233e519524SHoward Hinnant } 37243e519524SHoward Hinnant return __last; 37253e519524SHoward Hinnant} 37263e519524SHoward Hinnant 37273e519524SHoward Hinnanttemplate<class _ForwardIterator> 37283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37293e519524SHoward Hinnant_ForwardIterator 37303e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 37313e519524SHoward Hinnant{ 3732ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37333e519524SHoward Hinnant} 37343e519524SHoward Hinnant 37353e519524SHoward Hinnant// is_sorted 37363e519524SHoward Hinnant 37373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37393e519524SHoward Hinnantbool 37403e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37413e519524SHoward Hinnant{ 3742ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 37433e519524SHoward Hinnant} 37443e519524SHoward Hinnant 37453e519524SHoward Hinnanttemplate<class _ForwardIterator> 37463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37473e519524SHoward Hinnantbool 37483e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 37493e519524SHoward Hinnant{ 3750ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37513e519524SHoward Hinnant} 37523e519524SHoward Hinnant 37533e519524SHoward Hinnant// sort 37543e519524SHoward Hinnant 37553e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 37563e519524SHoward Hinnant 37573e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37583e519524SHoward Hinnantunsigned 37593e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 37603e519524SHoward Hinnant{ 37613e519524SHoward Hinnant unsigned __r = 0; 37623e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 37633e519524SHoward Hinnant { 37643e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 37653e519524SHoward Hinnant return __r; // x <= y && y <= z 37663e519524SHoward Hinnant // x <= y && y > z 37673e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 37683e519524SHoward Hinnant __r = 1; 37693e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37703e519524SHoward Hinnant { 37713e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37723e519524SHoward Hinnant __r = 2; 37733e519524SHoward Hinnant } 37743e519524SHoward Hinnant return __r; // x <= y && y < z 37753e519524SHoward Hinnant } 37763e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37773e519524SHoward Hinnant { 37783e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37793e519524SHoward Hinnant __r = 1; 37803e519524SHoward Hinnant return __r; 37813e519524SHoward Hinnant } 37823e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37833e519524SHoward Hinnant __r = 1; // x < y && x <= z 37843e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37853e519524SHoward Hinnant { 37863e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37873e519524SHoward Hinnant __r = 2; 37883e519524SHoward Hinnant } 37893e519524SHoward Hinnant return __r; 37903e519524SHoward Hinnant} // x <= y && y <= z 37913e519524SHoward Hinnant 37923e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37933e519524SHoward Hinnant 37943e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37953e519524SHoward Hinnantunsigned 37963e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37973e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37983e519524SHoward Hinnant{ 37993e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 38003e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38013e519524SHoward Hinnant { 38023e519524SHoward Hinnant swap(*__x3, *__x4); 38033e519524SHoward Hinnant ++__r; 38043e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38053e519524SHoward Hinnant { 38063e519524SHoward Hinnant swap(*__x2, *__x3); 38073e519524SHoward Hinnant ++__r; 38083e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38093e519524SHoward Hinnant { 38103e519524SHoward Hinnant swap(*__x1, *__x2); 38113e519524SHoward Hinnant ++__r; 38123e519524SHoward Hinnant } 38133e519524SHoward Hinnant } 38143e519524SHoward Hinnant } 38153e519524SHoward Hinnant return __r; 38163e519524SHoward Hinnant} 38173e519524SHoward Hinnant 38183e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 38193e519524SHoward Hinnant 38203e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38213e519524SHoward Hinnantunsigned 38223e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38233e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 38243e519524SHoward Hinnant{ 38253e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 38263e519524SHoward Hinnant if (__c(*__x5, *__x4)) 38273e519524SHoward Hinnant { 38283e519524SHoward Hinnant swap(*__x4, *__x5); 38293e519524SHoward Hinnant ++__r; 38303e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38313e519524SHoward Hinnant { 38323e519524SHoward Hinnant swap(*__x3, *__x4); 38333e519524SHoward Hinnant ++__r; 38343e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38353e519524SHoward Hinnant { 38363e519524SHoward Hinnant swap(*__x2, *__x3); 38373e519524SHoward Hinnant ++__r; 38383e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38393e519524SHoward Hinnant { 38403e519524SHoward Hinnant swap(*__x1, *__x2); 38413e519524SHoward Hinnant ++__r; 38423e519524SHoward Hinnant } 38433e519524SHoward Hinnant } 38443e519524SHoward Hinnant } 38453e519524SHoward Hinnant } 38463e519524SHoward Hinnant return __r; 38473e519524SHoward Hinnant} 38483e519524SHoward Hinnant 38493e519524SHoward Hinnant// Assumes size > 0 38503e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38513e519524SHoward Hinnantvoid 38523e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38533e519524SHoward Hinnant{ 38543e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 38553e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 38563e519524SHoward Hinnant { 3857ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 38583e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 38593e519524SHoward Hinnant (__first, __last, __comp); 38603e519524SHoward Hinnant if (__i != __first) 38613e519524SHoward Hinnant swap(*__first, *__i); 38623e519524SHoward Hinnant } 38633e519524SHoward Hinnant} 38643e519524SHoward Hinnant 38653e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38663e519524SHoward Hinnantvoid 38673e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38683e519524SHoward Hinnant{ 38693e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38703e519524SHoward Hinnant if (__first != __last) 38713e519524SHoward Hinnant { 38723e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38733e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3876ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38773e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3878ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3879ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38803e519524SHoward Hinnant } 38813e519524SHoward Hinnant } 38823e519524SHoward Hinnant} 38833e519524SHoward Hinnant 38843e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38853e519524SHoward Hinnantvoid 38863e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38873e519524SHoward Hinnant{ 38883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38893e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38903e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38913e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38923e519524SHoward Hinnant { 38933e519524SHoward Hinnant if (__comp(*__i, *__j)) 38943e519524SHoward Hinnant { 3895ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38963e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38973e519524SHoward Hinnant __j = __i; 38983e519524SHoward Hinnant do 38993e519524SHoward Hinnant { 3900ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39013e519524SHoward Hinnant __j = __k; 39023e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3903ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39043e519524SHoward Hinnant } 39053e519524SHoward Hinnant __j = __i; 39063e519524SHoward Hinnant } 39073e519524SHoward Hinnant} 39083e519524SHoward Hinnant 39093e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39103e519524SHoward Hinnantbool 39113e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39123e519524SHoward Hinnant{ 39133e519524SHoward Hinnant switch (__last - __first) 39143e519524SHoward Hinnant { 39153e519524SHoward Hinnant case 0: 39163e519524SHoward Hinnant case 1: 39173e519524SHoward Hinnant return true; 39183e519524SHoward Hinnant case 2: 39193e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39203e519524SHoward Hinnant swap(*__first, *__last); 39213e519524SHoward Hinnant return true; 39223e519524SHoward Hinnant case 3: 3923ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39243e519524SHoward Hinnant return true; 39253e519524SHoward Hinnant case 4: 3926ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39273e519524SHoward Hinnant return true; 39283e519524SHoward Hinnant case 5: 3929ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39303e519524SHoward Hinnant return true; 39313e519524SHoward Hinnant } 39323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39333e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39343e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 39353e519524SHoward Hinnant const unsigned __limit = 8; 39363e519524SHoward Hinnant unsigned __count = 0; 39373e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39383e519524SHoward Hinnant { 39393e519524SHoward Hinnant if (__comp(*__i, *__j)) 39403e519524SHoward Hinnant { 3941ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39423e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39433e519524SHoward Hinnant __j = __i; 39443e519524SHoward Hinnant do 39453e519524SHoward Hinnant { 3946ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39473e519524SHoward Hinnant __j = __k; 39483e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3949ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39503e519524SHoward Hinnant if (++__count == __limit) 39513e519524SHoward Hinnant return ++__i == __last; 39523e519524SHoward Hinnant } 39533e519524SHoward Hinnant __j = __i; 39543e519524SHoward Hinnant } 39553e519524SHoward Hinnant return true; 39563e519524SHoward Hinnant} 39573e519524SHoward Hinnant 39583e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 39593e519524SHoward Hinnantvoid 39603e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 39613e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 39623e519524SHoward Hinnant{ 39633e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 39643e519524SHoward Hinnant if (__first1 != __last1) 39653e519524SHoward Hinnant { 39663e519524SHoward Hinnant __destruct_n __d(0); 39673e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39683e519524SHoward Hinnant value_type* __last2 = __first2; 3969ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39703e519524SHoward Hinnant __d.__incr((value_type*)0); 39713e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39723e519524SHoward Hinnant { 39733e519524SHoward Hinnant value_type* __j2 = __last2; 39743e519524SHoward Hinnant value_type* __i2 = __j2; 39753e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39763e519524SHoward Hinnant { 3977ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39783e519524SHoward Hinnant __d.__incr((value_type*)0); 39793e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3980ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3981ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39823e519524SHoward Hinnant } 39833e519524SHoward Hinnant else 39843e519524SHoward Hinnant { 3985ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39863e519524SHoward Hinnant __d.__incr((value_type*)0); 39873e519524SHoward Hinnant } 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant __h.release(); 39903e519524SHoward Hinnant } 39913e519524SHoward Hinnant} 39923e519524SHoward Hinnant 39933e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39943e519524SHoward Hinnantvoid 39953e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39963e519524SHoward Hinnant{ 39973e519524SHoward Hinnant // _Compare is known to be a reference type 39983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4000ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 4001ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 40023e519524SHoward Hinnant while (true) 40033e519524SHoward Hinnant { 40043e519524SHoward Hinnant __restart: 40053e519524SHoward Hinnant difference_type __len = __last - __first; 40063e519524SHoward Hinnant switch (__len) 40073e519524SHoward Hinnant { 40083e519524SHoward Hinnant case 0: 40093e519524SHoward Hinnant case 1: 40103e519524SHoward Hinnant return; 40113e519524SHoward Hinnant case 2: 40123e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40133e519524SHoward Hinnant swap(*__first, *__last); 40143e519524SHoward Hinnant return; 40153e519524SHoward Hinnant case 3: 4016ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40173e519524SHoward Hinnant return; 40183e519524SHoward Hinnant case 4: 4019ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40203e519524SHoward Hinnant return; 40213e519524SHoward Hinnant case 5: 4022ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40233e519524SHoward Hinnant return; 40243e519524SHoward Hinnant } 40253e519524SHoward Hinnant if (__len <= __limit) 40263e519524SHoward Hinnant { 4027ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 40283e519524SHoward Hinnant return; 40293e519524SHoward Hinnant } 40303e519524SHoward Hinnant // __len > 5 40313e519524SHoward Hinnant _RandomAccessIterator __m = __first; 40323e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 40333e519524SHoward Hinnant --__lm1; 40343e519524SHoward Hinnant unsigned __n_swaps; 40353e519524SHoward Hinnant { 40363e519524SHoward Hinnant difference_type __delta; 40373e519524SHoward Hinnant if (__len >= 1000) 40383e519524SHoward Hinnant { 40393e519524SHoward Hinnant __delta = __len/2; 40403e519524SHoward Hinnant __m += __delta; 40413e519524SHoward Hinnant __delta /= 2; 4042ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 40433e519524SHoward Hinnant } 40443e519524SHoward Hinnant else 40453e519524SHoward Hinnant { 40463e519524SHoward Hinnant __delta = __len/2; 40473e519524SHoward Hinnant __m += __delta; 4048ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 40493e519524SHoward Hinnant } 40503e519524SHoward Hinnant } 40513e519524SHoward Hinnant // *__m is median 40523e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 40533e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 40543e519524SHoward Hinnant _RandomAccessIterator __i = __first; 40553e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 40563e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40573e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 40583e519524SHoward Hinnant // Prime the downward search with a guard. 40593e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 40603e519524SHoward Hinnant { 40613e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 40623e519524SHoward Hinnant // manually guard downward moving __j against __i 40633e519524SHoward Hinnant while (true) 40643e519524SHoward Hinnant { 40653e519524SHoward Hinnant if (__i == --__j) 40663e519524SHoward Hinnant { 40673e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40683e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40693e519524SHoward Hinnant ++__i; // __first + 1 40703e519524SHoward Hinnant __j = __last; 40713e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40723e519524SHoward Hinnant { 40733e519524SHoward Hinnant while (true) 40743e519524SHoward Hinnant { 40753e519524SHoward Hinnant if (__i == __j) 40763e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40773e519524SHoward Hinnant if (__comp(*__first, *__i)) 40783e519524SHoward Hinnant { 40793e519524SHoward Hinnant swap(*__i, *__j); 40803e519524SHoward Hinnant ++__n_swaps; 40813e519524SHoward Hinnant ++__i; 40823e519524SHoward Hinnant break; 40833e519524SHoward Hinnant } 40843e519524SHoward Hinnant ++__i; 40853e519524SHoward Hinnant } 40863e519524SHoward Hinnant } 40873e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40883e519524SHoward Hinnant if (__i == __j) 40893e519524SHoward Hinnant return; 40903e519524SHoward Hinnant while (true) 40913e519524SHoward Hinnant { 40923e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40933e519524SHoward Hinnant ++__i; 40943e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40953e519524SHoward Hinnant ; 40963e519524SHoward Hinnant if (__i >= __j) 40973e519524SHoward Hinnant break; 40983e519524SHoward Hinnant swap(*__i, *__j); 40993e519524SHoward Hinnant ++__n_swaps; 41003e519524SHoward Hinnant ++__i; 41013e519524SHoward Hinnant } 41023e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 41033e519524SHoward Hinnant // The first part is sorted, sort the secod part 4104ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 41053e519524SHoward Hinnant __first = __i; 41063e519524SHoward Hinnant goto __restart; 41073e519524SHoward Hinnant } 41083e519524SHoward Hinnant if (__comp(*__j, *__m)) 41093e519524SHoward Hinnant { 41103e519524SHoward Hinnant swap(*__i, *__j); 41113e519524SHoward Hinnant ++__n_swaps; 41123e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 41133e519524SHoward Hinnant } 41143e519524SHoward Hinnant } 41153e519524SHoward Hinnant } 41163e519524SHoward Hinnant // It is known that *__i < *__m 41173e519524SHoward Hinnant ++__i; 41183e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41193e519524SHoward Hinnant // if not yet partitioned... 41203e519524SHoward Hinnant if (__i < __j) 41213e519524SHoward Hinnant { 41223e519524SHoward Hinnant // known that *(__i - 1) < *__m 41233e519524SHoward Hinnant // known that __i <= __m 41243e519524SHoward Hinnant while (true) 41253e519524SHoward Hinnant { 41263e519524SHoward Hinnant // __m still guards upward moving __i 41273e519524SHoward Hinnant while (__comp(*__i, *__m)) 41283e519524SHoward Hinnant ++__i; 41293e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 41303e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 41313e519524SHoward Hinnant ; 41323e519524SHoward Hinnant if (__i > __j) 41333e519524SHoward Hinnant break; 41343e519524SHoward Hinnant swap(*__i, *__j); 41353e519524SHoward Hinnant ++__n_swaps; 41363e519524SHoward Hinnant // It is known that __m != __j 41373e519524SHoward Hinnant // If __m just moved, follow it 41383e519524SHoward Hinnant if (__m == __i) 41393e519524SHoward Hinnant __m = __j; 41403e519524SHoward Hinnant ++__i; 41413e519524SHoward Hinnant } 41423e519524SHoward Hinnant } 41433e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 41443e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 41453e519524SHoward Hinnant { 41463e519524SHoward Hinnant swap(*__i, *__m); 41473e519524SHoward Hinnant ++__n_swaps; 41483e519524SHoward Hinnant } 41493e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 41503e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 41513e519524SHoward Hinnant if (__n_swaps == 0) 41523e519524SHoward Hinnant { 4153ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4154ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 41553e519524SHoward Hinnant { 41563e519524SHoward Hinnant if (__fs) 41573e519524SHoward Hinnant return; 41583e519524SHoward Hinnant __last = __i; 41593e519524SHoward Hinnant continue; 41603e519524SHoward Hinnant } 41613e519524SHoward Hinnant else 41623e519524SHoward Hinnant { 41633e519524SHoward Hinnant if (__fs) 41643e519524SHoward Hinnant { 41653e519524SHoward Hinnant __first = ++__i; 41663e519524SHoward Hinnant continue; 41673e519524SHoward Hinnant } 41683e519524SHoward Hinnant } 41693e519524SHoward Hinnant } 41703e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41713e519524SHoward Hinnant if (__i - __first < __last - __i) 41723e519524SHoward Hinnant { 4173ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4174ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41753e519524SHoward Hinnant __first = ++__i; 41763e519524SHoward Hinnant } 41773e519524SHoward Hinnant else 41783e519524SHoward Hinnant { 4179ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4180ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41813e519524SHoward Hinnant __last = __i; 41823e519524SHoward Hinnant } 41833e519524SHoward Hinnant } 41843e519524SHoward Hinnant} 41853e519524SHoward Hinnant 41863e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnantvoid 41903e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41913e519524SHoward Hinnant{ 4192145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41953e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4196145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41983e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4199145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42003e519524SHoward Hinnant} 42013e519524SHoward Hinnant 42023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42043e519524SHoward Hinnantvoid 42053e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 42063e519524SHoward Hinnant{ 4207ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42083e519524SHoward Hinnant} 42093e519524SHoward Hinnant 42103e519524SHoward Hinnanttemplate <class _Tp> 42113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42123e519524SHoward Hinnantvoid 42133e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 42143e519524SHoward Hinnant{ 4215ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 42163e519524SHoward Hinnant} 42173e519524SHoward Hinnant 42183e519524SHoward Hinnanttemplate <class _Tp> 42193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42203e519524SHoward Hinnantvoid 42213e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 42223e519524SHoward Hinnant{ 4223ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 42243e519524SHoward Hinnant} 42253e519524SHoward Hinnant 4226f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4227f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4228f554add5SHoward Hinnantvoid 4229f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4230f554add5SHoward Hinnant{ 4231f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4232f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4233f554add5SHoward Hinnant} 4234f554add5SHoward Hinnant 42350be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4236e4383379SHoward Hinnant#pragma warning( push ) 4237e4383379SHoward Hinnant#pragma warning( disable: 4231) 42380be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4239f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4240f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4241f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4242f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4243f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4244f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4245f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4246f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4247f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4248f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4249f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4250f0544c20SHoward 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>&)) 4251f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4252f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4253f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42543e519524SHoward Hinnant 4255f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4256f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4257f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4258f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4259f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4260f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4261f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4262f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4263f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4264f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4265f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4266f0544c20SHoward 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>&)) 4267f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4268f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4269f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42703e519524SHoward Hinnant 4271f0544c20SHoward 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>&)) 42720be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4273e4383379SHoward Hinnant#pragma warning( pop ) 42740be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 42753e519524SHoward Hinnant 42763e519524SHoward Hinnant// lower_bound 42773e519524SHoward Hinnant 42783e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42793e519524SHoward Hinnant_ForwardIterator 4280e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42813e519524SHoward Hinnant{ 42823e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4283ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42843e519524SHoward Hinnant while (__len != 0) 42853e519524SHoward Hinnant { 42863e519524SHoward Hinnant difference_type __l2 = __len / 2; 42873e519524SHoward Hinnant _ForwardIterator __m = __first; 4288ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4289e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42903e519524SHoward Hinnant { 42913e519524SHoward Hinnant __first = ++__m; 42923e519524SHoward Hinnant __len -= __l2 + 1; 42933e519524SHoward Hinnant } 42943e519524SHoward Hinnant else 42953e519524SHoward Hinnant __len = __l2; 42963e519524SHoward Hinnant } 42973e519524SHoward Hinnant return __first; 42983e519524SHoward Hinnant} 42993e519524SHoward Hinnant 43003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43023e519524SHoward Hinnant_ForwardIterator 4303e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43043e519524SHoward Hinnant{ 4305145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4308e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4309145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4311e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4312145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43133e519524SHoward Hinnant} 43143e519524SHoward Hinnant 43153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43173e519524SHoward Hinnant_ForwardIterator 4318e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43193e519524SHoward Hinnant{ 4320e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 43213e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43223e519524SHoward Hinnant} 43233e519524SHoward Hinnant 43243e519524SHoward Hinnant// upper_bound 43253e519524SHoward Hinnant 43263e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43273e519524SHoward Hinnant_ForwardIterator 4328e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43293e519524SHoward Hinnant{ 43303e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4331ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43323e519524SHoward Hinnant while (__len != 0) 43333e519524SHoward Hinnant { 43343e519524SHoward Hinnant difference_type __l2 = __len / 2; 43353e519524SHoward Hinnant _ForwardIterator __m = __first; 4336ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4337e4383379SHoward Hinnant if (__comp(__value_, *__m)) 43383e519524SHoward Hinnant __len = __l2; 43393e519524SHoward Hinnant else 43403e519524SHoward Hinnant { 43413e519524SHoward Hinnant __first = ++__m; 43423e519524SHoward Hinnant __len -= __l2 + 1; 43433e519524SHoward Hinnant } 43443e519524SHoward Hinnant } 43453e519524SHoward Hinnant return __first; 43463e519524SHoward Hinnant} 43473e519524SHoward Hinnant 43483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43503e519524SHoward Hinnant_ForwardIterator 4351e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43523e519524SHoward Hinnant{ 4353145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43543e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43553e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4356e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4357145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4359e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4360145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43613e519524SHoward Hinnant} 43623e519524SHoward Hinnant 43633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43653e519524SHoward Hinnant_ForwardIterator 4366e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43673e519524SHoward Hinnant{ 4368e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43693e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43703e519524SHoward Hinnant} 43713e519524SHoward Hinnant 43723e519524SHoward Hinnant// equal_range 43733e519524SHoward Hinnant 43743e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43753e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4376e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43773e519524SHoward Hinnant{ 43783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4379ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43803e519524SHoward Hinnant while (__len != 0) 43813e519524SHoward Hinnant { 43823e519524SHoward Hinnant difference_type __l2 = __len / 2; 43833e519524SHoward Hinnant _ForwardIterator __m = __first; 4384ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4385e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43863e519524SHoward Hinnant { 43873e519524SHoward Hinnant __first = ++__m; 43883e519524SHoward Hinnant __len -= __l2 + 1; 43893e519524SHoward Hinnant } 4390e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43913e519524SHoward Hinnant { 43923e519524SHoward Hinnant __last = __m; 43933e519524SHoward Hinnant __len = __l2; 43943e519524SHoward Hinnant } 43953e519524SHoward Hinnant else 43963e519524SHoward Hinnant { 43973e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43983e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43993e519524SHoward Hinnant ( 4400e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4401e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 44023e519524SHoward Hinnant ); 44033e519524SHoward Hinnant } 44043e519524SHoward Hinnant } 44053e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 44063e519524SHoward Hinnant} 44073e519524SHoward Hinnant 44083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44103e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4411e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44123e519524SHoward Hinnant{ 4413145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4416e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4417145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4419e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4420145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44213e519524SHoward Hinnant} 44223e519524SHoward Hinnant 44233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44253e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4426e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44273e519524SHoward Hinnant{ 4428e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44293e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44303e519524SHoward Hinnant} 44313e519524SHoward Hinnant 44323e519524SHoward Hinnant// binary_search 44333e519524SHoward Hinnant 44343e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 44353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44363e519524SHoward Hinnantbool 4437e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44383e519524SHoward Hinnant{ 4439e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4440e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44413e519524SHoward Hinnant} 44423e519524SHoward Hinnant 44433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44453e519524SHoward Hinnantbool 4446e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44473e519524SHoward Hinnant{ 4448145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4451e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4452145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4454e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4455145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44563e519524SHoward Hinnant} 44573e519524SHoward Hinnant 44583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44603e519524SHoward Hinnantbool 4461e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44623e519524SHoward Hinnant{ 4463e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44643e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44653e519524SHoward Hinnant} 44663e519524SHoward Hinnant 44673e519524SHoward Hinnant// merge 44683e519524SHoward Hinnant 44693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44703e519524SHoward Hinnant_OutputIterator 44713e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44733e519524SHoward Hinnant{ 44743e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44753e519524SHoward Hinnant { 44763e519524SHoward Hinnant if (__first2 == __last2) 4477ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44783e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44793e519524SHoward Hinnant { 44803e519524SHoward Hinnant *__result = *__first2; 44813e519524SHoward Hinnant ++__first2; 44823e519524SHoward Hinnant } 44833e519524SHoward Hinnant else 44843e519524SHoward Hinnant { 44853e519524SHoward Hinnant *__result = *__first1; 44863e519524SHoward Hinnant ++__first1; 44873e519524SHoward Hinnant } 44883e519524SHoward Hinnant } 4489ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44903e519524SHoward Hinnant} 44913e519524SHoward Hinnant 44923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44943e519524SHoward Hinnant_OutputIterator 44953e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44973e519524SHoward Hinnant{ 4498145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4501ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4502145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4504ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4505145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45063e519524SHoward Hinnant} 45073e519524SHoward Hinnant 45083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 45093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45103e519524SHoward Hinnant_OutputIterator 45113e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 45133e519524SHoward Hinnant{ 45143e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 45153e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 45163e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 45173e519524SHoward Hinnant} 45183e519524SHoward Hinnant 45193e519524SHoward Hinnant// inplace_merge 45203e519524SHoward Hinnant 4521adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4522adfdae18SMarshall Clow class _OutputIterator> 4523adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4524adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4525adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4526adfdae18SMarshall Clow{ 4527adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4528adfdae18SMarshall Clow { 4529adfdae18SMarshall Clow if (__first2 == __last2) 4530adfdae18SMarshall Clow { 4531adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4532adfdae18SMarshall Clow return; 4533adfdae18SMarshall Clow } 4534adfdae18SMarshall Clow 4535adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4536adfdae18SMarshall Clow { 4537adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4538adfdae18SMarshall Clow ++__first2; 4539adfdae18SMarshall Clow } 4540adfdae18SMarshall Clow else 4541adfdae18SMarshall Clow { 4542adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4543adfdae18SMarshall Clow ++__first1; 4544adfdae18SMarshall Clow } 4545adfdae18SMarshall Clow } 4546adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4547adfdae18SMarshall Clow} 4548adfdae18SMarshall Clow 45493e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45503e519524SHoward Hinnantvoid 45513e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45523e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45533e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45543e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45553e519524SHoward Hinnant{ 45563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45573e519524SHoward Hinnant __destruct_n __d(0); 45583e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45593e519524SHoward Hinnant if (__len1 <= __len2) 45603e519524SHoward Hinnant { 45613e519524SHoward Hinnant value_type* __p = __buff; 4562910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4563ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4564adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 45653e519524SHoward Hinnant } 45663e519524SHoward Hinnant else 45673e519524SHoward Hinnant { 45683e519524SHoward Hinnant value_type* __p = __buff; 4569910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4570ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 45713e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45723e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4573adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4574adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 45753e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 45763e519524SHoward Hinnant } 45773e519524SHoward Hinnant} 45783e519524SHoward Hinnant 45793e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45803e519524SHoward Hinnantvoid 45813e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45823e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45833e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45843e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45853e519524SHoward Hinnant{ 45863e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45873e519524SHoward Hinnant while (true) 45883e519524SHoward Hinnant { 45893e519524SHoward Hinnant // if __middle == __last, we're done 45903e519524SHoward Hinnant if (__len2 == 0) 45913e519524SHoward Hinnant return; 4592526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4593526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4594526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45953e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4596910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45973e519524SHoward Hinnant { 45983e519524SHoward Hinnant if (__len1 == 0) 45993e519524SHoward Hinnant return; 46003e519524SHoward Hinnant if (__comp(*__middle, *__first)) 46013e519524SHoward Hinnant break; 46023e519524SHoward Hinnant } 46033e519524SHoward Hinnant // __first < __middle < __last 46043e519524SHoward Hinnant // *__first > *__middle 46053e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 46063e519524SHoward Hinnant // all elements in: 46073e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 46083e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 46093e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 46103e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 46113e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 46123e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 46133e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 46143e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 46153e519524SHoward Hinnant // binary search smaller range 46163e519524SHoward Hinnant if (__len1 < __len2) 46173e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 46183e519524SHoward Hinnant __len21 = __len2 / 2; 46193e519524SHoward Hinnant __m2 = __middle; 4620ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 46213e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4622ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46233e519524SHoward Hinnant } 46243e519524SHoward Hinnant else 46253e519524SHoward Hinnant { 46263e519524SHoward Hinnant if (__len1 == 1) 46273e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46283e519524SHoward Hinnant // It is known *__first > *__middle 46293e519524SHoward Hinnant swap(*__first, *__middle); 46303e519524SHoward Hinnant return; 46313e519524SHoward Hinnant } 46323e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46333e519524SHoward Hinnant __len11 = __len1 / 2; 46343e519524SHoward Hinnant __m1 = __first; 4635ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46363e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4637ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46383e519524SHoward Hinnant } 46393e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46403e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46413e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46423e519524SHoward Hinnant // swap middle two partitions 4643ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46443e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 46453e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 46463e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46473e519524SHoward Hinnant { 46483e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46493e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46503e519524SHoward Hinnant __first = __middle; 46513e519524SHoward Hinnant __middle = __m2; 46523e519524SHoward Hinnant __len1 = __len12; 46533e519524SHoward Hinnant __len2 = __len22; 46543e519524SHoward Hinnant } 46553e519524SHoward Hinnant else 46563e519524SHoward Hinnant { 46573e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46583e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46593e519524SHoward Hinnant __last = __middle; 46603e519524SHoward Hinnant __middle = __m1; 46613e519524SHoward Hinnant __len1 = __len11; 46623e519524SHoward Hinnant __len2 = __len21; 46633e519524SHoward Hinnant } 46643e519524SHoward Hinnant } 46653e519524SHoward Hinnant} 46663e519524SHoward Hinnant 46673e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46693e519524SHoward Hinnantvoid 46703e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46713e519524SHoward Hinnant _Compare __comp) 46723e519524SHoward Hinnant{ 46733e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46743e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4675ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4676ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4677ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46780b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46790b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46800b48cf9aSMarshall Clow 4681145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46823e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46833e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4684ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46853e519524SHoward Hinnant __buf.first, __buf.second); 4686145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4688ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46893e519524SHoward Hinnant __buf.first, __buf.second); 4690145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46913e519524SHoward Hinnant} 46923e519524SHoward Hinnant 46933e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46953e519524SHoward Hinnantvoid 46963e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46973e519524SHoward Hinnant{ 4698ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46993e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 47003e519524SHoward Hinnant} 47013e519524SHoward Hinnant 47023e519524SHoward Hinnant// stable_sort 47033e519524SHoward Hinnant 47043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47053e519524SHoward Hinnantvoid 47063e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 47073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47083e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 47093e519524SHoward Hinnant{ 47103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 47113e519524SHoward Hinnant __destruct_n __d(0); 47123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 47133e519524SHoward Hinnant for (; true; ++__result) 47143e519524SHoward Hinnant { 47153e519524SHoward Hinnant if (__first1 == __last1) 47163e519524SHoward Hinnant { 47173e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4718ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47193e519524SHoward Hinnant __h.release(); 47203e519524SHoward Hinnant return; 47213e519524SHoward Hinnant } 47223e519524SHoward Hinnant if (__first2 == __last2) 47233e519524SHoward Hinnant { 47243e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4725ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47263e519524SHoward Hinnant __h.release(); 47273e519524SHoward Hinnant return; 47283e519524SHoward Hinnant } 47293e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47303e519524SHoward Hinnant { 4731ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47323e519524SHoward Hinnant __d.__incr((value_type*)0); 47333e519524SHoward Hinnant ++__first2; 47343e519524SHoward Hinnant } 47353e519524SHoward Hinnant else 47363e519524SHoward Hinnant { 4737ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47383e519524SHoward Hinnant __d.__incr((value_type*)0); 47393e519524SHoward Hinnant ++__first1; 47403e519524SHoward Hinnant } 47413e519524SHoward Hinnant } 47423e519524SHoward Hinnant} 47433e519524SHoward Hinnant 47443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47453e519524SHoward Hinnantvoid 47463e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47483e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47493e519524SHoward Hinnant{ 47503e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47513e519524SHoward Hinnant { 47523e519524SHoward Hinnant if (__first2 == __last2) 47533e519524SHoward Hinnant { 47543e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4755ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47563e519524SHoward Hinnant return; 47573e519524SHoward Hinnant } 47583e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47593e519524SHoward Hinnant { 4760ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47613e519524SHoward Hinnant ++__first2; 47623e519524SHoward Hinnant } 47633e519524SHoward Hinnant else 47643e519524SHoward Hinnant { 4765ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47663e519524SHoward Hinnant ++__first1; 47673e519524SHoward Hinnant } 47683e519524SHoward Hinnant } 47693e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4770ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47713e519524SHoward Hinnant} 47723e519524SHoward Hinnant 47733e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47743e519524SHoward Hinnantvoid 47753e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47763e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47773e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47803e519524SHoward Hinnantvoid 47813e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47823e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47833e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47843e519524SHoward Hinnant{ 47853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47863e519524SHoward Hinnant switch (__len) 47873e519524SHoward Hinnant { 47883e519524SHoward Hinnant case 0: 47893e519524SHoward Hinnant return; 47903e519524SHoward Hinnant case 1: 4791ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47923e519524SHoward Hinnant return; 47933e519524SHoward Hinnant case 2: 47943e519524SHoward Hinnant __destruct_n __d(0); 47953e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47963e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47973e519524SHoward Hinnant { 4798ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47993e519524SHoward Hinnant __d.__incr((value_type*)0); 48003e519524SHoward Hinnant ++__first2; 4801ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 48023e519524SHoward Hinnant } 48033e519524SHoward Hinnant else 48043e519524SHoward Hinnant { 4805ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 48063e519524SHoward Hinnant __d.__incr((value_type*)0); 48073e519524SHoward Hinnant ++__first2; 4808ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 48093e519524SHoward Hinnant } 48103e519524SHoward Hinnant __h2.release(); 48113e519524SHoward Hinnant return; 48123e519524SHoward Hinnant } 48133e519524SHoward Hinnant if (__len <= 8) 48143e519524SHoward Hinnant { 48153e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 48163e519524SHoward Hinnant return; 48173e519524SHoward Hinnant } 48183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48193e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 48203e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 48213e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 48223e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48233e519524SHoward Hinnant} 48243e519524SHoward Hinnant 48253e519524SHoward Hinnanttemplate <class _Tp> 48263e519524SHoward Hinnantstruct __stable_sort_switch 48273e519524SHoward Hinnant{ 4828ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48293e519524SHoward Hinnant}; 48303e519524SHoward Hinnant 48313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48323e519524SHoward Hinnantvoid 48333e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48343e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48363e519524SHoward Hinnant{ 48373e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48393e519524SHoward Hinnant switch (__len) 48403e519524SHoward Hinnant { 48413e519524SHoward Hinnant case 0: 48423e519524SHoward Hinnant case 1: 48433e519524SHoward Hinnant return; 48443e519524SHoward Hinnant case 2: 48453e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48463e519524SHoward Hinnant swap(*__first, *__last); 48473e519524SHoward Hinnant return; 48483e519524SHoward Hinnant } 48493e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48503e519524SHoward Hinnant { 48513e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 48523e519524SHoward Hinnant return; 48533e519524SHoward Hinnant } 48543e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48553e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48563e519524SHoward Hinnant if (__len <= __buff_size) 48573e519524SHoward Hinnant { 48583e519524SHoward Hinnant __destruct_n __d(0); 48593e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48603e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 48613e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 48623e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 48633e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 48643e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48653e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 48663e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48673e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48683e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48693e519524SHoward Hinnant// __first, __comp); 48703e519524SHoward Hinnant return; 48713e519524SHoward Hinnant } 48723e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48733e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48743e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48753e519524SHoward Hinnant} 48763e519524SHoward Hinnant 48773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48793e519524SHoward Hinnantvoid 48803e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48813e519524SHoward Hinnant{ 48823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48843e519524SHoward Hinnant difference_type __len = __last - __first; 48853e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48863e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48873e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48883e519524SHoward Hinnant { 4889ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48903e519524SHoward Hinnant __h.reset(__buf.first); 48913e519524SHoward Hinnant } 4892145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48953e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4896145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48983e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4899145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49003e519524SHoward Hinnant} 49013e519524SHoward Hinnant 49023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49043e519524SHoward Hinnantvoid 49053e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 49063e519524SHoward Hinnant{ 4907ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnant// is_heap_until 49113e519524SHoward Hinnant 49123e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49133e519524SHoward Hinnant_RandomAccessIterator 49143e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49153e519524SHoward Hinnant{ 4916ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49173e519524SHoward Hinnant difference_type __len = __last - __first; 49183e519524SHoward Hinnant difference_type __p = 0; 49193e519524SHoward Hinnant difference_type __c = 1; 49203e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 49213e519524SHoward Hinnant while (__c < __len) 49223e519524SHoward Hinnant { 49233e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49243e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49253e519524SHoward Hinnant return __cp; 49263e519524SHoward Hinnant ++__c; 49273e519524SHoward Hinnant ++__cp; 49283e519524SHoward Hinnant if (__c == __len) 49293e519524SHoward Hinnant return __last; 49303e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49313e519524SHoward Hinnant return __cp; 49323e519524SHoward Hinnant ++__p; 49333e519524SHoward Hinnant ++__pp; 49343e519524SHoward Hinnant __c = 2 * __p + 1; 49353e519524SHoward Hinnant } 49363e519524SHoward Hinnant return __last; 49373e519524SHoward Hinnant} 49383e519524SHoward Hinnant 49393e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49413e519524SHoward Hinnant_RandomAccessIterator 49423e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49433e519524SHoward Hinnant{ 4944ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49453e519524SHoward Hinnant} 49463e519524SHoward Hinnant 49473e519524SHoward Hinnant// is_heap 49483e519524SHoward Hinnant 49493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49513e519524SHoward Hinnantbool 49523e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49533e519524SHoward Hinnant{ 4954ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49553e519524SHoward Hinnant} 49563e519524SHoward Hinnant 49573e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49593e519524SHoward Hinnantbool 49603e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49613e519524SHoward Hinnant{ 4962ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49633e519524SHoward Hinnant} 49643e519524SHoward Hinnant 49653e519524SHoward Hinnant// push_heap 49663e519524SHoward Hinnant 49673e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49683e519524SHoward Hinnantvoid 49698b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49703e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49713e519524SHoward Hinnant{ 49723e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49733e519524SHoward Hinnant if (__len > 1) 49743e519524SHoward Hinnant { 49753e519524SHoward Hinnant __len = (__len - 2) / 2; 49763e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49773e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49783e519524SHoward Hinnant { 4979ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49803e519524SHoward Hinnant do 49813e519524SHoward Hinnant { 4982ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49833e519524SHoward Hinnant __last = __ptr; 49843e519524SHoward Hinnant if (__len == 0) 49853e519524SHoward Hinnant break; 49863e519524SHoward Hinnant __len = (__len - 1) / 2; 49873e519524SHoward Hinnant __ptr = __first + __len; 49883e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4989ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49903e519524SHoward Hinnant } 49913e519524SHoward Hinnant } 49923e519524SHoward Hinnant} 49933e519524SHoward Hinnant 49943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49963e519524SHoward Hinnantvoid 49973e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49983e519524SHoward Hinnant{ 4999145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50028b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 5003145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50058b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 5006145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50073e519524SHoward Hinnant} 50083e519524SHoward Hinnant 50093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50113e519524SHoward Hinnantvoid 50123e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50133e519524SHoward Hinnant{ 5014ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50153e519524SHoward Hinnant} 50163e519524SHoward Hinnant 50173e519524SHoward Hinnant// pop_heap 50183e519524SHoward Hinnant 50193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50208b512602SDavid Majnemervoid 5021fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 5022fd838227SEric Fiselier _Compare __comp, 50238b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50248b512602SDavid Majnemer _RandomAccessIterator __start) 50258b512602SDavid Majnemer{ 50268b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50278b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50288b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50298b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50308b512602SDavid Majnemer difference_type __child = __start - __first; 50318b512602SDavid Majnemer 50328b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50338b512602SDavid Majnemer return; 50348b512602SDavid Majnemer 50358b512602SDavid Majnemer __child = 2 * __child + 1; 50368b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50378b512602SDavid Majnemer 50388b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50398b512602SDavid Majnemer // right-child exists and is greater than left-child 50408b512602SDavid Majnemer ++__child_i; 50418b512602SDavid Majnemer ++__child; 50428b512602SDavid Majnemer } 50438b512602SDavid Majnemer 50448b512602SDavid Majnemer // check if we are in heap-order 50458b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50468b512602SDavid Majnemer // we are, __start is larger than it's largest child 50478b512602SDavid Majnemer return; 50488b512602SDavid Majnemer 50498b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50508b512602SDavid Majnemer do 50518b512602SDavid Majnemer { 50528b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 50538b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50548b512602SDavid Majnemer __start = __child_i; 50558b512602SDavid Majnemer 50568b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50578b512602SDavid Majnemer break; 50588b512602SDavid Majnemer 50598b512602SDavid Majnemer // recompute the child based off of the updated parent 50608b512602SDavid Majnemer __child = 2 * __child + 1; 50618b512602SDavid Majnemer __child_i = __first + __child; 50628b512602SDavid Majnemer 50638b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50648b512602SDavid Majnemer // right-child exists and is greater than left-child 50658b512602SDavid Majnemer ++__child_i; 50668b512602SDavid Majnemer ++__child; 50678b512602SDavid Majnemer } 50688b512602SDavid Majnemer 50698b512602SDavid Majnemer // check if we are in heap-order 50708b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50718b512602SDavid Majnemer *__start = _VSTD::move(__top); 50728b512602SDavid Majnemer} 50738b512602SDavid Majnemer 50748b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50763e519524SHoward Hinnantvoid 50773e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50793e519524SHoward Hinnant{ 50803e519524SHoward Hinnant if (__len > 1) 50813e519524SHoward Hinnant { 50823e519524SHoward Hinnant swap(*__first, *--__last); 50838b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50843e519524SHoward Hinnant } 50853e519524SHoward Hinnant} 50863e519524SHoward Hinnant 50873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50893e519524SHoward Hinnantvoid 50903e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50913e519524SHoward Hinnant{ 5092145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50953e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5096145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50983e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5099145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51003e519524SHoward Hinnant} 51013e519524SHoward Hinnant 51023e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51043e519524SHoward Hinnantvoid 51053e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51063e519524SHoward Hinnant{ 5107ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51083e519524SHoward Hinnant} 51093e519524SHoward Hinnant 51103e519524SHoward Hinnant// make_heap 51113e519524SHoward Hinnant 51123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51133e519524SHoward Hinnantvoid 51143e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51153e519524SHoward Hinnant{ 51163e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51173e519524SHoward Hinnant difference_type __n = __last - __first; 51183e519524SHoward Hinnant if (__n > 1) 51193e519524SHoward Hinnant { 51208b512602SDavid Majnemer // start from the first parent, there is no need to consider children 51218b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 51228b512602SDavid Majnemer { 51238b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51248b512602SDavid Majnemer } 51253e519524SHoward Hinnant } 51263e519524SHoward Hinnant} 51273e519524SHoward Hinnant 51283e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51303e519524SHoward Hinnantvoid 51313e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51323e519524SHoward Hinnant{ 5133145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51363e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5137145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51393e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5140145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51413e519524SHoward Hinnant} 51423e519524SHoward Hinnant 51433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51453e519524SHoward Hinnantvoid 51463e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51473e519524SHoward Hinnant{ 5148ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51493e519524SHoward Hinnant} 51503e519524SHoward Hinnant 51513e519524SHoward Hinnant// sort_heap 51523e519524SHoward Hinnant 51533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51543e519524SHoward Hinnantvoid 51553e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51563e519524SHoward Hinnant{ 51573e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51583e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 51593e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 51603e519524SHoward Hinnant} 51613e519524SHoward Hinnant 51623e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51643e519524SHoward Hinnantvoid 51653e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51663e519524SHoward Hinnant{ 5167145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51683e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51693e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51703e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5171145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51723e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51733e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5174145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51753e519524SHoward Hinnant} 51763e519524SHoward Hinnant 51773e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51793e519524SHoward Hinnantvoid 51803e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51813e519524SHoward Hinnant{ 5182ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51833e519524SHoward Hinnant} 51843e519524SHoward Hinnant 51853e519524SHoward Hinnant// partial_sort 51863e519524SHoward Hinnant 51873e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51883e519524SHoward Hinnantvoid 51893e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51903e519524SHoward Hinnant _Compare __comp) 51913e519524SHoward Hinnant{ 51923e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51943e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51953e519524SHoward Hinnant { 51963e519524SHoward Hinnant if (__comp(*__i, *__first)) 51973e519524SHoward Hinnant { 51983e519524SHoward Hinnant swap(*__i, *__first); 51998b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 52003e519524SHoward Hinnant } 52013e519524SHoward Hinnant } 52023e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 52033e519524SHoward Hinnant} 52043e519524SHoward Hinnant 52053e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52073e519524SHoward Hinnantvoid 52083e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 52093e519524SHoward Hinnant _Compare __comp) 52103e519524SHoward Hinnant{ 5211145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52143e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5215145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52173e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5218145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52193e519524SHoward Hinnant} 52203e519524SHoward Hinnant 52213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52233e519524SHoward Hinnantvoid 52243e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 52253e519524SHoward Hinnant{ 5226ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52273e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52283e519524SHoward Hinnant} 52293e519524SHoward Hinnant 52303e519524SHoward Hinnant// partial_sort_copy 52313e519524SHoward Hinnant 52323e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52333e519524SHoward Hinnant_RandomAccessIterator 52343e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52353e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52363e519524SHoward Hinnant{ 52373e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52383e519524SHoward Hinnant if (__r != __result_last) 52393e519524SHoward Hinnant { 5240910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 52413e519524SHoward Hinnant *__r = *__first; 52423e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 52438b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52443e519524SHoward Hinnant for (; __first != __last; ++__first) 52453e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant *__result_first = *__first; 52488b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52493e519524SHoward Hinnant } 52503e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 52513e519524SHoward Hinnant } 52523e519524SHoward Hinnant return __r; 52533e519524SHoward Hinnant} 52543e519524SHoward Hinnant 52553e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52573e519524SHoward Hinnant_RandomAccessIterator 52583e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52593e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52603e519524SHoward Hinnant{ 5261145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52623e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52633e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52643e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5265145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52673e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5268145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52693e519524SHoward Hinnant} 52703e519524SHoward Hinnant 52713e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52733e519524SHoward Hinnant_RandomAccessIterator 52743e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52753e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52763e519524SHoward Hinnant{ 5277ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52783e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52793e519524SHoward Hinnant} 52803e519524SHoward Hinnant 52813e519524SHoward Hinnant// nth_element 52823e519524SHoward Hinnant 52833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52843e519524SHoward Hinnantvoid 52853e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52863e519524SHoward Hinnant{ 52873e519524SHoward Hinnant // _Compare is known to be a reference type 52883e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52893e519524SHoward Hinnant const difference_type __limit = 7; 52903e519524SHoward Hinnant while (true) 52913e519524SHoward Hinnant { 52923e519524SHoward Hinnant __restart: 5293b34b4819SHoward Hinnant if (__nth == __last) 5294b34b4819SHoward Hinnant return; 52953e519524SHoward Hinnant difference_type __len = __last - __first; 52963e519524SHoward Hinnant switch (__len) 52973e519524SHoward Hinnant { 52983e519524SHoward Hinnant case 0: 52993e519524SHoward Hinnant case 1: 53003e519524SHoward Hinnant return; 53013e519524SHoward Hinnant case 2: 53023e519524SHoward Hinnant if (__comp(*--__last, *__first)) 53033e519524SHoward Hinnant swap(*__first, *__last); 53043e519524SHoward Hinnant return; 53053e519524SHoward Hinnant case 3: 53063e519524SHoward Hinnant { 53073e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5308ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 53093e519524SHoward Hinnant return; 53103e519524SHoward Hinnant } 53113e519524SHoward Hinnant } 53123e519524SHoward Hinnant if (__len <= __limit) 53133e519524SHoward Hinnant { 53143e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 53153e519524SHoward Hinnant return; 53163e519524SHoward Hinnant } 53173e519524SHoward Hinnant // __len > __limit >= 3 53183e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 53193e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5320ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 53213e519524SHoward Hinnant // *__m is median 53223e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53233e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53243e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53253e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53263e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53273e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53283e519524SHoward Hinnant // Prime the downward search with a guard. 53293e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53303e519524SHoward Hinnant { 53313e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53323e519524SHoward Hinnant // manually guard downward moving __j against __i 53333e519524SHoward Hinnant while (true) 53343e519524SHoward Hinnant { 53353e519524SHoward Hinnant if (__i == --__j) 53363e519524SHoward Hinnant { 53373e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 53383e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 53393e519524SHoward Hinnant ++__i; // __first + 1 53403e519524SHoward Hinnant __j = __last; 53413e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 53423e519524SHoward Hinnant { 53433e519524SHoward Hinnant while (true) 53443e519524SHoward Hinnant { 53453e519524SHoward Hinnant if (__i == __j) 53463e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 53473e519524SHoward Hinnant if (__comp(*__first, *__i)) 53483e519524SHoward Hinnant { 53493e519524SHoward Hinnant swap(*__i, *__j); 53503e519524SHoward Hinnant ++__n_swaps; 53513e519524SHoward Hinnant ++__i; 53523e519524SHoward Hinnant break; 53533e519524SHoward Hinnant } 53543e519524SHoward Hinnant ++__i; 53553e519524SHoward Hinnant } 53563e519524SHoward Hinnant } 53573e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53583e519524SHoward Hinnant if (__i == __j) 53593e519524SHoward Hinnant return; 53603e519524SHoward Hinnant while (true) 53613e519524SHoward Hinnant { 53623e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53633e519524SHoward Hinnant ++__i; 53643e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53653e519524SHoward Hinnant ; 53663e519524SHoward Hinnant if (__i >= __j) 53673e519524SHoward Hinnant break; 53683e519524SHoward Hinnant swap(*__i, *__j); 53693e519524SHoward Hinnant ++__n_swaps; 53703e519524SHoward Hinnant ++__i; 53713e519524SHoward Hinnant } 53723e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53733e519524SHoward Hinnant // The first part is sorted, 53743e519524SHoward Hinnant if (__nth < __i) 53753e519524SHoward Hinnant return; 53763e519524SHoward Hinnant // __nth_element the secod part 53773e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53783e519524SHoward Hinnant __first = __i; 53793e519524SHoward Hinnant goto __restart; 53803e519524SHoward Hinnant } 53813e519524SHoward Hinnant if (__comp(*__j, *__m)) 53823e519524SHoward Hinnant { 53833e519524SHoward Hinnant swap(*__i, *__j); 53843e519524SHoward Hinnant ++__n_swaps; 53853e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53863e519524SHoward Hinnant } 53873e519524SHoward Hinnant } 53883e519524SHoward Hinnant } 53893e519524SHoward Hinnant ++__i; 53903e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53913e519524SHoward Hinnant // if not yet partitioned... 53923e519524SHoward Hinnant if (__i < __j) 53933e519524SHoward Hinnant { 53943e519524SHoward Hinnant // known that *(__i - 1) < *__m 53953e519524SHoward Hinnant while (true) 53963e519524SHoward Hinnant { 53973e519524SHoward Hinnant // __m still guards upward moving __i 53983e519524SHoward Hinnant while (__comp(*__i, *__m)) 53993e519524SHoward Hinnant ++__i; 54003e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 54013e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 54023e519524SHoward Hinnant ; 54033e519524SHoward Hinnant if (__i >= __j) 54043e519524SHoward Hinnant break; 54053e519524SHoward Hinnant swap(*__i, *__j); 54063e519524SHoward Hinnant ++__n_swaps; 54073e519524SHoward Hinnant // It is known that __m != __j 54083e519524SHoward Hinnant // If __m just moved, follow it 54093e519524SHoward Hinnant if (__m == __i) 54103e519524SHoward Hinnant __m = __j; 54113e519524SHoward Hinnant ++__i; 54123e519524SHoward Hinnant } 54133e519524SHoward Hinnant } 54143e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 54153e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 54163e519524SHoward Hinnant { 54173e519524SHoward Hinnant swap(*__i, *__m); 54183e519524SHoward Hinnant ++__n_swaps; 54193e519524SHoward Hinnant } 54203e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 54213e519524SHoward Hinnant if (__nth == __i) 54223e519524SHoward Hinnant return; 54233e519524SHoward Hinnant if (__n_swaps == 0) 54243e519524SHoward Hinnant { 54253e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 54263e519524SHoward Hinnant if (__nth < __i) 54273e519524SHoward Hinnant { 54283e519524SHoward Hinnant // Check for [__first, __i) already sorted 54293e519524SHoward Hinnant __j = __m = __first; 54303e519524SHoward Hinnant while (++__j != __i) 54313e519524SHoward Hinnant { 54323e519524SHoward Hinnant if (__comp(*__j, *__m)) 54333e519524SHoward Hinnant // not yet sorted, so sort 54343e519524SHoward Hinnant goto not_sorted; 54353e519524SHoward Hinnant __m = __j; 54363e519524SHoward Hinnant } 54373e519524SHoward Hinnant // [__first, __i) sorted 54383e519524SHoward Hinnant return; 54393e519524SHoward Hinnant } 54403e519524SHoward Hinnant else 54413e519524SHoward Hinnant { 54423e519524SHoward Hinnant // Check for [__i, __last) already sorted 54433e519524SHoward Hinnant __j = __m = __i; 54443e519524SHoward Hinnant while (++__j != __last) 54453e519524SHoward Hinnant { 54463e519524SHoward Hinnant if (__comp(*__j, *__m)) 54473e519524SHoward Hinnant // not yet sorted, so sort 54483e519524SHoward Hinnant goto not_sorted; 54493e519524SHoward Hinnant __m = __j; 54503e519524SHoward Hinnant } 54513e519524SHoward Hinnant // [__i, __last) sorted 54523e519524SHoward Hinnant return; 54533e519524SHoward Hinnant } 54543e519524SHoward Hinnant } 54553e519524SHoward Hinnantnot_sorted: 54563e519524SHoward Hinnant // __nth_element on range containing __nth 54573e519524SHoward Hinnant if (__nth < __i) 54583e519524SHoward Hinnant { 54593e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 54603e519524SHoward Hinnant __last = __i; 54613e519524SHoward Hinnant } 54623e519524SHoward Hinnant else 54633e519524SHoward Hinnant { 54643e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 54653e519524SHoward Hinnant __first = ++__i; 54663e519524SHoward Hinnant } 54673e519524SHoward Hinnant } 54683e519524SHoward Hinnant} 54693e519524SHoward Hinnant 54703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54723e519524SHoward Hinnantvoid 54733e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54743e519524SHoward Hinnant{ 5475145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54783e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5479145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54813e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5482145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54833e519524SHoward Hinnant} 54843e519524SHoward Hinnant 54853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54873e519524SHoward Hinnantvoid 54883e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54893e519524SHoward Hinnant{ 5490ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54913e519524SHoward Hinnant} 54923e519524SHoward Hinnant 54933e519524SHoward Hinnant// includes 54943e519524SHoward Hinnant 54953e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54963e519524SHoward Hinnantbool 54973e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54983e519524SHoward Hinnant _Compare __comp) 54993e519524SHoward Hinnant{ 55003e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 55013e519524SHoward Hinnant { 55023e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 55033e519524SHoward Hinnant return false; 55043e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55053e519524SHoward Hinnant ++__first2; 55063e519524SHoward Hinnant } 55073e519524SHoward Hinnant return true; 55083e519524SHoward Hinnant} 55093e519524SHoward Hinnant 55103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55123e519524SHoward Hinnantbool 55133e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 55143e519524SHoward Hinnant _Compare __comp) 55153e519524SHoward Hinnant{ 5516145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55193e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5520145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55223e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5523145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55243e519524SHoward Hinnant} 55253e519524SHoward Hinnant 55263e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55283e519524SHoward Hinnantbool 55293e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55303e519524SHoward Hinnant{ 5531ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55323e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55333e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55343e519524SHoward Hinnant} 55353e519524SHoward Hinnant 55363e519524SHoward Hinnant// set_union 55373e519524SHoward Hinnant 55383e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55393e519524SHoward Hinnant_OutputIterator 55403e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55413e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55423e519524SHoward Hinnant{ 55433e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55443e519524SHoward Hinnant { 55453e519524SHoward Hinnant if (__first2 == __last2) 5546ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55473e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55483e519524SHoward Hinnant { 55493e519524SHoward Hinnant *__result = *__first2; 55503e519524SHoward Hinnant ++__first2; 55513e519524SHoward Hinnant } 55523e519524SHoward Hinnant else 55533e519524SHoward Hinnant { 55543e519524SHoward Hinnant *__result = *__first1; 55553e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55563e519524SHoward Hinnant ++__first2; 55573e519524SHoward Hinnant ++__first1; 55583e519524SHoward Hinnant } 55593e519524SHoward Hinnant } 5560ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55613e519524SHoward Hinnant} 55623e519524SHoward Hinnant 55633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55653e519524SHoward Hinnant_OutputIterator 55663e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55673e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55683e519524SHoward Hinnant{ 5569145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55723e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5573145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55753e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5576145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55773e519524SHoward Hinnant} 55783e519524SHoward Hinnant 55793e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55813e519524SHoward Hinnant_OutputIterator 55823e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55833e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55843e519524SHoward Hinnant{ 5585ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55863e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55873e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55883e519524SHoward Hinnant} 55893e519524SHoward Hinnant 55903e519524SHoward Hinnant// set_intersection 55913e519524SHoward Hinnant 55923e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55933e519524SHoward Hinnant_OutputIterator 55943e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55953e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55963e519524SHoward Hinnant{ 55973e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55983e519524SHoward Hinnant { 55993e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56003e519524SHoward Hinnant ++__first1; 56013e519524SHoward Hinnant else 56023e519524SHoward Hinnant { 56033e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56043e519524SHoward Hinnant { 56053e519524SHoward Hinnant *__result = *__first1; 56063e519524SHoward Hinnant ++__result; 56073e519524SHoward Hinnant ++__first1; 56083e519524SHoward Hinnant } 56093e519524SHoward Hinnant ++__first2; 56103e519524SHoward Hinnant } 56113e519524SHoward Hinnant } 56123e519524SHoward Hinnant return __result; 56133e519524SHoward Hinnant} 56143e519524SHoward Hinnant 56153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56173e519524SHoward Hinnant_OutputIterator 56183e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56203e519524SHoward Hinnant{ 5621145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56223e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56233e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56243e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5625145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56263e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56273e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5628145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56293e519524SHoward Hinnant} 56303e519524SHoward Hinnant 56313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56333e519524SHoward Hinnant_OutputIterator 56343e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56353e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56363e519524SHoward Hinnant{ 5637ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56383e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56393e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56403e519524SHoward Hinnant} 56413e519524SHoward Hinnant 56423e519524SHoward Hinnant// set_difference 56433e519524SHoward Hinnant 56443e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56453e519524SHoward Hinnant_OutputIterator 56463e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56473e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56483e519524SHoward Hinnant{ 56493e519524SHoward Hinnant while (__first1 != __last1) 56503e519524SHoward Hinnant { 56513e519524SHoward Hinnant if (__first2 == __last2) 5652ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56533e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56543e519524SHoward Hinnant { 56553e519524SHoward Hinnant *__result = *__first1; 56563e519524SHoward Hinnant ++__result; 56573e519524SHoward Hinnant ++__first1; 56583e519524SHoward Hinnant } 56593e519524SHoward Hinnant else 56603e519524SHoward Hinnant { 56613e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56623e519524SHoward Hinnant ++__first1; 56633e519524SHoward Hinnant ++__first2; 56643e519524SHoward Hinnant } 56653e519524SHoward Hinnant } 56663e519524SHoward Hinnant return __result; 56673e519524SHoward Hinnant} 56683e519524SHoward Hinnant 56693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56713e519524SHoward Hinnant_OutputIterator 56723e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56743e519524SHoward Hinnant{ 5675145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56783e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5679145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56813e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5682145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56833e519524SHoward Hinnant} 56843e519524SHoward Hinnant 56853e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56873e519524SHoward Hinnant_OutputIterator 56883e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56893e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56903e519524SHoward Hinnant{ 5691ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56923e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56933e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56943e519524SHoward Hinnant} 56953e519524SHoward Hinnant 56963e519524SHoward Hinnant// set_symmetric_difference 56973e519524SHoward Hinnant 56983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56993e519524SHoward Hinnant_OutputIterator 57003e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57023e519524SHoward Hinnant{ 57033e519524SHoward Hinnant while (__first1 != __last1) 57043e519524SHoward Hinnant { 57053e519524SHoward Hinnant if (__first2 == __last2) 5706ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 57073e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 57083e519524SHoward Hinnant { 57093e519524SHoward Hinnant *__result = *__first1; 57103e519524SHoward Hinnant ++__result; 57113e519524SHoward Hinnant ++__first1; 57123e519524SHoward Hinnant } 57133e519524SHoward Hinnant else 57143e519524SHoward Hinnant { 57153e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57163e519524SHoward Hinnant { 57173e519524SHoward Hinnant *__result = *__first2; 57183e519524SHoward Hinnant ++__result; 57193e519524SHoward Hinnant } 57203e519524SHoward Hinnant else 57213e519524SHoward Hinnant ++__first1; 57223e519524SHoward Hinnant ++__first2; 57233e519524SHoward Hinnant } 57243e519524SHoward Hinnant } 5725ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 57263e519524SHoward Hinnant} 57273e519524SHoward Hinnant 57283e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 57293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57303e519524SHoward Hinnant_OutputIterator 57313e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57323e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57333e519524SHoward Hinnant{ 5734145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57373e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5738145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57403e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5741145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57423e519524SHoward Hinnant} 57433e519524SHoward Hinnant 57443e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 57453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57463e519524SHoward Hinnant_OutputIterator 57473e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57483e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57493e519524SHoward Hinnant{ 5750ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57513e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57523e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57533e519524SHoward Hinnant} 57543e519524SHoward Hinnant 57553e519524SHoward Hinnant// lexicographical_compare 57563e519524SHoward Hinnant 57573e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57583e519524SHoward Hinnantbool 57593e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57613e519524SHoward Hinnant{ 5762910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57633e519524SHoward Hinnant { 57643e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57653e519524SHoward Hinnant return true; 57663e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57673e519524SHoward Hinnant return false; 57683e519524SHoward Hinnant } 57693e519524SHoward Hinnant return false; 57703e519524SHoward Hinnant} 57713e519524SHoward Hinnant 57723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57743e519524SHoward Hinnantbool 57753e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57773e519524SHoward Hinnant{ 5778145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57813e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5782145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57843e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5785145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57863e519524SHoward Hinnant} 57873e519524SHoward Hinnant 57883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57903e519524SHoward Hinnantbool 57913e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57933e519524SHoward Hinnant{ 5794ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57973e519524SHoward Hinnant} 57983e519524SHoward Hinnant 57993e519524SHoward Hinnant// next_permutation 58003e519524SHoward Hinnant 58013e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58023e519524SHoward Hinnantbool 58033e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58043e519524SHoward Hinnant{ 58053e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58063e519524SHoward Hinnant if (__first == __last || __first == --__i) 58073e519524SHoward Hinnant return false; 58083e519524SHoward Hinnant while (true) 58093e519524SHoward Hinnant { 58103e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58113e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 58123e519524SHoward Hinnant { 58133e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58143e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 58153e519524SHoward Hinnant ; 58163e519524SHoward Hinnant swap(*__i, *__j); 5817ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58183e519524SHoward Hinnant return true; 58193e519524SHoward Hinnant } 58203e519524SHoward Hinnant if (__i == __first) 58213e519524SHoward Hinnant { 5822ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58233e519524SHoward Hinnant return false; 58243e519524SHoward Hinnant } 58253e519524SHoward Hinnant } 58263e519524SHoward Hinnant} 58273e519524SHoward Hinnant 58283e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58303e519524SHoward Hinnantbool 58313e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58323e519524SHoward Hinnant{ 5833145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58363e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5837145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58393e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5840145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58413e519524SHoward Hinnant} 58423e519524SHoward Hinnant 58433e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58453e519524SHoward Hinnantbool 58463e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58473e519524SHoward Hinnant{ 5848ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58493e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58503e519524SHoward Hinnant} 58513e519524SHoward Hinnant 58523e519524SHoward Hinnant// prev_permutation 58533e519524SHoward Hinnant 58543e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58553e519524SHoward Hinnantbool 58563e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58573e519524SHoward Hinnant{ 58583e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58593e519524SHoward Hinnant if (__first == __last || __first == --__i) 58603e519524SHoward Hinnant return false; 58613e519524SHoward Hinnant while (true) 58623e519524SHoward Hinnant { 58633e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58643e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58653e519524SHoward Hinnant { 58663e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58673e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58683e519524SHoward Hinnant ; 58693e519524SHoward Hinnant swap(*__i, *__j); 5870ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58713e519524SHoward Hinnant return true; 58723e519524SHoward Hinnant } 58733e519524SHoward Hinnant if (__i == __first) 58743e519524SHoward Hinnant { 5875ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58763e519524SHoward Hinnant return false; 58773e519524SHoward Hinnant } 58783e519524SHoward Hinnant } 58793e519524SHoward Hinnant} 58803e519524SHoward Hinnant 58813e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58833e519524SHoward Hinnantbool 58843e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58853e519524SHoward Hinnant{ 5886145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58873e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58883e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58893e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5890145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58913e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58923e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5893145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58943e519524SHoward Hinnant} 58953e519524SHoward Hinnant 58963e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58983e519524SHoward Hinnantbool 58993e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 59003e519524SHoward Hinnant{ 5901ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 59023e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 59033e519524SHoward Hinnant} 59043e519524SHoward Hinnant 59053e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 59063e519524SHoward Hinnant 59073e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5908