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 654c1bd9197SEric Fiselier#include <__debug> 655c1bd9197SEric Fiselier 656073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6573e519524SHoward Hinnant#pragma GCC system_header 658073458b1SHoward Hinnant#endif 6593e519524SHoward Hinnant 660a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 661a016efb1SEric Fiselier#include <__undef_macros> 662a016efb1SEric Fiselier 663a016efb1SEric Fiselier 6643e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6653e519524SHoward Hinnant 6669d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6679d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6689d67c6d5SMarshall Clow// * We haven't included <functional> here. 6693e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6703e519524SHoward Hinnantstruct __equal_to 6713e519524SHoward Hinnant{ 6723e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6733e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6743e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6753e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6763e519524SHoward Hinnant}; 6773e519524SHoward Hinnant 6783e519524SHoward Hinnanttemplate <class _T1> 6793e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6803e519524SHoward Hinnant{ 6819d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6829d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6833e519524SHoward Hinnant}; 6843e519524SHoward Hinnant 6853e519524SHoward Hinnanttemplate <class _T1> 6863e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6873e519524SHoward Hinnant{ 6889d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6899d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6903e519524SHoward Hinnant}; 6913e519524SHoward Hinnant 6923e519524SHoward Hinnanttemplate <class _T1> 6933e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6943e519524SHoward Hinnant{ 6959d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6969d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6973e519524SHoward Hinnant}; 6983e519524SHoward Hinnant 6993e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 7003e519524SHoward Hinnantstruct __less 7013e519524SHoward Hinnant{ 7029d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7039d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7049d67c6d5SMarshall Clow 7059d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7069d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7079d67c6d5SMarshall Clow 7089d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7099d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7109d67c6d5SMarshall Clow 7119d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7129d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7133e519524SHoward Hinnant}; 7143e519524SHoward Hinnant 7153e519524SHoward Hinnanttemplate <class _T1> 7163e519524SHoward Hinnantstruct __less<_T1, _T1> 7173e519524SHoward Hinnant{ 7189d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7199d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7203e519524SHoward Hinnant}; 7213e519524SHoward Hinnant 7223e519524SHoward Hinnanttemplate <class _T1> 7233e519524SHoward Hinnantstruct __less<const _T1, _T1> 7243e519524SHoward Hinnant{ 7259d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7269d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7273e519524SHoward Hinnant}; 7283e519524SHoward Hinnant 7293e519524SHoward Hinnanttemplate <class _T1> 7303e519524SHoward Hinnantstruct __less<_T1, const _T1> 7313e519524SHoward Hinnant{ 7329d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7339d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7343e519524SHoward Hinnant}; 7353e519524SHoward Hinnant 7363e519524SHoward Hinnanttemplate <class _Predicate> 737a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7383e519524SHoward Hinnant{ 7393e519524SHoward Hinnantprivate: 7403e519524SHoward Hinnant _Predicate __p_; 7413e519524SHoward Hinnantpublic: 742a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7433e519524SHoward Hinnant 7443e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 745a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7463e519524SHoward Hinnant 7473e519524SHoward Hinnant template <class _T1> 7483e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7493e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7503e519524SHoward Hinnant 7513e519524SHoward Hinnant template <class _T1, class _T2> 7523e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 753a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7543e519524SHoward Hinnant}; 7553e519524SHoward Hinnant 756145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7573e519524SHoward Hinnant 7583e519524SHoward Hinnanttemplate <class _Compare> 7593e519524SHoward Hinnantstruct __debug_less 7603e519524SHoward Hinnant{ 7613e519524SHoward Hinnant _Compare __comp_; 7623e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 763331d2159SEric Fiselier 7643e519524SHoward Hinnant template <class _Tp, class _Up> 7653e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7663e519524SHoward Hinnant { 7673e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7683e519524SHoward Hinnant if (__r) 769331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7703e519524SHoward Hinnant return __r; 7713e519524SHoward Hinnant } 772331d2159SEric Fiselier 773331d2159SEric Fiselier template <class _LHS, class _RHS> 774331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 775331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 776331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 777331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 778331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 779331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 780331d2159SEric Fiselier } 781331d2159SEric Fiselier 782331d2159SEric Fiselier template <class _LHS, class _RHS> 783331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 784331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7853e519524SHoward Hinnant}; 7863e519524SHoward Hinnant 787145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7883e519524SHoward Hinnant 789c8edcb36SHoward Hinnant// Precondition: __x != 0 790c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 79180f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 79280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 793c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 79480f8cfb3SEric Fiselier#else 79580f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 79680f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 79780f8cfb3SEric Fiselier unsigned long where; 79880f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 79980f8cfb3SEric Fiselier // Returns zero if no set bit is found. 80080f8cfb3SEric Fiselier if (_BitScanForward(&where, mask)) 80180f8cfb3SEric Fiselier return where; 80280f8cfb3SEric Fiselier return 32; 80380f8cfb3SEric Fiselier#endif 804c206366fSHoward Hinnant} 805c206366fSHoward Hinnant 806c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 80780f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 80880f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 809c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 81080f8cfb3SEric Fiselier#else 81180f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 81280f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 81380f8cfb3SEric Fiselier#endif 814c206366fSHoward Hinnant} 815c206366fSHoward Hinnant 816c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 81780f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 81880f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 819c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 82080f8cfb3SEric Fiselier#else 82180f8cfb3SEric Fiselier unsigned long where; 82280f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 82380f8cfb3SEric Fiselier// Returns zero if no set bit is found. 82480f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 82580f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 82680f8cfb3SEric Fiselier if (_BitScanForward64(&where, mask)) 82780f8cfb3SEric Fiselier return static_cast<int>(where); 82880f8cfb3SEric Fiselier#else 82980f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 83080f8cfb3SEric Fiselier // Scan the Low Word. 83180f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask))) 83280f8cfb3SEric Fiselier return where; 83380f8cfb3SEric Fiselier // Scan the High Word. 83480f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask >> 32))) 83580f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 83680f8cfb3SEric Fiselier#endif 83780f8cfb3SEric Fiselier return 64; 83880f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 839c206366fSHoward Hinnant} 840c8edcb36SHoward Hinnant 841c8edcb36SHoward Hinnant// Precondition: __x != 0 842c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 84380f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 84480f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 845c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 84680f8cfb3SEric Fiselier#else 84780f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 84880f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 84980f8cfb3SEric Fiselier unsigned long where; 85080f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 85180f8cfb3SEric Fiselier // Returns zero if no set bit is found. 85280f8cfb3SEric Fiselier if (_BitScanReverse(&where, mask)) 85380f8cfb3SEric Fiselier return 31 - where; 85480f8cfb3SEric Fiselier return 32; // Undefined Behavior. 85580f8cfb3SEric Fiselier#endif 856c206366fSHoward Hinnant} 857c206366fSHoward Hinnant 858c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 85980f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 86080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 861c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 86280f8cfb3SEric Fiselier#else 86380f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 86480f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 86580f8cfb3SEric Fiselier#endif 866c206366fSHoward Hinnant} 867c206366fSHoward Hinnant 868c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 86980f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 87080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 871c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 87280f8cfb3SEric Fiselier#else 87380f8cfb3SEric Fiselier unsigned long where; 87480f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 87580f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 87680f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 87780f8cfb3SEric Fiselier if (_BitScanReverse64(&where, mask)) 87880f8cfb3SEric Fiselier return static_cast<int>(63 - where); 87980f8cfb3SEric Fiselier#else 88080f8cfb3SEric Fiselier // Scan the high 32 bits. 88180f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask >> 32))) 88280f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 88380f8cfb3SEric Fiselier // Scan the low 32 bits. 88480f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask))) 88580f8cfb3SEric Fiselier return 63 - where; 88680f8cfb3SEric Fiselier#endif 88780f8cfb3SEric Fiselier return 64; // Undefined Behavior. 88880f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 889c206366fSHoward Hinnant} 890c8edcb36SHoward Hinnant 89180f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 89280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 89380f8cfb3SEric Fiselier return __builtin_popcount (__x); 89480f8cfb3SEric Fiselier#else 89580f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 89680f8cfb3SEric Fiselier return __popcnt(__x); 89780f8cfb3SEric Fiselier#endif 89880f8cfb3SEric Fiselier} 89980f8cfb3SEric Fiselier 90080f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 90180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90280f8cfb3SEric Fiselier return __builtin_popcountl (__x); 90380f8cfb3SEric Fiselier#else 90480f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 90580f8cfb3SEric Fiselier return __popcnt(__x); 90680f8cfb3SEric Fiselier#endif 90780f8cfb3SEric Fiselier} 90880f8cfb3SEric Fiselier 90980f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 91080f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 91180f8cfb3SEric Fiselier return __builtin_popcountll(__x); 91280f8cfb3SEric Fiselier#else 91380f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 91480f8cfb3SEric Fiselier return __popcnt64(__x); 91580f8cfb3SEric Fiselier#endif 91680f8cfb3SEric Fiselier} 917c8edcb36SHoward Hinnant 9183e519524SHoward Hinnant// all_of 9193e519524SHoward Hinnant 9203e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9223e519524SHoward Hinnantbool 9233e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9243e519524SHoward Hinnant{ 9253e519524SHoward Hinnant for (; __first != __last; ++__first) 9263e519524SHoward Hinnant if (!__pred(*__first)) 9273e519524SHoward Hinnant return false; 9283e519524SHoward Hinnant return true; 9293e519524SHoward Hinnant} 9303e519524SHoward Hinnant 9313e519524SHoward Hinnant// any_of 9323e519524SHoward Hinnant 9333e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9353e519524SHoward Hinnantbool 9363e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9373e519524SHoward Hinnant{ 9383e519524SHoward Hinnant for (; __first != __last; ++__first) 9393e519524SHoward Hinnant if (__pred(*__first)) 9403e519524SHoward Hinnant return true; 9413e519524SHoward Hinnant return false; 9423e519524SHoward Hinnant} 9433e519524SHoward Hinnant 9443e519524SHoward Hinnant// none_of 9453e519524SHoward Hinnant 9463e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9483e519524SHoward Hinnantbool 9493e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9503e519524SHoward Hinnant{ 9513e519524SHoward Hinnant for (; __first != __last; ++__first) 9523e519524SHoward Hinnant if (__pred(*__first)) 9533e519524SHoward Hinnant return false; 9543e519524SHoward Hinnant return true; 9553e519524SHoward Hinnant} 9563e519524SHoward Hinnant 9573e519524SHoward Hinnant// for_each 9583e519524SHoward Hinnant 9593e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9613e519524SHoward Hinnant_Function 9623e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9633e519524SHoward Hinnant{ 9643e519524SHoward Hinnant for (; __first != __last; ++__first) 9653e519524SHoward Hinnant __f(*__first); 9661c7fe126SMarshall Clow return __f; 9673e519524SHoward Hinnant} 9683e519524SHoward Hinnant 9691d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 970d5c65ffaSMarshall Clow// for_each_n 971d5c65ffaSMarshall Clow 972d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 973d5c65ffaSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 974d5c65ffaSMarshall Clow_InputIterator 975d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 976d5c65ffaSMarshall Clow{ 977d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 978d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 979d5c65ffaSMarshall Clow while (__n > 0) 980d5c65ffaSMarshall Clow { 981d5c65ffaSMarshall Clow __f(*__first); 982d5c65ffaSMarshall Clow ++__first; 983d5c65ffaSMarshall Clow --__n; 984d5c65ffaSMarshall Clow } 985d5c65ffaSMarshall Clow return __first; 986d5c65ffaSMarshall Clow} 9871d02996dSMarshall Clow#endif 988d5c65ffaSMarshall Clow 9893e519524SHoward Hinnant// find 9903e519524SHoward Hinnant 9913e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9933e519524SHoward Hinnant_InputIterator 994e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9953e519524SHoward Hinnant{ 9963e519524SHoward Hinnant for (; __first != __last; ++__first) 997e4383379SHoward Hinnant if (*__first == __value_) 9983e519524SHoward Hinnant break; 9993e519524SHoward Hinnant return __first; 10003e519524SHoward Hinnant} 10013e519524SHoward Hinnant 10023e519524SHoward Hinnant// find_if 10033e519524SHoward Hinnant 10043e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10063e519524SHoward Hinnant_InputIterator 10073e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10083e519524SHoward Hinnant{ 10093e519524SHoward Hinnant for (; __first != __last; ++__first) 10103e519524SHoward Hinnant if (__pred(*__first)) 10113e519524SHoward Hinnant break; 10123e519524SHoward Hinnant return __first; 10133e519524SHoward Hinnant} 10143e519524SHoward Hinnant 10153e519524SHoward Hinnant// find_if_not 10163e519524SHoward Hinnant 10173e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10193e519524SHoward Hinnant_InputIterator 10203e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10213e519524SHoward Hinnant{ 10223e519524SHoward Hinnant for (; __first != __last; ++__first) 10233e519524SHoward Hinnant if (!__pred(*__first)) 10243e519524SHoward Hinnant break; 10253e519524SHoward Hinnant return __first; 10263e519524SHoward Hinnant} 10273e519524SHoward Hinnant 10283e519524SHoward Hinnant// find_end 10293e519524SHoward Hinnant 10303e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10313e519524SHoward Hinnant_ForwardIterator1 10323e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10333e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10343e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10353e519524SHoward Hinnant{ 10363e519524SHoward Hinnant // modeled after search algorithm 10373e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10383e519524SHoward Hinnant if (__first2 == __last2) 10393e519524SHoward Hinnant return __r; 10403e519524SHoward Hinnant while (true) 10413e519524SHoward Hinnant { 10423e519524SHoward Hinnant while (true) 10433e519524SHoward Hinnant { 10443e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10453e519524SHoward Hinnant return __r; // (or __last1 if never found) 10463e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10473e519524SHoward Hinnant break; 10483e519524SHoward Hinnant ++__first1; 10493e519524SHoward Hinnant } 10503e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10513e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10523e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10533e519524SHoward Hinnant while (true) 10543e519524SHoward Hinnant { 10553e519524SHoward Hinnant if (++__m2 == __last2) 10563e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10573e519524SHoward Hinnant __r = __first1; 10583e519524SHoward Hinnant ++__first1; 10593e519524SHoward Hinnant break; 10603e519524SHoward Hinnant } 10613e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10623e519524SHoward Hinnant return __r; 10633e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10643e519524SHoward Hinnant { 10653e519524SHoward Hinnant ++__first1; 10663e519524SHoward Hinnant break; 10673e519524SHoward Hinnant } // else there is a match, check next elements 10683e519524SHoward Hinnant } 10693e519524SHoward Hinnant } 10703e519524SHoward Hinnant} 10713e519524SHoward Hinnant 10723e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10733e519524SHoward Hinnant_BidirectionalIterator1 10743e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10753e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10763e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10773e519524SHoward Hinnant{ 10783e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10793e519524SHoward Hinnant if (__first2 == __last2) 10803e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10813e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10823e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10833e519524SHoward Hinnant --__l2; 10843e519524SHoward Hinnant while (true) 10853e519524SHoward Hinnant { 10863e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10873e519524SHoward Hinnant while (true) 10883e519524SHoward Hinnant { 10893e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10903e519524SHoward Hinnant return __last1; 10913e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10923e519524SHoward Hinnant break; 10933e519524SHoward Hinnant } 10943e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10953e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10963e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10973e519524SHoward Hinnant while (true) 10983e519524SHoward Hinnant { 10993e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 11003e519524SHoward Hinnant return __m1; 11013e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 11023e519524SHoward Hinnant return __last1; 11033e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11043e519524SHoward Hinnant { 11053e519524SHoward Hinnant break; 11063e519524SHoward Hinnant } // else there is a match, check next elements 11073e519524SHoward Hinnant } 11083e519524SHoward Hinnant } 11093e519524SHoward Hinnant} 11103e519524SHoward Hinnant 11113e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11129b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11133e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11143e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11153e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11163e519524SHoward Hinnant{ 11173e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11183e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11193e519524SHoward Hinnant if (__len2 == 0) 11203e519524SHoward Hinnant return __last1; 11213e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11223e519524SHoward Hinnant if (__len1 < __len2) 11233e519524SHoward Hinnant return __last1; 11243e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11253e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11263e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11273e519524SHoward Hinnant --__l2; 11283e519524SHoward Hinnant while (true) 11293e519524SHoward Hinnant { 11303e519524SHoward Hinnant while (true) 11313e519524SHoward Hinnant { 11323e519524SHoward Hinnant if (__s == __l1) 11333e519524SHoward Hinnant return __last1; 11343e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11353e519524SHoward Hinnant break; 11363e519524SHoward Hinnant } 11373e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11383e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11393e519524SHoward Hinnant while (true) 11403e519524SHoward Hinnant { 11413e519524SHoward Hinnant if (__m2 == __first2) 11423e519524SHoward Hinnant return __m1; 11433e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11443e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11453e519524SHoward Hinnant { 11463e519524SHoward Hinnant break; 11473e519524SHoward Hinnant } 11483e519524SHoward Hinnant } 11493e519524SHoward Hinnant } 11503e519524SHoward Hinnant} 11513e519524SHoward Hinnant 11523e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11543e519524SHoward Hinnant_ForwardIterator1 11553e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11563e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11573e519524SHoward Hinnant{ 1158ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11593e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11603e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11613e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11623e519524SHoward Hinnant} 11633e519524SHoward Hinnant 11643e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11663e519524SHoward Hinnant_ForwardIterator1 11673e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11683e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11693e519524SHoward Hinnant{ 11703e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1172ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11733e519524SHoward Hinnant} 11743e519524SHoward Hinnant 11753e519524SHoward Hinnant// find_first_of 11763e519524SHoward Hinnant 11773e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11789b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11799b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11803e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11813e519524SHoward Hinnant{ 11823e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11833e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11843e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11853e519524SHoward Hinnant return __first1; 11863e519524SHoward Hinnant return __last1; 11873e519524SHoward Hinnant} 11883e519524SHoward Hinnant 11899b0af34dSMarshall Clow 11909b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11919b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11929b0af34dSMarshall Clow_ForwardIterator1 11939b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11949b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11959b0af34dSMarshall Clow{ 11969b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11979b0af34dSMarshall Clow} 11989b0af34dSMarshall Clow 11993e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12013e519524SHoward Hinnant_ForwardIterator1 12023e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12033e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12043e519524SHoward Hinnant{ 12053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12079b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12083e519524SHoward Hinnant} 12093e519524SHoward Hinnant 12103e519524SHoward Hinnant// adjacent_find 12113e519524SHoward Hinnant 12123e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12143e519524SHoward Hinnant_ForwardIterator 12153e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12163e519524SHoward Hinnant{ 12173e519524SHoward Hinnant if (__first != __last) 12183e519524SHoward Hinnant { 12193e519524SHoward Hinnant _ForwardIterator __i = __first; 12203e519524SHoward Hinnant while (++__i != __last) 12213e519524SHoward Hinnant { 12223e519524SHoward Hinnant if (__pred(*__first, *__i)) 12233e519524SHoward Hinnant return __first; 12243e519524SHoward Hinnant __first = __i; 12253e519524SHoward Hinnant } 12263e519524SHoward Hinnant } 12273e519524SHoward Hinnant return __last; 12283e519524SHoward Hinnant} 12293e519524SHoward Hinnant 12303e519524SHoward Hinnanttemplate <class _ForwardIterator> 12313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12323e519524SHoward Hinnant_ForwardIterator 12333e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12343e519524SHoward Hinnant{ 12353e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1236ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12373e519524SHoward Hinnant} 12383e519524SHoward Hinnant 12393e519524SHoward Hinnant// count 12403e519524SHoward Hinnant 12413e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12433e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1244e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12453e519524SHoward Hinnant{ 12463e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12473e519524SHoward Hinnant for (; __first != __last; ++__first) 1248e4383379SHoward Hinnant if (*__first == __value_) 12493e519524SHoward Hinnant ++__r; 12503e519524SHoward Hinnant return __r; 12513e519524SHoward Hinnant} 12523e519524SHoward Hinnant 12533e519524SHoward Hinnant// count_if 12543e519524SHoward Hinnant 12553e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12573e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12583e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12593e519524SHoward Hinnant{ 12603e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12613e519524SHoward Hinnant for (; __first != __last; ++__first) 12623e519524SHoward Hinnant if (__pred(*__first)) 12633e519524SHoward Hinnant ++__r; 12643e519524SHoward Hinnant return __r; 12653e519524SHoward Hinnant} 12663e519524SHoward Hinnant 12673e519524SHoward Hinnant// mismatch 12683e519524SHoward Hinnant 12693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12713e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12723e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12733e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12743e519524SHoward Hinnant{ 1275bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12763e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12773e519524SHoward Hinnant break; 12783e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12793e519524SHoward Hinnant} 12803e519524SHoward Hinnant 12813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12833e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12843e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12853e519524SHoward Hinnant{ 12863e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12873e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1288ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12893e519524SHoward Hinnant} 12903e519524SHoward Hinnant 12910b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12920b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12930b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12940b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12950b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12960b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12970b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12980b0bbd2fSMarshall Clow{ 1299bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13000b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13010b0bbd2fSMarshall Clow break; 13020b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 13030b0bbd2fSMarshall Clow} 13040b0bbd2fSMarshall Clow 13050b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13060b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13070b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13080b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13090b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13100b0bbd2fSMarshall Clow{ 13110b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13120b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13130b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13140b0bbd2fSMarshall Clow} 13150b0bbd2fSMarshall Clow#endif 13160b0bbd2fSMarshall Clow 13173e519524SHoward Hinnant// equal 13183e519524SHoward Hinnant 13193e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13213e519524SHoward Hinnantbool 13223e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13233e519524SHoward Hinnant{ 1324910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13253e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13263e519524SHoward Hinnant return false; 13273e519524SHoward Hinnant return true; 13283e519524SHoward Hinnant} 13293e519524SHoward Hinnant 13303e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13323e519524SHoward Hinnantbool 13333e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13343e519524SHoward Hinnant{ 13353e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13363e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1337ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13383e519524SHoward Hinnant} 13393e519524SHoward Hinnant 13400b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13410b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13420b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13430b0bbd2fSMarshall Clowbool 13440b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13450b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13460b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13470b0bbd2fSMarshall Clow{ 1348910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13490b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13500b0bbd2fSMarshall Clow return false; 13510b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13520b0bbd2fSMarshall Clow} 13530b0bbd2fSMarshall Clow 13540b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13550b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13560b0bbd2fSMarshall Clowbool 13570b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13580b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13590b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13600b0bbd2fSMarshall Clow{ 13610b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13620b0bbd2fSMarshall Clow return false; 13630b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13640b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13650b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13660b0bbd2fSMarshall Clow} 13670b0bbd2fSMarshall Clow 13680b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13690b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13700b0bbd2fSMarshall Clowbool 13710b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13720b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13730b0bbd2fSMarshall Clow{ 13740b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13750b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13760b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13770b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13780b0bbd2fSMarshall Clow} 13790b0bbd2fSMarshall Clow 13800b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13810b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13820b0bbd2fSMarshall Clowbool 13830b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13840b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13850b0bbd2fSMarshall Clow{ 13860b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13870b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13880b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13890b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13900b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13910b0bbd2fSMarshall Clow} 13920b0bbd2fSMarshall Clow#endif 13930b0bbd2fSMarshall Clow 13943e519524SHoward Hinnant// is_permutation 13953e519524SHoward Hinnant 13963e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13973e519524SHoward Hinnantbool 13983e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13993e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 14003e519524SHoward Hinnant{ 14013e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1402910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 14033e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 14043e519524SHoward Hinnant goto __not_done; 14053e519524SHoward Hinnant return true; 14063e519524SHoward Hinnant__not_done: 14073e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 14083e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1409ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14103e519524SHoward Hinnant if (__l1 == _D1(1)) 14113e519524SHoward Hinnant return false; 1412ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14133e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14143e519524SHoward Hinnant // equal elements in [f2, l2) 14153e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14163e519524SHoward Hinnant { 14173e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 14183e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14193e519524SHoward Hinnant if (__pred(*__j, *__i)) 14203e519524SHoward Hinnant goto __next_iter; 14213e519524SHoward Hinnant { 14223e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14233e519524SHoward Hinnant _D1 __c2 = 0; 14243e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14253e519524SHoward Hinnant if (__pred(*__i, *__j)) 14263e519524SHoward Hinnant ++__c2; 14273e519524SHoward Hinnant if (__c2 == 0) 14283e519524SHoward Hinnant return false; 14293e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14303e519524SHoward Hinnant _D1 __c1 = 1; 1431ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14323e519524SHoward Hinnant if (__pred(*__i, *__j)) 14333e519524SHoward Hinnant ++__c1; 14343e519524SHoward Hinnant if (__c1 != __c2) 14353e519524SHoward Hinnant return false; 14363e519524SHoward Hinnant } 14373e519524SHoward Hinnant__next_iter:; 14383e519524SHoward Hinnant } 14393e519524SHoward Hinnant return true; 14403e519524SHoward Hinnant} 14413e519524SHoward Hinnant 14423e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 14433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14443e519524SHoward Hinnantbool 14453e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14463e519524SHoward Hinnant _ForwardIterator2 __first2) 14473e519524SHoward Hinnant{ 14483e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1450ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14513e519524SHoward Hinnant} 14523e519524SHoward Hinnant 14530b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14540b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14550b0bbd2fSMarshall Clowbool 14560b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14570b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14580b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14590b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14600b0bbd2fSMarshall Clow{ 14610b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1462847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14630b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 14640b0bbd2fSMarshall Clow goto __not_done; 14650b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 14660b0bbd2fSMarshall Clow__not_done: 14670b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 14680b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14690b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14700b0bbd2fSMarshall Clow 14710b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1472fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14730b0bbd2fSMarshall Clow if (__l1 != __l2) 14740b0bbd2fSMarshall Clow return false; 14750b0bbd2fSMarshall Clow 14760b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14770b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14780b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14790b0bbd2fSMarshall Clow { 14800b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 14810b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14820b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 14830b0bbd2fSMarshall Clow goto __next_iter; 14840b0bbd2fSMarshall Clow { 14850b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14860b0bbd2fSMarshall Clow _D1 __c2 = 0; 14870b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14880b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14890b0bbd2fSMarshall Clow ++__c2; 14900b0bbd2fSMarshall Clow if (__c2 == 0) 14910b0bbd2fSMarshall Clow return false; 14920b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14930b0bbd2fSMarshall Clow _D1 __c1 = 1; 14940b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14950b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14960b0bbd2fSMarshall Clow ++__c1; 14970b0bbd2fSMarshall Clow if (__c1 != __c2) 14980b0bbd2fSMarshall Clow return false; 14990b0bbd2fSMarshall Clow } 15000b0bbd2fSMarshall Clow__next_iter:; 15010b0bbd2fSMarshall Clow } 15020b0bbd2fSMarshall Clow return true; 15030b0bbd2fSMarshall Clow} 15040b0bbd2fSMarshall Clow 15050b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 15060b0bbd2fSMarshall Clowbool 15070b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 15080b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 15090b0bbd2fSMarshall Clow _BinaryPredicate __pred, 15100b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 15110b0bbd2fSMarshall Clow{ 15120b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 15130b0bbd2fSMarshall Clow return false; 15140b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 15150b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 15160b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 15170b0bbd2fSMarshall Clow} 15180b0bbd2fSMarshall Clow 15190b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15200b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15210b0bbd2fSMarshall Clowbool 15220b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15230b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 15240b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15250b0bbd2fSMarshall Clow{ 15260b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15270b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15280b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15290b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15300b0bbd2fSMarshall Clow} 15310b0bbd2fSMarshall Clow 15320b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 15330b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15340b0bbd2fSMarshall Clowbool 15350b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15360b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15370b0bbd2fSMarshall Clow{ 15380b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15390b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15400b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15410b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15420b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15430b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15440b0bbd2fSMarshall Clow} 15450b0bbd2fSMarshall Clow#endif 15460b0bbd2fSMarshall Clow 15473e519524SHoward Hinnant// search 15483e519524SHoward Hinnant 15493e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 155028cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 15513e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15523e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 15533e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 15543e519524SHoward Hinnant{ 15553e519524SHoward Hinnant if (__first2 == __last2) 155628cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 15573e519524SHoward Hinnant while (true) 15583e519524SHoward Hinnant { 15593e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 15603e519524SHoward Hinnant while (true) 15613e519524SHoward Hinnant { 15623e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 156328cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15643e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15653e519524SHoward Hinnant break; 15663e519524SHoward Hinnant ++__first1; 15673e519524SHoward Hinnant } 15683e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 15693e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 15703e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 15713e519524SHoward Hinnant while (true) 15723e519524SHoward Hinnant { 15733e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 157428cc4ddeSMarshall Clow return make_pair(__first1, __m1); 15753e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 157628cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15773e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 15783e519524SHoward Hinnant { 15793e519524SHoward Hinnant ++__first1; 15803e519524SHoward Hinnant break; 15813e519524SHoward Hinnant } // else there is a match, check next elements 15823e519524SHoward Hinnant } 15833e519524SHoward Hinnant } 15843e519524SHoward Hinnant} 15853e519524SHoward Hinnant 15863e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 158728cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 158828cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 15893e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 15903e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 15913e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 15923e519524SHoward Hinnant{ 159328cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 159428cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 15953e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 159628cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 15973e519524SHoward Hinnant if (__len2 == 0) 159828cc4ddeSMarshall Clow return make_pair(__first1, __first1); 159928cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 16003e519524SHoward Hinnant if (__len1 < __len2) 160128cc4ddeSMarshall Clow return make_pair(__last1, __last1); 16023e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 1603b9775795SAditya Kumar 16043e519524SHoward Hinnant while (true) 16053e519524SHoward Hinnant { 16063e519524SHoward Hinnant while (true) 16073e519524SHoward Hinnant { 16083e519524SHoward Hinnant if (__first1 == __s) 160928cc4ddeSMarshall Clow return make_pair(__last1, __last1); 16103e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 16113e519524SHoward Hinnant break; 16123e519524SHoward Hinnant ++__first1; 16133e519524SHoward Hinnant } 1614b9775795SAditya Kumar 16153e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 16163e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 16173e519524SHoward Hinnant while (true) 16183e519524SHoward Hinnant { 16193e519524SHoward Hinnant if (++__m2 == __last2) 162028cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 16213e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 16223e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 16233e519524SHoward Hinnant { 16243e519524SHoward Hinnant ++__first1; 16253e519524SHoward Hinnant break; 16263e519524SHoward Hinnant } 16273e519524SHoward Hinnant } 16283e519524SHoward Hinnant } 16293e519524SHoward Hinnant} 16303e519524SHoward Hinnant 16313e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 16323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16333e519524SHoward Hinnant_ForwardIterator1 16343e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16353e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 16363e519524SHoward Hinnant{ 1637ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 16383e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 163928cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 164028cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 164128cc4ddeSMarshall Clow .first; 16423e519524SHoward Hinnant} 16433e519524SHoward Hinnant 16443e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16463e519524SHoward Hinnant_ForwardIterator1 16473e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16483e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16493e519524SHoward Hinnant{ 165028cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 165128cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1652ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16533e519524SHoward Hinnant} 16543e519524SHoward Hinnant 16553e519524SHoward Hinnant// search_n 16563e519524SHoward Hinnant 16573e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16583e519524SHoward Hinnant_ForwardIterator 16593e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1660e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16613e519524SHoward Hinnant{ 16623e519524SHoward Hinnant if (__count <= 0) 16633e519524SHoward Hinnant return __first; 16643e519524SHoward Hinnant while (true) 16653e519524SHoward Hinnant { 1666e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16673e519524SHoward Hinnant while (true) 16683e519524SHoward Hinnant { 1669e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16703e519524SHoward Hinnant return __last; 1671e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16723e519524SHoward Hinnant break; 16733e519524SHoward Hinnant ++__first; 16743e519524SHoward Hinnant } 1675e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16763e519524SHoward Hinnant _ForwardIterator __m = __first; 16773e519524SHoward Hinnant _Size __c(0); 16783e519524SHoward Hinnant while (true) 16793e519524SHoward Hinnant { 16803e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16813e519524SHoward Hinnant return __first; 16823e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16833e519524SHoward Hinnant return __last; 1684e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16853e519524SHoward Hinnant { 16863e519524SHoward Hinnant __first = __m; 16873e519524SHoward Hinnant ++__first; 16883e519524SHoward Hinnant break; 16893e519524SHoward Hinnant } // else there is a match, check next elements 16903e519524SHoward Hinnant } 16913e519524SHoward Hinnant } 16923e519524SHoward Hinnant} 16933e519524SHoward Hinnant 16943e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16953e519524SHoward Hinnant_RandomAccessIterator 16963e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1697e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16983e519524SHoward Hinnant{ 16993e519524SHoward Hinnant if (__count <= 0) 17003e519524SHoward Hinnant return __first; 17013e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 17023e519524SHoward Hinnant if (__len < __count) 17033e519524SHoward Hinnant return __last; 17043e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 17053e519524SHoward Hinnant while (true) 17063e519524SHoward Hinnant { 1707e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 17083e519524SHoward Hinnant while (true) 17093e519524SHoward Hinnant { 1710b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 17113e519524SHoward Hinnant return __last; 1712e4383379SHoward Hinnant if (__pred(*__first, __value_)) 17133e519524SHoward Hinnant break; 17143e519524SHoward Hinnant ++__first; 17153e519524SHoward Hinnant } 1716e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 17173e519524SHoward Hinnant _RandomAccessIterator __m = __first; 17183e519524SHoward Hinnant _Size __c(0); 17193e519524SHoward Hinnant while (true) 17203e519524SHoward Hinnant { 17213e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 17223e519524SHoward Hinnant return __first; 17233e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1724e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 17253e519524SHoward Hinnant { 17263e519524SHoward Hinnant __first = __m; 17273e519524SHoward Hinnant ++__first; 17283e519524SHoward Hinnant break; 17293e519524SHoward Hinnant } // else there is a match, check next elements 17303e519524SHoward Hinnant } 17313e519524SHoward Hinnant } 17323e519524SHoward Hinnant} 17333e519524SHoward Hinnant 17343e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 17353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17363e519524SHoward Hinnant_ForwardIterator 17373e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1738e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 17393e519524SHoward Hinnant{ 1740ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 174151544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 174251544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 17433e519524SHoward Hinnant} 17443e519524SHoward Hinnant 17453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17473e519524SHoward Hinnant_ForwardIterator 1748e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17493e519524SHoward Hinnant{ 17503e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 175151544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 175251544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17533e519524SHoward Hinnant} 17543e519524SHoward Hinnant 17553e519524SHoward Hinnant// copy 17563e519524SHoward Hinnanttemplate <class _Iter> 17573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17583e519524SHoward Hinnant_Iter 17593e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17603e519524SHoward Hinnant{ 17613e519524SHoward Hinnant return __i; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _Tp> 17655b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnanttypename enable_if 17673e519524SHoward Hinnant< 1768ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17693e519524SHoward Hinnant _Tp* 17703e519524SHoward Hinnant>::type 17713e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17723e519524SHoward Hinnant{ 17733e519524SHoward Hinnant return __i.base(); 17743e519524SHoward Hinnant} 17753e519524SHoward Hinnant 1776fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1777fc88dbd2SHoward Hinnant 17783e519524SHoward Hinnanttemplate <class _Tp> 17795b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17803e519524SHoward Hinnanttypename enable_if 17813e519524SHoward Hinnant< 1782ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17833e519524SHoward Hinnant _Tp* 17843e519524SHoward Hinnant>::type 17853e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17863e519524SHoward Hinnant{ 17873e519524SHoward Hinnant return __i.base(); 17883e519524SHoward Hinnant} 17893e519524SHoward Hinnant 179014bd0bf0SEric Fiselier#else 179114bd0bf0SEric Fiselier 179214bd0bf0SEric Fiseliertemplate <class _Tp> 17935b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 179414bd0bf0SEric Fiseliertypename enable_if 179514bd0bf0SEric Fiselier< 179614bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 179714bd0bf0SEric Fiselier __wrap_iter<_Tp*> 179814bd0bf0SEric Fiselier>::type 179914bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 180014bd0bf0SEric Fiselier{ 180114bd0bf0SEric Fiselier return __i; 180214bd0bf0SEric Fiselier} 180314bd0bf0SEric Fiselier 1804fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1805fc88dbd2SHoward Hinnant 18063e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18083e519524SHoward Hinnant_OutputIterator 18093e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18103e519524SHoward Hinnant{ 1811910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 18123e519524SHoward Hinnant *__result = *__first; 18133e519524SHoward Hinnant return __result; 18143e519524SHoward Hinnant} 18153e519524SHoward Hinnant 18163e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18183e519524SHoward Hinnanttypename enable_if 18193e519524SHoward Hinnant< 18203e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1821ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18223e519524SHoward Hinnant _Up* 18233e519524SHoward Hinnant>::type 18243e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 18253e519524SHoward Hinnant{ 18263e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18275b312052SMarshall Clow if (__n > 0) 1828ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18293e519524SHoward Hinnant return __result + __n; 18303e519524SHoward Hinnant} 18313e519524SHoward Hinnant 18323e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18343e519524SHoward Hinnant_OutputIterator 18353e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18363e519524SHoward Hinnant{ 1837ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18383e519524SHoward Hinnant} 18393e519524SHoward Hinnant 18403e519524SHoward Hinnant// copy_backward 18413e519524SHoward Hinnant 1842d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 18433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18443e519524SHoward Hinnant_OutputIterator 1845d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 18463e519524SHoward Hinnant{ 18473e519524SHoward Hinnant while (__first != __last) 18483e519524SHoward Hinnant *--__result = *--__last; 18493e519524SHoward Hinnant return __result; 18503e519524SHoward Hinnant} 18513e519524SHoward Hinnant 18523e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18543e519524SHoward Hinnanttypename enable_if 18553e519524SHoward Hinnant< 18563e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1857ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18583e519524SHoward Hinnant _Up* 18593e519524SHoward Hinnant>::type 18603e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18613e519524SHoward Hinnant{ 18623e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18635b312052SMarshall Clow if (__n > 0) 18645b312052SMarshall Clow { 18653e519524SHoward Hinnant __result -= __n; 1866ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18675b312052SMarshall Clow } 18683e519524SHoward Hinnant return __result; 18693e519524SHoward Hinnant} 18703e519524SHoward Hinnant 18713e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18733e519524SHoward Hinnant_BidirectionalIterator2 18743e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18753e519524SHoward Hinnant _BidirectionalIterator2 __result) 18763e519524SHoward Hinnant{ 1877fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1878fd838227SEric Fiselier __unwrap_iter(__last), 1879fd838227SEric Fiselier __unwrap_iter(__result)); 18803e519524SHoward Hinnant} 18813e519524SHoward Hinnant 18823e519524SHoward Hinnant// copy_if 18833e519524SHoward Hinnant 18843e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18863e519524SHoward Hinnant_OutputIterator 18873e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18883e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18893e519524SHoward Hinnant{ 18903e519524SHoward Hinnant for (; __first != __last; ++__first) 18913e519524SHoward Hinnant { 18923e519524SHoward Hinnant if (__pred(*__first)) 18933e519524SHoward Hinnant { 18943e519524SHoward Hinnant *__result = *__first; 18953e519524SHoward Hinnant ++__result; 18963e519524SHoward Hinnant } 18973e519524SHoward Hinnant } 18983e519524SHoward Hinnant return __result; 18993e519524SHoward Hinnant} 19003e519524SHoward Hinnant 19013e519524SHoward Hinnant// copy_n 19023e519524SHoward Hinnant 19033e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19053e519524SHoward Hinnanttypename enable_if 19063e519524SHoward Hinnant< 19073e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 19083e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 19093e519524SHoward Hinnant _OutputIterator 19103e519524SHoward Hinnant>::type 191151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19123e519524SHoward Hinnant{ 191351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 191451544023SEric Fiselier _IntegralSize __n = __orig_n; 191599847d2bSHoward Hinnant if (__n > 0) 191699847d2bSHoward Hinnant { 19173e519524SHoward Hinnant *__result = *__first; 191899847d2bSHoward Hinnant ++__result; 191999847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 192099847d2bSHoward Hinnant { 192199847d2bSHoward Hinnant ++__first; 192299847d2bSHoward Hinnant *__result = *__first; 192399847d2bSHoward Hinnant ++__result; 192499847d2bSHoward Hinnant } 192599847d2bSHoward Hinnant } 19263e519524SHoward Hinnant return __result; 19273e519524SHoward Hinnant} 19283e519524SHoward Hinnant 19293e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19313e519524SHoward Hinnanttypename enable_if 19323e519524SHoward Hinnant< 19333e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 19343e519524SHoward Hinnant _OutputIterator 19353e519524SHoward Hinnant>::type 193651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19373e519524SHoward Hinnant{ 193851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 193951544023SEric Fiselier _IntegralSize __n = __orig_n; 1940ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 19413e519524SHoward Hinnant} 19423e519524SHoward Hinnant 19433e519524SHoward Hinnant// move 19443e519524SHoward Hinnant 19453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19473e519524SHoward Hinnant_OutputIterator 19483e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19493e519524SHoward Hinnant{ 1950910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1951ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 19523e519524SHoward Hinnant return __result; 19533e519524SHoward Hinnant} 19543e519524SHoward Hinnant 19553e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19573e519524SHoward Hinnanttypename enable_if 19583e519524SHoward Hinnant< 19593e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1960ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19613e519524SHoward Hinnant _Up* 19623e519524SHoward Hinnant>::type 19633e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19643e519524SHoward Hinnant{ 19653e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19665b312052SMarshall Clow if (__n > 0) 1967ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19683e519524SHoward Hinnant return __result + __n; 19693e519524SHoward Hinnant} 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnant_OutputIterator 19743e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19753e519524SHoward Hinnant{ 1976ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19773e519524SHoward Hinnant} 19783e519524SHoward Hinnant 19793e519524SHoward Hinnant// move_backward 19803e519524SHoward Hinnant 19813e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19833e519524SHoward Hinnant_OutputIterator 19843e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19853e519524SHoward Hinnant{ 19863e519524SHoward Hinnant while (__first != __last) 1987ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19883e519524SHoward Hinnant return __result; 19893e519524SHoward Hinnant} 19903e519524SHoward Hinnant 19913e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19933e519524SHoward Hinnanttypename enable_if 19943e519524SHoward Hinnant< 19953e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1996ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19973e519524SHoward Hinnant _Up* 19983e519524SHoward Hinnant>::type 19993e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 20003e519524SHoward Hinnant{ 20013e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 20025b312052SMarshall Clow if (__n > 0) 20035b312052SMarshall Clow { 20043e519524SHoward Hinnant __result -= __n; 2005ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 20065b312052SMarshall Clow } 20073e519524SHoward Hinnant return __result; 20083e519524SHoward Hinnant} 20093e519524SHoward Hinnant 20103e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 20113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20123e519524SHoward Hinnant_BidirectionalIterator2 20133e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 20143e519524SHoward Hinnant _BidirectionalIterator2 __result) 20153e519524SHoward Hinnant{ 2016ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 20173e519524SHoward Hinnant} 20183e519524SHoward Hinnant 20193e519524SHoward Hinnant// iter_swap 20203e519524SHoward Hinnant 2021a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 20223e519524SHoward Hinnant 20233e519524SHoward Hinnant// transform 20243e519524SHoward Hinnant 20253e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 20263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20273e519524SHoward Hinnant_OutputIterator 20283e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 20293e519524SHoward Hinnant{ 2030910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20313e519524SHoward Hinnant *__result = __op(*__first); 20323e519524SHoward Hinnant return __result; 20333e519524SHoward Hinnant} 20343e519524SHoward Hinnant 20353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 20363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20373e519524SHoward Hinnant_OutputIterator 20383e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 20393e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 20403e519524SHoward Hinnant{ 2041910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 20423e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 20433e519524SHoward Hinnant return __result; 20443e519524SHoward Hinnant} 20453e519524SHoward Hinnant 20463e519524SHoward Hinnant// replace 20473e519524SHoward Hinnant 20483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20503e519524SHoward Hinnantvoid 20513e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20523e519524SHoward Hinnant{ 20533e519524SHoward Hinnant for (; __first != __last; ++__first) 20543e519524SHoward Hinnant if (*__first == __old_value) 20553e519524SHoward Hinnant *__first = __new_value; 20563e519524SHoward Hinnant} 20573e519524SHoward Hinnant 20583e519524SHoward Hinnant// replace_if 20593e519524SHoward Hinnant 20603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20623e519524SHoward Hinnantvoid 20633e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20643e519524SHoward Hinnant{ 20653e519524SHoward Hinnant for (; __first != __last; ++__first) 20663e519524SHoward Hinnant if (__pred(*__first)) 20673e519524SHoward Hinnant *__first = __new_value; 20683e519524SHoward Hinnant} 20693e519524SHoward Hinnant 20703e519524SHoward Hinnant// replace_copy 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20743e519524SHoward Hinnant_OutputIterator 20753e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20763e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20773e519524SHoward Hinnant{ 2078910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20793e519524SHoward Hinnant if (*__first == __old_value) 20803e519524SHoward Hinnant *__result = __new_value; 20813e519524SHoward Hinnant else 20823e519524SHoward Hinnant *__result = *__first; 20833e519524SHoward Hinnant return __result; 20843e519524SHoward Hinnant} 20853e519524SHoward Hinnant 20863e519524SHoward Hinnant// replace_copy_if 20873e519524SHoward Hinnant 20883e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20903e519524SHoward Hinnant_OutputIterator 20913e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20923e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20933e519524SHoward Hinnant{ 2094910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20953e519524SHoward Hinnant if (__pred(*__first)) 20963e519524SHoward Hinnant *__result = __new_value; 20973e519524SHoward Hinnant else 20983e519524SHoward Hinnant *__result = *__first; 20993e519524SHoward Hinnant return __result; 21003e519524SHoward Hinnant} 21013e519524SHoward Hinnant 21023e519524SHoward Hinnant// fill_n 21033e519524SHoward Hinnant 21043e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21063e519524SHoward Hinnant_OutputIterator 21070f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21083e519524SHoward Hinnant{ 2109910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2110e4383379SHoward Hinnant *__first = __value_; 21113e519524SHoward Hinnant return __first; 21123e519524SHoward Hinnant} 21133e519524SHoward Hinnant 21140f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 21153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21160f242beaSHoward Hinnanttypename enable_if 21170f242beaSHoward Hinnant< 21180f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 21190f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 21200f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 21210f242beaSHoward Hinnant _Tp* 21220f242beaSHoward Hinnant>::type 21230f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 21243e519524SHoward Hinnant{ 21253e519524SHoward Hinnant if (__n > 0) 2126e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 21273e519524SHoward Hinnant return __first + __n; 21283e519524SHoward Hinnant} 21293e519524SHoward Hinnant 21303e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21323e519524SHoward Hinnant_OutputIterator 2133e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21343e519524SHoward Hinnant{ 213551544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 21363e519524SHoward Hinnant} 21373e519524SHoward Hinnant 21383e519524SHoward Hinnant// fill 21393e519524SHoward Hinnant 21403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21423e519524SHoward Hinnantvoid 2143e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 21443e519524SHoward Hinnant{ 21453e519524SHoward Hinnant for (; __first != __last; ++__first) 2146e4383379SHoward Hinnant *__first = __value_; 21473e519524SHoward Hinnant} 21483e519524SHoward Hinnant 21493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 21503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21513e519524SHoward Hinnantvoid 2152e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 21533e519524SHoward Hinnant{ 2154e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 21553e519524SHoward Hinnant} 21563e519524SHoward Hinnant 21573e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21593e519524SHoward Hinnantvoid 2160e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21613e519524SHoward Hinnant{ 2162e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21633e519524SHoward Hinnant} 21643e519524SHoward Hinnant 21653e519524SHoward Hinnant// generate 21663e519524SHoward Hinnant 21673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21693e519524SHoward Hinnantvoid 21703e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21713e519524SHoward Hinnant{ 21723e519524SHoward Hinnant for (; __first != __last; ++__first) 21733e519524SHoward Hinnant *__first = __gen(); 21743e519524SHoward Hinnant} 21753e519524SHoward Hinnant 21763e519524SHoward Hinnant// generate_n 21773e519524SHoward Hinnant 21783e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21803e519524SHoward Hinnant_OutputIterator 218151544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21823e519524SHoward Hinnant{ 218351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 218451544023SEric Fiselier _IntegralSize __n = __orig_n; 2185910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21863e519524SHoward Hinnant *__first = __gen(); 21873e519524SHoward Hinnant return __first; 21883e519524SHoward Hinnant} 21893e519524SHoward Hinnant 21903e519524SHoward Hinnant// remove 21913e519524SHoward Hinnant 21923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21933e519524SHoward Hinnant_ForwardIterator 2194e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21953e519524SHoward Hinnant{ 2196e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21973e519524SHoward Hinnant if (__first != __last) 21983e519524SHoward Hinnant { 21993e519524SHoward Hinnant _ForwardIterator __i = __first; 22003e519524SHoward Hinnant while (++__i != __last) 22013e519524SHoward Hinnant { 2202e4383379SHoward Hinnant if (!(*__i == __value_)) 22033e519524SHoward Hinnant { 2204ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22053e519524SHoward Hinnant ++__first; 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant } 22083e519524SHoward Hinnant } 22093e519524SHoward Hinnant return __first; 22103e519524SHoward Hinnant} 22113e519524SHoward Hinnant 22123e519524SHoward Hinnant// remove_if 22133e519524SHoward Hinnant 22143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 22153e519524SHoward Hinnant_ForwardIterator 22163e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 22173e519524SHoward Hinnant{ 2218ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 22193e519524SHoward Hinnant (__first, __last, __pred); 22203e519524SHoward Hinnant if (__first != __last) 22213e519524SHoward Hinnant { 22223e519524SHoward Hinnant _ForwardIterator __i = __first; 22233e519524SHoward Hinnant while (++__i != __last) 22243e519524SHoward Hinnant { 22253e519524SHoward Hinnant if (!__pred(*__i)) 22263e519524SHoward Hinnant { 2227ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22283e519524SHoward Hinnant ++__first; 22293e519524SHoward Hinnant } 22303e519524SHoward Hinnant } 22313e519524SHoward Hinnant } 22323e519524SHoward Hinnant return __first; 22333e519524SHoward Hinnant} 22343e519524SHoward Hinnant 22353e519524SHoward Hinnant// remove_copy 22363e519524SHoward Hinnant 22373e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 22383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22393e519524SHoward Hinnant_OutputIterator 2240e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 22413e519524SHoward Hinnant{ 22423e519524SHoward Hinnant for (; __first != __last; ++__first) 22433e519524SHoward Hinnant { 2244e4383379SHoward Hinnant if (!(*__first == __value_)) 22453e519524SHoward Hinnant { 22463e519524SHoward Hinnant *__result = *__first; 22473e519524SHoward Hinnant ++__result; 22483e519524SHoward Hinnant } 22493e519524SHoward Hinnant } 22503e519524SHoward Hinnant return __result; 22513e519524SHoward Hinnant} 22523e519524SHoward Hinnant 22533e519524SHoward Hinnant// remove_copy_if 22543e519524SHoward Hinnant 22553e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 22563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22573e519524SHoward Hinnant_OutputIterator 22583e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 22593e519524SHoward Hinnant{ 22603e519524SHoward Hinnant for (; __first != __last; ++__first) 22613e519524SHoward Hinnant { 22623e519524SHoward Hinnant if (!__pred(*__first)) 22633e519524SHoward Hinnant { 22643e519524SHoward Hinnant *__result = *__first; 22653e519524SHoward Hinnant ++__result; 22663e519524SHoward Hinnant } 22673e519524SHoward Hinnant } 22683e519524SHoward Hinnant return __result; 22693e519524SHoward Hinnant} 22703e519524SHoward Hinnant 22713e519524SHoward Hinnant// unique 22723e519524SHoward Hinnant 22733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22743e519524SHoward Hinnant_ForwardIterator 22753e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22763e519524SHoward Hinnant{ 2277ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22783e519524SHoward Hinnant (__first, __last, __pred); 22793e519524SHoward Hinnant if (__first != __last) 22803e519524SHoward Hinnant { 22813e519524SHoward Hinnant // ... a a ? ... 22823e519524SHoward Hinnant // f i 22833e519524SHoward Hinnant _ForwardIterator __i = __first; 22843e519524SHoward Hinnant for (++__i; ++__i != __last;) 22853e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2286ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22873e519524SHoward Hinnant ++__first; 22883e519524SHoward Hinnant } 22893e519524SHoward Hinnant return __first; 22903e519524SHoward Hinnant} 22913e519524SHoward Hinnant 22923e519524SHoward Hinnanttemplate <class _ForwardIterator> 22933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22943e519524SHoward Hinnant_ForwardIterator 22953e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22963e519524SHoward Hinnant{ 22973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2298ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22993e519524SHoward Hinnant} 23003e519524SHoward Hinnant 23013e519524SHoward Hinnant// unique_copy 23023e519524SHoward Hinnant 23033e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 23043e519524SHoward Hinnant_OutputIterator 23053e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23063e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 23073e519524SHoward Hinnant{ 23083e519524SHoward Hinnant if (__first != __last) 23093e519524SHoward Hinnant { 23103e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 23113e519524SHoward Hinnant *__result = __t; 23123e519524SHoward Hinnant ++__result; 23133e519524SHoward Hinnant while (++__first != __last) 23143e519524SHoward Hinnant { 23153e519524SHoward Hinnant if (!__pred(__t, *__first)) 23163e519524SHoward Hinnant { 23173e519524SHoward Hinnant __t = *__first; 23183e519524SHoward Hinnant *__result = __t; 23193e519524SHoward Hinnant ++__result; 23203e519524SHoward Hinnant } 23213e519524SHoward Hinnant } 23223e519524SHoward Hinnant } 23233e519524SHoward Hinnant return __result; 23243e519524SHoward Hinnant} 23253e519524SHoward Hinnant 23263e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 23273e519524SHoward Hinnant_OutputIterator 23283e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23293e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 23303e519524SHoward Hinnant{ 23313e519524SHoward Hinnant if (__first != __last) 23323e519524SHoward Hinnant { 23333e519524SHoward Hinnant _ForwardIterator __i = __first; 23343e519524SHoward Hinnant *__result = *__i; 23353e519524SHoward Hinnant ++__result; 23363e519524SHoward Hinnant while (++__first != __last) 23373e519524SHoward Hinnant { 23383e519524SHoward Hinnant if (!__pred(*__i, *__first)) 23393e519524SHoward Hinnant { 23403e519524SHoward Hinnant *__result = *__first; 23413e519524SHoward Hinnant ++__result; 23423e519524SHoward Hinnant __i = __first; 23433e519524SHoward Hinnant } 23443e519524SHoward Hinnant } 23453e519524SHoward Hinnant } 23463e519524SHoward Hinnant return __result; 23473e519524SHoward Hinnant} 23483e519524SHoward Hinnant 23493e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 23503e519524SHoward Hinnant_ForwardIterator 23513e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 23523e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 23533e519524SHoward Hinnant{ 23543e519524SHoward Hinnant if (__first != __last) 23553e519524SHoward Hinnant { 23563e519524SHoward Hinnant *__result = *__first; 23573e519524SHoward Hinnant while (++__first != __last) 23583e519524SHoward Hinnant if (!__pred(*__result, *__first)) 23593e519524SHoward Hinnant *++__result = *__first; 23603e519524SHoward Hinnant ++__result; 23613e519524SHoward Hinnant } 23623e519524SHoward Hinnant return __result; 23633e519524SHoward Hinnant} 23643e519524SHoward Hinnant 23653e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23673e519524SHoward Hinnant_OutputIterator 23683e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23693e519524SHoward Hinnant{ 2370ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23713e519524SHoward Hinnant (__first, __last, __result, __pred, 23723e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23733e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23743e519524SHoward Hinnant} 23753e519524SHoward Hinnant 23763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23783e519524SHoward Hinnant_OutputIterator 23793e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23803e519524SHoward Hinnant{ 23813e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2382ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23833e519524SHoward Hinnant} 23843e519524SHoward Hinnant 23853e519524SHoward Hinnant// reverse 23863e519524SHoward Hinnant 23873e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23893e519524SHoward Hinnantvoid 23903e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23913e519524SHoward Hinnant{ 23923e519524SHoward Hinnant while (__first != __last) 23933e519524SHoward Hinnant { 23943e519524SHoward Hinnant if (__first == --__last) 23953e519524SHoward Hinnant break; 2396def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23973e519524SHoward Hinnant ++__first; 23983e519524SHoward Hinnant } 23993e519524SHoward Hinnant} 24003e519524SHoward Hinnant 24013e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 24023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24033e519524SHoward Hinnantvoid 24043e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 24053e519524SHoward Hinnant{ 24063e519524SHoward Hinnant if (__first != __last) 24073e519524SHoward Hinnant for (; __first < --__last; ++__first) 2408def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 24093e519524SHoward Hinnant} 24103e519524SHoward Hinnant 24113e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 24123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24133e519524SHoward Hinnantvoid 24143e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 24153e519524SHoward Hinnant{ 2416ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 24173e519524SHoward Hinnant} 24183e519524SHoward Hinnant 24193e519524SHoward Hinnant// reverse_copy 24203e519524SHoward Hinnant 24213e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 24223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24233e519524SHoward Hinnant_OutputIterator 24243e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 24253e519524SHoward Hinnant{ 24263e519524SHoward Hinnant for (; __first != __last; ++__result) 24273e519524SHoward Hinnant *__result = *--__last; 24283e519524SHoward Hinnant return __result; 24293e519524SHoward Hinnant} 24303e519524SHoward Hinnant 24313e519524SHoward Hinnant// rotate 24323e519524SHoward Hinnant 24333e519524SHoward Hinnanttemplate <class _ForwardIterator> 24343e519524SHoward Hinnant_ForwardIterator 2435aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 24363e519524SHoward Hinnant{ 2437aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2438aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2439aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2440aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2441aca09de3SHoward Hinnant return __lm1; 2442aca09de3SHoward Hinnant} 2443aca09de3SHoward Hinnant 2444aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2445aca09de3SHoward Hinnant_BidirectionalIterator 2446aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2447aca09de3SHoward Hinnant{ 2448aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2449aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2450aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2451aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2452aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2453aca09de3SHoward Hinnant return __fp1; 2454aca09de3SHoward Hinnant} 2455aca09de3SHoward Hinnant 2456aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2457aca09de3SHoward Hinnant_ForwardIterator 2458aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2459aca09de3SHoward Hinnant{ 24603e519524SHoward Hinnant _ForwardIterator __i = __middle; 24613e519524SHoward Hinnant while (true) 24623e519524SHoward Hinnant { 24633e519524SHoward Hinnant swap(*__first, *__i); 24643e519524SHoward Hinnant ++__first; 24653e519524SHoward Hinnant if (++__i == __last) 24663e519524SHoward Hinnant break; 24673e519524SHoward Hinnant if (__first == __middle) 24683e519524SHoward Hinnant __middle = __i; 24693e519524SHoward Hinnant } 24703e519524SHoward Hinnant _ForwardIterator __r = __first; 24713e519524SHoward Hinnant if (__first != __middle) 24723e519524SHoward Hinnant { 24733e519524SHoward Hinnant __i = __middle; 24743e519524SHoward Hinnant while (true) 24753e519524SHoward Hinnant { 24763e519524SHoward Hinnant swap(*__first, *__i); 24773e519524SHoward Hinnant ++__first; 24783e519524SHoward Hinnant if (++__i == __last) 24793e519524SHoward Hinnant { 24803e519524SHoward Hinnant if (__first == __middle) 24813e519524SHoward Hinnant break; 24823e519524SHoward Hinnant __i = __middle; 24833e519524SHoward Hinnant } 24843e519524SHoward Hinnant else if (__first == __middle) 24853e519524SHoward Hinnant __middle = __i; 24863e519524SHoward Hinnant } 24873e519524SHoward Hinnant } 24883e519524SHoward Hinnant return __r; 24893e519524SHoward Hinnant} 24903e519524SHoward Hinnant 24913e519524SHoward Hinnanttemplate<typename _Integral> 24923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24933e519524SHoward Hinnant_Integral 249419b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24953e519524SHoward Hinnant{ 24963e519524SHoward Hinnant do 24973e519524SHoward Hinnant { 24983e519524SHoward Hinnant _Integral __t = __x % __y; 24993e519524SHoward Hinnant __x = __y; 25003e519524SHoward Hinnant __y = __t; 25013e519524SHoward Hinnant } while (__y); 25023e519524SHoward Hinnant return __x; 25033e519524SHoward Hinnant} 25043e519524SHoward Hinnant 25053e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 25063e519524SHoward Hinnant_RandomAccessIterator 2507aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 25083e519524SHoward Hinnant{ 25093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 25103e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 25113e519524SHoward Hinnant 25123e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 25133e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 25143e519524SHoward Hinnant if (__m1 == __m2) 25153e519524SHoward Hinnant { 2516ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 25173e519524SHoward Hinnant return __middle; 25183e519524SHoward Hinnant } 251919b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 25203e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 25213e519524SHoward Hinnant { 2522aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 25233e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 25243e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 25253e519524SHoward Hinnant do 25263e519524SHoward Hinnant { 2527aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 25283e519524SHoward Hinnant __p1 = __p2; 25293e519524SHoward Hinnant const difference_type __d = __last - __p2; 25303e519524SHoward Hinnant if (__m1 < __d) 25313e519524SHoward Hinnant __p2 += __m1; 25323e519524SHoward Hinnant else 25333e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 25343e519524SHoward Hinnant } while (__p2 != __p); 2535aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 25363e519524SHoward Hinnant } 25373e519524SHoward Hinnant return __first + __m2; 25383e519524SHoward Hinnant} 25393e519524SHoward Hinnant 25403e519524SHoward Hinnanttemplate <class _ForwardIterator> 25413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25423e519524SHoward Hinnant_ForwardIterator 2543aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2544aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2545aca09de3SHoward Hinnant{ 2546aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2547aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2548aca09de3SHoward Hinnant { 2549aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2550aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2551aca09de3SHoward Hinnant } 2552aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2553aca09de3SHoward Hinnant} 2554aca09de3SHoward Hinnant 2555aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2556aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2557aca09de3SHoward Hinnant_BidirectionalIterator 2558aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2559aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2560aca09de3SHoward Hinnant{ 2561aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2562aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2563aca09de3SHoward Hinnant { 2564aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2565aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2566aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2567aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2568aca09de3SHoward Hinnant } 2569aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2570aca09de3SHoward Hinnant} 2571aca09de3SHoward Hinnant 2572aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2573aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2574aca09de3SHoward Hinnant_RandomAccessIterator 2575aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2576aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2577aca09de3SHoward Hinnant{ 2578aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2579aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2580aca09de3SHoward Hinnant { 2581aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2582aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2583aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2584aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2585aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2586aca09de3SHoward Hinnant } 2587aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2588aca09de3SHoward Hinnant} 2589aca09de3SHoward Hinnant 2590aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2591aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2592aca09de3SHoward Hinnant_ForwardIterator 25933e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25943e519524SHoward Hinnant{ 2595aca09de3SHoward Hinnant if (__first == __middle) 2596aca09de3SHoward Hinnant return __last; 2597aca09de3SHoward Hinnant if (__middle == __last) 2598aca09de3SHoward Hinnant return __first; 2599ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2600aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 26013e519524SHoward Hinnant} 26023e519524SHoward Hinnant 26033e519524SHoward Hinnant// rotate_copy 26043e519524SHoward Hinnant 26053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 26063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26073e519524SHoward Hinnant_OutputIterator 26083e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 26093e519524SHoward Hinnant{ 2610ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 26113e519524SHoward Hinnant} 26123e519524SHoward Hinnant 26133e519524SHoward Hinnant// min_element 26143e519524SHoward Hinnant 26153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26169d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26173e519524SHoward Hinnant_ForwardIterator 26180b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26193e519524SHoward Hinnant{ 26203e519524SHoward Hinnant if (__first != __last) 26213e519524SHoward Hinnant { 26223e519524SHoward Hinnant _ForwardIterator __i = __first; 26233e519524SHoward Hinnant while (++__i != __last) 26243e519524SHoward Hinnant if (__comp(*__i, *__first)) 26253e519524SHoward Hinnant __first = __i; 26263e519524SHoward Hinnant } 26273e519524SHoward Hinnant return __first; 26283e519524SHoward Hinnant} 26293e519524SHoward Hinnant 26303e519524SHoward Hinnanttemplate <class _ForwardIterator> 26310b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26323e519524SHoward Hinnant_ForwardIterator 26333e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 26343e519524SHoward Hinnant{ 26350b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 26364eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26374eb27b79SHoward Hinnant} 26384eb27b79SHoward Hinnant 26394eb27b79SHoward Hinnant// min 26404eb27b79SHoward Hinnant 26414eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26429d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26434eb27b79SHoward Hinnantconst _Tp& 26444eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 26454eb27b79SHoward Hinnant{ 26464eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 26474eb27b79SHoward Hinnant} 26484eb27b79SHoward Hinnant 26494eb27b79SHoward Hinnanttemplate <class _Tp> 26509d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26514eb27b79SHoward Hinnantconst _Tp& 26524eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 26534eb27b79SHoward Hinnant{ 2654ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26554eb27b79SHoward Hinnant} 26564eb27b79SHoward Hinnant 2657ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265854976f26SHoward Hinnant 26594eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26614eb27b79SHoward Hinnant_Tp 26624eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26634eb27b79SHoward Hinnant{ 26640b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26654eb27b79SHoward Hinnant} 26664eb27b79SHoward Hinnant 26674eb27b79SHoward Hinnanttemplate<class _Tp> 26689d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26694eb27b79SHoward Hinnant_Tp 26704eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26714eb27b79SHoward Hinnant{ 26720b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26733e519524SHoward Hinnant} 26743e519524SHoward Hinnant 2675ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 267654976f26SHoward Hinnant 26773e519524SHoward Hinnant// max_element 26783e519524SHoward Hinnant 26793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26809d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26813e519524SHoward Hinnant_ForwardIterator 26820b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26833e519524SHoward Hinnant{ 26843e519524SHoward Hinnant if (__first != __last) 26853e519524SHoward Hinnant { 26863e519524SHoward Hinnant _ForwardIterator __i = __first; 26873e519524SHoward Hinnant while (++__i != __last) 26883e519524SHoward Hinnant if (__comp(*__first, *__i)) 26893e519524SHoward Hinnant __first = __i; 26903e519524SHoward Hinnant } 26913e519524SHoward Hinnant return __first; 26923e519524SHoward Hinnant} 26933e519524SHoward Hinnant 26949d67c6d5SMarshall Clow 26953e519524SHoward Hinnanttemplate <class _ForwardIterator> 26960b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26973e519524SHoward Hinnant_ForwardIterator 26983e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26993e519524SHoward Hinnant{ 27000b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 27014eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27024eb27b79SHoward Hinnant} 27034eb27b79SHoward Hinnant 27044eb27b79SHoward Hinnant// max 27054eb27b79SHoward Hinnant 27064eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 27079d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27084eb27b79SHoward Hinnantconst _Tp& 27094eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27104eb27b79SHoward Hinnant{ 27114eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 27124eb27b79SHoward Hinnant} 27134eb27b79SHoward Hinnant 27144eb27b79SHoward Hinnanttemplate <class _Tp> 27159d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27164eb27b79SHoward Hinnantconst _Tp& 27174eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 27184eb27b79SHoward Hinnant{ 2719ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 27204eb27b79SHoward Hinnant} 27214eb27b79SHoward Hinnant 2722ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 272354976f26SHoward Hinnant 27244eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27264eb27b79SHoward Hinnant_Tp 27274eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 27284eb27b79SHoward Hinnant{ 27290b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 27304eb27b79SHoward Hinnant} 27314eb27b79SHoward Hinnant 27324eb27b79SHoward Hinnanttemplate<class _Tp> 27339d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27344eb27b79SHoward Hinnant_Tp 27354eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 27364eb27b79SHoward Hinnant{ 27370b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 27383e519524SHoward Hinnant} 27393e519524SHoward Hinnant 2740ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 274154976f26SHoward Hinnant 2742146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2743146c14acSMarshall Clow// clamp 2744146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2745146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2746146c14acSMarshall Clowconst _Tp& 2747146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2748146c14acSMarshall Clow{ 2749146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2750146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2751146c14acSMarshall Clow 2752146c14acSMarshall Clow} 2753146c14acSMarshall Clow 2754146c14acSMarshall Clowtemplate<class _Tp> 2755146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2756146c14acSMarshall Clowconst _Tp& 2757146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2758146c14acSMarshall Clow{ 2759146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2760146c14acSMarshall Clow} 2761146c14acSMarshall Clow#endif 2762146c14acSMarshall Clow 27633e519524SHoward Hinnant// minmax_element 27643e519524SHoward Hinnant 27653e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27660b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27673e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27683e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27693e519524SHoward Hinnant{ 27703e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27713e519524SHoward Hinnant if (__first != __last) 27723e519524SHoward Hinnant { 27733e519524SHoward Hinnant if (++__first != __last) 27743e519524SHoward Hinnant { 27753e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27763e519524SHoward Hinnant __result.first = __first; 27773e519524SHoward Hinnant else 27783e519524SHoward Hinnant __result.second = __first; 27793e519524SHoward Hinnant while (++__first != __last) 27803e519524SHoward Hinnant { 27813e519524SHoward Hinnant _ForwardIterator __i = __first; 27823e519524SHoward Hinnant if (++__first == __last) 27833e519524SHoward Hinnant { 27843e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27853e519524SHoward Hinnant __result.first = __i; 27863e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27873e519524SHoward Hinnant __result.second = __i; 27883e519524SHoward Hinnant break; 27893e519524SHoward Hinnant } 27903e519524SHoward Hinnant else 27913e519524SHoward Hinnant { 27923e519524SHoward Hinnant if (__comp(*__first, *__i)) 27933e519524SHoward Hinnant { 27943e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27953e519524SHoward Hinnant __result.first = __first; 27963e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27973e519524SHoward Hinnant __result.second = __i; 27983e519524SHoward Hinnant } 27993e519524SHoward Hinnant else 28003e519524SHoward Hinnant { 28013e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 28023e519524SHoward Hinnant __result.first = __i; 28033e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 28043e519524SHoward Hinnant __result.second = __first; 28053e519524SHoward Hinnant } 28063e519524SHoward Hinnant } 28073e519524SHoward Hinnant } 28083e519524SHoward Hinnant } 28093e519524SHoward Hinnant } 28103e519524SHoward Hinnant return __result; 28113e519524SHoward Hinnant} 28123e519524SHoward Hinnant 28133e519524SHoward Hinnanttemplate <class _ForwardIterator> 28140b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28153e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 28163e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 28173e519524SHoward Hinnant{ 28189d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 28199d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 28203e519524SHoward Hinnant} 28213e519524SHoward Hinnant 28224eb27b79SHoward Hinnant// minmax 28234eb27b79SHoward Hinnant 28244eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28264eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28274eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 28284eb27b79SHoward Hinnant{ 28294eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 28304eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 28314eb27b79SHoward Hinnant} 28324eb27b79SHoward Hinnant 28334eb27b79SHoward Hinnanttemplate<class _Tp> 28349d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28354eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28364eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 28374eb27b79SHoward Hinnant{ 2838ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 28394eb27b79SHoward Hinnant} 28404eb27b79SHoward Hinnant 2841ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 284254976f26SHoward Hinnant 28434eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28449d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28454eb27b79SHoward Hinnantpair<_Tp, _Tp> 28464eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28474eb27b79SHoward Hinnant{ 28489d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28499d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28509d67c6d5SMarshall Clow _Iter __last = __t.end(); 28519d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 28529d67c6d5SMarshall Clow 28539d67c6d5SMarshall Clow ++__first; 28549d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28559d67c6d5SMarshall Clow { 28569d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28579d67c6d5SMarshall Clow __result.first = *__first; 28589d67c6d5SMarshall Clow else 28599d67c6d5SMarshall Clow __result.second = *__first; 28609d67c6d5SMarshall Clow ++__first; 28619d67c6d5SMarshall Clow } 28629d67c6d5SMarshall Clow 28639d67c6d5SMarshall Clow while (__first != __last) 28649d67c6d5SMarshall Clow { 28659d67c6d5SMarshall Clow _Tp __prev = *__first++; 2866002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2867002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2868002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28699d67c6d5SMarshall Clow } 28709d67c6d5SMarshall Clow else { 2871002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2872002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28739d67c6d5SMarshall Clow } 28749d67c6d5SMarshall Clow 28759d67c6d5SMarshall Clow __first++; 28769d67c6d5SMarshall Clow } 28779d67c6d5SMarshall Clow return __result; 28789d67c6d5SMarshall Clow} 28799d67c6d5SMarshall Clow 28809d67c6d5SMarshall Clowtemplate<class _Tp> 28819d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28829d67c6d5SMarshall Clowpair<_Tp, _Tp> 28839d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28849d67c6d5SMarshall Clow{ 28859d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28864eb27b79SHoward Hinnant} 28874eb27b79SHoward Hinnant 2888ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 288954976f26SHoward Hinnant 28903e519524SHoward Hinnant// random_shuffle 28913e519524SHoward Hinnant 2892f9d540b0SHoward Hinnant// __independent_bits_engine 2893f9d540b0SHoward Hinnant 2894c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2895f9d540b0SHoward Hinnantstruct __log2_imp 28963e519524SHoward Hinnant{ 2897c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2898c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28993e519524SHoward Hinnant}; 29003e519524SHoward Hinnant 2901c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2902c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 29033e519524SHoward Hinnant{ 2904f9d540b0SHoward Hinnant static const size_t value = 0; 29053e519524SHoward Hinnant}; 29063e519524SHoward Hinnant 2907c003db1fSHoward Hinnanttemplate <size_t _Rp> 2908c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 29093e519524SHoward Hinnant{ 2910c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 29113e519524SHoward Hinnant}; 29123e519524SHoward Hinnant 291389918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2914f9d540b0SHoward Hinnantstruct __log2 29153e519524SHoward Hinnant{ 2916c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 291789918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 29183e519524SHoward Hinnant}; 29193e519524SHoward Hinnant 2920f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2921f9d540b0SHoward Hinnantclass __independent_bits_engine 29223e519524SHoward Hinnant{ 2923f9d540b0SHoward Hinnantpublic: 2924f9d540b0SHoward Hinnant // types 2925f9d540b0SHoward Hinnant typedef _UIntType result_type; 2926f9d540b0SHoward Hinnant 2927f9d540b0SHoward Hinnantprivate: 2928f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2929f9d540b0SHoward Hinnant typedef typename conditional 2930f9d540b0SHoward Hinnant < 2931f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2932f9d540b0SHoward Hinnant result_type, 2933f9d540b0SHoward Hinnant _Engine_result_type 2934f9d540b0SHoward Hinnant >::type _Working_result_type; 2935f9d540b0SHoward Hinnant 2936f9d540b0SHoward Hinnant _Engine& __e_; 2937f9d540b0SHoward Hinnant size_t __w_; 2938f9d540b0SHoward Hinnant size_t __w0_; 2939f9d540b0SHoward Hinnant size_t __n_; 2940f9d540b0SHoward Hinnant size_t __n0_; 2941f9d540b0SHoward Hinnant _Working_result_type __y0_; 2942f9d540b0SHoward Hinnant _Working_result_type __y1_; 2943f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2944f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2945f9d540b0SHoward Hinnant 2946ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2947c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2948f9d540b0SHoward Hinnant + _Working_result_type(1); 2949e386b7b3SHoward Hinnant#else 2950e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2951e386b7b3SHoward Hinnant + _Working_result_type(1); 2952e386b7b3SHoward Hinnant#endif 2953e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2954e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2955e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2956f9d540b0SHoward Hinnant 2957f9d540b0SHoward Hinnantpublic: 2958f9d540b0SHoward Hinnant // constructors and seeding functions 2959f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2960f9d540b0SHoward Hinnant 2961f9d540b0SHoward Hinnant // generating functions 2962c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2963f9d540b0SHoward Hinnant 2964f9d540b0SHoward Hinnantprivate: 2965f9d540b0SHoward Hinnant result_type __eval(false_type); 2966f9d540b0SHoward Hinnant result_type __eval(true_type); 2967f9d540b0SHoward Hinnant}; 2968f9d540b0SHoward Hinnant 2969f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2970f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2971f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2972f9d540b0SHoward Hinnant : __e_(__e), 2973f9d540b0SHoward Hinnant __w_(__w) 2974f9d540b0SHoward Hinnant{ 2975f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2976f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2977c003db1fSHoward Hinnant if (_Rp == 0) 2978c003db1fSHoward Hinnant __y0_ = _Rp; 2979f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2980c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2981f9d540b0SHoward Hinnant else 2982f9d540b0SHoward Hinnant __y0_ = 0; 2983c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2984f9d540b0SHoward Hinnant { 2985f9d540b0SHoward Hinnant ++__n_; 2986f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2987f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2988c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2989f9d540b0SHoward Hinnant else 2990f9d540b0SHoward Hinnant __y0_ = 0; 2991f9d540b0SHoward Hinnant } 2992f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2993f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2994c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2995f9d540b0SHoward Hinnant else 2996f9d540b0SHoward Hinnant __y1_ = 0; 2997f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2998f9d540b0SHoward Hinnant _Engine_result_type(0); 2999f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 3000f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 3001f9d540b0SHoward Hinnant _Engine_result_type(~0); 30023e519524SHoward Hinnant} 30033e519524SHoward Hinnant 3004f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3005f9d540b0SHoward Hinnantinline 3006f9d540b0SHoward Hinnant_UIntType 3007f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 30083e519524SHoward Hinnant{ 3009f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 30103e519524SHoward Hinnant} 30113e519524SHoward Hinnant 3012f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 3013f9d540b0SHoward Hinnant_UIntType 3014f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 30153e519524SHoward Hinnant{ 3016*5beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 3017c003db1fSHoward Hinnant result_type _Sp = 0; 3018f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 3019f9d540b0SHoward Hinnant { 3020f9d540b0SHoward Hinnant _Engine_result_type __u; 30213e519524SHoward Hinnant do 3022f9d540b0SHoward Hinnant { 3023f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3024f9d540b0SHoward Hinnant } while (__u >= __y0_); 3025*5beb2c3aSMarshall Clow if (__w0_ < _WRt) 3026c003db1fSHoward Hinnant _Sp <<= __w0_; 3027f9d540b0SHoward Hinnant else 3028c003db1fSHoward Hinnant _Sp = 0; 3029c003db1fSHoward Hinnant _Sp += __u & __mask0_; 3030f9d540b0SHoward Hinnant } 3031f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 3032f9d540b0SHoward Hinnant { 3033f9d540b0SHoward Hinnant _Engine_result_type __u; 3034f9d540b0SHoward Hinnant do 3035f9d540b0SHoward Hinnant { 3036f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3037f9d540b0SHoward Hinnant } while (__u >= __y1_); 3038*5beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 3039c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3040f9d540b0SHoward Hinnant else 3041c003db1fSHoward Hinnant _Sp = 0; 3042c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3043f9d540b0SHoward Hinnant } 3044c003db1fSHoward Hinnant return _Sp; 30453e519524SHoward Hinnant} 30463e519524SHoward Hinnant 3047f9d540b0SHoward Hinnant// uniform_int_distribution 30483e519524SHoward Hinnant 3049f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3050f9d540b0SHoward Hinnantclass uniform_int_distribution 30513e519524SHoward Hinnant{ 3052f9d540b0SHoward Hinnantpublic: 3053f9d540b0SHoward Hinnant // types 3054f9d540b0SHoward Hinnant typedef _IntType result_type; 3055f9d540b0SHoward Hinnant 3056f9d540b0SHoward Hinnant class param_type 3057f9d540b0SHoward Hinnant { 3058f9d540b0SHoward Hinnant result_type __a_; 3059f9d540b0SHoward Hinnant result_type __b_; 3060f9d540b0SHoward Hinnant public: 3061f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3062f9d540b0SHoward Hinnant 3063f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3064f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3065f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3066f9d540b0SHoward Hinnant 3067f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3068f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3069f9d540b0SHoward Hinnant 3070f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3071f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3072f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3073f9d540b0SHoward Hinnant {return !(__x == __y);} 30743e519524SHoward Hinnant }; 30753e519524SHoward Hinnant 3076f9d540b0SHoward Hinnantprivate: 3077f9d540b0SHoward Hinnant param_type __p_; 30783e519524SHoward Hinnant 3079f9d540b0SHoward Hinnantpublic: 3080f9d540b0SHoward Hinnant // constructors and reset functions 3081f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3082f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3083f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3084f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3085f9d540b0SHoward Hinnant void reset() {} 3086f9d540b0SHoward Hinnant 3087f9d540b0SHoward Hinnant // generating functions 3088f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3089f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3090f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3091f9d540b0SHoward Hinnant 3092f9d540b0SHoward Hinnant // property functions 3093f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3094f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3095f9d540b0SHoward Hinnant 3096f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3097f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3098f9d540b0SHoward Hinnant 3099f9d540b0SHoward Hinnant result_type min() const {return a();} 3100f9d540b0SHoward Hinnant result_type max() const {return b();} 3101f9d540b0SHoward Hinnant 3102f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3103f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3104f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3105f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3106f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3107f9d540b0SHoward Hinnant {return !(__x == __y);} 31083e519524SHoward Hinnant}; 31093e519524SHoward Hinnant 3110f9d540b0SHoward Hinnanttemplate<class _IntType> 3111f9d540b0SHoward Hinnanttemplate<class _URNG> 3112f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3113f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 31143e519524SHoward Hinnant{ 3115f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3116f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3117c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3118c003db1fSHoward Hinnant if (_Rp == 1) 3119f9d540b0SHoward Hinnant return __p.a(); 3120f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3121f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3122c003db1fSHoward Hinnant if (_Rp == 0) 3123f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3124c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3125a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3126f9d540b0SHoward Hinnant ++__w; 3127f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3128f9d540b0SHoward Hinnant _UIntType __u; 3129f9d540b0SHoward Hinnant do 31303e519524SHoward Hinnant { 3131f9d540b0SHoward Hinnant __u = __e(); 3132c003db1fSHoward Hinnant } while (__u >= _Rp); 3133f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31343e519524SHoward Hinnant} 3135f9d540b0SHoward Hinnant 313666f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 313766f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3138f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3139f9d540b0SHoward Hinnant 3140f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3141f9d540b0SHoward Hinnant 3142f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31433e519524SHoward Hinnant{ 3144f9d540b0SHoward Hinnant static unsigned __c_; 3145f9d540b0SHoward Hinnant 3146f9d540b0SHoward Hinnant __rs_default(); 3147f9d540b0SHoward Hinnantpublic: 3148b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3149f9d540b0SHoward Hinnant 3150f9d540b0SHoward Hinnant static const result_type _Min = 0; 3151f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3152f9d540b0SHoward Hinnant 3153f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3154f9d540b0SHoward Hinnant ~__rs_default(); 3155f9d540b0SHoward Hinnant 3156f9d540b0SHoward Hinnant result_type operator()(); 3157f9d540b0SHoward Hinnant 3158788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3159788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3160f9d540b0SHoward Hinnant 3161f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3162f9d540b0SHoward Hinnant}; 3163f9d540b0SHoward Hinnant 3164f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31653e519524SHoward Hinnant 31663e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31673e519524SHoward Hinnantvoid 31683e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31693e519524SHoward Hinnant{ 31703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3171c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3172c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31733e519524SHoward Hinnant difference_type __d = __last - __first; 31743e519524SHoward Hinnant if (__d > 1) 31753e519524SHoward Hinnant { 3176c003db1fSHoward Hinnant _Dp __uid; 3177f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3178f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3179007b26beSHoward Hinnant { 3180c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3181007b26beSHoward Hinnant if (__i != difference_type(0)) 3182007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3183007b26beSHoward Hinnant } 31843e519524SHoward Hinnant } 31853e519524SHoward Hinnant} 31863e519524SHoward Hinnant 31873e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31883e519524SHoward Hinnantvoid 31893e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3190ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31913e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31923e519524SHoward Hinnant#else 31933e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31943e519524SHoward Hinnant#endif 31953e519524SHoward Hinnant{ 31963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31973e519524SHoward Hinnant difference_type __d = __last - __first; 31983e519524SHoward Hinnant if (__d > 1) 31993e519524SHoward Hinnant { 32003e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3201007b26beSHoward Hinnant { 3202007b26beSHoward Hinnant difference_type __i = __rand(__d); 3203007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3204007b26beSHoward Hinnant } 32053e519524SHoward Hinnant } 32063e519524SHoward Hinnant} 32070f37a410SMarshall Clow#endif 32083e519524SHoward Hinnant 3209e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3210e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3211e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3212e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32135741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3214e7154709SEric Fiselier _Distance __n, 3215e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3216e7154709SEric Fiselier input_iterator_tag) { 3217e7154709SEric Fiselier 3218e7154709SEric Fiselier _Distance __k = 0; 3219e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 32205741d86dSEric Fiselier __output[__k] = *__first; 3221e7154709SEric Fiselier _Distance __sz = __k; 3222e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3223e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3224e7154709SEric Fiselier if (__r < __sz) 32255741d86dSEric Fiselier __output[__r] = *__first; 3226e7154709SEric Fiselier } 32275741d86dSEric Fiselier return __output + _VSTD::min(__n, __k); 3228e7154709SEric Fiselier} 3229e7154709SEric Fiselier 3230e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3231e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3232e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3233e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32345741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3235e7154709SEric Fiselier _Distance __n, 3236e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3237e7154709SEric Fiselier forward_iterator_tag) { 3238e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3239e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3240e7154709SEric Fiselier _Distance __r = 3241e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3242e7154709SEric Fiselier if (__r < __n) { 32435741d86dSEric Fiselier *__output++ = *__first; 3244e7154709SEric Fiselier --__n; 3245e7154709SEric Fiselier } 3246e7154709SEric Fiselier } 32475741d86dSEric Fiselier return __output; 3248e7154709SEric Fiselier} 3249e7154709SEric Fiselier 3250e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3251e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3252e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3253e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32545741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3255e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3256e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3257e7154709SEric Fiselier _PopCategory; 3258e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3259e7154709SEric Fiselier _Difference; 3260e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3261e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3262e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3263e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3264e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3265e7154709SEric Fiselier return _VSTD::__sample( 32665741d86dSEric Fiselier __first, __last, __output, _CommonType(__n), 3267e7154709SEric Fiselier __g, _PopCategory()); 3268e7154709SEric Fiselier} 3269e7154709SEric Fiselier 3270e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3271e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3272e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3273e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3274e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 32755741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3276e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 32775741d86dSEric Fiselier return _VSTD::__sample(__first, __last, __output, __n, __g); 3278e7154709SEric Fiselier} 3279e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3280e7154709SEric Fiselier 3281f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3282f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3283ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3284fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3285fb340102SHoward Hinnant#else 3286f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3287fb340102SHoward Hinnant#endif 3288f9d540b0SHoward Hinnant{ 3289f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3290c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3291c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3292f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3293f9d540b0SHoward Hinnant if (__d > 1) 3294f9d540b0SHoward Hinnant { 3295c003db1fSHoward Hinnant _Dp __uid; 3296f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3297007b26beSHoward Hinnant { 3298c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3299007b26beSHoward Hinnant if (__i != difference_type(0)) 3300007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3301007b26beSHoward Hinnant } 3302f9d540b0SHoward Hinnant } 3303f9d540b0SHoward Hinnant} 3304f9d540b0SHoward Hinnant 33053e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 33063e519524SHoward Hinnantbool 33073e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 33083e519524SHoward Hinnant{ 33093e519524SHoward Hinnant for (; __first != __last; ++__first) 33103e519524SHoward Hinnant if (!__pred(*__first)) 33113e519524SHoward Hinnant break; 3312b9595b79SMarshall Clow if ( __first == __last ) 3313b9595b79SMarshall Clow return true; 3314b9595b79SMarshall Clow ++__first; 33153e519524SHoward Hinnant for (; __first != __last; ++__first) 33163e519524SHoward Hinnant if (__pred(*__first)) 33173e519524SHoward Hinnant return false; 33183e519524SHoward Hinnant return true; 33193e519524SHoward Hinnant} 33203e519524SHoward Hinnant 33213e519524SHoward Hinnant// partition 33223e519524SHoward Hinnant 33233e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33243e519524SHoward Hinnant_ForwardIterator 33253e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 33263e519524SHoward Hinnant{ 33273e519524SHoward Hinnant while (true) 33283e519524SHoward Hinnant { 33293e519524SHoward Hinnant if (__first == __last) 33303e519524SHoward Hinnant return __first; 33313e519524SHoward Hinnant if (!__pred(*__first)) 33323e519524SHoward Hinnant break; 33333e519524SHoward Hinnant ++__first; 33343e519524SHoward Hinnant } 33353e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 33363e519524SHoward Hinnant { 33373e519524SHoward Hinnant if (__pred(*__p)) 33383e519524SHoward Hinnant { 33393e519524SHoward Hinnant swap(*__first, *__p); 33403e519524SHoward Hinnant ++__first; 33413e519524SHoward Hinnant } 33423e519524SHoward Hinnant } 33433e519524SHoward Hinnant return __first; 33443e519524SHoward Hinnant} 33453e519524SHoward Hinnant 33463e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 33473e519524SHoward Hinnant_BidirectionalIterator 33483e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33493e519524SHoward Hinnant bidirectional_iterator_tag) 33503e519524SHoward Hinnant{ 33513e519524SHoward Hinnant while (true) 33523e519524SHoward Hinnant { 33533e519524SHoward Hinnant while (true) 33543e519524SHoward Hinnant { 33553e519524SHoward Hinnant if (__first == __last) 33563e519524SHoward Hinnant return __first; 33573e519524SHoward Hinnant if (!__pred(*__first)) 33583e519524SHoward Hinnant break; 33593e519524SHoward Hinnant ++__first; 33603e519524SHoward Hinnant } 33613e519524SHoward Hinnant do 33623e519524SHoward Hinnant { 33633e519524SHoward Hinnant if (__first == --__last) 33643e519524SHoward Hinnant return __first; 33653e519524SHoward Hinnant } while (!__pred(*__last)); 33663e519524SHoward Hinnant swap(*__first, *__last); 33673e519524SHoward Hinnant ++__first; 33683e519524SHoward Hinnant } 33693e519524SHoward Hinnant} 33703e519524SHoward Hinnant 33713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33733e519524SHoward Hinnant_ForwardIterator 33743e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33753e519524SHoward Hinnant{ 3376ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33773e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33783e519524SHoward Hinnant} 33793e519524SHoward Hinnant 33803e519524SHoward Hinnant// partition_copy 33813e519524SHoward Hinnant 33823e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33833e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33843e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33853e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33863e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33873e519524SHoward Hinnant _Predicate __pred) 33883e519524SHoward Hinnant{ 33893e519524SHoward Hinnant for (; __first != __last; ++__first) 33903e519524SHoward Hinnant { 33913e519524SHoward Hinnant if (__pred(*__first)) 33923e519524SHoward Hinnant { 33933e519524SHoward Hinnant *__out_true = *__first; 33943e519524SHoward Hinnant ++__out_true; 33953e519524SHoward Hinnant } 33963e519524SHoward Hinnant else 33973e519524SHoward Hinnant { 33983e519524SHoward Hinnant *__out_false = *__first; 33993e519524SHoward Hinnant ++__out_false; 34003e519524SHoward Hinnant } 34013e519524SHoward Hinnant } 34023e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 34033e519524SHoward Hinnant} 34043e519524SHoward Hinnant 34053e519524SHoward Hinnant// partition_point 34063e519524SHoward Hinnant 34073e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 34083e519524SHoward Hinnant_ForwardIterator 34093e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 34103e519524SHoward Hinnant{ 34113e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3412ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34133e519524SHoward Hinnant while (__len != 0) 34143e519524SHoward Hinnant { 34153e519524SHoward Hinnant difference_type __l2 = __len / 2; 34163e519524SHoward Hinnant _ForwardIterator __m = __first; 3417ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 34183e519524SHoward Hinnant if (__pred(*__m)) 34193e519524SHoward Hinnant { 34203e519524SHoward Hinnant __first = ++__m; 34213e519524SHoward Hinnant __len -= __l2 + 1; 34223e519524SHoward Hinnant } 34233e519524SHoward Hinnant else 34243e519524SHoward Hinnant __len = __l2; 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant return __first; 34273e519524SHoward Hinnant} 34283e519524SHoward Hinnant 34293e519524SHoward Hinnant// stable_partition 34303e519524SHoward Hinnant 34313e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 34323e519524SHoward Hinnant_ForwardIterator 34333e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34343e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 34353e519524SHoward Hinnant{ 34363e519524SHoward Hinnant // *__first is known to be false 34373e519524SHoward Hinnant // __len >= 1 34383e519524SHoward Hinnant if (__len == 1) 34393e519524SHoward Hinnant return __first; 34403e519524SHoward Hinnant if (__len == 2) 34413e519524SHoward Hinnant { 34423e519524SHoward Hinnant _ForwardIterator __m = __first; 34433e519524SHoward Hinnant if (__pred(*++__m)) 34443e519524SHoward Hinnant { 34453e519524SHoward Hinnant swap(*__first, *__m); 34463e519524SHoward Hinnant return __m; 34473e519524SHoward Hinnant } 34483e519524SHoward Hinnant return __first; 34493e519524SHoward Hinnant } 34503e519524SHoward Hinnant if (__len <= __p.second) 34513e519524SHoward Hinnant { // The buffer is big enough to use 34523e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 34533e519524SHoward Hinnant __destruct_n __d(0); 34543e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34553e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34563e519524SHoward Hinnant // Update __first to always point to the end of the trues 34573e519524SHoward Hinnant value_type* __t = __p.first; 3458ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34593e519524SHoward Hinnant __d.__incr((value_type*)0); 34603e519524SHoward Hinnant ++__t; 34613e519524SHoward Hinnant _ForwardIterator __i = __first; 34623e519524SHoward Hinnant while (++__i != __last) 34633e519524SHoward Hinnant { 34643e519524SHoward Hinnant if (__pred(*__i)) 34653e519524SHoward Hinnant { 3466ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34673e519524SHoward Hinnant ++__first; 34683e519524SHoward Hinnant } 34693e519524SHoward Hinnant else 34703e519524SHoward Hinnant { 3471ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34723e519524SHoward Hinnant __d.__incr((value_type*)0); 34733e519524SHoward Hinnant ++__t; 34743e519524SHoward Hinnant } 34753e519524SHoward Hinnant } 34763e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34773e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34783e519524SHoward Hinnant __i = __first; 34793e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3480ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34813e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34823e519524SHoward Hinnant return __first; 34833e519524SHoward Hinnant } 34843e519524SHoward Hinnant // Else not enough buffer, do in place 34853e519524SHoward Hinnant // __len >= 3 34863e519524SHoward Hinnant _ForwardIterator __m = __first; 34873e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3488ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34893e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34903e519524SHoward Hinnant // F????????????????? 34913e519524SHoward Hinnant // f m l 34923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34933e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34943e519524SHoward Hinnant // TTTFFFFF?????????? 34953e519524SHoward Hinnant // f ff m l 34963e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34973e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34983e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34993e519524SHoward Hinnant _Distance __len_half = __len - __len2; 35003e519524SHoward Hinnant while (__pred(*__m1)) 35013e519524SHoward Hinnant { 35023e519524SHoward Hinnant if (++__m1 == __last) 35033e519524SHoward Hinnant goto __second_half_done; 35043e519524SHoward Hinnant --__len_half; 35053e519524SHoward Hinnant } 35063e519524SHoward Hinnant // TTTFFFFFTTTF?????? 35073e519524SHoward Hinnant // f ff m m1 l 35083e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 35093e519524SHoward Hinnant__second_half_done: 35103e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35113e519524SHoward Hinnant // f ff m sf l 3512ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35133e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35143e519524SHoward Hinnant // | 35153e519524SHoward Hinnant} 35163e519524SHoward Hinnant 35173e519524SHoward Hinnantstruct __return_temporary_buffer 35183e519524SHoward Hinnant{ 35193e519524SHoward Hinnant template <class _Tp> 3520ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 35213e519524SHoward Hinnant}; 35223e519524SHoward Hinnant 35233e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 35243e519524SHoward Hinnant_ForwardIterator 35253e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35263e519524SHoward Hinnant forward_iterator_tag) 35273e519524SHoward Hinnant{ 35283e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 35293e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35303e519524SHoward Hinnant while (true) 35313e519524SHoward Hinnant { 35323e519524SHoward Hinnant if (__first == __last) 35333e519524SHoward Hinnant return __first; 35343e519524SHoward Hinnant if (!__pred(*__first)) 35353e519524SHoward Hinnant break; 35363e519524SHoward Hinnant ++__first; 35373e519524SHoward Hinnant } 35383e519524SHoward Hinnant // We now have a reduced range [__first, __last) 35393e519524SHoward Hinnant // *__first is known to be false 35403e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 35413e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3542ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 35433e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35443e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35453e519524SHoward Hinnant if (__len >= __alloc_limit) 35463e519524SHoward Hinnant { 3547ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35483e519524SHoward Hinnant __h.reset(__p.first); 35493e519524SHoward Hinnant } 35503e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35513e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 35523e519524SHoward Hinnant} 35533e519524SHoward Hinnant 35543e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 35553e519524SHoward Hinnant_BidirectionalIterator 35563e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35573e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 35583e519524SHoward Hinnant{ 35593e519524SHoward Hinnant // *__first is known to be false 35603e519524SHoward Hinnant // *__last is known to be true 35613e519524SHoward Hinnant // __len >= 2 35623e519524SHoward Hinnant if (__len == 2) 35633e519524SHoward Hinnant { 35643e519524SHoward Hinnant swap(*__first, *__last); 35653e519524SHoward Hinnant return __last; 35663e519524SHoward Hinnant } 35673e519524SHoward Hinnant if (__len == 3) 35683e519524SHoward Hinnant { 35693e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35703e519524SHoward Hinnant if (__pred(*++__m)) 35713e519524SHoward Hinnant { 35723e519524SHoward Hinnant swap(*__first, *__m); 35733e519524SHoward Hinnant swap(*__m, *__last); 35743e519524SHoward Hinnant return __last; 35753e519524SHoward Hinnant } 35763e519524SHoward Hinnant swap(*__m, *__last); 35773e519524SHoward Hinnant swap(*__first, *__m); 35783e519524SHoward Hinnant return __m; 35793e519524SHoward Hinnant } 35803e519524SHoward Hinnant if (__len <= __p.second) 35813e519524SHoward Hinnant { // The buffer is big enough to use 35823e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35833e519524SHoward Hinnant __destruct_n __d(0); 35843e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35853e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35863e519524SHoward Hinnant // Update __first to always point to the end of the trues 35873e519524SHoward Hinnant value_type* __t = __p.first; 3588ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35893e519524SHoward Hinnant __d.__incr((value_type*)0); 35903e519524SHoward Hinnant ++__t; 35913e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35923e519524SHoward Hinnant while (++__i != __last) 35933e519524SHoward Hinnant { 35943e519524SHoward Hinnant if (__pred(*__i)) 35953e519524SHoward Hinnant { 3596ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35973e519524SHoward Hinnant ++__first; 35983e519524SHoward Hinnant } 35993e519524SHoward Hinnant else 36003e519524SHoward Hinnant { 3601ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 36023e519524SHoward Hinnant __d.__incr((value_type*)0); 36033e519524SHoward Hinnant ++__t; 36043e519524SHoward Hinnant } 36053e519524SHoward Hinnant } 36063e519524SHoward Hinnant // move *__last, known to be true 3607ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 36083e519524SHoward Hinnant __i = ++__first; 36093e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 36103e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 36113e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3612ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 36133e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 36143e519524SHoward Hinnant return __first; 36153e519524SHoward Hinnant } 36163e519524SHoward Hinnant // Else not enough buffer, do in place 36173e519524SHoward Hinnant // __len >= 4 36183e519524SHoward Hinnant _BidirectionalIterator __m = __first; 36193e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3620ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 36213e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 36223e519524SHoward Hinnant // F????????????????T 36233e519524SHoward Hinnant // f m l 36243e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 36253e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 36263e519524SHoward Hinnant _Distance __len_half = __len2; 36273e519524SHoward Hinnant while (!__pred(*--__m1)) 36283e519524SHoward Hinnant { 36293e519524SHoward Hinnant if (__m1 == __first) 36303e519524SHoward Hinnant goto __first_half_done; 36313e519524SHoward Hinnant --__len_half; 36323e519524SHoward Hinnant } 36333e519524SHoward Hinnant // F???TFFF?????????T 36343e519524SHoward Hinnant // f m1 m l 36353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 36363e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 36373e519524SHoward Hinnant__first_half_done: 36383e519524SHoward Hinnant // TTTFFFFF?????????T 36393e519524SHoward Hinnant // f ff m l 36403e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 36413e519524SHoward Hinnant __m1 = __m; 36423e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 36433e519524SHoward Hinnant ++__second_false; 36443e519524SHoward Hinnant __len_half = __len - __len2; 36453e519524SHoward Hinnant while (__pred(*__m1)) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant if (++__m1 == __last) 36483e519524SHoward Hinnant goto __second_half_done; 36493e519524SHoward Hinnant --__len_half; 36503e519524SHoward Hinnant } 36513e519524SHoward Hinnant // TTTFFFFFTTTF?????T 36523e519524SHoward Hinnant // f ff m m1 l 36533e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 36543e519524SHoward Hinnant__second_half_done: 36553e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 36563e519524SHoward Hinnant // f ff m sf l 3657ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 36583e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 36593e519524SHoward Hinnant // | 36603e519524SHoward Hinnant} 36613e519524SHoward Hinnant 36623e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 36633e519524SHoward Hinnant_BidirectionalIterator 36643e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36653e519524SHoward Hinnant bidirectional_iterator_tag) 36663e519524SHoward Hinnant{ 36673e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36693e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 36703e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36713e519524SHoward Hinnant while (true) 36723e519524SHoward Hinnant { 36733e519524SHoward Hinnant if (__first == __last) 36743e519524SHoward Hinnant return __first; 36753e519524SHoward Hinnant if (!__pred(*__first)) 36763e519524SHoward Hinnant break; 36773e519524SHoward Hinnant ++__first; 36783e519524SHoward Hinnant } 36793e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36803e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36813e519524SHoward Hinnant do 36823e519524SHoward Hinnant { 36833e519524SHoward Hinnant if (__first == --__last) 36843e519524SHoward Hinnant return __first; 36853e519524SHoward Hinnant } while (!__pred(*__last)); 36863e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36873e519524SHoward Hinnant // *__first is known to be false 36883e519524SHoward Hinnant // *__last is known to be true 36893e519524SHoward Hinnant // __len >= 2 3690ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36913e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36923e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36933e519524SHoward Hinnant if (__len >= __alloc_limit) 36943e519524SHoward Hinnant { 3695ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36963e519524SHoward Hinnant __h.reset(__p.first); 36973e519524SHoward Hinnant } 36983e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36993e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 37003e519524SHoward Hinnant} 37013e519524SHoward Hinnant 37023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 37033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37043e519524SHoward Hinnant_ForwardIterator 37053e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 37063e519524SHoward Hinnant{ 37073e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 37083e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 37093e519524SHoward Hinnant} 37103e519524SHoward Hinnant 37113e519524SHoward Hinnant// is_sorted_until 37123e519524SHoward Hinnant 37133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37143e519524SHoward Hinnant_ForwardIterator 37153e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37163e519524SHoward Hinnant{ 37173e519524SHoward Hinnant if (__first != __last) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant _ForwardIterator __i = __first; 37203e519524SHoward Hinnant while (++__i != __last) 37213e519524SHoward Hinnant { 37223e519524SHoward Hinnant if (__comp(*__i, *__first)) 37233e519524SHoward Hinnant return __i; 37243e519524SHoward Hinnant __first = __i; 37253e519524SHoward Hinnant } 37263e519524SHoward Hinnant } 37273e519524SHoward Hinnant return __last; 37283e519524SHoward Hinnant} 37293e519524SHoward Hinnant 37303e519524SHoward Hinnanttemplate<class _ForwardIterator> 37313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37323e519524SHoward Hinnant_ForwardIterator 37333e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 37343e519524SHoward Hinnant{ 3735ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37363e519524SHoward Hinnant} 37373e519524SHoward Hinnant 37383e519524SHoward Hinnant// is_sorted 37393e519524SHoward Hinnant 37403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37423e519524SHoward Hinnantbool 37433e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37443e519524SHoward Hinnant{ 3745ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 37463e519524SHoward Hinnant} 37473e519524SHoward Hinnant 37483e519524SHoward Hinnanttemplate<class _ForwardIterator> 37493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37503e519524SHoward Hinnantbool 37513e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 37523e519524SHoward Hinnant{ 3753ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37543e519524SHoward Hinnant} 37553e519524SHoward Hinnant 37563e519524SHoward Hinnant// sort 37573e519524SHoward Hinnant 37583e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 37593e519524SHoward Hinnant 37603e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37613e519524SHoward Hinnantunsigned 37623e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 37633e519524SHoward Hinnant{ 37643e519524SHoward Hinnant unsigned __r = 0; 37653e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 37663e519524SHoward Hinnant { 37673e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 37683e519524SHoward Hinnant return __r; // x <= y && y <= z 37693e519524SHoward Hinnant // x <= y && y > z 37703e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 37713e519524SHoward Hinnant __r = 1; 37723e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37733e519524SHoward Hinnant { 37743e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37753e519524SHoward Hinnant __r = 2; 37763e519524SHoward Hinnant } 37773e519524SHoward Hinnant return __r; // x <= y && y < z 37783e519524SHoward Hinnant } 37793e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37803e519524SHoward Hinnant { 37813e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37823e519524SHoward Hinnant __r = 1; 37833e519524SHoward Hinnant return __r; 37843e519524SHoward Hinnant } 37853e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37863e519524SHoward Hinnant __r = 1; // x < y && x <= z 37873e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37883e519524SHoward Hinnant { 37893e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37903e519524SHoward Hinnant __r = 2; 37913e519524SHoward Hinnant } 37923e519524SHoward Hinnant return __r; 37933e519524SHoward Hinnant} // x <= y && y <= z 37943e519524SHoward Hinnant 37953e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37963e519524SHoward Hinnant 37973e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37983e519524SHoward Hinnantunsigned 37993e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38003e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 38013e519524SHoward Hinnant{ 38023e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 38033e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38043e519524SHoward Hinnant { 38053e519524SHoward Hinnant swap(*__x3, *__x4); 38063e519524SHoward Hinnant ++__r; 38073e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38083e519524SHoward Hinnant { 38093e519524SHoward Hinnant swap(*__x2, *__x3); 38103e519524SHoward Hinnant ++__r; 38113e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38123e519524SHoward Hinnant { 38133e519524SHoward Hinnant swap(*__x1, *__x2); 38143e519524SHoward Hinnant ++__r; 38153e519524SHoward Hinnant } 38163e519524SHoward Hinnant } 38173e519524SHoward Hinnant } 38183e519524SHoward Hinnant return __r; 38193e519524SHoward Hinnant} 38203e519524SHoward Hinnant 38213e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 38223e519524SHoward Hinnant 38233e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 38243e519524SHoward Hinnantunsigned 38253e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38263e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 38273e519524SHoward Hinnant{ 38283e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 38293e519524SHoward Hinnant if (__c(*__x5, *__x4)) 38303e519524SHoward Hinnant { 38313e519524SHoward Hinnant swap(*__x4, *__x5); 38323e519524SHoward Hinnant ++__r; 38333e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38343e519524SHoward Hinnant { 38353e519524SHoward Hinnant swap(*__x3, *__x4); 38363e519524SHoward Hinnant ++__r; 38373e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38383e519524SHoward Hinnant { 38393e519524SHoward Hinnant swap(*__x2, *__x3); 38403e519524SHoward Hinnant ++__r; 38413e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38423e519524SHoward Hinnant { 38433e519524SHoward Hinnant swap(*__x1, *__x2); 38443e519524SHoward Hinnant ++__r; 38453e519524SHoward Hinnant } 38463e519524SHoward Hinnant } 38473e519524SHoward Hinnant } 38483e519524SHoward Hinnant } 38493e519524SHoward Hinnant return __r; 38503e519524SHoward Hinnant} 38513e519524SHoward Hinnant 38523e519524SHoward Hinnant// Assumes size > 0 38533e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38543e519524SHoward Hinnantvoid 38553e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38563e519524SHoward Hinnant{ 38573e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 38583e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 38593e519524SHoward Hinnant { 3860ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 38613e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 38623e519524SHoward Hinnant (__first, __last, __comp); 38633e519524SHoward Hinnant if (__i != __first) 38643e519524SHoward Hinnant swap(*__first, *__i); 38653e519524SHoward Hinnant } 38663e519524SHoward Hinnant} 38673e519524SHoward Hinnant 38683e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38693e519524SHoward Hinnantvoid 38703e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38713e519524SHoward Hinnant{ 38723e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38733e519524SHoward Hinnant if (__first != __last) 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38763e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38773e519524SHoward Hinnant { 38783e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3879ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38803e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3881ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3882ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38833e519524SHoward Hinnant } 38843e519524SHoward Hinnant } 38853e519524SHoward Hinnant} 38863e519524SHoward Hinnant 38873e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38883e519524SHoward Hinnantvoid 38893e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38903e519524SHoward Hinnant{ 38913e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38923e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38933e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38943e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38953e519524SHoward Hinnant { 38963e519524SHoward Hinnant if (__comp(*__i, *__j)) 38973e519524SHoward Hinnant { 3898ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38993e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39003e519524SHoward Hinnant __j = __i; 39013e519524SHoward Hinnant do 39023e519524SHoward Hinnant { 3903ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39043e519524SHoward Hinnant __j = __k; 39053e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3906ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39073e519524SHoward Hinnant } 39083e519524SHoward Hinnant __j = __i; 39093e519524SHoward Hinnant } 39103e519524SHoward Hinnant} 39113e519524SHoward Hinnant 39123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39133e519524SHoward Hinnantbool 39143e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39153e519524SHoward Hinnant{ 39163e519524SHoward Hinnant switch (__last - __first) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant case 0: 39193e519524SHoward Hinnant case 1: 39203e519524SHoward Hinnant return true; 39213e519524SHoward Hinnant case 2: 39223e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39233e519524SHoward Hinnant swap(*__first, *__last); 39243e519524SHoward Hinnant return true; 39253e519524SHoward Hinnant case 3: 3926ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39273e519524SHoward Hinnant return true; 39283e519524SHoward Hinnant case 4: 3929ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39303e519524SHoward Hinnant return true; 39313e519524SHoward Hinnant case 5: 3932ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39333e519524SHoward Hinnant return true; 39343e519524SHoward Hinnant } 39353e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39363e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39373e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 39383e519524SHoward Hinnant const unsigned __limit = 8; 39393e519524SHoward Hinnant unsigned __count = 0; 39403e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39413e519524SHoward Hinnant { 39423e519524SHoward Hinnant if (__comp(*__i, *__j)) 39433e519524SHoward Hinnant { 3944ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39453e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39463e519524SHoward Hinnant __j = __i; 39473e519524SHoward Hinnant do 39483e519524SHoward Hinnant { 3949ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39503e519524SHoward Hinnant __j = __k; 39513e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3952ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39533e519524SHoward Hinnant if (++__count == __limit) 39543e519524SHoward Hinnant return ++__i == __last; 39553e519524SHoward Hinnant } 39563e519524SHoward Hinnant __j = __i; 39573e519524SHoward Hinnant } 39583e519524SHoward Hinnant return true; 39593e519524SHoward Hinnant} 39603e519524SHoward Hinnant 39613e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 39623e519524SHoward Hinnantvoid 39633e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 39643e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 39653e519524SHoward Hinnant{ 39663e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 39673e519524SHoward Hinnant if (__first1 != __last1) 39683e519524SHoward Hinnant { 39693e519524SHoward Hinnant __destruct_n __d(0); 39703e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39713e519524SHoward Hinnant value_type* __last2 = __first2; 3972ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39733e519524SHoward Hinnant __d.__incr((value_type*)0); 39743e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39753e519524SHoward Hinnant { 39763e519524SHoward Hinnant value_type* __j2 = __last2; 39773e519524SHoward Hinnant value_type* __i2 = __j2; 39783e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39793e519524SHoward Hinnant { 3980ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39813e519524SHoward Hinnant __d.__incr((value_type*)0); 39823e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3983ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3984ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39853e519524SHoward Hinnant } 39863e519524SHoward Hinnant else 39873e519524SHoward Hinnant { 3988ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39893e519524SHoward Hinnant __d.__incr((value_type*)0); 39903e519524SHoward Hinnant } 39913e519524SHoward Hinnant } 39923e519524SHoward Hinnant __h.release(); 39933e519524SHoward Hinnant } 39943e519524SHoward Hinnant} 39953e519524SHoward Hinnant 39963e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39973e519524SHoward Hinnantvoid 39983e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39993e519524SHoward Hinnant{ 40003e519524SHoward Hinnant // _Compare is known to be a reference type 40013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 40023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 4003ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 4004ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 40053e519524SHoward Hinnant while (true) 40063e519524SHoward Hinnant { 40073e519524SHoward Hinnant __restart: 40083e519524SHoward Hinnant difference_type __len = __last - __first; 40093e519524SHoward Hinnant switch (__len) 40103e519524SHoward Hinnant { 40113e519524SHoward Hinnant case 0: 40123e519524SHoward Hinnant case 1: 40133e519524SHoward Hinnant return; 40143e519524SHoward Hinnant case 2: 40153e519524SHoward Hinnant if (__comp(*--__last, *__first)) 40163e519524SHoward Hinnant swap(*__first, *__last); 40173e519524SHoward Hinnant return; 40183e519524SHoward Hinnant case 3: 4019ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 40203e519524SHoward Hinnant return; 40213e519524SHoward Hinnant case 4: 4022ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 40233e519524SHoward Hinnant return; 40243e519524SHoward Hinnant case 5: 4025ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40263e519524SHoward Hinnant return; 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant if (__len <= __limit) 40293e519524SHoward Hinnant { 4030ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 40313e519524SHoward Hinnant return; 40323e519524SHoward Hinnant } 40333e519524SHoward Hinnant // __len > 5 40343e519524SHoward Hinnant _RandomAccessIterator __m = __first; 40353e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 40363e519524SHoward Hinnant --__lm1; 40373e519524SHoward Hinnant unsigned __n_swaps; 40383e519524SHoward Hinnant { 40393e519524SHoward Hinnant difference_type __delta; 40403e519524SHoward Hinnant if (__len >= 1000) 40413e519524SHoward Hinnant { 40423e519524SHoward Hinnant __delta = __len/2; 40433e519524SHoward Hinnant __m += __delta; 40443e519524SHoward Hinnant __delta /= 2; 4045ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant else 40483e519524SHoward Hinnant { 40493e519524SHoward Hinnant __delta = __len/2; 40503e519524SHoward Hinnant __m += __delta; 4051ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 40523e519524SHoward Hinnant } 40533e519524SHoward Hinnant } 40543e519524SHoward Hinnant // *__m is median 40553e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 40563e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 40573e519524SHoward Hinnant _RandomAccessIterator __i = __first; 40583e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 40593e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40603e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 40613e519524SHoward Hinnant // Prime the downward search with a guard. 40623e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 40633e519524SHoward Hinnant { 40643e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 40653e519524SHoward Hinnant // manually guard downward moving __j against __i 40663e519524SHoward Hinnant while (true) 40673e519524SHoward Hinnant { 40683e519524SHoward Hinnant if (__i == --__j) 40693e519524SHoward Hinnant { 40703e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40713e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40723e519524SHoward Hinnant ++__i; // __first + 1 40733e519524SHoward Hinnant __j = __last; 40743e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40753e519524SHoward Hinnant { 40763e519524SHoward Hinnant while (true) 40773e519524SHoward Hinnant { 40783e519524SHoward Hinnant if (__i == __j) 40793e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40803e519524SHoward Hinnant if (__comp(*__first, *__i)) 40813e519524SHoward Hinnant { 40823e519524SHoward Hinnant swap(*__i, *__j); 40833e519524SHoward Hinnant ++__n_swaps; 40843e519524SHoward Hinnant ++__i; 40853e519524SHoward Hinnant break; 40863e519524SHoward Hinnant } 40873e519524SHoward Hinnant ++__i; 40883e519524SHoward Hinnant } 40893e519524SHoward Hinnant } 40903e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40913e519524SHoward Hinnant if (__i == __j) 40923e519524SHoward Hinnant return; 40933e519524SHoward Hinnant while (true) 40943e519524SHoward Hinnant { 40953e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40963e519524SHoward Hinnant ++__i; 40973e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40983e519524SHoward Hinnant ; 40993e519524SHoward Hinnant if (__i >= __j) 41003e519524SHoward Hinnant break; 41013e519524SHoward Hinnant swap(*__i, *__j); 41023e519524SHoward Hinnant ++__n_swaps; 41033e519524SHoward Hinnant ++__i; 41043e519524SHoward Hinnant } 41053e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 41063e519524SHoward Hinnant // The first part is sorted, sort the secod part 4107ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 41083e519524SHoward Hinnant __first = __i; 41093e519524SHoward Hinnant goto __restart; 41103e519524SHoward Hinnant } 41113e519524SHoward Hinnant if (__comp(*__j, *__m)) 41123e519524SHoward Hinnant { 41133e519524SHoward Hinnant swap(*__i, *__j); 41143e519524SHoward Hinnant ++__n_swaps; 41153e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 41163e519524SHoward Hinnant } 41173e519524SHoward Hinnant } 41183e519524SHoward Hinnant } 41193e519524SHoward Hinnant // It is known that *__i < *__m 41203e519524SHoward Hinnant ++__i; 41213e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 41223e519524SHoward Hinnant // if not yet partitioned... 41233e519524SHoward Hinnant if (__i < __j) 41243e519524SHoward Hinnant { 41253e519524SHoward Hinnant // known that *(__i - 1) < *__m 41263e519524SHoward Hinnant // known that __i <= __m 41273e519524SHoward Hinnant while (true) 41283e519524SHoward Hinnant { 41293e519524SHoward Hinnant // __m still guards upward moving __i 41303e519524SHoward Hinnant while (__comp(*__i, *__m)) 41313e519524SHoward Hinnant ++__i; 41323e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 41333e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 41343e519524SHoward Hinnant ; 41353e519524SHoward Hinnant if (__i > __j) 41363e519524SHoward Hinnant break; 41373e519524SHoward Hinnant swap(*__i, *__j); 41383e519524SHoward Hinnant ++__n_swaps; 41393e519524SHoward Hinnant // It is known that __m != __j 41403e519524SHoward Hinnant // If __m just moved, follow it 41413e519524SHoward Hinnant if (__m == __i) 41423e519524SHoward Hinnant __m = __j; 41433e519524SHoward Hinnant ++__i; 41443e519524SHoward Hinnant } 41453e519524SHoward Hinnant } 41463e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 41473e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 41483e519524SHoward Hinnant { 41493e519524SHoward Hinnant swap(*__i, *__m); 41503e519524SHoward Hinnant ++__n_swaps; 41513e519524SHoward Hinnant } 41523e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 41533e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 41543e519524SHoward Hinnant if (__n_swaps == 0) 41553e519524SHoward Hinnant { 4156ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4157ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 41583e519524SHoward Hinnant { 41593e519524SHoward Hinnant if (__fs) 41603e519524SHoward Hinnant return; 41613e519524SHoward Hinnant __last = __i; 41623e519524SHoward Hinnant continue; 41633e519524SHoward Hinnant } 41643e519524SHoward Hinnant else 41653e519524SHoward Hinnant { 41663e519524SHoward Hinnant if (__fs) 41673e519524SHoward Hinnant { 41683e519524SHoward Hinnant __first = ++__i; 41693e519524SHoward Hinnant continue; 41703e519524SHoward Hinnant } 41713e519524SHoward Hinnant } 41723e519524SHoward Hinnant } 41733e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41743e519524SHoward Hinnant if (__i - __first < __last - __i) 41753e519524SHoward Hinnant { 4176ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4177ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41783e519524SHoward Hinnant __first = ++__i; 41793e519524SHoward Hinnant } 41803e519524SHoward Hinnant else 41813e519524SHoward Hinnant { 4182ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4183ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41843e519524SHoward Hinnant __last = __i; 41853e519524SHoward Hinnant } 41863e519524SHoward Hinnant } 41873e519524SHoward Hinnant} 41883e519524SHoward Hinnant 41893e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41903e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41923e519524SHoward Hinnantvoid 41933e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41943e519524SHoward Hinnant{ 4195145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41963e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41973e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41983e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4199145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42003e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 42013e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4202145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42033e519524SHoward Hinnant} 42043e519524SHoward Hinnant 42053e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 42063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42073e519524SHoward Hinnantvoid 42083e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 42093e519524SHoward Hinnant{ 4210ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 42113e519524SHoward Hinnant} 42123e519524SHoward Hinnant 42133e519524SHoward Hinnanttemplate <class _Tp> 42143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42153e519524SHoward Hinnantvoid 42163e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 42173e519524SHoward Hinnant{ 4218ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 42193e519524SHoward Hinnant} 42203e519524SHoward Hinnant 42213e519524SHoward Hinnanttemplate <class _Tp> 42223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42233e519524SHoward Hinnantvoid 42243e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 42253e519524SHoward Hinnant{ 4226ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 42273e519524SHoward Hinnant} 42283e519524SHoward Hinnant 4229f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4230f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4231f554add5SHoward Hinnantvoid 4232f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4233f554add5SHoward Hinnant{ 4234f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4235f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4236f554add5SHoward Hinnant} 4237f554add5SHoward Hinnant 4238f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4239f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4240f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4241f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4242f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4243f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4244f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4245f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4246f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4247f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4248f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4249f0544c20SHoward 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>&)) 4250f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4251f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4252f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42533e519524SHoward Hinnant 4254f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4255f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4256f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4257f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4258f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4259f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4260f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4261f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4262f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4263f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4264f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4265f0544c20SHoward 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>&)) 4266f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4267f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4268f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42693e519524SHoward Hinnant 4270f0544c20SHoward 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>&)) 42713e519524SHoward Hinnant 42723e519524SHoward Hinnant// lower_bound 42733e519524SHoward Hinnant 42743e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42753e519524SHoward Hinnant_ForwardIterator 4276e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42773e519524SHoward Hinnant{ 42783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4279ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42803e519524SHoward Hinnant while (__len != 0) 42813e519524SHoward Hinnant { 42823e519524SHoward Hinnant difference_type __l2 = __len / 2; 42833e519524SHoward Hinnant _ForwardIterator __m = __first; 4284ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4285e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42863e519524SHoward Hinnant { 42873e519524SHoward Hinnant __first = ++__m; 42883e519524SHoward Hinnant __len -= __l2 + 1; 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant else 42913e519524SHoward Hinnant __len = __l2; 42923e519524SHoward Hinnant } 42933e519524SHoward Hinnant return __first; 42943e519524SHoward Hinnant} 42953e519524SHoward Hinnant 42963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42983e519524SHoward Hinnant_ForwardIterator 4299e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43003e519524SHoward Hinnant{ 4301145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43023e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43033e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4304e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4305145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43063e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4307e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4308145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43093e519524SHoward Hinnant} 43103e519524SHoward Hinnant 43113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43133e519524SHoward Hinnant_ForwardIterator 4314e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43153e519524SHoward Hinnant{ 4316e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 43173e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43183e519524SHoward Hinnant} 43193e519524SHoward Hinnant 43203e519524SHoward Hinnant// upper_bound 43213e519524SHoward Hinnant 43223e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43233e519524SHoward Hinnant_ForwardIterator 4324e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43253e519524SHoward Hinnant{ 43263e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4327ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43283e519524SHoward Hinnant while (__len != 0) 43293e519524SHoward Hinnant { 43303e519524SHoward Hinnant difference_type __l2 = __len / 2; 43313e519524SHoward Hinnant _ForwardIterator __m = __first; 4332ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4333e4383379SHoward Hinnant if (__comp(__value_, *__m)) 43343e519524SHoward Hinnant __len = __l2; 43353e519524SHoward Hinnant else 43363e519524SHoward Hinnant { 43373e519524SHoward Hinnant __first = ++__m; 43383e519524SHoward Hinnant __len -= __l2 + 1; 43393e519524SHoward Hinnant } 43403e519524SHoward Hinnant } 43413e519524SHoward Hinnant return __first; 43423e519524SHoward Hinnant} 43433e519524SHoward Hinnant 43443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43463e519524SHoward Hinnant_ForwardIterator 4347e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43483e519524SHoward Hinnant{ 4349145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43503e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43513e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4352e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4353145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43543e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4355e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4356145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43573e519524SHoward Hinnant} 43583e519524SHoward Hinnant 43593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43613e519524SHoward Hinnant_ForwardIterator 4362e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43633e519524SHoward Hinnant{ 4364e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43653e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43663e519524SHoward Hinnant} 43673e519524SHoward Hinnant 43683e519524SHoward Hinnant// equal_range 43693e519524SHoward Hinnant 43703e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43713e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4372e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43733e519524SHoward Hinnant{ 43743e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4375ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43763e519524SHoward Hinnant while (__len != 0) 43773e519524SHoward Hinnant { 43783e519524SHoward Hinnant difference_type __l2 = __len / 2; 43793e519524SHoward Hinnant _ForwardIterator __m = __first; 4380ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4381e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43823e519524SHoward Hinnant { 43833e519524SHoward Hinnant __first = ++__m; 43843e519524SHoward Hinnant __len -= __l2 + 1; 43853e519524SHoward Hinnant } 4386e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43873e519524SHoward Hinnant { 43883e519524SHoward Hinnant __last = __m; 43893e519524SHoward Hinnant __len = __l2; 43903e519524SHoward Hinnant } 43913e519524SHoward Hinnant else 43923e519524SHoward Hinnant { 43933e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43943e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43953e519524SHoward Hinnant ( 4396e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4397e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43983e519524SHoward Hinnant ); 43993e519524SHoward Hinnant } 44003e519524SHoward Hinnant } 44013e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 44023e519524SHoward Hinnant} 44033e519524SHoward Hinnant 44043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44063e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4407e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44083e519524SHoward Hinnant{ 4409145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44103e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44113e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4412e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4413145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44143e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4415e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4416145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44173e519524SHoward Hinnant} 44183e519524SHoward Hinnant 44193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44213e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4422e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44233e519524SHoward Hinnant{ 4424e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44253e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44263e519524SHoward Hinnant} 44273e519524SHoward Hinnant 44283e519524SHoward Hinnant// binary_search 44293e519524SHoward Hinnant 44303e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 44313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44323e519524SHoward Hinnantbool 4433e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44343e519524SHoward Hinnant{ 4435e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4436e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44373e519524SHoward Hinnant} 44383e519524SHoward Hinnant 44393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44413e519524SHoward Hinnantbool 4442e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44433e519524SHoward Hinnant{ 4444145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4447e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4448145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4450e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4451145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44523e519524SHoward Hinnant} 44533e519524SHoward Hinnant 44543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44563e519524SHoward Hinnantbool 4457e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44583e519524SHoward Hinnant{ 4459e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44603e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44613e519524SHoward Hinnant} 44623e519524SHoward Hinnant 44633e519524SHoward Hinnant// merge 44643e519524SHoward Hinnant 44653e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44663e519524SHoward Hinnant_OutputIterator 44673e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44693e519524SHoward Hinnant{ 44703e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44713e519524SHoward Hinnant { 44723e519524SHoward Hinnant if (__first2 == __last2) 4473ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44743e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44753e519524SHoward Hinnant { 44763e519524SHoward Hinnant *__result = *__first2; 44773e519524SHoward Hinnant ++__first2; 44783e519524SHoward Hinnant } 44793e519524SHoward Hinnant else 44803e519524SHoward Hinnant { 44813e519524SHoward Hinnant *__result = *__first1; 44823e519524SHoward Hinnant ++__first1; 44833e519524SHoward Hinnant } 44843e519524SHoward Hinnant } 4485ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44863e519524SHoward Hinnant} 44873e519524SHoward Hinnant 44883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44903e519524SHoward Hinnant_OutputIterator 44913e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44933e519524SHoward Hinnant{ 4494145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44953e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44963e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4497ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4498145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4500ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4501145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45023e519524SHoward Hinnant} 45033e519524SHoward Hinnant 45043e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 45053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45063e519524SHoward Hinnant_OutputIterator 45073e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 45083e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 45093e519524SHoward Hinnant{ 45103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 45113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 45123e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 45133e519524SHoward Hinnant} 45143e519524SHoward Hinnant 45153e519524SHoward Hinnant// inplace_merge 45163e519524SHoward Hinnant 4517adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4518adfdae18SMarshall Clow class _OutputIterator> 4519adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4520adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4521adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4522adfdae18SMarshall Clow{ 4523adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4524adfdae18SMarshall Clow { 4525adfdae18SMarshall Clow if (__first2 == __last2) 4526adfdae18SMarshall Clow { 4527adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4528adfdae18SMarshall Clow return; 4529adfdae18SMarshall Clow } 4530adfdae18SMarshall Clow 4531adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4532adfdae18SMarshall Clow { 4533adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4534adfdae18SMarshall Clow ++__first2; 4535adfdae18SMarshall Clow } 4536adfdae18SMarshall Clow else 4537adfdae18SMarshall Clow { 4538adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4539adfdae18SMarshall Clow ++__first1; 4540adfdae18SMarshall Clow } 4541adfdae18SMarshall Clow } 4542adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4543adfdae18SMarshall Clow} 4544adfdae18SMarshall Clow 45453e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45463e519524SHoward Hinnantvoid 45473e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45483e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45493e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45503e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45513e519524SHoward Hinnant{ 45523e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45533e519524SHoward Hinnant __destruct_n __d(0); 45543e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45553e519524SHoward Hinnant if (__len1 <= __len2) 45563e519524SHoward Hinnant { 45573e519524SHoward Hinnant value_type* __p = __buff; 4558910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4559ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4560adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 45613e519524SHoward Hinnant } 45623e519524SHoward Hinnant else 45633e519524SHoward Hinnant { 45643e519524SHoward Hinnant value_type* __p = __buff; 4565910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4566ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 45673e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45683e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4569adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4570adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4571a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 45723e519524SHoward Hinnant } 45733e519524SHoward Hinnant} 45743e519524SHoward Hinnant 45753e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45763e519524SHoward Hinnantvoid 45773e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45783e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45793e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45803e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45813e519524SHoward Hinnant{ 45823e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45833e519524SHoward Hinnant while (true) 45843e519524SHoward Hinnant { 45853e519524SHoward Hinnant // if __middle == __last, we're done 45863e519524SHoward Hinnant if (__len2 == 0) 45873e519524SHoward Hinnant return; 4588526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4589526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4590526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45913e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4592910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45933e519524SHoward Hinnant { 45943e519524SHoward Hinnant if (__len1 == 0) 45953e519524SHoward Hinnant return; 45963e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45973e519524SHoward Hinnant break; 45983e519524SHoward Hinnant } 45993e519524SHoward Hinnant // __first < __middle < __last 46003e519524SHoward Hinnant // *__first > *__middle 46013e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 46023e519524SHoward Hinnant // all elements in: 46033e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 46043e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 46053e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 46063e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 46073e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 46083e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 46093e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 46103e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 46113e519524SHoward Hinnant // binary search smaller range 46123e519524SHoward Hinnant if (__len1 < __len2) 46133e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 46143e519524SHoward Hinnant __len21 = __len2 / 2; 46153e519524SHoward Hinnant __m2 = __middle; 4616ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 46173e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4618ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46193e519524SHoward Hinnant } 46203e519524SHoward Hinnant else 46213e519524SHoward Hinnant { 46223e519524SHoward Hinnant if (__len1 == 1) 46233e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46243e519524SHoward Hinnant // It is known *__first > *__middle 46253e519524SHoward Hinnant swap(*__first, *__middle); 46263e519524SHoward Hinnant return; 46273e519524SHoward Hinnant } 46283e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46293e519524SHoward Hinnant __len11 = __len1 / 2; 46303e519524SHoward Hinnant __m1 = __first; 4631ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46323e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4633ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46343e519524SHoward Hinnant } 46353e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46363e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46373e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46383e519524SHoward Hinnant // swap middle two partitions 4639ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46403e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 46413e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 46423e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46433e519524SHoward Hinnant { 46443e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46453e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46463e519524SHoward Hinnant __first = __middle; 46473e519524SHoward Hinnant __middle = __m2; 46483e519524SHoward Hinnant __len1 = __len12; 46493e519524SHoward Hinnant __len2 = __len22; 46503e519524SHoward Hinnant } 46513e519524SHoward Hinnant else 46523e519524SHoward Hinnant { 46533e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46543e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46553e519524SHoward Hinnant __last = __middle; 46563e519524SHoward Hinnant __middle = __m1; 46573e519524SHoward Hinnant __len1 = __len11; 46583e519524SHoward Hinnant __len2 = __len21; 46593e519524SHoward Hinnant } 46603e519524SHoward Hinnant } 46613e519524SHoward Hinnant} 46623e519524SHoward Hinnant 46633e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46653e519524SHoward Hinnantvoid 46663e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46673e519524SHoward Hinnant _Compare __comp) 46683e519524SHoward Hinnant{ 46693e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46703e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4671ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4672ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4673ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46740b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46750b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46760b48cf9aSMarshall Clow 4677145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4680ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46813e519524SHoward Hinnant __buf.first, __buf.second); 4682145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4684ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46853e519524SHoward Hinnant __buf.first, __buf.second); 4686145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46873e519524SHoward Hinnant} 46883e519524SHoward Hinnant 46893e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46913e519524SHoward Hinnantvoid 46923e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46933e519524SHoward Hinnant{ 4694ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46953e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46963e519524SHoward Hinnant} 46973e519524SHoward Hinnant 46983e519524SHoward Hinnant// stable_sort 46993e519524SHoward Hinnant 47003e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 47013e519524SHoward Hinnantvoid 47023e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 47033e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47043e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 47053e519524SHoward Hinnant{ 47063e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 47073e519524SHoward Hinnant __destruct_n __d(0); 47083e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 47093e519524SHoward Hinnant for (; true; ++__result) 47103e519524SHoward Hinnant { 47113e519524SHoward Hinnant if (__first1 == __last1) 47123e519524SHoward Hinnant { 47133e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4714ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47153e519524SHoward Hinnant __h.release(); 47163e519524SHoward Hinnant return; 47173e519524SHoward Hinnant } 47183e519524SHoward Hinnant if (__first2 == __last2) 47193e519524SHoward Hinnant { 47203e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4721ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47223e519524SHoward Hinnant __h.release(); 47233e519524SHoward Hinnant return; 47243e519524SHoward Hinnant } 47253e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47263e519524SHoward Hinnant { 4727ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47283e519524SHoward Hinnant __d.__incr((value_type*)0); 47293e519524SHoward Hinnant ++__first2; 47303e519524SHoward Hinnant } 47313e519524SHoward Hinnant else 47323e519524SHoward Hinnant { 4733ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47343e519524SHoward Hinnant __d.__incr((value_type*)0); 47353e519524SHoward Hinnant ++__first1; 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant } 47383e519524SHoward Hinnant} 47393e519524SHoward Hinnant 47403e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47413e519524SHoward Hinnantvoid 47423e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47433e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47443e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47453e519524SHoward Hinnant{ 47463e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47473e519524SHoward Hinnant { 47483e519524SHoward Hinnant if (__first2 == __last2) 47493e519524SHoward Hinnant { 47503e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4751ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47523e519524SHoward Hinnant return; 47533e519524SHoward Hinnant } 47543e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47553e519524SHoward Hinnant { 4756ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47573e519524SHoward Hinnant ++__first2; 47583e519524SHoward Hinnant } 47593e519524SHoward Hinnant else 47603e519524SHoward Hinnant { 4761ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47623e519524SHoward Hinnant ++__first1; 47633e519524SHoward Hinnant } 47643e519524SHoward Hinnant } 47653e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4766ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47673e519524SHoward Hinnant} 47683e519524SHoward Hinnant 47693e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47703e519524SHoward Hinnantvoid 47713e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47733e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47743e519524SHoward Hinnant 47753e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47763e519524SHoward Hinnantvoid 47773e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47793e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47803e519524SHoward Hinnant{ 47813e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47823e519524SHoward Hinnant switch (__len) 47833e519524SHoward Hinnant { 47843e519524SHoward Hinnant case 0: 47853e519524SHoward Hinnant return; 47863e519524SHoward Hinnant case 1: 4787ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47883e519524SHoward Hinnant return; 47893e519524SHoward Hinnant case 2: 47903e519524SHoward Hinnant __destruct_n __d(0); 47913e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47923e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47933e519524SHoward Hinnant { 4794ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47953e519524SHoward Hinnant __d.__incr((value_type*)0); 47963e519524SHoward Hinnant ++__first2; 4797ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47983e519524SHoward Hinnant } 47993e519524SHoward Hinnant else 48003e519524SHoward Hinnant { 4801ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 48023e519524SHoward Hinnant __d.__incr((value_type*)0); 48033e519524SHoward Hinnant ++__first2; 4804ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 48053e519524SHoward Hinnant } 48063e519524SHoward Hinnant __h2.release(); 48073e519524SHoward Hinnant return; 48083e519524SHoward Hinnant } 48093e519524SHoward Hinnant if (__len <= 8) 48103e519524SHoward Hinnant { 48113e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 48123e519524SHoward Hinnant return; 48133e519524SHoward Hinnant } 48143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48153e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 48163e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 48173e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 48183e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48193e519524SHoward Hinnant} 48203e519524SHoward Hinnant 48213e519524SHoward Hinnanttemplate <class _Tp> 48223e519524SHoward Hinnantstruct __stable_sort_switch 48233e519524SHoward Hinnant{ 4824ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48253e519524SHoward Hinnant}; 48263e519524SHoward Hinnant 48273e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48283e519524SHoward Hinnantvoid 48293e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48303e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48313e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48323e519524SHoward Hinnant{ 48333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48343e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48353e519524SHoward Hinnant switch (__len) 48363e519524SHoward Hinnant { 48373e519524SHoward Hinnant case 0: 48383e519524SHoward Hinnant case 1: 48393e519524SHoward Hinnant return; 48403e519524SHoward Hinnant case 2: 48413e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48423e519524SHoward Hinnant swap(*__first, *__last); 48433e519524SHoward Hinnant return; 48443e519524SHoward Hinnant } 48453e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48463e519524SHoward Hinnant { 48473e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 48483e519524SHoward Hinnant return; 48493e519524SHoward Hinnant } 48503e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48513e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48523e519524SHoward Hinnant if (__len <= __buff_size) 48533e519524SHoward Hinnant { 48543e519524SHoward Hinnant __destruct_n __d(0); 48553e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48563e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 48573e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 48583e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 48593e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 48603e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48613e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 48623e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48633e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48643e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48653e519524SHoward Hinnant// __first, __comp); 48663e519524SHoward Hinnant return; 48673e519524SHoward Hinnant } 48683e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48693e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48703e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48713e519524SHoward Hinnant} 48723e519524SHoward Hinnant 48733e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48753e519524SHoward Hinnantvoid 48763e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48773e519524SHoward Hinnant{ 48783e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48793e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48803e519524SHoward Hinnant difference_type __len = __last - __first; 48813e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48823e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48833e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48843e519524SHoward Hinnant { 4885ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48863e519524SHoward Hinnant __h.reset(__buf.first); 48873e519524SHoward Hinnant } 4888145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48913e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4892145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48943e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4895145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48963e519524SHoward Hinnant} 48973e519524SHoward Hinnant 48983e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49003e519524SHoward Hinnantvoid 49013e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 49023e519524SHoward Hinnant{ 4903ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49043e519524SHoward Hinnant} 49053e519524SHoward Hinnant 49063e519524SHoward Hinnant// is_heap_until 49073e519524SHoward Hinnant 49083e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49093e519524SHoward Hinnant_RandomAccessIterator 49103e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49113e519524SHoward Hinnant{ 4912ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49133e519524SHoward Hinnant difference_type __len = __last - __first; 49143e519524SHoward Hinnant difference_type __p = 0; 49153e519524SHoward Hinnant difference_type __c = 1; 49163e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 49173e519524SHoward Hinnant while (__c < __len) 49183e519524SHoward Hinnant { 49193e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49203e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49213e519524SHoward Hinnant return __cp; 49223e519524SHoward Hinnant ++__c; 49233e519524SHoward Hinnant ++__cp; 49243e519524SHoward Hinnant if (__c == __len) 49253e519524SHoward Hinnant return __last; 49263e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49273e519524SHoward Hinnant return __cp; 49283e519524SHoward Hinnant ++__p; 49293e519524SHoward Hinnant ++__pp; 49303e519524SHoward Hinnant __c = 2 * __p + 1; 49313e519524SHoward Hinnant } 49323e519524SHoward Hinnant return __last; 49333e519524SHoward Hinnant} 49343e519524SHoward Hinnant 49353e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49373e519524SHoward Hinnant_RandomAccessIterator 49383e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49393e519524SHoward Hinnant{ 4940ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49413e519524SHoward Hinnant} 49423e519524SHoward Hinnant 49433e519524SHoward Hinnant// is_heap 49443e519524SHoward Hinnant 49453e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49473e519524SHoward Hinnantbool 49483e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49493e519524SHoward Hinnant{ 4950ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49513e519524SHoward Hinnant} 49523e519524SHoward Hinnant 49533e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49553e519524SHoward Hinnantbool 49563e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49573e519524SHoward Hinnant{ 4958ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49593e519524SHoward Hinnant} 49603e519524SHoward Hinnant 49613e519524SHoward Hinnant// push_heap 49623e519524SHoward Hinnant 49633e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49643e519524SHoward Hinnantvoid 49658b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49663e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49673e519524SHoward Hinnant{ 49683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49693e519524SHoward Hinnant if (__len > 1) 49703e519524SHoward Hinnant { 49713e519524SHoward Hinnant __len = (__len - 2) / 2; 49723e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49733e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49743e519524SHoward Hinnant { 4975ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49763e519524SHoward Hinnant do 49773e519524SHoward Hinnant { 4978ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49793e519524SHoward Hinnant __last = __ptr; 49803e519524SHoward Hinnant if (__len == 0) 49813e519524SHoward Hinnant break; 49823e519524SHoward Hinnant __len = (__len - 1) / 2; 49833e519524SHoward Hinnant __ptr = __first + __len; 49843e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4985ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49863e519524SHoward Hinnant } 49873e519524SHoward Hinnant } 49883e519524SHoward Hinnant} 49893e519524SHoward Hinnant 49903e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49923e519524SHoward Hinnantvoid 49933e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49943e519524SHoward Hinnant{ 4995145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49963e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49973e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49988b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4999145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50003e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50018b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 5002145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50033e519524SHoward Hinnant} 50043e519524SHoward Hinnant 50053e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50073e519524SHoward Hinnantvoid 50083e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50093e519524SHoward Hinnant{ 5010ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50113e519524SHoward Hinnant} 50123e519524SHoward Hinnant 50133e519524SHoward Hinnant// pop_heap 50143e519524SHoward Hinnant 50153e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50168b512602SDavid Majnemervoid 5017fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 5018fd838227SEric Fiselier _Compare __comp, 50198b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50208b512602SDavid Majnemer _RandomAccessIterator __start) 50218b512602SDavid Majnemer{ 50228b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50238b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50248b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50258b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50268b512602SDavid Majnemer difference_type __child = __start - __first; 50278b512602SDavid Majnemer 50288b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50298b512602SDavid Majnemer return; 50308b512602SDavid Majnemer 50318b512602SDavid Majnemer __child = 2 * __child + 1; 50328b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50338b512602SDavid Majnemer 50348b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50358b512602SDavid Majnemer // right-child exists and is greater than left-child 50368b512602SDavid Majnemer ++__child_i; 50378b512602SDavid Majnemer ++__child; 50388b512602SDavid Majnemer } 50398b512602SDavid Majnemer 50408b512602SDavid Majnemer // check if we are in heap-order 50418b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50428b512602SDavid Majnemer // we are, __start is larger than it's largest child 50438b512602SDavid Majnemer return; 50448b512602SDavid Majnemer 50458b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50468b512602SDavid Majnemer do 50478b512602SDavid Majnemer { 50488b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 50498b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50508b512602SDavid Majnemer __start = __child_i; 50518b512602SDavid Majnemer 50528b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50538b512602SDavid Majnemer break; 50548b512602SDavid Majnemer 50558b512602SDavid Majnemer // recompute the child based off of the updated parent 50568b512602SDavid Majnemer __child = 2 * __child + 1; 50578b512602SDavid Majnemer __child_i = __first + __child; 50588b512602SDavid Majnemer 50598b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50608b512602SDavid Majnemer // right-child exists and is greater than left-child 50618b512602SDavid Majnemer ++__child_i; 50628b512602SDavid Majnemer ++__child; 50638b512602SDavid Majnemer } 50648b512602SDavid Majnemer 50658b512602SDavid Majnemer // check if we are in heap-order 50668b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50678b512602SDavid Majnemer *__start = _VSTD::move(__top); 50688b512602SDavid Majnemer} 50698b512602SDavid Majnemer 50708b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50723e519524SHoward Hinnantvoid 50733e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50743e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50753e519524SHoward Hinnant{ 50763e519524SHoward Hinnant if (__len > 1) 50773e519524SHoward Hinnant { 50783e519524SHoward Hinnant swap(*__first, *--__last); 50798b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50803e519524SHoward Hinnant } 50813e519524SHoward Hinnant} 50823e519524SHoward Hinnant 50833e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50853e519524SHoward Hinnantvoid 50863e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50873e519524SHoward Hinnant{ 5088145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50913e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5092145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50943e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5095145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50963e519524SHoward Hinnant} 50973e519524SHoward Hinnant 50983e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51003e519524SHoward Hinnantvoid 51013e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51023e519524SHoward Hinnant{ 5103ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51043e519524SHoward Hinnant} 51053e519524SHoward Hinnant 51063e519524SHoward Hinnant// make_heap 51073e519524SHoward Hinnant 51083e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51093e519524SHoward Hinnantvoid 51103e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51113e519524SHoward Hinnant{ 51123e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51133e519524SHoward Hinnant difference_type __n = __last - __first; 51143e519524SHoward Hinnant if (__n > 1) 51153e519524SHoward Hinnant { 51168b512602SDavid Majnemer // start from the first parent, there is no need to consider children 51178b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 51188b512602SDavid Majnemer { 51198b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51208b512602SDavid Majnemer } 51213e519524SHoward Hinnant } 51223e519524SHoward Hinnant} 51233e519524SHoward Hinnant 51243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51263e519524SHoward Hinnantvoid 51273e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51283e519524SHoward Hinnant{ 5129145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51303e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51313e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51323e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5133145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51353e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5136145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51373e519524SHoward Hinnant} 51383e519524SHoward Hinnant 51393e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51413e519524SHoward Hinnantvoid 51423e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51433e519524SHoward Hinnant{ 5144ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51453e519524SHoward Hinnant} 51463e519524SHoward Hinnant 51473e519524SHoward Hinnant// sort_heap 51483e519524SHoward Hinnant 51493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51503e519524SHoward Hinnantvoid 51513e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51523e519524SHoward Hinnant{ 51533e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51543e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 51553e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 51563e519524SHoward Hinnant} 51573e519524SHoward Hinnant 51583e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51603e519524SHoward Hinnantvoid 51613e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51623e519524SHoward Hinnant{ 5163145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51663e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5167145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51693e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5170145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51713e519524SHoward Hinnant} 51723e519524SHoward Hinnant 51733e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51753e519524SHoward Hinnantvoid 51763e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51773e519524SHoward Hinnant{ 5178ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51793e519524SHoward Hinnant} 51803e519524SHoward Hinnant 51813e519524SHoward Hinnant// partial_sort 51823e519524SHoward Hinnant 51833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51843e519524SHoward Hinnantvoid 51853e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51863e519524SHoward Hinnant _Compare __comp) 51873e519524SHoward Hinnant{ 51883e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51903e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51913e519524SHoward Hinnant { 51923e519524SHoward Hinnant if (__comp(*__i, *__first)) 51933e519524SHoward Hinnant { 51943e519524SHoward Hinnant swap(*__i, *__first); 51958b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51963e519524SHoward Hinnant } 51973e519524SHoward Hinnant } 51983e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51993e519524SHoward Hinnant} 52003e519524SHoward Hinnant 52013e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 52023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52033e519524SHoward Hinnantvoid 52043e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 52053e519524SHoward Hinnant _Compare __comp) 52063e519524SHoward Hinnant{ 5207145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52083e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52093e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52103e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5211145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52123e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52133e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5214145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52153e519524SHoward Hinnant} 52163e519524SHoward Hinnant 52173e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 52183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52193e519524SHoward Hinnantvoid 52203e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 52213e519524SHoward Hinnant{ 5222ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52233e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52243e519524SHoward Hinnant} 52253e519524SHoward Hinnant 52263e519524SHoward Hinnant// partial_sort_copy 52273e519524SHoward Hinnant 52283e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52293e519524SHoward Hinnant_RandomAccessIterator 52303e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52313e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52323e519524SHoward Hinnant{ 52333e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52343e519524SHoward Hinnant if (__r != __result_last) 52353e519524SHoward Hinnant { 5236910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 52373e519524SHoward Hinnant *__r = *__first; 52383e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 52398b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52403e519524SHoward Hinnant for (; __first != __last; ++__first) 52413e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52423e519524SHoward Hinnant { 52433e519524SHoward Hinnant *__result_first = *__first; 52448b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52453e519524SHoward Hinnant } 52463e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 52473e519524SHoward Hinnant } 52483e519524SHoward Hinnant return __r; 52493e519524SHoward Hinnant} 52503e519524SHoward Hinnant 52513e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52533e519524SHoward Hinnant_RandomAccessIterator 52543e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52553e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52563e519524SHoward Hinnant{ 5257145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52583e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52593e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52603e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5261145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52633e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5264145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52653e519524SHoward Hinnant} 52663e519524SHoward Hinnant 52673e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52693e519524SHoward Hinnant_RandomAccessIterator 52703e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52713e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52723e519524SHoward Hinnant{ 5273ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52743e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52753e519524SHoward Hinnant} 52763e519524SHoward Hinnant 52773e519524SHoward Hinnant// nth_element 52783e519524SHoward Hinnant 52793e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52803e519524SHoward Hinnantvoid 52813e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52823e519524SHoward Hinnant{ 52833e519524SHoward Hinnant // _Compare is known to be a reference type 52843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52853e519524SHoward Hinnant const difference_type __limit = 7; 52863e519524SHoward Hinnant while (true) 52873e519524SHoward Hinnant { 52883e519524SHoward Hinnant __restart: 5289b34b4819SHoward Hinnant if (__nth == __last) 5290b34b4819SHoward Hinnant return; 52913e519524SHoward Hinnant difference_type __len = __last - __first; 52923e519524SHoward Hinnant switch (__len) 52933e519524SHoward Hinnant { 52943e519524SHoward Hinnant case 0: 52953e519524SHoward Hinnant case 1: 52963e519524SHoward Hinnant return; 52973e519524SHoward Hinnant case 2: 52983e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52993e519524SHoward Hinnant swap(*__first, *__last); 53003e519524SHoward Hinnant return; 53013e519524SHoward Hinnant case 3: 53023e519524SHoward Hinnant { 53033e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5304ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 53053e519524SHoward Hinnant return; 53063e519524SHoward Hinnant } 53073e519524SHoward Hinnant } 53083e519524SHoward Hinnant if (__len <= __limit) 53093e519524SHoward Hinnant { 53103e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 53113e519524SHoward Hinnant return; 53123e519524SHoward Hinnant } 53133e519524SHoward Hinnant // __len > __limit >= 3 53143e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 53153e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5316ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 53173e519524SHoward Hinnant // *__m is median 53183e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53193e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53203e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53213e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53223e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53233e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53243e519524SHoward Hinnant // Prime the downward search with a guard. 53253e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53263e519524SHoward Hinnant { 53273e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53283e519524SHoward Hinnant // manually guard downward moving __j against __i 53293e519524SHoward Hinnant while (true) 53303e519524SHoward Hinnant { 53313e519524SHoward Hinnant if (__i == --__j) 53323e519524SHoward Hinnant { 53333e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 53343e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 53353e519524SHoward Hinnant ++__i; // __first + 1 53363e519524SHoward Hinnant __j = __last; 53373e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 53383e519524SHoward Hinnant { 53393e519524SHoward Hinnant while (true) 53403e519524SHoward Hinnant { 53413e519524SHoward Hinnant if (__i == __j) 53423e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 53433e519524SHoward Hinnant if (__comp(*__first, *__i)) 53443e519524SHoward Hinnant { 53453e519524SHoward Hinnant swap(*__i, *__j); 53463e519524SHoward Hinnant ++__n_swaps; 53473e519524SHoward Hinnant ++__i; 53483e519524SHoward Hinnant break; 53493e519524SHoward Hinnant } 53503e519524SHoward Hinnant ++__i; 53513e519524SHoward Hinnant } 53523e519524SHoward Hinnant } 53533e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53543e519524SHoward Hinnant if (__i == __j) 53553e519524SHoward Hinnant return; 53563e519524SHoward Hinnant while (true) 53573e519524SHoward Hinnant { 53583e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53593e519524SHoward Hinnant ++__i; 53603e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53613e519524SHoward Hinnant ; 53623e519524SHoward Hinnant if (__i >= __j) 53633e519524SHoward Hinnant break; 53643e519524SHoward Hinnant swap(*__i, *__j); 53653e519524SHoward Hinnant ++__n_swaps; 53663e519524SHoward Hinnant ++__i; 53673e519524SHoward Hinnant } 53683e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53693e519524SHoward Hinnant // The first part is sorted, 53703e519524SHoward Hinnant if (__nth < __i) 53713e519524SHoward Hinnant return; 53723e519524SHoward Hinnant // __nth_element the secod part 53733e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53743e519524SHoward Hinnant __first = __i; 53753e519524SHoward Hinnant goto __restart; 53763e519524SHoward Hinnant } 53773e519524SHoward Hinnant if (__comp(*__j, *__m)) 53783e519524SHoward Hinnant { 53793e519524SHoward Hinnant swap(*__i, *__j); 53803e519524SHoward Hinnant ++__n_swaps; 53813e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53823e519524SHoward Hinnant } 53833e519524SHoward Hinnant } 53843e519524SHoward Hinnant } 53853e519524SHoward Hinnant ++__i; 53863e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53873e519524SHoward Hinnant // if not yet partitioned... 53883e519524SHoward Hinnant if (__i < __j) 53893e519524SHoward Hinnant { 53903e519524SHoward Hinnant // known that *(__i - 1) < *__m 53913e519524SHoward Hinnant while (true) 53923e519524SHoward Hinnant { 53933e519524SHoward Hinnant // __m still guards upward moving __i 53943e519524SHoward Hinnant while (__comp(*__i, *__m)) 53953e519524SHoward Hinnant ++__i; 53963e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53973e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53983e519524SHoward Hinnant ; 53993e519524SHoward Hinnant if (__i >= __j) 54003e519524SHoward Hinnant break; 54013e519524SHoward Hinnant swap(*__i, *__j); 54023e519524SHoward Hinnant ++__n_swaps; 54033e519524SHoward Hinnant // It is known that __m != __j 54043e519524SHoward Hinnant // If __m just moved, follow it 54053e519524SHoward Hinnant if (__m == __i) 54063e519524SHoward Hinnant __m = __j; 54073e519524SHoward Hinnant ++__i; 54083e519524SHoward Hinnant } 54093e519524SHoward Hinnant } 54103e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 54113e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 54123e519524SHoward Hinnant { 54133e519524SHoward Hinnant swap(*__i, *__m); 54143e519524SHoward Hinnant ++__n_swaps; 54153e519524SHoward Hinnant } 54163e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 54173e519524SHoward Hinnant if (__nth == __i) 54183e519524SHoward Hinnant return; 54193e519524SHoward Hinnant if (__n_swaps == 0) 54203e519524SHoward Hinnant { 54213e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 54223e519524SHoward Hinnant if (__nth < __i) 54233e519524SHoward Hinnant { 54243e519524SHoward Hinnant // Check for [__first, __i) already sorted 54253e519524SHoward Hinnant __j = __m = __first; 54263e519524SHoward Hinnant while (++__j != __i) 54273e519524SHoward Hinnant { 54283e519524SHoward Hinnant if (__comp(*__j, *__m)) 54293e519524SHoward Hinnant // not yet sorted, so sort 54303e519524SHoward Hinnant goto not_sorted; 54313e519524SHoward Hinnant __m = __j; 54323e519524SHoward Hinnant } 54333e519524SHoward Hinnant // [__first, __i) sorted 54343e519524SHoward Hinnant return; 54353e519524SHoward Hinnant } 54363e519524SHoward Hinnant else 54373e519524SHoward Hinnant { 54383e519524SHoward Hinnant // Check for [__i, __last) already sorted 54393e519524SHoward Hinnant __j = __m = __i; 54403e519524SHoward Hinnant while (++__j != __last) 54413e519524SHoward Hinnant { 54423e519524SHoward Hinnant if (__comp(*__j, *__m)) 54433e519524SHoward Hinnant // not yet sorted, so sort 54443e519524SHoward Hinnant goto not_sorted; 54453e519524SHoward Hinnant __m = __j; 54463e519524SHoward Hinnant } 54473e519524SHoward Hinnant // [__i, __last) sorted 54483e519524SHoward Hinnant return; 54493e519524SHoward Hinnant } 54503e519524SHoward Hinnant } 54513e519524SHoward Hinnantnot_sorted: 54523e519524SHoward Hinnant // __nth_element on range containing __nth 54533e519524SHoward Hinnant if (__nth < __i) 54543e519524SHoward Hinnant { 54553e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 54563e519524SHoward Hinnant __last = __i; 54573e519524SHoward Hinnant } 54583e519524SHoward Hinnant else 54593e519524SHoward Hinnant { 54603e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 54613e519524SHoward Hinnant __first = ++__i; 54623e519524SHoward Hinnant } 54633e519524SHoward Hinnant } 54643e519524SHoward Hinnant} 54653e519524SHoward Hinnant 54663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54683e519524SHoward Hinnantvoid 54693e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54703e519524SHoward Hinnant{ 5471145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54743e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5475145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54773e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5478145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54793e519524SHoward Hinnant} 54803e519524SHoward Hinnant 54813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54833e519524SHoward Hinnantvoid 54843e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54853e519524SHoward Hinnant{ 5486ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54873e519524SHoward Hinnant} 54883e519524SHoward Hinnant 54893e519524SHoward Hinnant// includes 54903e519524SHoward Hinnant 54913e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54923e519524SHoward Hinnantbool 54933e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54943e519524SHoward Hinnant _Compare __comp) 54953e519524SHoward Hinnant{ 54963e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54973e519524SHoward Hinnant { 54983e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54993e519524SHoward Hinnant return false; 55003e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55013e519524SHoward Hinnant ++__first2; 55023e519524SHoward Hinnant } 55033e519524SHoward Hinnant return true; 55043e519524SHoward Hinnant} 55053e519524SHoward Hinnant 55063e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 55073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55083e519524SHoward Hinnantbool 55093e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 55103e519524SHoward Hinnant _Compare __comp) 55113e519524SHoward Hinnant{ 5512145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55153e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5516145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55183e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5519145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55203e519524SHoward Hinnant} 55213e519524SHoward Hinnant 55223e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55243e519524SHoward Hinnantbool 55253e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55263e519524SHoward Hinnant{ 5527ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55283e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55293e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55303e519524SHoward Hinnant} 55313e519524SHoward Hinnant 55323e519524SHoward Hinnant// set_union 55333e519524SHoward Hinnant 55343e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55353e519524SHoward Hinnant_OutputIterator 55363e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55373e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55383e519524SHoward Hinnant{ 55393e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55403e519524SHoward Hinnant { 55413e519524SHoward Hinnant if (__first2 == __last2) 5542ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55433e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55443e519524SHoward Hinnant { 55453e519524SHoward Hinnant *__result = *__first2; 55463e519524SHoward Hinnant ++__first2; 55473e519524SHoward Hinnant } 55483e519524SHoward Hinnant else 55493e519524SHoward Hinnant { 55503e519524SHoward Hinnant *__result = *__first1; 55513e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55523e519524SHoward Hinnant ++__first2; 55533e519524SHoward Hinnant ++__first1; 55543e519524SHoward Hinnant } 55553e519524SHoward Hinnant } 5556ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55573e519524SHoward Hinnant} 55583e519524SHoward Hinnant 55593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55613e519524SHoward Hinnant_OutputIterator 55623e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55643e519524SHoward Hinnant{ 5565145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55683e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5569145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55713e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5572145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55733e519524SHoward Hinnant} 55743e519524SHoward Hinnant 55753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55773e519524SHoward Hinnant_OutputIterator 55783e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55803e519524SHoward Hinnant{ 5581ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55823e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55833e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55843e519524SHoward Hinnant} 55853e519524SHoward Hinnant 55863e519524SHoward Hinnant// set_intersection 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55893e519524SHoward Hinnant_OutputIterator 55903e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55923e519524SHoward Hinnant{ 55933e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55943e519524SHoward Hinnant { 55953e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55963e519524SHoward Hinnant ++__first1; 55973e519524SHoward Hinnant else 55983e519524SHoward Hinnant { 55993e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56003e519524SHoward Hinnant { 56013e519524SHoward Hinnant *__result = *__first1; 56023e519524SHoward Hinnant ++__result; 56033e519524SHoward Hinnant ++__first1; 56043e519524SHoward Hinnant } 56053e519524SHoward Hinnant ++__first2; 56063e519524SHoward Hinnant } 56073e519524SHoward Hinnant } 56083e519524SHoward Hinnant return __result; 56093e519524SHoward Hinnant} 56103e519524SHoward Hinnant 56113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56133e519524SHoward Hinnant_OutputIterator 56143e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56163e519524SHoward Hinnant{ 5617145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56203e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5621145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56233e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5624145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56253e519524SHoward Hinnant} 56263e519524SHoward Hinnant 56273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56293e519524SHoward Hinnant_OutputIterator 56303e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56323e519524SHoward Hinnant{ 5633ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56343e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56353e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56363e519524SHoward Hinnant} 56373e519524SHoward Hinnant 56383e519524SHoward Hinnant// set_difference 56393e519524SHoward Hinnant 56403e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56413e519524SHoward Hinnant_OutputIterator 56423e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56433e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56443e519524SHoward Hinnant{ 56453e519524SHoward Hinnant while (__first1 != __last1) 56463e519524SHoward Hinnant { 56473e519524SHoward Hinnant if (__first2 == __last2) 5648ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56493e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56503e519524SHoward Hinnant { 56513e519524SHoward Hinnant *__result = *__first1; 56523e519524SHoward Hinnant ++__result; 56533e519524SHoward Hinnant ++__first1; 56543e519524SHoward Hinnant } 56553e519524SHoward Hinnant else 56563e519524SHoward Hinnant { 56573e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56583e519524SHoward Hinnant ++__first1; 56593e519524SHoward Hinnant ++__first2; 56603e519524SHoward Hinnant } 56613e519524SHoward Hinnant } 56623e519524SHoward Hinnant return __result; 56633e519524SHoward Hinnant} 56643e519524SHoward Hinnant 56653e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56673e519524SHoward Hinnant_OutputIterator 56683e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56693e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56703e519524SHoward Hinnant{ 5671145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56743e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5675145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56773e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5678145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56793e519524SHoward Hinnant} 56803e519524SHoward Hinnant 56813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56833e519524SHoward Hinnant_OutputIterator 56843e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56863e519524SHoward Hinnant{ 5687ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56883e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56893e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56903e519524SHoward Hinnant} 56913e519524SHoward Hinnant 56923e519524SHoward Hinnant// set_symmetric_difference 56933e519524SHoward Hinnant 56943e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56953e519524SHoward Hinnant_OutputIterator 56963e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56973e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56983e519524SHoward Hinnant{ 56993e519524SHoward Hinnant while (__first1 != __last1) 57003e519524SHoward Hinnant { 57013e519524SHoward Hinnant if (__first2 == __last2) 5702ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 57033e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 57043e519524SHoward Hinnant { 57053e519524SHoward Hinnant *__result = *__first1; 57063e519524SHoward Hinnant ++__result; 57073e519524SHoward Hinnant ++__first1; 57083e519524SHoward Hinnant } 57093e519524SHoward Hinnant else 57103e519524SHoward Hinnant { 57113e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57123e519524SHoward Hinnant { 57133e519524SHoward Hinnant *__result = *__first2; 57143e519524SHoward Hinnant ++__result; 57153e519524SHoward Hinnant } 57163e519524SHoward Hinnant else 57173e519524SHoward Hinnant ++__first1; 57183e519524SHoward Hinnant ++__first2; 57193e519524SHoward Hinnant } 57203e519524SHoward Hinnant } 5721ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 57223e519524SHoward Hinnant} 57233e519524SHoward Hinnant 57243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 57253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57263e519524SHoward Hinnant_OutputIterator 57273e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57283e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57293e519524SHoward Hinnant{ 5730145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57333e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5734145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57363e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5737145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57383e519524SHoward Hinnant} 57393e519524SHoward Hinnant 57403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 57413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57423e519524SHoward Hinnant_OutputIterator 57433e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57453e519524SHoward Hinnant{ 5746ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57473e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57483e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57493e519524SHoward Hinnant} 57503e519524SHoward Hinnant 57513e519524SHoward Hinnant// lexicographical_compare 57523e519524SHoward Hinnant 57533e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57543e519524SHoward Hinnantbool 57553e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57563e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57573e519524SHoward Hinnant{ 5758910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57593e519524SHoward Hinnant { 57603e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57613e519524SHoward Hinnant return true; 57623e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57633e519524SHoward Hinnant return false; 57643e519524SHoward Hinnant } 57653e519524SHoward Hinnant return false; 57663e519524SHoward Hinnant} 57673e519524SHoward Hinnant 57683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57703e519524SHoward Hinnantbool 57713e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57733e519524SHoward Hinnant{ 5774145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57753e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57763e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57773e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5778145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57793e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57803e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5781145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57823e519524SHoward Hinnant} 57833e519524SHoward Hinnant 57843e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57863e519524SHoward Hinnantbool 57873e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57883e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57893e519524SHoward Hinnant{ 5790ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57913e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57923e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57933e519524SHoward Hinnant} 57943e519524SHoward Hinnant 57953e519524SHoward Hinnant// next_permutation 57963e519524SHoward Hinnant 57973e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57983e519524SHoward Hinnantbool 57993e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58003e519524SHoward Hinnant{ 58013e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58023e519524SHoward Hinnant if (__first == __last || __first == --__i) 58033e519524SHoward Hinnant return false; 58043e519524SHoward Hinnant while (true) 58053e519524SHoward Hinnant { 58063e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58073e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 58083e519524SHoward Hinnant { 58093e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58103e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 58113e519524SHoward Hinnant ; 58123e519524SHoward Hinnant swap(*__i, *__j); 5813ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58143e519524SHoward Hinnant return true; 58153e519524SHoward Hinnant } 58163e519524SHoward Hinnant if (__i == __first) 58173e519524SHoward Hinnant { 5818ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58193e519524SHoward Hinnant return false; 58203e519524SHoward Hinnant } 58213e519524SHoward Hinnant } 58223e519524SHoward Hinnant} 58233e519524SHoward Hinnant 58243e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58263e519524SHoward Hinnantbool 58273e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58283e519524SHoward Hinnant{ 5829145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58303e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58313e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58323e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5833145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58353e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5836145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58373e519524SHoward Hinnant} 58383e519524SHoward Hinnant 58393e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58413e519524SHoward Hinnantbool 58423e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58433e519524SHoward Hinnant{ 5844ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58453e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58463e519524SHoward Hinnant} 58473e519524SHoward Hinnant 58483e519524SHoward Hinnant// prev_permutation 58493e519524SHoward Hinnant 58503e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58513e519524SHoward Hinnantbool 58523e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58533e519524SHoward Hinnant{ 58543e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58553e519524SHoward Hinnant if (__first == __last || __first == --__i) 58563e519524SHoward Hinnant return false; 58573e519524SHoward Hinnant while (true) 58583e519524SHoward Hinnant { 58593e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58603e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58613e519524SHoward Hinnant { 58623e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58633e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58643e519524SHoward Hinnant ; 58653e519524SHoward Hinnant swap(*__i, *__j); 5866ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58673e519524SHoward Hinnant return true; 58683e519524SHoward Hinnant } 58693e519524SHoward Hinnant if (__i == __first) 58703e519524SHoward Hinnant { 5871ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58723e519524SHoward Hinnant return false; 58733e519524SHoward Hinnant } 58743e519524SHoward Hinnant } 58753e519524SHoward Hinnant} 58763e519524SHoward Hinnant 58773e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58793e519524SHoward Hinnantbool 58803e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58813e519524SHoward Hinnant{ 5882145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58853e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5886145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58883e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5889145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58903e519524SHoward Hinnant} 58913e519524SHoward Hinnant 58923e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58943e519524SHoward Hinnantbool 58953e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58963e519524SHoward Hinnant{ 5897ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58983e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58993e519524SHoward Hinnant} 59003e519524SHoward Hinnant 59013e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 59023e519524SHoward Hinnant 5903a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5904a016efb1SEric Fiselier 59053e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5906