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> 644*d835e592SMarshall Clow#include <functional> 6453e519524SHoward Hinnant#include <iterator> 646a1d07d57SHoward Hinnant#include <cstddef> 6473e519524SHoward Hinnant 6485d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6495d1a701dSHoward Hinnant#include "support/ibm/support.h" 6505d1a701dSHoward Hinnant#endif 6515d50aa32SEric Fiselier#if defined(_LIBCPP_COMPILER_MSVC) 65280f8cfb3SEric Fiselier#include <intrin.h> 6535f878d4bSHoward Hinnant#endif 6545d1a701dSHoward Hinnant 655c1bd9197SEric Fiselier#include <__debug> 656c1bd9197SEric Fiselier 657073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6583e519524SHoward Hinnant#pragma GCC system_header 659073458b1SHoward Hinnant#endif 6603e519524SHoward Hinnant 661a016efb1SEric Fiselier_LIBCPP_PUSH_MACROS 662a016efb1SEric Fiselier#include <__undef_macros> 663a016efb1SEric Fiselier 664a016efb1SEric Fiselier 6653e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6663e519524SHoward Hinnant 6679d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6689d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6699d67c6d5SMarshall Clow// * We haven't included <functional> here. 6703e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6713e519524SHoward Hinnantstruct __equal_to 6723e519524SHoward Hinnant{ 6733e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6743e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6753e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6763e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6773e519524SHoward Hinnant}; 6783e519524SHoward Hinnant 6793e519524SHoward Hinnanttemplate <class _T1> 6803e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6813e519524SHoward Hinnant{ 6829d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6839d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6843e519524SHoward Hinnant}; 6853e519524SHoward Hinnant 6863e519524SHoward Hinnanttemplate <class _T1> 6873e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6883e519524SHoward Hinnant{ 6899d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6909d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6913e519524SHoward Hinnant}; 6923e519524SHoward Hinnant 6933e519524SHoward Hinnanttemplate <class _T1> 6943e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6953e519524SHoward Hinnant{ 6969d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6979d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6983e519524SHoward Hinnant}; 6993e519524SHoward Hinnant 7003e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 7013e519524SHoward Hinnantstruct __less 7023e519524SHoward Hinnant{ 7039d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7049d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7059d67c6d5SMarshall Clow 7069d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7079d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7089d67c6d5SMarshall Clow 7099d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7109d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7119d67c6d5SMarshall Clow 7129d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7139d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7143e519524SHoward Hinnant}; 7153e519524SHoward Hinnant 7163e519524SHoward Hinnanttemplate <class _T1> 7173e519524SHoward Hinnantstruct __less<_T1, _T1> 7183e519524SHoward Hinnant{ 7199d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7209d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7213e519524SHoward Hinnant}; 7223e519524SHoward Hinnant 7233e519524SHoward Hinnanttemplate <class _T1> 7243e519524SHoward Hinnantstruct __less<const _T1, _T1> 7253e519524SHoward Hinnant{ 7269d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7279d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7283e519524SHoward Hinnant}; 7293e519524SHoward Hinnant 7303e519524SHoward Hinnanttemplate <class _T1> 7313e519524SHoward Hinnantstruct __less<_T1, const _T1> 7323e519524SHoward Hinnant{ 7339d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7349d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7353e519524SHoward Hinnant}; 7363e519524SHoward Hinnant 7373e519524SHoward Hinnanttemplate <class _Predicate> 738a763b36fSMarshall Clowclass __invert // invert the sense of a comparison 7393e519524SHoward Hinnant{ 7403e519524SHoward Hinnantprivate: 7413e519524SHoward Hinnant _Predicate __p_; 7423e519524SHoward Hinnantpublic: 743a763b36fSMarshall Clow _LIBCPP_INLINE_VISIBILITY __invert() {} 7443e519524SHoward Hinnant 7453e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 746a763b36fSMarshall Clow explicit __invert(_Predicate __p) : __p_(__p) {} 7473e519524SHoward Hinnant 7483e519524SHoward Hinnant template <class _T1> 7493e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7503e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7513e519524SHoward Hinnant 7523e519524SHoward Hinnant template <class _T1, class _T2> 7533e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 754a763b36fSMarshall Clow bool operator()(const _T1& __x, const _T2& __y) {return __p_(__y, __x);} 7553e519524SHoward Hinnant}; 7563e519524SHoward Hinnant 757145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7583e519524SHoward Hinnant 7593e519524SHoward Hinnanttemplate <class _Compare> 7603e519524SHoward Hinnantstruct __debug_less 7613e519524SHoward Hinnant{ 7623e519524SHoward Hinnant _Compare __comp_; 7633e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 764331d2159SEric Fiselier 7653e519524SHoward Hinnant template <class _Tp, class _Up> 7663e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7673e519524SHoward Hinnant { 7683e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7693e519524SHoward Hinnant if (__r) 770331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7713e519524SHoward Hinnant return __r; 7723e519524SHoward Hinnant } 773331d2159SEric Fiselier 774331d2159SEric Fiselier template <class _LHS, class _RHS> 775331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 776331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 777331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 778331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 779331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 780331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 781331d2159SEric Fiselier } 782331d2159SEric Fiselier 783331d2159SEric Fiselier template <class _LHS, class _RHS> 784331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 785331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7863e519524SHoward Hinnant}; 7873e519524SHoward Hinnant 788145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7893e519524SHoward Hinnant 790c8edcb36SHoward Hinnant// Precondition: __x != 0 791c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 79280f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 79380f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 794c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 79580f8cfb3SEric Fiselier#else 79680f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 79780f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 79880f8cfb3SEric Fiselier unsigned long where; 79980f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 80080f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8019a0a0045SShoaib Meenai if (_BitScanForward(&where, __x)) 80280f8cfb3SEric Fiselier return where; 80380f8cfb3SEric Fiselier return 32; 80480f8cfb3SEric Fiselier#endif 805c206366fSHoward Hinnant} 806c206366fSHoward Hinnant 807c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 80880f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 80980f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 810c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 81180f8cfb3SEric Fiselier#else 81280f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 81380f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 81480f8cfb3SEric Fiselier#endif 815c206366fSHoward Hinnant} 816c206366fSHoward Hinnant 817c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 81880f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 81980f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 820c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 82180f8cfb3SEric Fiselier#else 82280f8cfb3SEric Fiselier unsigned long where; 82380f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 82480f8cfb3SEric Fiselier// Returns zero if no set bit is found. 82580f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 82680f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 8279a0a0045SShoaib Meenai if (_BitScanForward64(&where, __x)) 82880f8cfb3SEric Fiselier return static_cast<int>(where); 82980f8cfb3SEric Fiselier#else 83080f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 83180f8cfb3SEric Fiselier // Scan the Low Word. 8329a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x))) 83380f8cfb3SEric Fiselier return where; 83480f8cfb3SEric Fiselier // Scan the High Word. 8359a0a0045SShoaib Meenai if (_BitScanForward(&where, static_cast<unsigned long>(__x >> 32))) 83680f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 83780f8cfb3SEric Fiselier#endif 83880f8cfb3SEric Fiselier return 64; 83980f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 840c206366fSHoward Hinnant} 841c8edcb36SHoward Hinnant 842c8edcb36SHoward Hinnant// Precondition: __x != 0 843c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 84480f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 84580f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 846c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 84780f8cfb3SEric Fiselier#else 84880f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 84980f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 85080f8cfb3SEric Fiselier unsigned long where; 85180f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 85280f8cfb3SEric Fiselier // Returns zero if no set bit is found. 8539a0a0045SShoaib Meenai if (_BitScanReverse(&where, __x)) 85480f8cfb3SEric Fiselier return 31 - where; 85580f8cfb3SEric Fiselier return 32; // Undefined Behavior. 85680f8cfb3SEric Fiselier#endif 857c206366fSHoward Hinnant} 858c206366fSHoward Hinnant 859c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 86080f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 86180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 862c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 86380f8cfb3SEric Fiselier#else 86480f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 86580f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 86680f8cfb3SEric Fiselier#endif 867c206366fSHoward Hinnant} 868c206366fSHoward Hinnant 869c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 87080f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 87180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 872c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 87380f8cfb3SEric Fiselier#else 87480f8cfb3SEric Fiselier unsigned long where; 87580f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 87680f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 87780f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 8789a0a0045SShoaib Meenai if (_BitScanReverse64(&where, __x)) 87980f8cfb3SEric Fiselier return static_cast<int>(63 - where); 88080f8cfb3SEric Fiselier#else 88180f8cfb3SEric Fiselier // Scan the high 32 bits. 8829a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x >> 32))) 88380f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 88480f8cfb3SEric Fiselier // Scan the low 32 bits. 8859a0a0045SShoaib Meenai if (_BitScanReverse(&where, static_cast<unsigned long>(__x))) 88680f8cfb3SEric Fiselier return 63 - where; 88780f8cfb3SEric Fiselier#endif 88880f8cfb3SEric Fiselier return 64; // Undefined Behavior. 88980f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 890c206366fSHoward Hinnant} 891c8edcb36SHoward Hinnant 89280f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 89380f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 89480f8cfb3SEric Fiselier return __builtin_popcount (__x); 89580f8cfb3SEric Fiselier#else 89680f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 89780f8cfb3SEric Fiselier return __popcnt(__x); 89880f8cfb3SEric Fiselier#endif 89980f8cfb3SEric Fiselier} 90080f8cfb3SEric Fiselier 90180f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 90280f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 90380f8cfb3SEric Fiselier return __builtin_popcountl (__x); 90480f8cfb3SEric Fiselier#else 90580f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 90680f8cfb3SEric Fiselier return __popcnt(__x); 90780f8cfb3SEric Fiselier#endif 90880f8cfb3SEric Fiselier} 90980f8cfb3SEric Fiselier 91080f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 91180f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 91280f8cfb3SEric Fiselier return __builtin_popcountll(__x); 91380f8cfb3SEric Fiselier#else 91480f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 91580f8cfb3SEric Fiselier return __popcnt64(__x); 91680f8cfb3SEric Fiselier#endif 91780f8cfb3SEric Fiselier} 918c8edcb36SHoward Hinnant 9193e519524SHoward Hinnant// all_of 9203e519524SHoward Hinnant 9213e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9233e519524SHoward Hinnantbool 9243e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9253e519524SHoward Hinnant{ 9263e519524SHoward Hinnant for (; __first != __last; ++__first) 9273e519524SHoward Hinnant if (!__pred(*__first)) 9283e519524SHoward Hinnant return false; 9293e519524SHoward Hinnant return true; 9303e519524SHoward Hinnant} 9313e519524SHoward Hinnant 9323e519524SHoward Hinnant// any_of 9333e519524SHoward Hinnant 9343e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9363e519524SHoward Hinnantbool 9373e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9383e519524SHoward Hinnant{ 9393e519524SHoward Hinnant for (; __first != __last; ++__first) 9403e519524SHoward Hinnant if (__pred(*__first)) 9413e519524SHoward Hinnant return true; 9423e519524SHoward Hinnant return false; 9433e519524SHoward Hinnant} 9443e519524SHoward Hinnant 9453e519524SHoward Hinnant// none_of 9463e519524SHoward Hinnant 9473e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9493e519524SHoward Hinnantbool 9503e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9513e519524SHoward Hinnant{ 9523e519524SHoward Hinnant for (; __first != __last; ++__first) 9533e519524SHoward Hinnant if (__pred(*__first)) 9543e519524SHoward Hinnant return false; 9553e519524SHoward Hinnant return true; 9563e519524SHoward Hinnant} 9573e519524SHoward Hinnant 9583e519524SHoward Hinnant// for_each 9593e519524SHoward Hinnant 9603e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9623e519524SHoward Hinnant_Function 9633e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9643e519524SHoward Hinnant{ 9653e519524SHoward Hinnant for (; __first != __last; ++__first) 9663e519524SHoward Hinnant __f(*__first); 9671c7fe126SMarshall Clow return __f; 9683e519524SHoward Hinnant} 9693e519524SHoward Hinnant 9701d02996dSMarshall Clow#if _LIBCPP_STD_VER > 14 971d5c65ffaSMarshall Clow// for_each_n 972d5c65ffaSMarshall Clow 973d5c65ffaSMarshall Clowtemplate <class _InputIterator, class _Size, class _Function> 974d5c65ffaSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 975d5c65ffaSMarshall Clow_InputIterator 976d5c65ffaSMarshall Clowfor_each_n(_InputIterator __first, _Size __orig_n, _Function __f) 977d5c65ffaSMarshall Clow{ 978d5c65ffaSMarshall Clow typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 979d5c65ffaSMarshall Clow _IntegralSize __n = __orig_n; 980d5c65ffaSMarshall Clow while (__n > 0) 981d5c65ffaSMarshall Clow { 982d5c65ffaSMarshall Clow __f(*__first); 983d5c65ffaSMarshall Clow ++__first; 984d5c65ffaSMarshall Clow --__n; 985d5c65ffaSMarshall Clow } 986d5c65ffaSMarshall Clow return __first; 987d5c65ffaSMarshall Clow} 9881d02996dSMarshall Clow#endif 989d5c65ffaSMarshall Clow 9903e519524SHoward Hinnant// find 9913e519524SHoward Hinnant 9923e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9943e519524SHoward Hinnant_InputIterator 995e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9963e519524SHoward Hinnant{ 9973e519524SHoward Hinnant for (; __first != __last; ++__first) 998e4383379SHoward Hinnant if (*__first == __value_) 9993e519524SHoward Hinnant break; 10003e519524SHoward Hinnant return __first; 10013e519524SHoward Hinnant} 10023e519524SHoward Hinnant 10033e519524SHoward Hinnant// find_if 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 10063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10073e519524SHoward Hinnant_InputIterator 10083e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10093e519524SHoward Hinnant{ 10103e519524SHoward Hinnant for (; __first != __last; ++__first) 10113e519524SHoward Hinnant if (__pred(*__first)) 10123e519524SHoward Hinnant break; 10133e519524SHoward Hinnant return __first; 10143e519524SHoward Hinnant} 10153e519524SHoward Hinnant 10163e519524SHoward Hinnant// find_if_not 10173e519524SHoward Hinnant 10183e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 10193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10203e519524SHoward Hinnant_InputIterator 10213e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 10223e519524SHoward Hinnant{ 10233e519524SHoward Hinnant for (; __first != __last; ++__first) 10243e519524SHoward Hinnant if (!__pred(*__first)) 10253e519524SHoward Hinnant break; 10263e519524SHoward Hinnant return __first; 10273e519524SHoward Hinnant} 10283e519524SHoward Hinnant 10293e519524SHoward Hinnant// find_end 10303e519524SHoward Hinnant 10313e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10323e519524SHoward Hinnant_ForwardIterator1 10333e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10343e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10353e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10363e519524SHoward Hinnant{ 10373e519524SHoward Hinnant // modeled after search algorithm 10383e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10393e519524SHoward Hinnant if (__first2 == __last2) 10403e519524SHoward Hinnant return __r; 10413e519524SHoward Hinnant while (true) 10423e519524SHoward Hinnant { 10433e519524SHoward Hinnant while (true) 10443e519524SHoward Hinnant { 10453e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10463e519524SHoward Hinnant return __r; // (or __last1 if never found) 10473e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10483e519524SHoward Hinnant break; 10493e519524SHoward Hinnant ++__first1; 10503e519524SHoward Hinnant } 10513e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10523e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10533e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10543e519524SHoward Hinnant while (true) 10553e519524SHoward Hinnant { 10563e519524SHoward Hinnant if (++__m2 == __last2) 10573e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10583e519524SHoward Hinnant __r = __first1; 10593e519524SHoward Hinnant ++__first1; 10603e519524SHoward Hinnant break; 10613e519524SHoward Hinnant } 10623e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10633e519524SHoward Hinnant return __r; 10643e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10653e519524SHoward Hinnant { 10663e519524SHoward Hinnant ++__first1; 10673e519524SHoward Hinnant break; 10683e519524SHoward Hinnant } // else there is a match, check next elements 10693e519524SHoward Hinnant } 10703e519524SHoward Hinnant } 10713e519524SHoward Hinnant} 10723e519524SHoward Hinnant 10733e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10743e519524SHoward Hinnant_BidirectionalIterator1 10753e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10763e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10773e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10783e519524SHoward Hinnant{ 10793e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10803e519524SHoward Hinnant if (__first2 == __last2) 10813e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10823e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10833e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10843e519524SHoward Hinnant --__l2; 10853e519524SHoward Hinnant while (true) 10863e519524SHoward Hinnant { 10873e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10883e519524SHoward Hinnant while (true) 10893e519524SHoward Hinnant { 10903e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10913e519524SHoward Hinnant return __last1; 10923e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10933e519524SHoward Hinnant break; 10943e519524SHoward Hinnant } 10953e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10963e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10973e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10983e519524SHoward Hinnant while (true) 10993e519524SHoward Hinnant { 11003e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 11013e519524SHoward Hinnant return __m1; 11023e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 11033e519524SHoward Hinnant return __last1; 11043e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 11053e519524SHoward Hinnant { 11063e519524SHoward Hinnant break; 11073e519524SHoward Hinnant } // else there is a match, check next elements 11083e519524SHoward Hinnant } 11093e519524SHoward Hinnant } 11103e519524SHoward Hinnant} 11113e519524SHoward Hinnant 11123e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 11139b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 11143e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 11153e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 11163e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 11173e519524SHoward Hinnant{ 11183e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 11193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 11203e519524SHoward Hinnant if (__len2 == 0) 11213e519524SHoward Hinnant return __last1; 11223e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 11233e519524SHoward Hinnant if (__len1 < __len2) 11243e519524SHoward Hinnant return __last1; 11253e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11263e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11273e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11283e519524SHoward Hinnant --__l2; 11293e519524SHoward Hinnant while (true) 11303e519524SHoward Hinnant { 11313e519524SHoward Hinnant while (true) 11323e519524SHoward Hinnant { 11333e519524SHoward Hinnant if (__s == __l1) 11343e519524SHoward Hinnant return __last1; 11353e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11363e519524SHoward Hinnant break; 11373e519524SHoward Hinnant } 11383e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11393e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11403e519524SHoward Hinnant while (true) 11413e519524SHoward Hinnant { 11423e519524SHoward Hinnant if (__m2 == __first2) 11433e519524SHoward Hinnant return __m1; 11443e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11453e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11463e519524SHoward Hinnant { 11473e519524SHoward Hinnant break; 11483e519524SHoward Hinnant } 11493e519524SHoward Hinnant } 11503e519524SHoward Hinnant } 11513e519524SHoward Hinnant} 11523e519524SHoward Hinnant 11533e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11553e519524SHoward Hinnant_ForwardIterator1 11563e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11573e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11583e519524SHoward Hinnant{ 1159ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11603e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11613e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11623e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11633e519524SHoward Hinnant} 11643e519524SHoward Hinnant 11653e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11673e519524SHoward Hinnant_ForwardIterator1 11683e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11693e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11703e519524SHoward Hinnant{ 11713e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1173ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11743e519524SHoward Hinnant} 11753e519524SHoward Hinnant 11763e519524SHoward Hinnant// find_first_of 11773e519524SHoward Hinnant 11783e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11799b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11809b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11813e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11823e519524SHoward Hinnant{ 11833e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11843e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11853e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11863e519524SHoward Hinnant return __first1; 11873e519524SHoward Hinnant return __last1; 11883e519524SHoward Hinnant} 11893e519524SHoward Hinnant 11909b0af34dSMarshall Clow 11919b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11929b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11939b0af34dSMarshall Clow_ForwardIterator1 11949b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11959b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11969b0af34dSMarshall Clow{ 11979b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11989b0af34dSMarshall Clow} 11999b0af34dSMarshall Clow 12003e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 12013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12023e519524SHoward Hinnant_ForwardIterator1 12033e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12043e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 12053e519524SHoward Hinnant{ 12063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 12073e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 12089b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12093e519524SHoward Hinnant} 12103e519524SHoward Hinnant 12113e519524SHoward Hinnant// adjacent_find 12123e519524SHoward Hinnant 12133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 12143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12153e519524SHoward Hinnant_ForwardIterator 12163e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 12173e519524SHoward Hinnant{ 12183e519524SHoward Hinnant if (__first != __last) 12193e519524SHoward Hinnant { 12203e519524SHoward Hinnant _ForwardIterator __i = __first; 12213e519524SHoward Hinnant while (++__i != __last) 12223e519524SHoward Hinnant { 12233e519524SHoward Hinnant if (__pred(*__first, *__i)) 12243e519524SHoward Hinnant return __first; 12253e519524SHoward Hinnant __first = __i; 12263e519524SHoward Hinnant } 12273e519524SHoward Hinnant } 12283e519524SHoward Hinnant return __last; 12293e519524SHoward Hinnant} 12303e519524SHoward Hinnant 12313e519524SHoward Hinnanttemplate <class _ForwardIterator> 12323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12333e519524SHoward Hinnant_ForwardIterator 12343e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12353e519524SHoward Hinnant{ 12363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1237ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12383e519524SHoward Hinnant} 12393e519524SHoward Hinnant 12403e519524SHoward Hinnant// count 12413e519524SHoward Hinnant 12423e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12443e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1245e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12463e519524SHoward Hinnant{ 12473e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12483e519524SHoward Hinnant for (; __first != __last; ++__first) 1249e4383379SHoward Hinnant if (*__first == __value_) 12503e519524SHoward Hinnant ++__r; 12513e519524SHoward Hinnant return __r; 12523e519524SHoward Hinnant} 12533e519524SHoward Hinnant 12543e519524SHoward Hinnant// count_if 12553e519524SHoward Hinnant 12563e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12583e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12593e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12603e519524SHoward Hinnant{ 12613e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12623e519524SHoward Hinnant for (; __first != __last; ++__first) 12633e519524SHoward Hinnant if (__pred(*__first)) 12643e519524SHoward Hinnant ++__r; 12653e519524SHoward Hinnant return __r; 12663e519524SHoward Hinnant} 12673e519524SHoward Hinnant 12683e519524SHoward Hinnant// mismatch 12693e519524SHoward Hinnant 12703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12723e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12733e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12743e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12753e519524SHoward Hinnant{ 1276bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12773e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12783e519524SHoward Hinnant break; 12793e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12803e519524SHoward Hinnant} 12813e519524SHoward Hinnant 12823e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12843e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12853e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12863e519524SHoward Hinnant{ 12873e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12883e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1289ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12903e519524SHoward Hinnant} 12913e519524SHoward Hinnant 12920b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12930b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12940b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12950b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12960b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12970b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12980b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12990b0bbd2fSMarshall Clow{ 1300bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13010b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13020b0bbd2fSMarshall Clow break; 13030b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 13040b0bbd2fSMarshall Clow} 13050b0bbd2fSMarshall Clow 13060b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13070b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13080b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 13090b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 13100b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13110b0bbd2fSMarshall Clow{ 13120b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13130b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13140b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 13150b0bbd2fSMarshall Clow} 13160b0bbd2fSMarshall Clow#endif 13170b0bbd2fSMarshall Clow 13183e519524SHoward Hinnant// equal 13193e519524SHoward Hinnant 13203e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13223e519524SHoward Hinnantbool 13233e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 13243e519524SHoward Hinnant{ 1325910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13263e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13273e519524SHoward Hinnant return false; 13283e519524SHoward Hinnant return true; 13293e519524SHoward Hinnant} 13303e519524SHoward Hinnant 13313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13333e519524SHoward Hinnantbool 13343e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13353e519524SHoward Hinnant{ 13363e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13373e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1338ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13393e519524SHoward Hinnant} 13403e519524SHoward Hinnant 13410b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13420b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13430b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13440b0bbd2fSMarshall Clowbool 13450b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13460b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13470b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13480b0bbd2fSMarshall Clow{ 1349910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13500b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13510b0bbd2fSMarshall Clow return false; 13520b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13530b0bbd2fSMarshall Clow} 13540b0bbd2fSMarshall Clow 13550b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13560b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13570b0bbd2fSMarshall Clowbool 13580b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13590b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13600b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13610b0bbd2fSMarshall Clow{ 13620b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13630b0bbd2fSMarshall Clow return false; 13640b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13650b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13660b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13670b0bbd2fSMarshall Clow} 13680b0bbd2fSMarshall Clow 13690b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13700b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13710b0bbd2fSMarshall Clowbool 13720b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13730b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13740b0bbd2fSMarshall Clow{ 13750b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13760b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13770b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13780b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13790b0bbd2fSMarshall Clow} 13800b0bbd2fSMarshall Clow 13810b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13820b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13830b0bbd2fSMarshall Clowbool 13840b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13850b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13860b0bbd2fSMarshall Clow{ 13870b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13880b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13890b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13900b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13910b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13920b0bbd2fSMarshall Clow} 13930b0bbd2fSMarshall Clow#endif 13940b0bbd2fSMarshall Clow 13953e519524SHoward Hinnant// is_permutation 13963e519524SHoward Hinnant 13973e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13983e519524SHoward Hinnantbool 13993e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14003e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 14013e519524SHoward Hinnant{ 14023e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1403910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 14043e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 14053e519524SHoward Hinnant goto __not_done; 14063e519524SHoward Hinnant return true; 14073e519524SHoward Hinnant__not_done: 14083e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 14093e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1410ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 14113e519524SHoward Hinnant if (__l1 == _D1(1)) 14123e519524SHoward Hinnant return false; 1413ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 14143e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 14153e519524SHoward Hinnant // equal elements in [f2, l2) 14163e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14173e519524SHoward Hinnant { 14183e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 14193e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14203e519524SHoward Hinnant if (__pred(*__j, *__i)) 14213e519524SHoward Hinnant goto __next_iter; 14223e519524SHoward Hinnant { 14233e519524SHoward Hinnant // Count number of *__i in [f2, l2) 14243e519524SHoward Hinnant _D1 __c2 = 0; 14253e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14263e519524SHoward Hinnant if (__pred(*__i, *__j)) 14273e519524SHoward Hinnant ++__c2; 14283e519524SHoward Hinnant if (__c2 == 0) 14293e519524SHoward Hinnant return false; 14303e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14313e519524SHoward Hinnant _D1 __c1 = 1; 1432ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14333e519524SHoward Hinnant if (__pred(*__i, *__j)) 14343e519524SHoward Hinnant ++__c1; 14353e519524SHoward Hinnant if (__c1 != __c2) 14363e519524SHoward Hinnant return false; 14373e519524SHoward Hinnant } 14383e519524SHoward Hinnant__next_iter:; 14393e519524SHoward Hinnant } 14403e519524SHoward Hinnant return true; 14413e519524SHoward Hinnant} 14423e519524SHoward Hinnant 14433e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 14443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14453e519524SHoward Hinnantbool 14463e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14473e519524SHoward Hinnant _ForwardIterator2 __first2) 14483e519524SHoward Hinnant{ 14493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14503e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1451ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14523e519524SHoward Hinnant} 14533e519524SHoward Hinnant 14540b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14550b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14560b0bbd2fSMarshall Clowbool 14570b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14580b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14590b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14600b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14610b0bbd2fSMarshall Clow{ 14620b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1463847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14640b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 14650b0bbd2fSMarshall Clow goto __not_done; 14660b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 14670b0bbd2fSMarshall Clow__not_done: 14680b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 14690b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14700b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14710b0bbd2fSMarshall Clow 14720b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1473fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14740b0bbd2fSMarshall Clow if (__l1 != __l2) 14750b0bbd2fSMarshall Clow return false; 14760b0bbd2fSMarshall Clow 14770b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14780b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14790b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14800b0bbd2fSMarshall Clow { 14810b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 14820b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14830b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 14840b0bbd2fSMarshall Clow goto __next_iter; 14850b0bbd2fSMarshall Clow { 14860b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14870b0bbd2fSMarshall Clow _D1 __c2 = 0; 14880b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14890b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14900b0bbd2fSMarshall Clow ++__c2; 14910b0bbd2fSMarshall Clow if (__c2 == 0) 14920b0bbd2fSMarshall Clow return false; 14930b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14940b0bbd2fSMarshall Clow _D1 __c1 = 1; 14950b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14960b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14970b0bbd2fSMarshall Clow ++__c1; 14980b0bbd2fSMarshall Clow if (__c1 != __c2) 14990b0bbd2fSMarshall Clow return false; 15000b0bbd2fSMarshall Clow } 15010b0bbd2fSMarshall Clow__next_iter:; 15020b0bbd2fSMarshall Clow } 15030b0bbd2fSMarshall Clow return true; 15040b0bbd2fSMarshall Clow} 15050b0bbd2fSMarshall Clow 15060b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 15070b0bbd2fSMarshall Clowbool 15080b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 15090b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 15100b0bbd2fSMarshall Clow _BinaryPredicate __pred, 15110b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 15120b0bbd2fSMarshall Clow{ 15130b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 15140b0bbd2fSMarshall Clow return false; 15150b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 15160b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 15170b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 15180b0bbd2fSMarshall Clow} 15190b0bbd2fSMarshall Clow 15200b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15210b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15220b0bbd2fSMarshall Clowbool 15230b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15240b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 15250b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15260b0bbd2fSMarshall Clow{ 15270b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15280b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15290b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15300b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15310b0bbd2fSMarshall Clow} 15320b0bbd2fSMarshall Clow 15330b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 15340b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15350b0bbd2fSMarshall Clowbool 15360b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15370b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15380b0bbd2fSMarshall Clow{ 15390b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15400b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15410b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15420b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15430b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15440b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15450b0bbd2fSMarshall Clow} 15460b0bbd2fSMarshall Clow#endif 15470b0bbd2fSMarshall Clow 15483e519524SHoward Hinnant// search 1549*d835e592SMarshall Clow// __search is in <functional> 15503e519524SHoward Hinnant 15513e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15533e519524SHoward Hinnant_ForwardIterator1 15543e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15553e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15563e519524SHoward Hinnant{ 1557ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15583e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 155928cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 156028cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 156128cc4ddeSMarshall Clow .first; 15623e519524SHoward Hinnant} 15633e519524SHoward Hinnant 15643e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15663e519524SHoward Hinnant_ForwardIterator1 15673e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15683e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15693e519524SHoward Hinnant{ 157028cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 157128cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1572ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15733e519524SHoward Hinnant} 15743e519524SHoward Hinnant 1575*d835e592SMarshall Clow 1576*d835e592SMarshall Clow#if _LIBCPP_STD_VER > 14 1577*d835e592SMarshall Clowtemplate <class _ForwardIterator, class _Searcher> 1578*d835e592SMarshall Clow_LIBCPP_INLINE_VISIBILITY 1579*d835e592SMarshall Clow_ForwardIterator search(_ForwardIterator __f, _ForwardIterator __l, const _Searcher &__s) 1580*d835e592SMarshall Clow{ return __s(__f, __l).first; } 1581*d835e592SMarshall Clow#endif 1582*d835e592SMarshall Clow 15833e519524SHoward Hinnant// search_n 15843e519524SHoward Hinnant 15853e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15863e519524SHoward Hinnant_ForwardIterator 15873e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1588e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15893e519524SHoward Hinnant{ 15903e519524SHoward Hinnant if (__count <= 0) 15913e519524SHoward Hinnant return __first; 15923e519524SHoward Hinnant while (true) 15933e519524SHoward Hinnant { 1594e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15953e519524SHoward Hinnant while (true) 15963e519524SHoward Hinnant { 1597e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15983e519524SHoward Hinnant return __last; 1599e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16003e519524SHoward Hinnant break; 16013e519524SHoward Hinnant ++__first; 16023e519524SHoward Hinnant } 1603e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16043e519524SHoward Hinnant _ForwardIterator __m = __first; 16053e519524SHoward Hinnant _Size __c(0); 16063e519524SHoward Hinnant while (true) 16073e519524SHoward Hinnant { 16083e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16093e519524SHoward Hinnant return __first; 16103e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16113e519524SHoward Hinnant return __last; 1612e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16133e519524SHoward Hinnant { 16143e519524SHoward Hinnant __first = __m; 16153e519524SHoward Hinnant ++__first; 16163e519524SHoward Hinnant break; 16173e519524SHoward Hinnant } // else there is a match, check next elements 16183e519524SHoward Hinnant } 16193e519524SHoward Hinnant } 16203e519524SHoward Hinnant} 16213e519524SHoward Hinnant 16223e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16233e519524SHoward Hinnant_RandomAccessIterator 16243e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1625e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16263e519524SHoward Hinnant{ 16273e519524SHoward Hinnant if (__count <= 0) 16283e519524SHoward Hinnant return __first; 16293e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16303e519524SHoward Hinnant if (__len < __count) 16313e519524SHoward Hinnant return __last; 16323e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16333e519524SHoward Hinnant while (true) 16343e519524SHoward Hinnant { 1635e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16363e519524SHoward Hinnant while (true) 16373e519524SHoward Hinnant { 1638b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16393e519524SHoward Hinnant return __last; 1640e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16413e519524SHoward Hinnant break; 16423e519524SHoward Hinnant ++__first; 16433e519524SHoward Hinnant } 1644e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16453e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16463e519524SHoward Hinnant _Size __c(0); 16473e519524SHoward Hinnant while (true) 16483e519524SHoward Hinnant { 16493e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16503e519524SHoward Hinnant return __first; 16513e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1652e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16533e519524SHoward Hinnant { 16543e519524SHoward Hinnant __first = __m; 16553e519524SHoward Hinnant ++__first; 16563e519524SHoward Hinnant break; 16573e519524SHoward Hinnant } // else there is a match, check next elements 16583e519524SHoward Hinnant } 16593e519524SHoward Hinnant } 16603e519524SHoward Hinnant} 16613e519524SHoward Hinnant 16623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16643e519524SHoward Hinnant_ForwardIterator 16653e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1666e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16673e519524SHoward Hinnant{ 1668ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 166951544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 167051544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16713e519524SHoward Hinnant} 16723e519524SHoward Hinnant 16733e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16753e519524SHoward Hinnant_ForwardIterator 1676e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16773e519524SHoward Hinnant{ 16783e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 167951544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 168051544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16813e519524SHoward Hinnant} 16823e519524SHoward Hinnant 16833e519524SHoward Hinnant// copy 16843e519524SHoward Hinnanttemplate <class _Iter> 16853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16863e519524SHoward Hinnant_Iter 16873e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16883e519524SHoward Hinnant{ 16893e519524SHoward Hinnant return __i; 16903e519524SHoward Hinnant} 16913e519524SHoward Hinnant 16923e519524SHoward Hinnanttemplate <class _Tp> 16935b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 16943e519524SHoward Hinnanttypename enable_if 16953e519524SHoward Hinnant< 1696ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16973e519524SHoward Hinnant _Tp* 16983e519524SHoward Hinnant>::type 16993e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17003e519524SHoward Hinnant{ 17013e519524SHoward Hinnant return __i.base(); 17023e519524SHoward Hinnant} 17033e519524SHoward Hinnant 1704fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1705fc88dbd2SHoward Hinnant 17063e519524SHoward Hinnanttemplate <class _Tp> 17075b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 17083e519524SHoward Hinnanttypename enable_if 17093e519524SHoward Hinnant< 1710ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17113e519524SHoward Hinnant _Tp* 17123e519524SHoward Hinnant>::type 17133e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17143e519524SHoward Hinnant{ 17153e519524SHoward Hinnant return __i.base(); 17163e519524SHoward Hinnant} 17173e519524SHoward Hinnant 171814bd0bf0SEric Fiselier#else 171914bd0bf0SEric Fiselier 172014bd0bf0SEric Fiseliertemplate <class _Tp> 17215b7c98e5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 172214bd0bf0SEric Fiseliertypename enable_if 172314bd0bf0SEric Fiselier< 172414bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 172514bd0bf0SEric Fiselier __wrap_iter<_Tp*> 172614bd0bf0SEric Fiselier>::type 172714bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 172814bd0bf0SEric Fiselier{ 172914bd0bf0SEric Fiselier return __i; 173014bd0bf0SEric Fiselier} 173114bd0bf0SEric Fiselier 1732fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1733fc88dbd2SHoward Hinnant 17343e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17363e519524SHoward Hinnant_OutputIterator 17373e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17383e519524SHoward Hinnant{ 1739910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17403e519524SHoward Hinnant *__result = *__first; 17413e519524SHoward Hinnant return __result; 17423e519524SHoward Hinnant} 17433e519524SHoward Hinnant 17443e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17463e519524SHoward Hinnanttypename enable_if 17473e519524SHoward Hinnant< 17483e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1749ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17503e519524SHoward Hinnant _Up* 17513e519524SHoward Hinnant>::type 17523e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17533e519524SHoward Hinnant{ 17543e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17555b312052SMarshall Clow if (__n > 0) 1756ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17573e519524SHoward Hinnant return __result + __n; 17583e519524SHoward Hinnant} 17593e519524SHoward Hinnant 17603e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17623e519524SHoward Hinnant_OutputIterator 17633e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17643e519524SHoward Hinnant{ 1765ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17663e519524SHoward Hinnant} 17673e519524SHoward Hinnant 17683e519524SHoward Hinnant// copy_backward 17693e519524SHoward Hinnant 1770d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17723e519524SHoward Hinnant_OutputIterator 1773d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17743e519524SHoward Hinnant{ 17753e519524SHoward Hinnant while (__first != __last) 17763e519524SHoward Hinnant *--__result = *--__last; 17773e519524SHoward Hinnant return __result; 17783e519524SHoward Hinnant} 17793e519524SHoward Hinnant 17803e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17823e519524SHoward Hinnanttypename enable_if 17833e519524SHoward Hinnant< 17843e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1785ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17863e519524SHoward Hinnant _Up* 17873e519524SHoward Hinnant>::type 17883e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17893e519524SHoward Hinnant{ 17903e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17915b312052SMarshall Clow if (__n > 0) 17925b312052SMarshall Clow { 17933e519524SHoward Hinnant __result -= __n; 1794ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17955b312052SMarshall Clow } 17963e519524SHoward Hinnant return __result; 17973e519524SHoward Hinnant} 17983e519524SHoward Hinnant 17993e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18013e519524SHoward Hinnant_BidirectionalIterator2 18023e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18033e519524SHoward Hinnant _BidirectionalIterator2 __result) 18043e519524SHoward Hinnant{ 1805fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1806fd838227SEric Fiselier __unwrap_iter(__last), 1807fd838227SEric Fiselier __unwrap_iter(__result)); 18083e519524SHoward Hinnant} 18093e519524SHoward Hinnant 18103e519524SHoward Hinnant// copy_if 18113e519524SHoward Hinnant 18123e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18143e519524SHoward Hinnant_OutputIterator 18153e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18163e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18173e519524SHoward Hinnant{ 18183e519524SHoward Hinnant for (; __first != __last; ++__first) 18193e519524SHoward Hinnant { 18203e519524SHoward Hinnant if (__pred(*__first)) 18213e519524SHoward Hinnant { 18223e519524SHoward Hinnant *__result = *__first; 18233e519524SHoward Hinnant ++__result; 18243e519524SHoward Hinnant } 18253e519524SHoward Hinnant } 18263e519524SHoward Hinnant return __result; 18273e519524SHoward Hinnant} 18283e519524SHoward Hinnant 18293e519524SHoward Hinnant// copy_n 18303e519524SHoward Hinnant 18313e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18333e519524SHoward Hinnanttypename enable_if 18343e519524SHoward Hinnant< 18353e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18363e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18373e519524SHoward Hinnant _OutputIterator 18383e519524SHoward Hinnant>::type 183951544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18403e519524SHoward Hinnant{ 184151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 184251544023SEric Fiselier _IntegralSize __n = __orig_n; 184399847d2bSHoward Hinnant if (__n > 0) 184499847d2bSHoward Hinnant { 18453e519524SHoward Hinnant *__result = *__first; 184699847d2bSHoward Hinnant ++__result; 184799847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184899847d2bSHoward Hinnant { 184999847d2bSHoward Hinnant ++__first; 185099847d2bSHoward Hinnant *__result = *__first; 185199847d2bSHoward Hinnant ++__result; 185299847d2bSHoward Hinnant } 185399847d2bSHoward Hinnant } 18543e519524SHoward Hinnant return __result; 18553e519524SHoward Hinnant} 18563e519524SHoward Hinnant 18573e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18593e519524SHoward Hinnanttypename enable_if 18603e519524SHoward Hinnant< 18613e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18623e519524SHoward Hinnant _OutputIterator 18633e519524SHoward Hinnant>::type 186451544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18653e519524SHoward Hinnant{ 186651544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 186751544023SEric Fiselier _IntegralSize __n = __orig_n; 1868ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18693e519524SHoward Hinnant} 18703e519524SHoward Hinnant 18713e519524SHoward Hinnant// move 18723e519524SHoward Hinnant 18733e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18753e519524SHoward Hinnant_OutputIterator 18763e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18773e519524SHoward Hinnant{ 1878910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1879ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18803e519524SHoward Hinnant return __result; 18813e519524SHoward Hinnant} 18823e519524SHoward Hinnant 18833e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18853e519524SHoward Hinnanttypename enable_if 18863e519524SHoward Hinnant< 18873e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1888ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18893e519524SHoward Hinnant _Up* 18903e519524SHoward Hinnant>::type 18913e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18923e519524SHoward Hinnant{ 18933e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18945b312052SMarshall Clow if (__n > 0) 1895ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18963e519524SHoward Hinnant return __result + __n; 18973e519524SHoward Hinnant} 18983e519524SHoward Hinnant 18993e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19013e519524SHoward Hinnant_OutputIterator 19023e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19033e519524SHoward Hinnant{ 1904ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19053e519524SHoward Hinnant} 19063e519524SHoward Hinnant 19073e519524SHoward Hinnant// move_backward 19083e519524SHoward Hinnant 19093e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19113e519524SHoward Hinnant_OutputIterator 19123e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19133e519524SHoward Hinnant{ 19143e519524SHoward Hinnant while (__first != __last) 1915ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19163e519524SHoward Hinnant return __result; 19173e519524SHoward Hinnant} 19183e519524SHoward Hinnant 19193e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19213e519524SHoward Hinnanttypename enable_if 19223e519524SHoward Hinnant< 19233e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1924ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19253e519524SHoward Hinnant _Up* 19263e519524SHoward Hinnant>::type 19273e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19283e519524SHoward Hinnant{ 19293e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19305b312052SMarshall Clow if (__n > 0) 19315b312052SMarshall Clow { 19323e519524SHoward Hinnant __result -= __n; 1933ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19345b312052SMarshall Clow } 19353e519524SHoward Hinnant return __result; 19363e519524SHoward Hinnant} 19373e519524SHoward Hinnant 19383e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19403e519524SHoward Hinnant_BidirectionalIterator2 19413e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19423e519524SHoward Hinnant _BidirectionalIterator2 __result) 19433e519524SHoward Hinnant{ 1944ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19453e519524SHoward Hinnant} 19463e519524SHoward Hinnant 19473e519524SHoward Hinnant// iter_swap 19483e519524SHoward Hinnant 1949a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19503e519524SHoward Hinnant 19513e519524SHoward Hinnant// transform 19523e519524SHoward Hinnant 19533e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19553e519524SHoward Hinnant_OutputIterator 19563e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19573e519524SHoward Hinnant{ 1958910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19593e519524SHoward Hinnant *__result = __op(*__first); 19603e519524SHoward Hinnant return __result; 19613e519524SHoward Hinnant} 19623e519524SHoward Hinnant 19633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19653e519524SHoward Hinnant_OutputIterator 19663e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19673e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19683e519524SHoward Hinnant{ 1969910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19703e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19713e519524SHoward Hinnant return __result; 19723e519524SHoward Hinnant} 19733e519524SHoward Hinnant 19743e519524SHoward Hinnant// replace 19753e519524SHoward Hinnant 19763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19783e519524SHoward Hinnantvoid 19793e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19803e519524SHoward Hinnant{ 19813e519524SHoward Hinnant for (; __first != __last; ++__first) 19823e519524SHoward Hinnant if (*__first == __old_value) 19833e519524SHoward Hinnant *__first = __new_value; 19843e519524SHoward Hinnant} 19853e519524SHoward Hinnant 19863e519524SHoward Hinnant// replace_if 19873e519524SHoward Hinnant 19883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19903e519524SHoward Hinnantvoid 19913e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19923e519524SHoward Hinnant{ 19933e519524SHoward Hinnant for (; __first != __last; ++__first) 19943e519524SHoward Hinnant if (__pred(*__first)) 19953e519524SHoward Hinnant *__first = __new_value; 19963e519524SHoward Hinnant} 19973e519524SHoward Hinnant 19983e519524SHoward Hinnant// replace_copy 19993e519524SHoward Hinnant 20003e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20023e519524SHoward Hinnant_OutputIterator 20033e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20043e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20053e519524SHoward Hinnant{ 2006910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20073e519524SHoward Hinnant if (*__first == __old_value) 20083e519524SHoward Hinnant *__result = __new_value; 20093e519524SHoward Hinnant else 20103e519524SHoward Hinnant *__result = *__first; 20113e519524SHoward Hinnant return __result; 20123e519524SHoward Hinnant} 20133e519524SHoward Hinnant 20143e519524SHoward Hinnant// replace_copy_if 20153e519524SHoward Hinnant 20163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20183e519524SHoward Hinnant_OutputIterator 20193e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20203e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20213e519524SHoward Hinnant{ 2022910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20233e519524SHoward Hinnant if (__pred(*__first)) 20243e519524SHoward Hinnant *__result = __new_value; 20253e519524SHoward Hinnant else 20263e519524SHoward Hinnant *__result = *__first; 20273e519524SHoward Hinnant return __result; 20283e519524SHoward Hinnant} 20293e519524SHoward Hinnant 20303e519524SHoward Hinnant// fill_n 20313e519524SHoward Hinnant 20323e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20343e519524SHoward Hinnant_OutputIterator 20350f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20363e519524SHoward Hinnant{ 2037910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2038e4383379SHoward Hinnant *__first = __value_; 20393e519524SHoward Hinnant return __first; 20403e519524SHoward Hinnant} 20413e519524SHoward Hinnant 20420f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20440f242beaSHoward Hinnanttypename enable_if 20450f242beaSHoward Hinnant< 20460f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20470f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20480f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20490f242beaSHoward Hinnant _Tp* 20500f242beaSHoward Hinnant>::type 20510f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20523e519524SHoward Hinnant{ 20533e519524SHoward Hinnant if (__n > 0) 2054e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20553e519524SHoward Hinnant return __first + __n; 20563e519524SHoward Hinnant} 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnant_OutputIterator 2061e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20623e519524SHoward Hinnant{ 206351544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20643e519524SHoward Hinnant} 20653e519524SHoward Hinnant 20663e519524SHoward Hinnant// fill 20673e519524SHoward Hinnant 20683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20703e519524SHoward Hinnantvoid 2071e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20723e519524SHoward Hinnant{ 20733e519524SHoward Hinnant for (; __first != __last; ++__first) 2074e4383379SHoward Hinnant *__first = __value_; 20753e519524SHoward Hinnant} 20763e519524SHoward Hinnant 20773e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20793e519524SHoward Hinnantvoid 2080e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20813e519524SHoward Hinnant{ 2082e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20833e519524SHoward Hinnant} 20843e519524SHoward Hinnant 20853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20873e519524SHoward Hinnantvoid 2088e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20893e519524SHoward Hinnant{ 2090e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20913e519524SHoward Hinnant} 20923e519524SHoward Hinnant 20933e519524SHoward Hinnant// generate 20943e519524SHoward Hinnant 20953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20973e519524SHoward Hinnantvoid 20983e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20993e519524SHoward Hinnant{ 21003e519524SHoward Hinnant for (; __first != __last; ++__first) 21013e519524SHoward Hinnant *__first = __gen(); 21023e519524SHoward Hinnant} 21033e519524SHoward Hinnant 21043e519524SHoward Hinnant// generate_n 21053e519524SHoward Hinnant 21063e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21083e519524SHoward Hinnant_OutputIterator 210951544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21103e519524SHoward Hinnant{ 211151544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 211251544023SEric Fiselier _IntegralSize __n = __orig_n; 2113910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21143e519524SHoward Hinnant *__first = __gen(); 21153e519524SHoward Hinnant return __first; 21163e519524SHoward Hinnant} 21173e519524SHoward Hinnant 21183e519524SHoward Hinnant// remove 21193e519524SHoward Hinnant 21203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21213e519524SHoward Hinnant_ForwardIterator 2122e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21233e519524SHoward Hinnant{ 2124e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21253e519524SHoward Hinnant if (__first != __last) 21263e519524SHoward Hinnant { 21273e519524SHoward Hinnant _ForwardIterator __i = __first; 21283e519524SHoward Hinnant while (++__i != __last) 21293e519524SHoward Hinnant { 2130e4383379SHoward Hinnant if (!(*__i == __value_)) 21313e519524SHoward Hinnant { 2132ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21333e519524SHoward Hinnant ++__first; 21343e519524SHoward Hinnant } 21353e519524SHoward Hinnant } 21363e519524SHoward Hinnant } 21373e519524SHoward Hinnant return __first; 21383e519524SHoward Hinnant} 21393e519524SHoward Hinnant 21403e519524SHoward Hinnant// remove_if 21413e519524SHoward Hinnant 21423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21433e519524SHoward Hinnant_ForwardIterator 21443e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21453e519524SHoward Hinnant{ 2146ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21473e519524SHoward Hinnant (__first, __last, __pred); 21483e519524SHoward Hinnant if (__first != __last) 21493e519524SHoward Hinnant { 21503e519524SHoward Hinnant _ForwardIterator __i = __first; 21513e519524SHoward Hinnant while (++__i != __last) 21523e519524SHoward Hinnant { 21533e519524SHoward Hinnant if (!__pred(*__i)) 21543e519524SHoward Hinnant { 2155ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21563e519524SHoward Hinnant ++__first; 21573e519524SHoward Hinnant } 21583e519524SHoward Hinnant } 21593e519524SHoward Hinnant } 21603e519524SHoward Hinnant return __first; 21613e519524SHoward Hinnant} 21623e519524SHoward Hinnant 21633e519524SHoward Hinnant// remove_copy 21643e519524SHoward Hinnant 21653e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21673e519524SHoward Hinnant_OutputIterator 2168e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21693e519524SHoward Hinnant{ 21703e519524SHoward Hinnant for (; __first != __last; ++__first) 21713e519524SHoward Hinnant { 2172e4383379SHoward Hinnant if (!(*__first == __value_)) 21733e519524SHoward Hinnant { 21743e519524SHoward Hinnant *__result = *__first; 21753e519524SHoward Hinnant ++__result; 21763e519524SHoward Hinnant } 21773e519524SHoward Hinnant } 21783e519524SHoward Hinnant return __result; 21793e519524SHoward Hinnant} 21803e519524SHoward Hinnant 21813e519524SHoward Hinnant// remove_copy_if 21823e519524SHoward Hinnant 21833e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21853e519524SHoward Hinnant_OutputIterator 21863e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21873e519524SHoward Hinnant{ 21883e519524SHoward Hinnant for (; __first != __last; ++__first) 21893e519524SHoward Hinnant { 21903e519524SHoward Hinnant if (!__pred(*__first)) 21913e519524SHoward Hinnant { 21923e519524SHoward Hinnant *__result = *__first; 21933e519524SHoward Hinnant ++__result; 21943e519524SHoward Hinnant } 21953e519524SHoward Hinnant } 21963e519524SHoward Hinnant return __result; 21973e519524SHoward Hinnant} 21983e519524SHoward Hinnant 21993e519524SHoward Hinnant// unique 22003e519524SHoward Hinnant 22013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22023e519524SHoward Hinnant_ForwardIterator 22033e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22043e519524SHoward Hinnant{ 2205ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22063e519524SHoward Hinnant (__first, __last, __pred); 22073e519524SHoward Hinnant if (__first != __last) 22083e519524SHoward Hinnant { 22093e519524SHoward Hinnant // ... a a ? ... 22103e519524SHoward Hinnant // f i 22113e519524SHoward Hinnant _ForwardIterator __i = __first; 22123e519524SHoward Hinnant for (++__i; ++__i != __last;) 22133e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2214ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22153e519524SHoward Hinnant ++__first; 22163e519524SHoward Hinnant } 22173e519524SHoward Hinnant return __first; 22183e519524SHoward Hinnant} 22193e519524SHoward Hinnant 22203e519524SHoward Hinnanttemplate <class _ForwardIterator> 22213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22223e519524SHoward Hinnant_ForwardIterator 22233e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22243e519524SHoward Hinnant{ 22253e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2226ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22273e519524SHoward Hinnant} 22283e519524SHoward Hinnant 22293e519524SHoward Hinnant// unique_copy 22303e519524SHoward Hinnant 22313e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22323e519524SHoward Hinnant_OutputIterator 22333e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22343e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22353e519524SHoward Hinnant{ 22363e519524SHoward Hinnant if (__first != __last) 22373e519524SHoward Hinnant { 22383e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22393e519524SHoward Hinnant *__result = __t; 22403e519524SHoward Hinnant ++__result; 22413e519524SHoward Hinnant while (++__first != __last) 22423e519524SHoward Hinnant { 22433e519524SHoward Hinnant if (!__pred(__t, *__first)) 22443e519524SHoward Hinnant { 22453e519524SHoward Hinnant __t = *__first; 22463e519524SHoward Hinnant *__result = __t; 22473e519524SHoward Hinnant ++__result; 22483e519524SHoward Hinnant } 22493e519524SHoward Hinnant } 22503e519524SHoward Hinnant } 22513e519524SHoward Hinnant return __result; 22523e519524SHoward Hinnant} 22533e519524SHoward Hinnant 22543e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22553e519524SHoward Hinnant_OutputIterator 22563e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22573e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22583e519524SHoward Hinnant{ 22593e519524SHoward Hinnant if (__first != __last) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant _ForwardIterator __i = __first; 22623e519524SHoward Hinnant *__result = *__i; 22633e519524SHoward Hinnant ++__result; 22643e519524SHoward Hinnant while (++__first != __last) 22653e519524SHoward Hinnant { 22663e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22673e519524SHoward Hinnant { 22683e519524SHoward Hinnant *__result = *__first; 22693e519524SHoward Hinnant ++__result; 22703e519524SHoward Hinnant __i = __first; 22713e519524SHoward Hinnant } 22723e519524SHoward Hinnant } 22733e519524SHoward Hinnant } 22743e519524SHoward Hinnant return __result; 22753e519524SHoward Hinnant} 22763e519524SHoward Hinnant 22773e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22783e519524SHoward Hinnant_ForwardIterator 22793e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22803e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22813e519524SHoward Hinnant{ 22823e519524SHoward Hinnant if (__first != __last) 22833e519524SHoward Hinnant { 22843e519524SHoward Hinnant *__result = *__first; 22853e519524SHoward Hinnant while (++__first != __last) 22863e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22873e519524SHoward Hinnant *++__result = *__first; 22883e519524SHoward Hinnant ++__result; 22893e519524SHoward Hinnant } 22903e519524SHoward Hinnant return __result; 22913e519524SHoward Hinnant} 22923e519524SHoward Hinnant 22933e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22953e519524SHoward Hinnant_OutputIterator 22963e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22973e519524SHoward Hinnant{ 2298ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22993e519524SHoward Hinnant (__first, __last, __result, __pred, 23003e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23013e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23023e519524SHoward Hinnant} 23033e519524SHoward Hinnant 23043e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23063e519524SHoward Hinnant_OutputIterator 23073e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23083e519524SHoward Hinnant{ 23093e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2310ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23113e519524SHoward Hinnant} 23123e519524SHoward Hinnant 23133e519524SHoward Hinnant// reverse 23143e519524SHoward Hinnant 23153e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23173e519524SHoward Hinnantvoid 23183e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23193e519524SHoward Hinnant{ 23203e519524SHoward Hinnant while (__first != __last) 23213e519524SHoward Hinnant { 23223e519524SHoward Hinnant if (__first == --__last) 23233e519524SHoward Hinnant break; 2324def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23253e519524SHoward Hinnant ++__first; 23263e519524SHoward Hinnant } 23273e519524SHoward Hinnant} 23283e519524SHoward Hinnant 23293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23313e519524SHoward Hinnantvoid 23323e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23333e519524SHoward Hinnant{ 23343e519524SHoward Hinnant if (__first != __last) 23353e519524SHoward Hinnant for (; __first < --__last; ++__first) 2336def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23373e519524SHoward Hinnant} 23383e519524SHoward Hinnant 23393e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23413e519524SHoward Hinnantvoid 23423e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23433e519524SHoward Hinnant{ 2344ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnant// reverse_copy 23483e519524SHoward Hinnant 23493e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23513e519524SHoward Hinnant_OutputIterator 23523e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23533e519524SHoward Hinnant{ 23543e519524SHoward Hinnant for (; __first != __last; ++__result) 23553e519524SHoward Hinnant *__result = *--__last; 23563e519524SHoward Hinnant return __result; 23573e519524SHoward Hinnant} 23583e519524SHoward Hinnant 23593e519524SHoward Hinnant// rotate 23603e519524SHoward Hinnant 23613e519524SHoward Hinnanttemplate <class _ForwardIterator> 23623e519524SHoward Hinnant_ForwardIterator 2363aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23643e519524SHoward Hinnant{ 2365aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2366aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2367aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2368aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2369aca09de3SHoward Hinnant return __lm1; 2370aca09de3SHoward Hinnant} 2371aca09de3SHoward Hinnant 2372aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2373aca09de3SHoward Hinnant_BidirectionalIterator 2374aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2375aca09de3SHoward Hinnant{ 2376aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2377aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2378aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2379aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2380aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2381aca09de3SHoward Hinnant return __fp1; 2382aca09de3SHoward Hinnant} 2383aca09de3SHoward Hinnant 2384aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2385aca09de3SHoward Hinnant_ForwardIterator 2386aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2387aca09de3SHoward Hinnant{ 23883e519524SHoward Hinnant _ForwardIterator __i = __middle; 23893e519524SHoward Hinnant while (true) 23903e519524SHoward Hinnant { 23913e519524SHoward Hinnant swap(*__first, *__i); 23923e519524SHoward Hinnant ++__first; 23933e519524SHoward Hinnant if (++__i == __last) 23943e519524SHoward Hinnant break; 23953e519524SHoward Hinnant if (__first == __middle) 23963e519524SHoward Hinnant __middle = __i; 23973e519524SHoward Hinnant } 23983e519524SHoward Hinnant _ForwardIterator __r = __first; 23993e519524SHoward Hinnant if (__first != __middle) 24003e519524SHoward Hinnant { 24013e519524SHoward Hinnant __i = __middle; 24023e519524SHoward Hinnant while (true) 24033e519524SHoward Hinnant { 24043e519524SHoward Hinnant swap(*__first, *__i); 24053e519524SHoward Hinnant ++__first; 24063e519524SHoward Hinnant if (++__i == __last) 24073e519524SHoward Hinnant { 24083e519524SHoward Hinnant if (__first == __middle) 24093e519524SHoward Hinnant break; 24103e519524SHoward Hinnant __i = __middle; 24113e519524SHoward Hinnant } 24123e519524SHoward Hinnant else if (__first == __middle) 24133e519524SHoward Hinnant __middle = __i; 24143e519524SHoward Hinnant } 24153e519524SHoward Hinnant } 24163e519524SHoward Hinnant return __r; 24173e519524SHoward Hinnant} 24183e519524SHoward Hinnant 24193e519524SHoward Hinnanttemplate<typename _Integral> 24203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24213e519524SHoward Hinnant_Integral 242219b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24233e519524SHoward Hinnant{ 24243e519524SHoward Hinnant do 24253e519524SHoward Hinnant { 24263e519524SHoward Hinnant _Integral __t = __x % __y; 24273e519524SHoward Hinnant __x = __y; 24283e519524SHoward Hinnant __y = __t; 24293e519524SHoward Hinnant } while (__y); 24303e519524SHoward Hinnant return __x; 24313e519524SHoward Hinnant} 24323e519524SHoward Hinnant 24333e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24343e519524SHoward Hinnant_RandomAccessIterator 2435aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24363e519524SHoward Hinnant{ 24373e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24393e519524SHoward Hinnant 24403e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24413e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24423e519524SHoward Hinnant if (__m1 == __m2) 24433e519524SHoward Hinnant { 2444ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24453e519524SHoward Hinnant return __middle; 24463e519524SHoward Hinnant } 244719b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24483e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24493e519524SHoward Hinnant { 2450aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24513e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24523e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24533e519524SHoward Hinnant do 24543e519524SHoward Hinnant { 2455aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24563e519524SHoward Hinnant __p1 = __p2; 24573e519524SHoward Hinnant const difference_type __d = __last - __p2; 24583e519524SHoward Hinnant if (__m1 < __d) 24593e519524SHoward Hinnant __p2 += __m1; 24603e519524SHoward Hinnant else 24613e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24623e519524SHoward Hinnant } while (__p2 != __p); 2463aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24643e519524SHoward Hinnant } 24653e519524SHoward Hinnant return __first + __m2; 24663e519524SHoward Hinnant} 24673e519524SHoward Hinnant 24683e519524SHoward Hinnanttemplate <class _ForwardIterator> 24693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24703e519524SHoward Hinnant_ForwardIterator 2471aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2472aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2473aca09de3SHoward Hinnant{ 2474aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2475aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2476aca09de3SHoward Hinnant { 2477aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2478aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2479aca09de3SHoward Hinnant } 2480aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2481aca09de3SHoward Hinnant} 2482aca09de3SHoward Hinnant 2483aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2484aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2485aca09de3SHoward Hinnant_BidirectionalIterator 2486aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2487aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2488aca09de3SHoward Hinnant{ 2489aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2490aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2491aca09de3SHoward Hinnant { 2492aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2493aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2494aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2495aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2496aca09de3SHoward Hinnant } 2497aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2498aca09de3SHoward Hinnant} 2499aca09de3SHoward Hinnant 2500aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2501aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2502aca09de3SHoward Hinnant_RandomAccessIterator 2503aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2504aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2505aca09de3SHoward Hinnant{ 2506aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2507aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2508aca09de3SHoward Hinnant { 2509aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2510aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2511aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2512aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2513aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2514aca09de3SHoward Hinnant } 2515aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2516aca09de3SHoward Hinnant} 2517aca09de3SHoward Hinnant 2518aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2519aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2520aca09de3SHoward Hinnant_ForwardIterator 25213e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25223e519524SHoward Hinnant{ 2523aca09de3SHoward Hinnant if (__first == __middle) 2524aca09de3SHoward Hinnant return __last; 2525aca09de3SHoward Hinnant if (__middle == __last) 2526aca09de3SHoward Hinnant return __first; 2527ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2528aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25293e519524SHoward Hinnant} 25303e519524SHoward Hinnant 25313e519524SHoward Hinnant// rotate_copy 25323e519524SHoward Hinnant 25333e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25353e519524SHoward Hinnant_OutputIterator 25363e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25373e519524SHoward Hinnant{ 2538ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25393e519524SHoward Hinnant} 25403e519524SHoward Hinnant 25413e519524SHoward Hinnant// min_element 25423e519524SHoward Hinnant 25433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25449d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25453e519524SHoward Hinnant_ForwardIterator 25460b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25473e519524SHoward Hinnant{ 25483e519524SHoward Hinnant if (__first != __last) 25493e519524SHoward Hinnant { 25503e519524SHoward Hinnant _ForwardIterator __i = __first; 25513e519524SHoward Hinnant while (++__i != __last) 25523e519524SHoward Hinnant if (__comp(*__i, *__first)) 25533e519524SHoward Hinnant __first = __i; 25543e519524SHoward Hinnant } 25553e519524SHoward Hinnant return __first; 25563e519524SHoward Hinnant} 25573e519524SHoward Hinnant 25583e519524SHoward Hinnanttemplate <class _ForwardIterator> 25590b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25603e519524SHoward Hinnant_ForwardIterator 25613e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25623e519524SHoward Hinnant{ 25630b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25644eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25654eb27b79SHoward Hinnant} 25664eb27b79SHoward Hinnant 25674eb27b79SHoward Hinnant// min 25684eb27b79SHoward Hinnant 25694eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25709d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25714eb27b79SHoward Hinnantconst _Tp& 25724eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25734eb27b79SHoward Hinnant{ 25744eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25754eb27b79SHoward Hinnant} 25764eb27b79SHoward Hinnant 25774eb27b79SHoward Hinnanttemplate <class _Tp> 25789d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25794eb27b79SHoward Hinnantconst _Tp& 25804eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25814eb27b79SHoward Hinnant{ 2582ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25834eb27b79SHoward Hinnant} 25844eb27b79SHoward Hinnant 2585ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 258654976f26SHoward Hinnant 25874eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25889d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25894eb27b79SHoward Hinnant_Tp 25904eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25914eb27b79SHoward Hinnant{ 25920b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25934eb27b79SHoward Hinnant} 25944eb27b79SHoward Hinnant 25954eb27b79SHoward Hinnanttemplate<class _Tp> 25969d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25974eb27b79SHoward Hinnant_Tp 25984eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25994eb27b79SHoward Hinnant{ 26000b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26013e519524SHoward Hinnant} 26023e519524SHoward Hinnant 2603ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 260454976f26SHoward Hinnant 26053e519524SHoward Hinnant// max_element 26063e519524SHoward Hinnant 26073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26089d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26093e519524SHoward Hinnant_ForwardIterator 26100b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26113e519524SHoward Hinnant{ 26123e519524SHoward Hinnant if (__first != __last) 26133e519524SHoward Hinnant { 26143e519524SHoward Hinnant _ForwardIterator __i = __first; 26153e519524SHoward Hinnant while (++__i != __last) 26163e519524SHoward Hinnant if (__comp(*__first, *__i)) 26173e519524SHoward Hinnant __first = __i; 26183e519524SHoward Hinnant } 26193e519524SHoward Hinnant return __first; 26203e519524SHoward Hinnant} 26213e519524SHoward Hinnant 26229d67c6d5SMarshall Clow 26233e519524SHoward Hinnanttemplate <class _ForwardIterator> 26240b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26253e519524SHoward Hinnant_ForwardIterator 26263e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26273e519524SHoward Hinnant{ 26280b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26294eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26304eb27b79SHoward Hinnant} 26314eb27b79SHoward Hinnant 26324eb27b79SHoward Hinnant// max 26334eb27b79SHoward Hinnant 26344eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26359d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26364eb27b79SHoward Hinnantconst _Tp& 26374eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26384eb27b79SHoward Hinnant{ 26394eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26404eb27b79SHoward Hinnant} 26414eb27b79SHoward Hinnant 26424eb27b79SHoward Hinnanttemplate <class _Tp> 26439d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26444eb27b79SHoward Hinnantconst _Tp& 26454eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26464eb27b79SHoward Hinnant{ 2647ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26484eb27b79SHoward Hinnant} 26494eb27b79SHoward Hinnant 2650ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 265154976f26SHoward Hinnant 26524eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26539d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26544eb27b79SHoward Hinnant_Tp 26554eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26564eb27b79SHoward Hinnant{ 26570b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26584eb27b79SHoward Hinnant} 26594eb27b79SHoward Hinnant 26604eb27b79SHoward Hinnanttemplate<class _Tp> 26619d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26624eb27b79SHoward Hinnant_Tp 26634eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26644eb27b79SHoward Hinnant{ 26650b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26663e519524SHoward Hinnant} 26673e519524SHoward Hinnant 2668ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 266954976f26SHoward Hinnant 2670146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2671146c14acSMarshall Clow// clamp 2672146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2673146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2674146c14acSMarshall Clowconst _Tp& 2675146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2676146c14acSMarshall Clow{ 2677146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2678146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2679146c14acSMarshall Clow 2680146c14acSMarshall Clow} 2681146c14acSMarshall Clow 2682146c14acSMarshall Clowtemplate<class _Tp> 2683146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2684146c14acSMarshall Clowconst _Tp& 2685146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2686146c14acSMarshall Clow{ 2687146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2688146c14acSMarshall Clow} 2689146c14acSMarshall Clow#endif 2690146c14acSMarshall Clow 26913e519524SHoward Hinnant// minmax_element 26923e519524SHoward Hinnant 26933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26940b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26953e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26963e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26973e519524SHoward Hinnant{ 26983e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26993e519524SHoward Hinnant if (__first != __last) 27003e519524SHoward Hinnant { 27013e519524SHoward Hinnant if (++__first != __last) 27023e519524SHoward Hinnant { 27033e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27043e519524SHoward Hinnant __result.first = __first; 27053e519524SHoward Hinnant else 27063e519524SHoward Hinnant __result.second = __first; 27073e519524SHoward Hinnant while (++__first != __last) 27083e519524SHoward Hinnant { 27093e519524SHoward Hinnant _ForwardIterator __i = __first; 27103e519524SHoward Hinnant if (++__first == __last) 27113e519524SHoward Hinnant { 27123e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27133e519524SHoward Hinnant __result.first = __i; 27143e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27153e519524SHoward Hinnant __result.second = __i; 27163e519524SHoward Hinnant break; 27173e519524SHoward Hinnant } 27183e519524SHoward Hinnant else 27193e519524SHoward Hinnant { 27203e519524SHoward Hinnant if (__comp(*__first, *__i)) 27213e519524SHoward Hinnant { 27223e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27233e519524SHoward Hinnant __result.first = __first; 27243e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27253e519524SHoward Hinnant __result.second = __i; 27263e519524SHoward Hinnant } 27273e519524SHoward Hinnant else 27283e519524SHoward Hinnant { 27293e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27303e519524SHoward Hinnant __result.first = __i; 27313e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27323e519524SHoward Hinnant __result.second = __first; 27333e519524SHoward Hinnant } 27343e519524SHoward Hinnant } 27353e519524SHoward Hinnant } 27363e519524SHoward Hinnant } 27373e519524SHoward Hinnant } 27383e519524SHoward Hinnant return __result; 27393e519524SHoward Hinnant} 27403e519524SHoward Hinnant 27413e519524SHoward Hinnanttemplate <class _ForwardIterator> 27420b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27433e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27443e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27453e519524SHoward Hinnant{ 27469d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27479d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27483e519524SHoward Hinnant} 27493e519524SHoward Hinnant 27504eb27b79SHoward Hinnant// minmax 27514eb27b79SHoward Hinnant 27524eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27539d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27544eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27554eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27564eb27b79SHoward Hinnant{ 27574eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27584eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27594eb27b79SHoward Hinnant} 27604eb27b79SHoward Hinnant 27614eb27b79SHoward Hinnanttemplate<class _Tp> 27629d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27634eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27644eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27654eb27b79SHoward Hinnant{ 2766ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27674eb27b79SHoward Hinnant} 27684eb27b79SHoward Hinnant 2769ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 277054976f26SHoward Hinnant 27714eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27729d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27734eb27b79SHoward Hinnantpair<_Tp, _Tp> 27744eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27754eb27b79SHoward Hinnant{ 27769d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27779d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27789d67c6d5SMarshall Clow _Iter __last = __t.end(); 27799d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27809d67c6d5SMarshall Clow 27819d67c6d5SMarshall Clow ++__first; 27829d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27839d67c6d5SMarshall Clow { 27849d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27859d67c6d5SMarshall Clow __result.first = *__first; 27869d67c6d5SMarshall Clow else 27879d67c6d5SMarshall Clow __result.second = *__first; 27889d67c6d5SMarshall Clow ++__first; 27899d67c6d5SMarshall Clow } 27909d67c6d5SMarshall Clow 27919d67c6d5SMarshall Clow while (__first != __last) 27929d67c6d5SMarshall Clow { 27939d67c6d5SMarshall Clow _Tp __prev = *__first++; 2794002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2795002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2796002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27979d67c6d5SMarshall Clow } 27989d67c6d5SMarshall Clow else { 2799002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2800002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28019d67c6d5SMarshall Clow } 28029d67c6d5SMarshall Clow 28039d67c6d5SMarshall Clow __first++; 28049d67c6d5SMarshall Clow } 28059d67c6d5SMarshall Clow return __result; 28069d67c6d5SMarshall Clow} 28079d67c6d5SMarshall Clow 28089d67c6d5SMarshall Clowtemplate<class _Tp> 28099d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28109d67c6d5SMarshall Clowpair<_Tp, _Tp> 28119d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28129d67c6d5SMarshall Clow{ 28139d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28144eb27b79SHoward Hinnant} 28154eb27b79SHoward Hinnant 2816ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 281754976f26SHoward Hinnant 28183e519524SHoward Hinnant// random_shuffle 28193e519524SHoward Hinnant 2820f9d540b0SHoward Hinnant// __independent_bits_engine 2821f9d540b0SHoward Hinnant 2822c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2823f9d540b0SHoward Hinnantstruct __log2_imp 28243e519524SHoward Hinnant{ 2825c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2826c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28273e519524SHoward Hinnant}; 28283e519524SHoward Hinnant 2829c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2830c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28313e519524SHoward Hinnant{ 2832f9d540b0SHoward Hinnant static const size_t value = 0; 28333e519524SHoward Hinnant}; 28343e519524SHoward Hinnant 2835c003db1fSHoward Hinnanttemplate <size_t _Rp> 2836c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28373e519524SHoward Hinnant{ 2838c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28393e519524SHoward Hinnant}; 28403e519524SHoward Hinnant 284189918caaSEric Fiseliertemplate <class _UIntType, _UIntType _Xp> 2842f9d540b0SHoward Hinnantstruct __log2 28433e519524SHoward Hinnant{ 2844c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 284589918caaSEric Fiselier sizeof(_UIntType) * __CHAR_BIT__ - 1>::value; 28463e519524SHoward Hinnant}; 28473e519524SHoward Hinnant 2848f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2849f9d540b0SHoward Hinnantclass __independent_bits_engine 28503e519524SHoward Hinnant{ 2851f9d540b0SHoward Hinnantpublic: 2852f9d540b0SHoward Hinnant // types 2853f9d540b0SHoward Hinnant typedef _UIntType result_type; 2854f9d540b0SHoward Hinnant 2855f9d540b0SHoward Hinnantprivate: 2856f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2857f9d540b0SHoward Hinnant typedef typename conditional 2858f9d540b0SHoward Hinnant < 2859f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2860f9d540b0SHoward Hinnant result_type, 2861f9d540b0SHoward Hinnant _Engine_result_type 2862f9d540b0SHoward Hinnant >::type _Working_result_type; 2863f9d540b0SHoward Hinnant 2864f9d540b0SHoward Hinnant _Engine& __e_; 2865f9d540b0SHoward Hinnant size_t __w_; 2866f9d540b0SHoward Hinnant size_t __w0_; 2867f9d540b0SHoward Hinnant size_t __n_; 2868f9d540b0SHoward Hinnant size_t __n0_; 2869f9d540b0SHoward Hinnant _Working_result_type __y0_; 2870f9d540b0SHoward Hinnant _Working_result_type __y1_; 2871f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2872f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2873f9d540b0SHoward Hinnant 2874ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2875c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2876f9d540b0SHoward Hinnant + _Working_result_type(1); 2877e386b7b3SHoward Hinnant#else 2878e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2879e386b7b3SHoward Hinnant + _Working_result_type(1); 2880e386b7b3SHoward Hinnant#endif 2881e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2882e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2883e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2884f9d540b0SHoward Hinnant 2885f9d540b0SHoward Hinnantpublic: 2886f9d540b0SHoward Hinnant // constructors and seeding functions 2887f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2888f9d540b0SHoward Hinnant 2889f9d540b0SHoward Hinnant // generating functions 2890c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2891f9d540b0SHoward Hinnant 2892f9d540b0SHoward Hinnantprivate: 289308bba64aSMarshall Clow result_type __eval(false_type); 289408bba64aSMarshall Clow result_type __eval(true_type); 2895f9d540b0SHoward Hinnant}; 2896f9d540b0SHoward Hinnant 2897f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2898f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2899f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2900f9d540b0SHoward Hinnant : __e_(__e), 2901f9d540b0SHoward Hinnant __w_(__w) 2902f9d540b0SHoward Hinnant{ 2903f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2904f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2905c003db1fSHoward Hinnant if (_Rp == 0) 2906c003db1fSHoward Hinnant __y0_ = _Rp; 2907f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2908c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2909f9d540b0SHoward Hinnant else 2910f9d540b0SHoward Hinnant __y0_ = 0; 2911c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2912f9d540b0SHoward Hinnant { 2913f9d540b0SHoward Hinnant ++__n_; 2914f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2915f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2916c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2917f9d540b0SHoward Hinnant else 2918f9d540b0SHoward Hinnant __y0_ = 0; 2919f9d540b0SHoward Hinnant } 2920f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2921f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2922c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2923f9d540b0SHoward Hinnant else 2924f9d540b0SHoward Hinnant __y1_ = 0; 2925f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2926f9d540b0SHoward Hinnant _Engine_result_type(0); 2927f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2928f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2929f9d540b0SHoward Hinnant _Engine_result_type(~0); 29303e519524SHoward Hinnant} 29313e519524SHoward Hinnant 2932f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2933f9d540b0SHoward Hinnantinline 2934f9d540b0SHoward Hinnant_UIntType 293508bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29363e519524SHoward Hinnant{ 2937f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29383e519524SHoward Hinnant} 29393e519524SHoward Hinnant 2940f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2941f9d540b0SHoward Hinnant_UIntType 294208bba64aSMarshall Clow__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29433e519524SHoward Hinnant{ 29445beb2c3aSMarshall Clow const size_t _WRt = numeric_limits<result_type>::digits; 2945c003db1fSHoward Hinnant result_type _Sp = 0; 2946f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2947f9d540b0SHoward Hinnant { 2948f9d540b0SHoward Hinnant _Engine_result_type __u; 29493e519524SHoward Hinnant do 2950f9d540b0SHoward Hinnant { 2951f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2952f9d540b0SHoward Hinnant } while (__u >= __y0_); 29535beb2c3aSMarshall Clow if (__w0_ < _WRt) 2954c003db1fSHoward Hinnant _Sp <<= __w0_; 2955f9d540b0SHoward Hinnant else 2956c003db1fSHoward Hinnant _Sp = 0; 2957c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2958f9d540b0SHoward Hinnant } 2959f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2960f9d540b0SHoward Hinnant { 2961f9d540b0SHoward Hinnant _Engine_result_type __u; 2962f9d540b0SHoward Hinnant do 2963f9d540b0SHoward Hinnant { 2964f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2965f9d540b0SHoward Hinnant } while (__u >= __y1_); 29665beb2c3aSMarshall Clow if (__w0_ < _WRt - 1) 2967c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2968f9d540b0SHoward Hinnant else 2969c003db1fSHoward Hinnant _Sp = 0; 2970c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2971f9d540b0SHoward Hinnant } 2972c003db1fSHoward Hinnant return _Sp; 29733e519524SHoward Hinnant} 29743e519524SHoward Hinnant 2975f9d540b0SHoward Hinnant// uniform_int_distribution 29763e519524SHoward Hinnant 2977f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2978f9d540b0SHoward Hinnantclass uniform_int_distribution 29793e519524SHoward Hinnant{ 2980f9d540b0SHoward Hinnantpublic: 2981f9d540b0SHoward Hinnant // types 2982f9d540b0SHoward Hinnant typedef _IntType result_type; 2983f9d540b0SHoward Hinnant 2984f9d540b0SHoward Hinnant class param_type 2985f9d540b0SHoward Hinnant { 2986f9d540b0SHoward Hinnant result_type __a_; 2987f9d540b0SHoward Hinnant result_type __b_; 2988f9d540b0SHoward Hinnant public: 2989f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2990f9d540b0SHoward Hinnant 2991f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2992f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2993f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2994f9d540b0SHoward Hinnant 2995f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2996f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2997f9d540b0SHoward Hinnant 2998f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2999f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3000f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3001f9d540b0SHoward Hinnant {return !(__x == __y);} 30023e519524SHoward Hinnant }; 30033e519524SHoward Hinnant 3004f9d540b0SHoward Hinnantprivate: 3005f9d540b0SHoward Hinnant param_type __p_; 30063e519524SHoward Hinnant 3007f9d540b0SHoward Hinnantpublic: 3008f9d540b0SHoward Hinnant // constructors and reset functions 3009f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3010f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3011f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3012f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3013f9d540b0SHoward Hinnant void reset() {} 3014f9d540b0SHoward Hinnant 3015f9d540b0SHoward Hinnant // generating functions 3016f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3017f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3018f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3019f9d540b0SHoward Hinnant 3020f9d540b0SHoward Hinnant // property functions 3021f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3022f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3023f9d540b0SHoward Hinnant 3024f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3025f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3026f9d540b0SHoward Hinnant 3027f9d540b0SHoward Hinnant result_type min() const {return a();} 3028f9d540b0SHoward Hinnant result_type max() const {return b();} 3029f9d540b0SHoward Hinnant 3030f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3031f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3032f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3033f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3034f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3035f9d540b0SHoward Hinnant {return !(__x == __y);} 30363e519524SHoward Hinnant}; 30373e519524SHoward Hinnant 3038f9d540b0SHoward Hinnanttemplate<class _IntType> 3039f9d540b0SHoward Hinnanttemplate<class _URNG> 3040f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3041f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30423e519524SHoward Hinnant{ 3043f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3044f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3045c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3046c003db1fSHoward Hinnant if (_Rp == 1) 3047f9d540b0SHoward Hinnant return __p.a(); 3048f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3049f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3050c003db1fSHoward Hinnant if (_Rp == 0) 3051f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3052c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3053a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3054f9d540b0SHoward Hinnant ++__w; 3055f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3056f9d540b0SHoward Hinnant _UIntType __u; 3057f9d540b0SHoward Hinnant do 30583e519524SHoward Hinnant { 3059f9d540b0SHoward Hinnant __u = __e(); 3060c003db1fSHoward Hinnant } while (__u >= _Rp); 3061f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30623e519524SHoward Hinnant} 3063f9d540b0SHoward Hinnant 306466f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 306566f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3066f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3067f9d540b0SHoward Hinnant 3068f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3069f9d540b0SHoward Hinnant 3070f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30713e519524SHoward Hinnant{ 3072f9d540b0SHoward Hinnant static unsigned __c_; 3073f9d540b0SHoward Hinnant 3074f9d540b0SHoward Hinnant __rs_default(); 3075f9d540b0SHoward Hinnantpublic: 3076b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3077f9d540b0SHoward Hinnant 3078f9d540b0SHoward Hinnant static const result_type _Min = 0; 3079f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3080f9d540b0SHoward Hinnant 3081f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3082f9d540b0SHoward Hinnant ~__rs_default(); 3083f9d540b0SHoward Hinnant 3084f9d540b0SHoward Hinnant result_type operator()(); 3085f9d540b0SHoward Hinnant 3086788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3087788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3088f9d540b0SHoward Hinnant 3089f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3090f9d540b0SHoward Hinnant}; 3091f9d540b0SHoward Hinnant 3092f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30933e519524SHoward Hinnant 30943e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30953e519524SHoward Hinnantvoid 30963e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30973e519524SHoward Hinnant{ 30983e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3099c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3100c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31013e519524SHoward Hinnant difference_type __d = __last - __first; 31023e519524SHoward Hinnant if (__d > 1) 31033e519524SHoward Hinnant { 3104c003db1fSHoward Hinnant _Dp __uid; 3105f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3106f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3107007b26beSHoward Hinnant { 3108c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3109007b26beSHoward Hinnant if (__i != difference_type(0)) 3110007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3111007b26beSHoward Hinnant } 31123e519524SHoward Hinnant } 31133e519524SHoward Hinnant} 31143e519524SHoward Hinnant 31153e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31163e519524SHoward Hinnantvoid 31173e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3118ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31193e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31203e519524SHoward Hinnant#else 31213e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31223e519524SHoward Hinnant#endif 31233e519524SHoward Hinnant{ 31243e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31253e519524SHoward Hinnant difference_type __d = __last - __first; 31263e519524SHoward Hinnant if (__d > 1) 31273e519524SHoward Hinnant { 31283e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3129007b26beSHoward Hinnant { 3130007b26beSHoward Hinnant difference_type __i = __rand(__d); 3131007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3132007b26beSHoward Hinnant } 31333e519524SHoward Hinnant } 31343e519524SHoward Hinnant} 31350f37a410SMarshall Clow#endif 31363e519524SHoward Hinnant 3137e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3138e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3139e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3140e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 314142bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3142e7154709SEric Fiselier _Distance __n, 3143e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3144e7154709SEric Fiselier input_iterator_tag) { 3145e7154709SEric Fiselier 3146e7154709SEric Fiselier _Distance __k = 0; 3147e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 314842bfedd9SAlexander Richardson __output_iter[__k] = *__first; 3149e7154709SEric Fiselier _Distance __sz = __k; 3150e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3151e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3152e7154709SEric Fiselier if (__r < __sz) 315342bfedd9SAlexander Richardson __output_iter[__r] = *__first; 3154e7154709SEric Fiselier } 315542bfedd9SAlexander Richardson return __output_iter + _VSTD::min(__n, __k); 3156e7154709SEric Fiselier} 3157e7154709SEric Fiselier 3158e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3159e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3160e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3161e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 316242bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3163e7154709SEric Fiselier _Distance __n, 3164e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3165e7154709SEric Fiselier forward_iterator_tag) { 3166e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3167e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3168e7154709SEric Fiselier _Distance __r = 3169e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3170e7154709SEric Fiselier if (__r < __n) { 317142bfedd9SAlexander Richardson *__output_iter++ = *__first; 3172e7154709SEric Fiselier --__n; 3173e7154709SEric Fiselier } 3174e7154709SEric Fiselier } 317542bfedd9SAlexander Richardson return __output_iter; 3176e7154709SEric Fiselier} 3177e7154709SEric Fiselier 3178e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3179e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3180e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3181e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 318242bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3183e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3184e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3185e7154709SEric Fiselier _PopCategory; 3186e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3187e7154709SEric Fiselier _Difference; 3188e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3189e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3190e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3191e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3192e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3193e7154709SEric Fiselier return _VSTD::__sample( 319442bfedd9SAlexander Richardson __first, __last, __output_iter, _CommonType(__n), 3195e7154709SEric Fiselier __g, _PopCategory()); 3196e7154709SEric Fiselier} 3197e7154709SEric Fiselier 3198e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3199e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3200e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3201e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3202e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 320342bfedd9SAlexander Richardson _PopulationIterator __last, _SampleIterator __output_iter, 3204e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 320542bfedd9SAlexander Richardson return _VSTD::__sample(__first, __last, __output_iter, __n, __g); 3206e7154709SEric Fiselier} 3207e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3208e7154709SEric Fiselier 3209f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3210f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3211ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3212fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3213fb340102SHoward Hinnant#else 3214f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3215fb340102SHoward Hinnant#endif 3216f9d540b0SHoward Hinnant{ 3217f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3218c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3219c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3220f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3221f9d540b0SHoward Hinnant if (__d > 1) 3222f9d540b0SHoward Hinnant { 3223c003db1fSHoward Hinnant _Dp __uid; 3224f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3225007b26beSHoward Hinnant { 3226c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3227007b26beSHoward Hinnant if (__i != difference_type(0)) 3228007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3229007b26beSHoward Hinnant } 3230f9d540b0SHoward Hinnant } 3231f9d540b0SHoward Hinnant} 3232f9d540b0SHoward Hinnant 32333e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 32343e519524SHoward Hinnantbool 32353e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32363e519524SHoward Hinnant{ 32373e519524SHoward Hinnant for (; __first != __last; ++__first) 32383e519524SHoward Hinnant if (!__pred(*__first)) 32393e519524SHoward Hinnant break; 3240b9595b79SMarshall Clow if ( __first == __last ) 3241b9595b79SMarshall Clow return true; 3242b9595b79SMarshall Clow ++__first; 32433e519524SHoward Hinnant for (; __first != __last; ++__first) 32443e519524SHoward Hinnant if (__pred(*__first)) 32453e519524SHoward Hinnant return false; 32463e519524SHoward Hinnant return true; 32473e519524SHoward Hinnant} 32483e519524SHoward Hinnant 32493e519524SHoward Hinnant// partition 32503e519524SHoward Hinnant 32513e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32523e519524SHoward Hinnant_ForwardIterator 32533e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32543e519524SHoward Hinnant{ 32553e519524SHoward Hinnant while (true) 32563e519524SHoward Hinnant { 32573e519524SHoward Hinnant if (__first == __last) 32583e519524SHoward Hinnant return __first; 32593e519524SHoward Hinnant if (!__pred(*__first)) 32603e519524SHoward Hinnant break; 32613e519524SHoward Hinnant ++__first; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32643e519524SHoward Hinnant { 32653e519524SHoward Hinnant if (__pred(*__p)) 32663e519524SHoward Hinnant { 32673e519524SHoward Hinnant swap(*__first, *__p); 32683e519524SHoward Hinnant ++__first; 32693e519524SHoward Hinnant } 32703e519524SHoward Hinnant } 32713e519524SHoward Hinnant return __first; 32723e519524SHoward Hinnant} 32733e519524SHoward Hinnant 32743e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32753e519524SHoward Hinnant_BidirectionalIterator 32763e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32773e519524SHoward Hinnant bidirectional_iterator_tag) 32783e519524SHoward Hinnant{ 32793e519524SHoward Hinnant while (true) 32803e519524SHoward Hinnant { 32813e519524SHoward Hinnant while (true) 32823e519524SHoward Hinnant { 32833e519524SHoward Hinnant if (__first == __last) 32843e519524SHoward Hinnant return __first; 32853e519524SHoward Hinnant if (!__pred(*__first)) 32863e519524SHoward Hinnant break; 32873e519524SHoward Hinnant ++__first; 32883e519524SHoward Hinnant } 32893e519524SHoward Hinnant do 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant if (__first == --__last) 32923e519524SHoward Hinnant return __first; 32933e519524SHoward Hinnant } while (!__pred(*__last)); 32943e519524SHoward Hinnant swap(*__first, *__last); 32953e519524SHoward Hinnant ++__first; 32963e519524SHoward Hinnant } 32973e519524SHoward Hinnant} 32983e519524SHoward Hinnant 32993e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33013e519524SHoward Hinnant_ForwardIterator 33023e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33033e519524SHoward Hinnant{ 3304ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33053e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33063e519524SHoward Hinnant} 33073e519524SHoward Hinnant 33083e519524SHoward Hinnant// partition_copy 33093e519524SHoward Hinnant 33103e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33113e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33123e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33133e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33143e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33153e519524SHoward Hinnant _Predicate __pred) 33163e519524SHoward Hinnant{ 33173e519524SHoward Hinnant for (; __first != __last; ++__first) 33183e519524SHoward Hinnant { 33193e519524SHoward Hinnant if (__pred(*__first)) 33203e519524SHoward Hinnant { 33213e519524SHoward Hinnant *__out_true = *__first; 33223e519524SHoward Hinnant ++__out_true; 33233e519524SHoward Hinnant } 33243e519524SHoward Hinnant else 33253e519524SHoward Hinnant { 33263e519524SHoward Hinnant *__out_false = *__first; 33273e519524SHoward Hinnant ++__out_false; 33283e519524SHoward Hinnant } 33293e519524SHoward Hinnant } 33303e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33313e519524SHoward Hinnant} 33323e519524SHoward Hinnant 33333e519524SHoward Hinnant// partition_point 33343e519524SHoward Hinnant 33353e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 33363e519524SHoward Hinnant_ForwardIterator 33373e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33383e519524SHoward Hinnant{ 33393e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3340ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33413e519524SHoward Hinnant while (__len != 0) 33423e519524SHoward Hinnant { 33433e519524SHoward Hinnant difference_type __l2 = __len / 2; 33443e519524SHoward Hinnant _ForwardIterator __m = __first; 3345ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33463e519524SHoward Hinnant if (__pred(*__m)) 33473e519524SHoward Hinnant { 33483e519524SHoward Hinnant __first = ++__m; 33493e519524SHoward Hinnant __len -= __l2 + 1; 33503e519524SHoward Hinnant } 33513e519524SHoward Hinnant else 33523e519524SHoward Hinnant __len = __l2; 33533e519524SHoward Hinnant } 33543e519524SHoward Hinnant return __first; 33553e519524SHoward Hinnant} 33563e519524SHoward Hinnant 33573e519524SHoward Hinnant// stable_partition 33583e519524SHoward Hinnant 33593e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33603e519524SHoward Hinnant_ForwardIterator 33613e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33623e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33633e519524SHoward Hinnant{ 33643e519524SHoward Hinnant // *__first is known to be false 33653e519524SHoward Hinnant // __len >= 1 33663e519524SHoward Hinnant if (__len == 1) 33673e519524SHoward Hinnant return __first; 33683e519524SHoward Hinnant if (__len == 2) 33693e519524SHoward Hinnant { 33703e519524SHoward Hinnant _ForwardIterator __m = __first; 33713e519524SHoward Hinnant if (__pred(*++__m)) 33723e519524SHoward Hinnant { 33733e519524SHoward Hinnant swap(*__first, *__m); 33743e519524SHoward Hinnant return __m; 33753e519524SHoward Hinnant } 33763e519524SHoward Hinnant return __first; 33773e519524SHoward Hinnant } 33783e519524SHoward Hinnant if (__len <= __p.second) 33793e519524SHoward Hinnant { // The buffer is big enough to use 33803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33813e519524SHoward Hinnant __destruct_n __d(0); 33823e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33833e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33843e519524SHoward Hinnant // Update __first to always point to the end of the trues 33853e519524SHoward Hinnant value_type* __t = __p.first; 3386ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33873e519524SHoward Hinnant __d.__incr((value_type*)0); 33883e519524SHoward Hinnant ++__t; 33893e519524SHoward Hinnant _ForwardIterator __i = __first; 33903e519524SHoward Hinnant while (++__i != __last) 33913e519524SHoward Hinnant { 33923e519524SHoward Hinnant if (__pred(*__i)) 33933e519524SHoward Hinnant { 3394ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33953e519524SHoward Hinnant ++__first; 33963e519524SHoward Hinnant } 33973e519524SHoward Hinnant else 33983e519524SHoward Hinnant { 3399ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34003e519524SHoward Hinnant __d.__incr((value_type*)0); 34013e519524SHoward Hinnant ++__t; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant } 34043e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34053e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34063e519524SHoward Hinnant __i = __first; 34073e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3408ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34093e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34103e519524SHoward Hinnant return __first; 34113e519524SHoward Hinnant } 34123e519524SHoward Hinnant // Else not enough buffer, do in place 34133e519524SHoward Hinnant // __len >= 3 34143e519524SHoward Hinnant _ForwardIterator __m = __first; 34153e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3416ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34173e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34183e519524SHoward Hinnant // F????????????????? 34193e519524SHoward Hinnant // f m l 34203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34213e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34223e519524SHoward Hinnant // TTTFFFFF?????????? 34233e519524SHoward Hinnant // f ff m l 34243e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34253e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34263e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34273e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34283e519524SHoward Hinnant while (__pred(*__m1)) 34293e519524SHoward Hinnant { 34303e519524SHoward Hinnant if (++__m1 == __last) 34313e519524SHoward Hinnant goto __second_half_done; 34323e519524SHoward Hinnant --__len_half; 34333e519524SHoward Hinnant } 34343e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34353e519524SHoward Hinnant // f ff m m1 l 34363e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34373e519524SHoward Hinnant__second_half_done: 34383e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34393e519524SHoward Hinnant // f ff m sf l 3440ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34413e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34423e519524SHoward Hinnant // | 34433e519524SHoward Hinnant} 34443e519524SHoward Hinnant 34453e519524SHoward Hinnantstruct __return_temporary_buffer 34463e519524SHoward Hinnant{ 34473e519524SHoward Hinnant template <class _Tp> 3448ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34493e519524SHoward Hinnant}; 34503e519524SHoward Hinnant 34513e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34523e519524SHoward Hinnant_ForwardIterator 34533e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34543e519524SHoward Hinnant forward_iterator_tag) 34553e519524SHoward Hinnant{ 34563e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34573e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34583e519524SHoward Hinnant while (true) 34593e519524SHoward Hinnant { 34603e519524SHoward Hinnant if (__first == __last) 34613e519524SHoward Hinnant return __first; 34623e519524SHoward Hinnant if (!__pred(*__first)) 34633e519524SHoward Hinnant break; 34643e519524SHoward Hinnant ++__first; 34653e519524SHoward Hinnant } 34663e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34673e519524SHoward Hinnant // *__first is known to be false 34683e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34693e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3470ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34713e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34723e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34733e519524SHoward Hinnant if (__len >= __alloc_limit) 34743e519524SHoward Hinnant { 3475ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34763e519524SHoward Hinnant __h.reset(__p.first); 34773e519524SHoward Hinnant } 34783e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34793e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34803e519524SHoward Hinnant} 34813e519524SHoward Hinnant 34823e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34833e519524SHoward Hinnant_BidirectionalIterator 34843e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34853e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34863e519524SHoward Hinnant{ 34873e519524SHoward Hinnant // *__first is known to be false 34883e519524SHoward Hinnant // *__last is known to be true 34893e519524SHoward Hinnant // __len >= 2 34903e519524SHoward Hinnant if (__len == 2) 34913e519524SHoward Hinnant { 34923e519524SHoward Hinnant swap(*__first, *__last); 34933e519524SHoward Hinnant return __last; 34943e519524SHoward Hinnant } 34953e519524SHoward Hinnant if (__len == 3) 34963e519524SHoward Hinnant { 34973e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34983e519524SHoward Hinnant if (__pred(*++__m)) 34993e519524SHoward Hinnant { 35003e519524SHoward Hinnant swap(*__first, *__m); 35013e519524SHoward Hinnant swap(*__m, *__last); 35023e519524SHoward Hinnant return __last; 35033e519524SHoward Hinnant } 35043e519524SHoward Hinnant swap(*__m, *__last); 35053e519524SHoward Hinnant swap(*__first, *__m); 35063e519524SHoward Hinnant return __m; 35073e519524SHoward Hinnant } 35083e519524SHoward Hinnant if (__len <= __p.second) 35093e519524SHoward Hinnant { // The buffer is big enough to use 35103e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35113e519524SHoward Hinnant __destruct_n __d(0); 35123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35133e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35143e519524SHoward Hinnant // Update __first to always point to the end of the trues 35153e519524SHoward Hinnant value_type* __t = __p.first; 3516ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35173e519524SHoward Hinnant __d.__incr((value_type*)0); 35183e519524SHoward Hinnant ++__t; 35193e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35203e519524SHoward Hinnant while (++__i != __last) 35213e519524SHoward Hinnant { 35223e519524SHoward Hinnant if (__pred(*__i)) 35233e519524SHoward Hinnant { 3524ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35253e519524SHoward Hinnant ++__first; 35263e519524SHoward Hinnant } 35273e519524SHoward Hinnant else 35283e519524SHoward Hinnant { 3529ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35303e519524SHoward Hinnant __d.__incr((value_type*)0); 35313e519524SHoward Hinnant ++__t; 35323e519524SHoward Hinnant } 35333e519524SHoward Hinnant } 35343e519524SHoward Hinnant // move *__last, known to be true 3535ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35363e519524SHoward Hinnant __i = ++__first; 35373e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35383e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35393e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3540ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35413e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35423e519524SHoward Hinnant return __first; 35433e519524SHoward Hinnant } 35443e519524SHoward Hinnant // Else not enough buffer, do in place 35453e519524SHoward Hinnant // __len >= 4 35463e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35473e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3548ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35493e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35503e519524SHoward Hinnant // F????????????????T 35513e519524SHoward Hinnant // f m l 35523e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35533e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35543e519524SHoward Hinnant _Distance __len_half = __len2; 35553e519524SHoward Hinnant while (!__pred(*--__m1)) 35563e519524SHoward Hinnant { 35573e519524SHoward Hinnant if (__m1 == __first) 35583e519524SHoward Hinnant goto __first_half_done; 35593e519524SHoward Hinnant --__len_half; 35603e519524SHoward Hinnant } 35613e519524SHoward Hinnant // F???TFFF?????????T 35623e519524SHoward Hinnant // f m1 m l 35633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35643e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35653e519524SHoward Hinnant__first_half_done: 35663e519524SHoward Hinnant // TTTFFFFF?????????T 35673e519524SHoward Hinnant // f ff m l 35683e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35693e519524SHoward Hinnant __m1 = __m; 35703e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35713e519524SHoward Hinnant ++__second_false; 35723e519524SHoward Hinnant __len_half = __len - __len2; 35733e519524SHoward Hinnant while (__pred(*__m1)) 35743e519524SHoward Hinnant { 35753e519524SHoward Hinnant if (++__m1 == __last) 35763e519524SHoward Hinnant goto __second_half_done; 35773e519524SHoward Hinnant --__len_half; 35783e519524SHoward Hinnant } 35793e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35803e519524SHoward Hinnant // f ff m m1 l 35813e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35823e519524SHoward Hinnant__second_half_done: 35833e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35843e519524SHoward Hinnant // f ff m sf l 3585ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35863e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35873e519524SHoward Hinnant // | 35883e519524SHoward Hinnant} 35893e519524SHoward Hinnant 35903e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35913e519524SHoward Hinnant_BidirectionalIterator 35923e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35933e519524SHoward Hinnant bidirectional_iterator_tag) 35943e519524SHoward Hinnant{ 35953e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35963e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35973e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35983e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35993e519524SHoward Hinnant while (true) 36003e519524SHoward Hinnant { 36013e519524SHoward Hinnant if (__first == __last) 36023e519524SHoward Hinnant return __first; 36033e519524SHoward Hinnant if (!__pred(*__first)) 36043e519524SHoward Hinnant break; 36053e519524SHoward Hinnant ++__first; 36063e519524SHoward Hinnant } 36073e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36083e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36093e519524SHoward Hinnant do 36103e519524SHoward Hinnant { 36113e519524SHoward Hinnant if (__first == --__last) 36123e519524SHoward Hinnant return __first; 36133e519524SHoward Hinnant } while (!__pred(*__last)); 36143e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36153e519524SHoward Hinnant // *__first is known to be false 36163e519524SHoward Hinnant // *__last is known to be true 36173e519524SHoward Hinnant // __len >= 2 3618ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36193e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36203e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36213e519524SHoward Hinnant if (__len >= __alloc_limit) 36223e519524SHoward Hinnant { 3623ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36243e519524SHoward Hinnant __h.reset(__p.first); 36253e519524SHoward Hinnant } 36263e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36273e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36283e519524SHoward Hinnant} 36293e519524SHoward Hinnant 36303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36323e519524SHoward Hinnant_ForwardIterator 36333e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36343e519524SHoward Hinnant{ 36353e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36363e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36373e519524SHoward Hinnant} 36383e519524SHoward Hinnant 36393e519524SHoward Hinnant// is_sorted_until 36403e519524SHoward Hinnant 36413e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36423e519524SHoward Hinnant_ForwardIterator 36433e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36443e519524SHoward Hinnant{ 36453e519524SHoward Hinnant if (__first != __last) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant _ForwardIterator __i = __first; 36483e519524SHoward Hinnant while (++__i != __last) 36493e519524SHoward Hinnant { 36503e519524SHoward Hinnant if (__comp(*__i, *__first)) 36513e519524SHoward Hinnant return __i; 36523e519524SHoward Hinnant __first = __i; 36533e519524SHoward Hinnant } 36543e519524SHoward Hinnant } 36553e519524SHoward Hinnant return __last; 36563e519524SHoward Hinnant} 36573e519524SHoward Hinnant 36583e519524SHoward Hinnanttemplate<class _ForwardIterator> 36593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36603e519524SHoward Hinnant_ForwardIterator 36613e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36623e519524SHoward Hinnant{ 3663ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36643e519524SHoward Hinnant} 36653e519524SHoward Hinnant 36663e519524SHoward Hinnant// is_sorted 36673e519524SHoward Hinnant 36683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36703e519524SHoward Hinnantbool 36713e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36723e519524SHoward Hinnant{ 3673ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36743e519524SHoward Hinnant} 36753e519524SHoward Hinnant 36763e519524SHoward Hinnanttemplate<class _ForwardIterator> 36773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36783e519524SHoward Hinnantbool 36793e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36803e519524SHoward Hinnant{ 3681ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36823e519524SHoward Hinnant} 36833e519524SHoward Hinnant 36843e519524SHoward Hinnant// sort 36853e519524SHoward Hinnant 36863e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36873e519524SHoward Hinnant 36883e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36893e519524SHoward Hinnantunsigned 36903e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36913e519524SHoward Hinnant{ 36923e519524SHoward Hinnant unsigned __r = 0; 36933e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36943e519524SHoward Hinnant { 36953e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36963e519524SHoward Hinnant return __r; // x <= y && y <= z 36973e519524SHoward Hinnant // x <= y && y > z 36983e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36993e519524SHoward Hinnant __r = 1; 37003e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37013e519524SHoward Hinnant { 37023e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37033e519524SHoward Hinnant __r = 2; 37043e519524SHoward Hinnant } 37053e519524SHoward Hinnant return __r; // x <= y && y < z 37063e519524SHoward Hinnant } 37073e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37083e519524SHoward Hinnant { 37093e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37103e519524SHoward Hinnant __r = 1; 37113e519524SHoward Hinnant return __r; 37123e519524SHoward Hinnant } 37133e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37143e519524SHoward Hinnant __r = 1; // x < y && x <= z 37153e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37163e519524SHoward Hinnant { 37173e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37183e519524SHoward Hinnant __r = 2; 37193e519524SHoward Hinnant } 37203e519524SHoward Hinnant return __r; 37213e519524SHoward Hinnant} // x <= y && y <= z 37223e519524SHoward Hinnant 37233e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37243e519524SHoward Hinnant 37253e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37263e519524SHoward Hinnantunsigned 37273e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37283e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37293e519524SHoward Hinnant{ 37303e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37313e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37323e519524SHoward Hinnant { 37333e519524SHoward Hinnant swap(*__x3, *__x4); 37343e519524SHoward Hinnant ++__r; 37353e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37363e519524SHoward Hinnant { 37373e519524SHoward Hinnant swap(*__x2, *__x3); 37383e519524SHoward Hinnant ++__r; 37393e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37403e519524SHoward Hinnant { 37413e519524SHoward Hinnant swap(*__x1, *__x2); 37423e519524SHoward Hinnant ++__r; 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant } 37453e519524SHoward Hinnant } 37463e519524SHoward Hinnant return __r; 37473e519524SHoward Hinnant} 37483e519524SHoward Hinnant 37493e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37503e519524SHoward Hinnant 37513e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37523e519524SHoward Hinnantunsigned 37533e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37543e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37553e519524SHoward Hinnant{ 37563e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37573e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37583e519524SHoward Hinnant { 37593e519524SHoward Hinnant swap(*__x4, *__x5); 37603e519524SHoward Hinnant ++__r; 37613e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37623e519524SHoward Hinnant { 37633e519524SHoward Hinnant swap(*__x3, *__x4); 37643e519524SHoward Hinnant ++__r; 37653e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37663e519524SHoward Hinnant { 37673e519524SHoward Hinnant swap(*__x2, *__x3); 37683e519524SHoward Hinnant ++__r; 37693e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37703e519524SHoward Hinnant { 37713e519524SHoward Hinnant swap(*__x1, *__x2); 37723e519524SHoward Hinnant ++__r; 37733e519524SHoward Hinnant } 37743e519524SHoward Hinnant } 37753e519524SHoward Hinnant } 37763e519524SHoward Hinnant } 37773e519524SHoward Hinnant return __r; 37783e519524SHoward Hinnant} 37793e519524SHoward Hinnant 37803e519524SHoward Hinnant// Assumes size > 0 37813e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37823e519524SHoward Hinnantvoid 37833e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37843e519524SHoward Hinnant{ 37853e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37863e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37873e519524SHoward Hinnant { 3788ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37893e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37903e519524SHoward Hinnant (__first, __last, __comp); 37913e519524SHoward Hinnant if (__i != __first) 37923e519524SHoward Hinnant swap(*__first, *__i); 37933e519524SHoward Hinnant } 37943e519524SHoward Hinnant} 37953e519524SHoward Hinnant 37963e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37973e519524SHoward Hinnantvoid 37983e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37993e519524SHoward Hinnant{ 38003e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38013e519524SHoward Hinnant if (__first != __last) 38023e519524SHoward Hinnant { 38033e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38043e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38053e519524SHoward Hinnant { 38063e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3807ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38083e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3809ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3810ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38113e519524SHoward Hinnant } 38123e519524SHoward Hinnant } 38133e519524SHoward Hinnant} 38143e519524SHoward Hinnant 38153e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38163e519524SHoward Hinnantvoid 38173e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38183e519524SHoward Hinnant{ 38193e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38203e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38213e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38223e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38233e519524SHoward Hinnant { 38243e519524SHoward Hinnant if (__comp(*__i, *__j)) 38253e519524SHoward Hinnant { 3826ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38273e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38283e519524SHoward Hinnant __j = __i; 38293e519524SHoward Hinnant do 38303e519524SHoward Hinnant { 3831ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38323e519524SHoward Hinnant __j = __k; 38333e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3834ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38353e519524SHoward Hinnant } 38363e519524SHoward Hinnant __j = __i; 38373e519524SHoward Hinnant } 38383e519524SHoward Hinnant} 38393e519524SHoward Hinnant 38403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38413e519524SHoward Hinnantbool 38423e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38433e519524SHoward Hinnant{ 38443e519524SHoward Hinnant switch (__last - __first) 38453e519524SHoward Hinnant { 38463e519524SHoward Hinnant case 0: 38473e519524SHoward Hinnant case 1: 38483e519524SHoward Hinnant return true; 38493e519524SHoward Hinnant case 2: 38503e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38513e519524SHoward Hinnant swap(*__first, *__last); 38523e519524SHoward Hinnant return true; 38533e519524SHoward Hinnant case 3: 3854ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38553e519524SHoward Hinnant return true; 38563e519524SHoward Hinnant case 4: 3857ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38583e519524SHoward Hinnant return true; 38593e519524SHoward Hinnant case 5: 3860ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38613e519524SHoward Hinnant return true; 38623e519524SHoward Hinnant } 38633e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38643e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38653e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38663e519524SHoward Hinnant const unsigned __limit = 8; 38673e519524SHoward Hinnant unsigned __count = 0; 38683e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38693e519524SHoward Hinnant { 38703e519524SHoward Hinnant if (__comp(*__i, *__j)) 38713e519524SHoward Hinnant { 3872ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38733e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38743e519524SHoward Hinnant __j = __i; 38753e519524SHoward Hinnant do 38763e519524SHoward Hinnant { 3877ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38783e519524SHoward Hinnant __j = __k; 38793e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3880ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38813e519524SHoward Hinnant if (++__count == __limit) 38823e519524SHoward Hinnant return ++__i == __last; 38833e519524SHoward Hinnant } 38843e519524SHoward Hinnant __j = __i; 38853e519524SHoward Hinnant } 38863e519524SHoward Hinnant return true; 38873e519524SHoward Hinnant} 38883e519524SHoward Hinnant 38893e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38903e519524SHoward Hinnantvoid 38913e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38923e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38933e519524SHoward Hinnant{ 38943e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38953e519524SHoward Hinnant if (__first1 != __last1) 38963e519524SHoward Hinnant { 38973e519524SHoward Hinnant __destruct_n __d(0); 38983e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38993e519524SHoward Hinnant value_type* __last2 = __first2; 3900ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39013e519524SHoward Hinnant __d.__incr((value_type*)0); 39023e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39033e519524SHoward Hinnant { 39043e519524SHoward Hinnant value_type* __j2 = __last2; 39053e519524SHoward Hinnant value_type* __i2 = __j2; 39063e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39073e519524SHoward Hinnant { 3908ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39093e519524SHoward Hinnant __d.__incr((value_type*)0); 39103e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3911ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3912ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39133e519524SHoward Hinnant } 39143e519524SHoward Hinnant else 39153e519524SHoward Hinnant { 3916ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39173e519524SHoward Hinnant __d.__incr((value_type*)0); 39183e519524SHoward Hinnant } 39193e519524SHoward Hinnant } 39203e519524SHoward Hinnant __h.release(); 39213e519524SHoward Hinnant } 39223e519524SHoward Hinnant} 39233e519524SHoward Hinnant 39243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39253e519524SHoward Hinnantvoid 39263e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39273e519524SHoward Hinnant{ 39283e519524SHoward Hinnant // _Compare is known to be a reference type 39293e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3931ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3932ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39333e519524SHoward Hinnant while (true) 39343e519524SHoward Hinnant { 39353e519524SHoward Hinnant __restart: 39363e519524SHoward Hinnant difference_type __len = __last - __first; 39373e519524SHoward Hinnant switch (__len) 39383e519524SHoward Hinnant { 39393e519524SHoward Hinnant case 0: 39403e519524SHoward Hinnant case 1: 39413e519524SHoward Hinnant return; 39423e519524SHoward Hinnant case 2: 39433e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39443e519524SHoward Hinnant swap(*__first, *__last); 39453e519524SHoward Hinnant return; 39463e519524SHoward Hinnant case 3: 3947ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39483e519524SHoward Hinnant return; 39493e519524SHoward Hinnant case 4: 3950ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39513e519524SHoward Hinnant return; 39523e519524SHoward Hinnant case 5: 3953ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39543e519524SHoward Hinnant return; 39553e519524SHoward Hinnant } 39563e519524SHoward Hinnant if (__len <= __limit) 39573e519524SHoward Hinnant { 3958ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39593e519524SHoward Hinnant return; 39603e519524SHoward Hinnant } 39613e519524SHoward Hinnant // __len > 5 39623e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39633e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39643e519524SHoward Hinnant --__lm1; 39653e519524SHoward Hinnant unsigned __n_swaps; 39663e519524SHoward Hinnant { 39673e519524SHoward Hinnant difference_type __delta; 39683e519524SHoward Hinnant if (__len >= 1000) 39693e519524SHoward Hinnant { 39703e519524SHoward Hinnant __delta = __len/2; 39713e519524SHoward Hinnant __m += __delta; 39723e519524SHoward Hinnant __delta /= 2; 3973ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39743e519524SHoward Hinnant } 39753e519524SHoward Hinnant else 39763e519524SHoward Hinnant { 39773e519524SHoward Hinnant __delta = __len/2; 39783e519524SHoward Hinnant __m += __delta; 3979ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant } 39823e519524SHoward Hinnant // *__m is median 39833e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39843e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39853e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39863e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39873e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39883e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39893e519524SHoward Hinnant // Prime the downward search with a guard. 39903e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39913e519524SHoward Hinnant { 39923e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39933e519524SHoward Hinnant // manually guard downward moving __j against __i 39943e519524SHoward Hinnant while (true) 39953e519524SHoward Hinnant { 39963e519524SHoward Hinnant if (__i == --__j) 39973e519524SHoward Hinnant { 39983e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39993e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40003e519524SHoward Hinnant ++__i; // __first + 1 40013e519524SHoward Hinnant __j = __last; 40023e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40033e519524SHoward Hinnant { 40043e519524SHoward Hinnant while (true) 40053e519524SHoward Hinnant { 40063e519524SHoward Hinnant if (__i == __j) 40073e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40083e519524SHoward Hinnant if (__comp(*__first, *__i)) 40093e519524SHoward Hinnant { 40103e519524SHoward Hinnant swap(*__i, *__j); 40113e519524SHoward Hinnant ++__n_swaps; 40123e519524SHoward Hinnant ++__i; 40133e519524SHoward Hinnant break; 40143e519524SHoward Hinnant } 40153e519524SHoward Hinnant ++__i; 40163e519524SHoward Hinnant } 40173e519524SHoward Hinnant } 40183e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40193e519524SHoward Hinnant if (__i == __j) 40203e519524SHoward Hinnant return; 40213e519524SHoward Hinnant while (true) 40223e519524SHoward Hinnant { 40233e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40243e519524SHoward Hinnant ++__i; 40253e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40263e519524SHoward Hinnant ; 40273e519524SHoward Hinnant if (__i >= __j) 40283e519524SHoward Hinnant break; 40293e519524SHoward Hinnant swap(*__i, *__j); 40303e519524SHoward Hinnant ++__n_swaps; 40313e519524SHoward Hinnant ++__i; 40323e519524SHoward Hinnant } 40333e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40343e519524SHoward Hinnant // The first part is sorted, sort the secod part 4035ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40363e519524SHoward Hinnant __first = __i; 40373e519524SHoward Hinnant goto __restart; 40383e519524SHoward Hinnant } 40393e519524SHoward Hinnant if (__comp(*__j, *__m)) 40403e519524SHoward Hinnant { 40413e519524SHoward Hinnant swap(*__i, *__j); 40423e519524SHoward Hinnant ++__n_swaps; 40433e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40443e519524SHoward Hinnant } 40453e519524SHoward Hinnant } 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant // It is known that *__i < *__m 40483e519524SHoward Hinnant ++__i; 40493e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40503e519524SHoward Hinnant // if not yet partitioned... 40513e519524SHoward Hinnant if (__i < __j) 40523e519524SHoward Hinnant { 40533e519524SHoward Hinnant // known that *(__i - 1) < *__m 40543e519524SHoward Hinnant // known that __i <= __m 40553e519524SHoward Hinnant while (true) 40563e519524SHoward Hinnant { 40573e519524SHoward Hinnant // __m still guards upward moving __i 40583e519524SHoward Hinnant while (__comp(*__i, *__m)) 40593e519524SHoward Hinnant ++__i; 40603e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40613e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40623e519524SHoward Hinnant ; 40633e519524SHoward Hinnant if (__i > __j) 40643e519524SHoward Hinnant break; 40653e519524SHoward Hinnant swap(*__i, *__j); 40663e519524SHoward Hinnant ++__n_swaps; 40673e519524SHoward Hinnant // It is known that __m != __j 40683e519524SHoward Hinnant // If __m just moved, follow it 40693e519524SHoward Hinnant if (__m == __i) 40703e519524SHoward Hinnant __m = __j; 40713e519524SHoward Hinnant ++__i; 40723e519524SHoward Hinnant } 40733e519524SHoward Hinnant } 40743e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40753e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40763e519524SHoward Hinnant { 40773e519524SHoward Hinnant swap(*__i, *__m); 40783e519524SHoward Hinnant ++__n_swaps; 40793e519524SHoward Hinnant } 40803e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40813e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40823e519524SHoward Hinnant if (__n_swaps == 0) 40833e519524SHoward Hinnant { 4084ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4085ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40863e519524SHoward Hinnant { 40873e519524SHoward Hinnant if (__fs) 40883e519524SHoward Hinnant return; 40893e519524SHoward Hinnant __last = __i; 40903e519524SHoward Hinnant continue; 40913e519524SHoward Hinnant } 40923e519524SHoward Hinnant else 40933e519524SHoward Hinnant { 40943e519524SHoward Hinnant if (__fs) 40953e519524SHoward Hinnant { 40963e519524SHoward Hinnant __first = ++__i; 40973e519524SHoward Hinnant continue; 40983e519524SHoward Hinnant } 40993e519524SHoward Hinnant } 41003e519524SHoward Hinnant } 41013e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41023e519524SHoward Hinnant if (__i - __first < __last - __i) 41033e519524SHoward Hinnant { 4104ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4105ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41063e519524SHoward Hinnant __first = ++__i; 41073e519524SHoward Hinnant } 41083e519524SHoward Hinnant else 41093e519524SHoward Hinnant { 4110ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4111ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41123e519524SHoward Hinnant __last = __i; 41133e519524SHoward Hinnant } 41143e519524SHoward Hinnant } 41153e519524SHoward Hinnant} 41163e519524SHoward Hinnant 41173e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41183e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41203e519524SHoward Hinnantvoid 41213e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41223e519524SHoward Hinnant{ 4123145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41263e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4127145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41293e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4130145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41313e519524SHoward Hinnant} 41323e519524SHoward Hinnant 41333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41353e519524SHoward Hinnantvoid 41363e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41373e519524SHoward Hinnant{ 4138ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41393e519524SHoward Hinnant} 41403e519524SHoward Hinnant 41413e519524SHoward Hinnanttemplate <class _Tp> 41423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41433e519524SHoward Hinnantvoid 41443e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41453e519524SHoward Hinnant{ 4146ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41473e519524SHoward Hinnant} 41483e519524SHoward Hinnant 41493e519524SHoward Hinnanttemplate <class _Tp> 41503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41513e519524SHoward Hinnantvoid 41523e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41533e519524SHoward Hinnant{ 4154ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41553e519524SHoward Hinnant} 41563e519524SHoward Hinnant 4157f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4158f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4159f554add5SHoward Hinnantvoid 4160f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4161f554add5SHoward Hinnant{ 4162f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4163f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4164f554add5SHoward Hinnant} 4165f554add5SHoward Hinnant 4166f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4167f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4168f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4169f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4170f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4171f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4172f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4173f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4174f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4175f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4176f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4177f0544c20SHoward 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>&)) 4178f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4179f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4180f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41813e519524SHoward Hinnant 4182f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4183f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4184f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4185f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4186f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4187f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4188f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4189f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4190f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4191f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4192f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4193f0544c20SHoward 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>&)) 4194f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4195f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4196f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41973e519524SHoward Hinnant 4198f0544c20SHoward 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>&)) 41993e519524SHoward Hinnant 42003e519524SHoward Hinnant// lower_bound 42013e519524SHoward Hinnant 42023e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42033e519524SHoward Hinnant_ForwardIterator 4204e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42053e519524SHoward Hinnant{ 42063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4207ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42083e519524SHoward Hinnant while (__len != 0) 42093e519524SHoward Hinnant { 42103e519524SHoward Hinnant difference_type __l2 = __len / 2; 42113e519524SHoward Hinnant _ForwardIterator __m = __first; 4212ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4213e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42143e519524SHoward Hinnant { 42153e519524SHoward Hinnant __first = ++__m; 42163e519524SHoward Hinnant __len -= __l2 + 1; 42173e519524SHoward Hinnant } 42183e519524SHoward Hinnant else 42193e519524SHoward Hinnant __len = __l2; 42203e519524SHoward Hinnant } 42213e519524SHoward Hinnant return __first; 42223e519524SHoward Hinnant} 42233e519524SHoward Hinnant 42243e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42263e519524SHoward Hinnant_ForwardIterator 4227e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42283e519524SHoward Hinnant{ 4229145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42303e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42313e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4232e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4233145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4235e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4236145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42373e519524SHoward Hinnant} 42383e519524SHoward Hinnant 42393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42413e519524SHoward Hinnant_ForwardIterator 4242e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42433e519524SHoward Hinnant{ 4244e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42453e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42463e519524SHoward Hinnant} 42473e519524SHoward Hinnant 42483e519524SHoward Hinnant// upper_bound 42493e519524SHoward Hinnant 42503e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42513e519524SHoward Hinnant_ForwardIterator 4252e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42533e519524SHoward Hinnant{ 42543e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4255ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42563e519524SHoward Hinnant while (__len != 0) 42573e519524SHoward Hinnant { 42583e519524SHoward Hinnant difference_type __l2 = __len / 2; 42593e519524SHoward Hinnant _ForwardIterator __m = __first; 4260ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4261e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42623e519524SHoward Hinnant __len = __l2; 42633e519524SHoward Hinnant else 42643e519524SHoward Hinnant { 42653e519524SHoward Hinnant __first = ++__m; 42663e519524SHoward Hinnant __len -= __l2 + 1; 42673e519524SHoward Hinnant } 42683e519524SHoward Hinnant } 42693e519524SHoward Hinnant return __first; 42703e519524SHoward Hinnant} 42713e519524SHoward Hinnant 42723e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42743e519524SHoward Hinnant_ForwardIterator 4275e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42763e519524SHoward Hinnant{ 4277145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4280e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4281145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4283e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4284145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42853e519524SHoward Hinnant} 42863e519524SHoward Hinnant 42873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42893e519524SHoward Hinnant_ForwardIterator 4290e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42913e519524SHoward Hinnant{ 4292e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42933e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42943e519524SHoward Hinnant} 42953e519524SHoward Hinnant 42963e519524SHoward Hinnant// equal_range 42973e519524SHoward Hinnant 42983e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42993e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4300e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43013e519524SHoward Hinnant{ 43023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4303ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43043e519524SHoward Hinnant while (__len != 0) 43053e519524SHoward Hinnant { 43063e519524SHoward Hinnant difference_type __l2 = __len / 2; 43073e519524SHoward Hinnant _ForwardIterator __m = __first; 4308ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4309e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43103e519524SHoward Hinnant { 43113e519524SHoward Hinnant __first = ++__m; 43123e519524SHoward Hinnant __len -= __l2 + 1; 43133e519524SHoward Hinnant } 4314e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43153e519524SHoward Hinnant { 43163e519524SHoward Hinnant __last = __m; 43173e519524SHoward Hinnant __len = __l2; 43183e519524SHoward Hinnant } 43193e519524SHoward Hinnant else 43203e519524SHoward Hinnant { 43213e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43223e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43233e519524SHoward Hinnant ( 4324e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4325e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43263e519524SHoward Hinnant ); 43273e519524SHoward Hinnant } 43283e519524SHoward Hinnant } 43293e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43303e519524SHoward Hinnant} 43313e519524SHoward Hinnant 43323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43343e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4335e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43363e519524SHoward Hinnant{ 4337145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4340e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4341145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4343e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4344145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43453e519524SHoward Hinnant} 43463e519524SHoward Hinnant 43473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43493e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4350e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43513e519524SHoward Hinnant{ 4352e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43533e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43543e519524SHoward Hinnant} 43553e519524SHoward Hinnant 43563e519524SHoward Hinnant// binary_search 43573e519524SHoward Hinnant 43583e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43603e519524SHoward Hinnantbool 4361e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43623e519524SHoward Hinnant{ 4363e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4364e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43653e519524SHoward Hinnant} 43663e519524SHoward Hinnant 43673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43693e519524SHoward Hinnantbool 4370e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43713e519524SHoward Hinnant{ 4372145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4375e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4376145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4378e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4379145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43803e519524SHoward Hinnant} 43813e519524SHoward Hinnant 43823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43843e519524SHoward Hinnantbool 4385e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43863e519524SHoward Hinnant{ 4387e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43883e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43893e519524SHoward Hinnant} 43903e519524SHoward Hinnant 43913e519524SHoward Hinnant// merge 43923e519524SHoward Hinnant 43933e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43943e519524SHoward Hinnant_OutputIterator 43953e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43973e519524SHoward Hinnant{ 43983e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43993e519524SHoward Hinnant { 44003e519524SHoward Hinnant if (__first2 == __last2) 4401ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44023e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44033e519524SHoward Hinnant { 44043e519524SHoward Hinnant *__result = *__first2; 44053e519524SHoward Hinnant ++__first2; 44063e519524SHoward Hinnant } 44073e519524SHoward Hinnant else 44083e519524SHoward Hinnant { 44093e519524SHoward Hinnant *__result = *__first1; 44103e519524SHoward Hinnant ++__first1; 44113e519524SHoward Hinnant } 44123e519524SHoward Hinnant } 4413ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44143e519524SHoward Hinnant} 44153e519524SHoward Hinnant 44163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44183e519524SHoward Hinnant_OutputIterator 44193e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44213e519524SHoward Hinnant{ 4422145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4425ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4426145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4428ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4429145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44303e519524SHoward Hinnant} 44313e519524SHoward Hinnant 44323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44343e519524SHoward Hinnant_OutputIterator 44353e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44373e519524SHoward Hinnant{ 44383e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44393e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44403e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44413e519524SHoward Hinnant} 44423e519524SHoward Hinnant 44433e519524SHoward Hinnant// inplace_merge 44443e519524SHoward Hinnant 4445adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4446adfdae18SMarshall Clow class _OutputIterator> 4447adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4448adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4449adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4450adfdae18SMarshall Clow{ 4451adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4452adfdae18SMarshall Clow { 4453adfdae18SMarshall Clow if (__first2 == __last2) 4454adfdae18SMarshall Clow { 4455adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4456adfdae18SMarshall Clow return; 4457adfdae18SMarshall Clow } 4458adfdae18SMarshall Clow 4459adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4460adfdae18SMarshall Clow { 4461adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4462adfdae18SMarshall Clow ++__first2; 4463adfdae18SMarshall Clow } 4464adfdae18SMarshall Clow else 4465adfdae18SMarshall Clow { 4466adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4467adfdae18SMarshall Clow ++__first1; 4468adfdae18SMarshall Clow } 4469adfdae18SMarshall Clow } 4470adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4471adfdae18SMarshall Clow} 4472adfdae18SMarshall Clow 44733e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44743e519524SHoward Hinnantvoid 44753e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44763e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44773e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44783e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44793e519524SHoward Hinnant{ 44803e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44813e519524SHoward Hinnant __destruct_n __d(0); 44823e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44833e519524SHoward Hinnant if (__len1 <= __len2) 44843e519524SHoward Hinnant { 44853e519524SHoward Hinnant value_type* __p = __buff; 4486910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4487ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4488adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44893e519524SHoward Hinnant } 44903e519524SHoward Hinnant else 44913e519524SHoward Hinnant { 44923e519524SHoward Hinnant value_type* __p = __buff; 4493910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4494ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44953e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44963e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4497adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4498adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 4499a763b36fSMarshall Clow _RBi(__last), __invert<_Compare>(__comp)); 45003e519524SHoward Hinnant } 45013e519524SHoward Hinnant} 45023e519524SHoward Hinnant 45033e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45043e519524SHoward Hinnantvoid 45053e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45063e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45073e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45083e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45093e519524SHoward Hinnant{ 45103e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45113e519524SHoward Hinnant while (true) 45123e519524SHoward Hinnant { 45133e519524SHoward Hinnant // if __middle == __last, we're done 45143e519524SHoward Hinnant if (__len2 == 0) 45153e519524SHoward Hinnant return; 4516526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4517526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4518526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45193e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4520910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45213e519524SHoward Hinnant { 45223e519524SHoward Hinnant if (__len1 == 0) 45233e519524SHoward Hinnant return; 45243e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45253e519524SHoward Hinnant break; 45263e519524SHoward Hinnant } 45273e519524SHoward Hinnant // __first < __middle < __last 45283e519524SHoward Hinnant // *__first > *__middle 45293e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45303e519524SHoward Hinnant // all elements in: 45313e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45323e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45333e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45343e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45353e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45363e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45373e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45383e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45393e519524SHoward Hinnant // binary search smaller range 45403e519524SHoward Hinnant if (__len1 < __len2) 45413e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45423e519524SHoward Hinnant __len21 = __len2 / 2; 45433e519524SHoward Hinnant __m2 = __middle; 4544ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45453e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4546ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45473e519524SHoward Hinnant } 45483e519524SHoward Hinnant else 45493e519524SHoward Hinnant { 45503e519524SHoward Hinnant if (__len1 == 1) 45513e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45523e519524SHoward Hinnant // It is known *__first > *__middle 45533e519524SHoward Hinnant swap(*__first, *__middle); 45543e519524SHoward Hinnant return; 45553e519524SHoward Hinnant } 45563e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45573e519524SHoward Hinnant __len11 = __len1 / 2; 45583e519524SHoward Hinnant __m1 = __first; 4559ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45603e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4561ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45623e519524SHoward Hinnant } 45633e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45643e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45653e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45663e519524SHoward Hinnant // swap middle two partitions 4567ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45683e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45693e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45703e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45713e519524SHoward Hinnant { 45723e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45733e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45743e519524SHoward Hinnant __first = __middle; 45753e519524SHoward Hinnant __middle = __m2; 45763e519524SHoward Hinnant __len1 = __len12; 45773e519524SHoward Hinnant __len2 = __len22; 45783e519524SHoward Hinnant } 45793e519524SHoward Hinnant else 45803e519524SHoward Hinnant { 45813e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45823e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45833e519524SHoward Hinnant __last = __middle; 45843e519524SHoward Hinnant __middle = __m1; 45853e519524SHoward Hinnant __len1 = __len11; 45863e519524SHoward Hinnant __len2 = __len21; 45873e519524SHoward Hinnant } 45883e519524SHoward Hinnant } 45893e519524SHoward Hinnant} 45903e519524SHoward Hinnant 45913e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45933e519524SHoward Hinnantvoid 45943e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45953e519524SHoward Hinnant _Compare __comp) 45963e519524SHoward Hinnant{ 45973e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45983e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4599ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4600ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4601ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46020b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46030b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46040b48cf9aSMarshall Clow 4605145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4608ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46093e519524SHoward Hinnant __buf.first, __buf.second); 4610145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46113e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4612ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46133e519524SHoward Hinnant __buf.first, __buf.second); 4614145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46153e519524SHoward Hinnant} 46163e519524SHoward Hinnant 46173e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46193e519524SHoward Hinnantvoid 46203e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46213e519524SHoward Hinnant{ 4622ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46233e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46243e519524SHoward Hinnant} 46253e519524SHoward Hinnant 46263e519524SHoward Hinnant// stable_sort 46273e519524SHoward Hinnant 46283e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 46293e519524SHoward Hinnantvoid 46303e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 46313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46323e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 46333e519524SHoward Hinnant{ 46343e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46353e519524SHoward Hinnant __destruct_n __d(0); 46363e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46373e519524SHoward Hinnant for (; true; ++__result) 46383e519524SHoward Hinnant { 46393e519524SHoward Hinnant if (__first1 == __last1) 46403e519524SHoward Hinnant { 46413e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4642ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46433e519524SHoward Hinnant __h.release(); 46443e519524SHoward Hinnant return; 46453e519524SHoward Hinnant } 46463e519524SHoward Hinnant if (__first2 == __last2) 46473e519524SHoward Hinnant { 46483e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4649ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46503e519524SHoward Hinnant __h.release(); 46513e519524SHoward Hinnant return; 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46543e519524SHoward Hinnant { 4655ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46563e519524SHoward Hinnant __d.__incr((value_type*)0); 46573e519524SHoward Hinnant ++__first2; 46583e519524SHoward Hinnant } 46593e519524SHoward Hinnant else 46603e519524SHoward Hinnant { 4661ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46623e519524SHoward Hinnant __d.__incr((value_type*)0); 46633e519524SHoward Hinnant ++__first1; 46643e519524SHoward Hinnant } 46653e519524SHoward Hinnant } 46663e519524SHoward Hinnant} 46673e519524SHoward Hinnant 46683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46693e519524SHoward Hinnantvoid 46703e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46723e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46733e519524SHoward Hinnant{ 46743e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46753e519524SHoward Hinnant { 46763e519524SHoward Hinnant if (__first2 == __last2) 46773e519524SHoward Hinnant { 46783e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4679ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46803e519524SHoward Hinnant return; 46813e519524SHoward Hinnant } 46823e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46833e519524SHoward Hinnant { 4684ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46853e519524SHoward Hinnant ++__first2; 46863e519524SHoward Hinnant } 46873e519524SHoward Hinnant else 46883e519524SHoward Hinnant { 4689ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46903e519524SHoward Hinnant ++__first1; 46913e519524SHoward Hinnant } 46923e519524SHoward Hinnant } 46933e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4694ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46953e519524SHoward Hinnant} 46963e519524SHoward Hinnant 46973e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46983e519524SHoward Hinnantvoid 46993e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47003e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47023e519524SHoward Hinnant 47033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47043e519524SHoward Hinnantvoid 47053e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47063e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47073e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47083e519524SHoward Hinnant{ 47093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47103e519524SHoward Hinnant switch (__len) 47113e519524SHoward Hinnant { 47123e519524SHoward Hinnant case 0: 47133e519524SHoward Hinnant return; 47143e519524SHoward Hinnant case 1: 4715ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47163e519524SHoward Hinnant return; 47173e519524SHoward Hinnant case 2: 47183e519524SHoward Hinnant __destruct_n __d(0); 47193e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47203e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47213e519524SHoward Hinnant { 4722ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47233e519524SHoward Hinnant __d.__incr((value_type*)0); 47243e519524SHoward Hinnant ++__first2; 4725ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47263e519524SHoward Hinnant } 47273e519524SHoward Hinnant else 47283e519524SHoward Hinnant { 4729ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47303e519524SHoward Hinnant __d.__incr((value_type*)0); 47313e519524SHoward Hinnant ++__first2; 4732ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47333e519524SHoward Hinnant } 47343e519524SHoward Hinnant __h2.release(); 47353e519524SHoward Hinnant return; 47363e519524SHoward Hinnant } 47373e519524SHoward Hinnant if (__len <= 8) 47383e519524SHoward Hinnant { 47393e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47403e519524SHoward Hinnant return; 47413e519524SHoward Hinnant } 47423e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47433e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47443e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47453e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47463e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47473e519524SHoward Hinnant} 47483e519524SHoward Hinnant 47493e519524SHoward Hinnanttemplate <class _Tp> 47503e519524SHoward Hinnantstruct __stable_sort_switch 47513e519524SHoward Hinnant{ 4752ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47533e519524SHoward Hinnant}; 47543e519524SHoward Hinnant 47553e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47563e519524SHoward Hinnantvoid 47573e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47583e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47603e519524SHoward Hinnant{ 47613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47633e519524SHoward Hinnant switch (__len) 47643e519524SHoward Hinnant { 47653e519524SHoward Hinnant case 0: 47663e519524SHoward Hinnant case 1: 47673e519524SHoward Hinnant return; 47683e519524SHoward Hinnant case 2: 47693e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47703e519524SHoward Hinnant swap(*__first, *__last); 47713e519524SHoward Hinnant return; 47723e519524SHoward Hinnant } 47733e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47743e519524SHoward Hinnant { 47753e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47763e519524SHoward Hinnant return; 47773e519524SHoward Hinnant } 47783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47793e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47803e519524SHoward Hinnant if (__len <= __buff_size) 47813e519524SHoward Hinnant { 47823e519524SHoward Hinnant __destruct_n __d(0); 47833e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47843e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47853e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47863e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47873e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47883e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47893e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47903e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47913e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47923e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47933e519524SHoward Hinnant// __first, __comp); 47943e519524SHoward Hinnant return; 47953e519524SHoward Hinnant } 47963e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47973e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47983e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47993e519524SHoward Hinnant} 48003e519524SHoward Hinnant 48013e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48033e519524SHoward Hinnantvoid 48043e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48053e519524SHoward Hinnant{ 48063e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48083e519524SHoward Hinnant difference_type __len = __last - __first; 48093e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48103e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48113e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48123e519524SHoward Hinnant { 4813ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48143e519524SHoward Hinnant __h.reset(__buf.first); 48153e519524SHoward Hinnant } 4816145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48193e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4820145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48223e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4823145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48243e519524SHoward Hinnant} 48253e519524SHoward Hinnant 48263e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48283e519524SHoward Hinnantvoid 48293e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 48303e519524SHoward Hinnant{ 4831ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48323e519524SHoward Hinnant} 48333e519524SHoward Hinnant 48343e519524SHoward Hinnant// is_heap_until 48353e519524SHoward Hinnant 48363e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48373e519524SHoward Hinnant_RandomAccessIterator 48383e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48393e519524SHoward Hinnant{ 4840ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48413e519524SHoward Hinnant difference_type __len = __last - __first; 48423e519524SHoward Hinnant difference_type __p = 0; 48433e519524SHoward Hinnant difference_type __c = 1; 48443e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48453e519524SHoward Hinnant while (__c < __len) 48463e519524SHoward Hinnant { 48473e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48483e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48493e519524SHoward Hinnant return __cp; 48503e519524SHoward Hinnant ++__c; 48513e519524SHoward Hinnant ++__cp; 48523e519524SHoward Hinnant if (__c == __len) 48533e519524SHoward Hinnant return __last; 48543e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48553e519524SHoward Hinnant return __cp; 48563e519524SHoward Hinnant ++__p; 48573e519524SHoward Hinnant ++__pp; 48583e519524SHoward Hinnant __c = 2 * __p + 1; 48593e519524SHoward Hinnant } 48603e519524SHoward Hinnant return __last; 48613e519524SHoward Hinnant} 48623e519524SHoward Hinnant 48633e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48653e519524SHoward Hinnant_RandomAccessIterator 48663e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48673e519524SHoward Hinnant{ 4868ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48693e519524SHoward Hinnant} 48703e519524SHoward Hinnant 48713e519524SHoward Hinnant// is_heap 48723e519524SHoward Hinnant 48733e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48753e519524SHoward Hinnantbool 48763e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48773e519524SHoward Hinnant{ 4878ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48793e519524SHoward Hinnant} 48803e519524SHoward Hinnant 48813e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48833e519524SHoward Hinnantbool 48843e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48853e519524SHoward Hinnant{ 4886ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48873e519524SHoward Hinnant} 48883e519524SHoward Hinnant 48893e519524SHoward Hinnant// push_heap 48903e519524SHoward Hinnant 48913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48923e519524SHoward Hinnantvoid 48938b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48943e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48953e519524SHoward Hinnant{ 48963e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48973e519524SHoward Hinnant if (__len > 1) 48983e519524SHoward Hinnant { 48993e519524SHoward Hinnant __len = (__len - 2) / 2; 49003e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49013e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49023e519524SHoward Hinnant { 4903ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49043e519524SHoward Hinnant do 49053e519524SHoward Hinnant { 4906ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49073e519524SHoward Hinnant __last = __ptr; 49083e519524SHoward Hinnant if (__len == 0) 49093e519524SHoward Hinnant break; 49103e519524SHoward Hinnant __len = (__len - 1) / 2; 49113e519524SHoward Hinnant __ptr = __first + __len; 49123e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4913ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49143e519524SHoward Hinnant } 49153e519524SHoward Hinnant } 49163e519524SHoward Hinnant} 49173e519524SHoward Hinnant 49183e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49203e519524SHoward Hinnantvoid 49213e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49223e519524SHoward Hinnant{ 4923145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49243e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49253e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49268b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4927145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49298b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4930145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49313e519524SHoward Hinnant} 49323e519524SHoward Hinnant 49333e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49353e519524SHoward Hinnantvoid 49363e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49373e519524SHoward Hinnant{ 4938ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49393e519524SHoward Hinnant} 49403e519524SHoward Hinnant 49413e519524SHoward Hinnant// pop_heap 49423e519524SHoward Hinnant 49433e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49448b512602SDavid Majnemervoid 4945fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4946fd838227SEric Fiselier _Compare __comp, 49478b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49488b512602SDavid Majnemer _RandomAccessIterator __start) 49498b512602SDavid Majnemer{ 49508b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49518b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49528b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49538b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49548b512602SDavid Majnemer difference_type __child = __start - __first; 49558b512602SDavid Majnemer 49568b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49578b512602SDavid Majnemer return; 49588b512602SDavid Majnemer 49598b512602SDavid Majnemer __child = 2 * __child + 1; 49608b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49618b512602SDavid Majnemer 49628b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49638b512602SDavid Majnemer // right-child exists and is greater than left-child 49648b512602SDavid Majnemer ++__child_i; 49658b512602SDavid Majnemer ++__child; 49668b512602SDavid Majnemer } 49678b512602SDavid Majnemer 49688b512602SDavid Majnemer // check if we are in heap-order 49698b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49708b512602SDavid Majnemer // we are, __start is larger than it's largest child 49718b512602SDavid Majnemer return; 49728b512602SDavid Majnemer 49738b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49748b512602SDavid Majnemer do 49758b512602SDavid Majnemer { 49768b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49778b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49788b512602SDavid Majnemer __start = __child_i; 49798b512602SDavid Majnemer 49808b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49818b512602SDavid Majnemer break; 49828b512602SDavid Majnemer 49838b512602SDavid Majnemer // recompute the child based off of the updated parent 49848b512602SDavid Majnemer __child = 2 * __child + 1; 49858b512602SDavid Majnemer __child_i = __first + __child; 49868b512602SDavid Majnemer 49878b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49888b512602SDavid Majnemer // right-child exists and is greater than left-child 49898b512602SDavid Majnemer ++__child_i; 49908b512602SDavid Majnemer ++__child; 49918b512602SDavid Majnemer } 49928b512602SDavid Majnemer 49938b512602SDavid Majnemer // check if we are in heap-order 49948b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49958b512602SDavid Majnemer *__start = _VSTD::move(__top); 49968b512602SDavid Majnemer} 49978b512602SDavid Majnemer 49988b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50003e519524SHoward Hinnantvoid 50013e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50023e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50033e519524SHoward Hinnant{ 50043e519524SHoward Hinnant if (__len > 1) 50053e519524SHoward Hinnant { 50063e519524SHoward Hinnant swap(*__first, *--__last); 50078b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50083e519524SHoward Hinnant } 50093e519524SHoward Hinnant} 50103e519524SHoward Hinnant 50113e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50133e519524SHoward Hinnantvoid 50143e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50153e519524SHoward Hinnant{ 5016145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50193e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5020145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50223e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5023145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50243e519524SHoward Hinnant} 50253e519524SHoward Hinnant 50263e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50283e519524SHoward Hinnantvoid 50293e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50303e519524SHoward Hinnant{ 5031ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50323e519524SHoward Hinnant} 50333e519524SHoward Hinnant 50343e519524SHoward Hinnant// make_heap 50353e519524SHoward Hinnant 50363e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50373e519524SHoward Hinnantvoid 50383e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50393e519524SHoward Hinnant{ 50403e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50413e519524SHoward Hinnant difference_type __n = __last - __first; 50423e519524SHoward Hinnant if (__n > 1) 50433e519524SHoward Hinnant { 50448b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50458b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50468b512602SDavid Majnemer { 50478b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 50488b512602SDavid Majnemer } 50493e519524SHoward Hinnant } 50503e519524SHoward Hinnant} 50513e519524SHoward Hinnant 50523e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50543e519524SHoward Hinnantvoid 50553e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50563e519524SHoward Hinnant{ 5057145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50583e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50593e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50603e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5061145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50633e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5064145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50653e519524SHoward Hinnant} 50663e519524SHoward Hinnant 50673e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50693e519524SHoward Hinnantvoid 50703e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50713e519524SHoward Hinnant{ 5072ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50733e519524SHoward Hinnant} 50743e519524SHoward Hinnant 50753e519524SHoward Hinnant// sort_heap 50763e519524SHoward Hinnant 50773e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50783e519524SHoward Hinnantvoid 50793e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50803e519524SHoward Hinnant{ 50813e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50823e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50833e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50843e519524SHoward Hinnant} 50853e519524SHoward Hinnant 50863e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50883e519524SHoward Hinnantvoid 50893e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50903e519524SHoward Hinnant{ 5091145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50923e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50933e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50943e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5095145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50963e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50973e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5098145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50993e519524SHoward Hinnant} 51003e519524SHoward Hinnant 51013e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51033e519524SHoward Hinnantvoid 51043e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51053e519524SHoward Hinnant{ 5106ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51073e519524SHoward Hinnant} 51083e519524SHoward Hinnant 51093e519524SHoward Hinnant// partial_sort 51103e519524SHoward Hinnant 51113e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51123e519524SHoward Hinnantvoid 51133e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51143e519524SHoward Hinnant _Compare __comp) 51153e519524SHoward Hinnant{ 51163e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51173e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51183e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51193e519524SHoward Hinnant { 51203e519524SHoward Hinnant if (__comp(*__i, *__first)) 51213e519524SHoward Hinnant { 51223e519524SHoward Hinnant swap(*__i, *__first); 51238b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51243e519524SHoward Hinnant } 51253e519524SHoward Hinnant } 51263e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51273e519524SHoward Hinnant} 51283e519524SHoward Hinnant 51293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51313e519524SHoward Hinnantvoid 51323e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51333e519524SHoward Hinnant _Compare __comp) 51343e519524SHoward Hinnant{ 5135145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51383e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5139145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51413e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5142145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51433e519524SHoward Hinnant} 51443e519524SHoward Hinnant 51453e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51473e519524SHoward Hinnantvoid 51483e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51493e519524SHoward Hinnant{ 5150ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 51513e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51523e519524SHoward Hinnant} 51533e519524SHoward Hinnant 51543e519524SHoward Hinnant// partial_sort_copy 51553e519524SHoward Hinnant 51563e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 51573e519524SHoward Hinnant_RandomAccessIterator 51583e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51593e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51603e519524SHoward Hinnant{ 51613e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51623e519524SHoward Hinnant if (__r != __result_last) 51633e519524SHoward Hinnant { 5164910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51653e519524SHoward Hinnant *__r = *__first; 51663e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51678b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51683e519524SHoward Hinnant for (; __first != __last; ++__first) 51693e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51703e519524SHoward Hinnant { 51713e519524SHoward Hinnant *__result_first = *__first; 51728b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51733e519524SHoward Hinnant } 51743e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51753e519524SHoward Hinnant } 51763e519524SHoward Hinnant return __r; 51773e519524SHoward Hinnant} 51783e519524SHoward Hinnant 51793e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51813e519524SHoward Hinnant_RandomAccessIterator 51823e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51833e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51843e519524SHoward Hinnant{ 5185145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51863e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51873e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51883e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5189145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51903e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51913e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5192145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51933e519524SHoward Hinnant} 51943e519524SHoward Hinnant 51953e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51973e519524SHoward Hinnant_RandomAccessIterator 51983e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51993e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52003e519524SHoward Hinnant{ 5201ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52023e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52033e519524SHoward Hinnant} 52043e519524SHoward Hinnant 52053e519524SHoward Hinnant// nth_element 52063e519524SHoward Hinnant 52073e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52083e519524SHoward Hinnantvoid 52093e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52103e519524SHoward Hinnant{ 52113e519524SHoward Hinnant // _Compare is known to be a reference type 52123e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52133e519524SHoward Hinnant const difference_type __limit = 7; 52143e519524SHoward Hinnant while (true) 52153e519524SHoward Hinnant { 52163e519524SHoward Hinnant __restart: 5217b34b4819SHoward Hinnant if (__nth == __last) 5218b34b4819SHoward Hinnant return; 52193e519524SHoward Hinnant difference_type __len = __last - __first; 52203e519524SHoward Hinnant switch (__len) 52213e519524SHoward Hinnant { 52223e519524SHoward Hinnant case 0: 52233e519524SHoward Hinnant case 1: 52243e519524SHoward Hinnant return; 52253e519524SHoward Hinnant case 2: 52263e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52273e519524SHoward Hinnant swap(*__first, *__last); 52283e519524SHoward Hinnant return; 52293e519524SHoward Hinnant case 3: 52303e519524SHoward Hinnant { 52313e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5232ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52333e519524SHoward Hinnant return; 52343e519524SHoward Hinnant } 52353e519524SHoward Hinnant } 52363e519524SHoward Hinnant if (__len <= __limit) 52373e519524SHoward Hinnant { 52383e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 52393e519524SHoward Hinnant return; 52403e519524SHoward Hinnant } 52413e519524SHoward Hinnant // __len > __limit >= 3 52423e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 52433e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5244ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52453e519524SHoward Hinnant // *__m is median 52463e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 52473e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 52483e519524SHoward Hinnant _RandomAccessIterator __i = __first; 52493e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 52503e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52513e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 52523e519524SHoward Hinnant // Prime the downward search with a guard. 52533e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 52543e519524SHoward Hinnant { 52553e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 52563e519524SHoward Hinnant // manually guard downward moving __j against __i 52573e519524SHoward Hinnant while (true) 52583e519524SHoward Hinnant { 52593e519524SHoward Hinnant if (__i == --__j) 52603e519524SHoward Hinnant { 52613e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52623e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52633e519524SHoward Hinnant ++__i; // __first + 1 52643e519524SHoward Hinnant __j = __last; 52653e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52663e519524SHoward Hinnant { 52673e519524SHoward Hinnant while (true) 52683e519524SHoward Hinnant { 52693e519524SHoward Hinnant if (__i == __j) 52703e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52713e519524SHoward Hinnant if (__comp(*__first, *__i)) 52723e519524SHoward Hinnant { 52733e519524SHoward Hinnant swap(*__i, *__j); 52743e519524SHoward Hinnant ++__n_swaps; 52753e519524SHoward Hinnant ++__i; 52763e519524SHoward Hinnant break; 52773e519524SHoward Hinnant } 52783e519524SHoward Hinnant ++__i; 52793e519524SHoward Hinnant } 52803e519524SHoward Hinnant } 52813e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52823e519524SHoward Hinnant if (__i == __j) 52833e519524SHoward Hinnant return; 52843e519524SHoward Hinnant while (true) 52853e519524SHoward Hinnant { 52863e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52873e519524SHoward Hinnant ++__i; 52883e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52893e519524SHoward Hinnant ; 52903e519524SHoward Hinnant if (__i >= __j) 52913e519524SHoward Hinnant break; 52923e519524SHoward Hinnant swap(*__i, *__j); 52933e519524SHoward Hinnant ++__n_swaps; 52943e519524SHoward Hinnant ++__i; 52953e519524SHoward Hinnant } 52963e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52973e519524SHoward Hinnant // The first part is sorted, 52983e519524SHoward Hinnant if (__nth < __i) 52993e519524SHoward Hinnant return; 53003e519524SHoward Hinnant // __nth_element the secod part 53013e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53023e519524SHoward Hinnant __first = __i; 53033e519524SHoward Hinnant goto __restart; 53043e519524SHoward Hinnant } 53053e519524SHoward Hinnant if (__comp(*__j, *__m)) 53063e519524SHoward Hinnant { 53073e519524SHoward Hinnant swap(*__i, *__j); 53083e519524SHoward Hinnant ++__n_swaps; 53093e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53103e519524SHoward Hinnant } 53113e519524SHoward Hinnant } 53123e519524SHoward Hinnant } 53133e519524SHoward Hinnant ++__i; 53143e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53153e519524SHoward Hinnant // if not yet partitioned... 53163e519524SHoward Hinnant if (__i < __j) 53173e519524SHoward Hinnant { 53183e519524SHoward Hinnant // known that *(__i - 1) < *__m 53193e519524SHoward Hinnant while (true) 53203e519524SHoward Hinnant { 53213e519524SHoward Hinnant // __m still guards upward moving __i 53223e519524SHoward Hinnant while (__comp(*__i, *__m)) 53233e519524SHoward Hinnant ++__i; 53243e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53253e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53263e519524SHoward Hinnant ; 53273e519524SHoward Hinnant if (__i >= __j) 53283e519524SHoward Hinnant break; 53293e519524SHoward Hinnant swap(*__i, *__j); 53303e519524SHoward Hinnant ++__n_swaps; 53313e519524SHoward Hinnant // It is known that __m != __j 53323e519524SHoward Hinnant // If __m just moved, follow it 53333e519524SHoward Hinnant if (__m == __i) 53343e519524SHoward Hinnant __m = __j; 53353e519524SHoward Hinnant ++__i; 53363e519524SHoward Hinnant } 53373e519524SHoward Hinnant } 53383e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53393e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53403e519524SHoward Hinnant { 53413e519524SHoward Hinnant swap(*__i, *__m); 53423e519524SHoward Hinnant ++__n_swaps; 53433e519524SHoward Hinnant } 53443e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53453e519524SHoward Hinnant if (__nth == __i) 53463e519524SHoward Hinnant return; 53473e519524SHoward Hinnant if (__n_swaps == 0) 53483e519524SHoward Hinnant { 53493e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53503e519524SHoward Hinnant if (__nth < __i) 53513e519524SHoward Hinnant { 53523e519524SHoward Hinnant // Check for [__first, __i) already sorted 53533e519524SHoward Hinnant __j = __m = __first; 53543e519524SHoward Hinnant while (++__j != __i) 53553e519524SHoward Hinnant { 53563e519524SHoward Hinnant if (__comp(*__j, *__m)) 53573e519524SHoward Hinnant // not yet sorted, so sort 53583e519524SHoward Hinnant goto not_sorted; 53593e519524SHoward Hinnant __m = __j; 53603e519524SHoward Hinnant } 53613e519524SHoward Hinnant // [__first, __i) sorted 53623e519524SHoward Hinnant return; 53633e519524SHoward Hinnant } 53643e519524SHoward Hinnant else 53653e519524SHoward Hinnant { 53663e519524SHoward Hinnant // Check for [__i, __last) already sorted 53673e519524SHoward Hinnant __j = __m = __i; 53683e519524SHoward Hinnant while (++__j != __last) 53693e519524SHoward Hinnant { 53703e519524SHoward Hinnant if (__comp(*__j, *__m)) 53713e519524SHoward Hinnant // not yet sorted, so sort 53723e519524SHoward Hinnant goto not_sorted; 53733e519524SHoward Hinnant __m = __j; 53743e519524SHoward Hinnant } 53753e519524SHoward Hinnant // [__i, __last) sorted 53763e519524SHoward Hinnant return; 53773e519524SHoward Hinnant } 53783e519524SHoward Hinnant } 53793e519524SHoward Hinnantnot_sorted: 53803e519524SHoward Hinnant // __nth_element on range containing __nth 53813e519524SHoward Hinnant if (__nth < __i) 53823e519524SHoward Hinnant { 53833e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53843e519524SHoward Hinnant __last = __i; 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant else 53873e519524SHoward Hinnant { 53883e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53893e519524SHoward Hinnant __first = ++__i; 53903e519524SHoward Hinnant } 53913e519524SHoward Hinnant } 53923e519524SHoward Hinnant} 53933e519524SHoward Hinnant 53943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53963e519524SHoward Hinnantvoid 53973e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53983e519524SHoward Hinnant{ 5399145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54023e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5403145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54053e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5406145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54073e519524SHoward Hinnant} 54083e519524SHoward Hinnant 54093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54113e519524SHoward Hinnantvoid 54123e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54133e519524SHoward Hinnant{ 5414ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54153e519524SHoward Hinnant} 54163e519524SHoward Hinnant 54173e519524SHoward Hinnant// includes 54183e519524SHoward Hinnant 54193e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54203e519524SHoward Hinnantbool 54213e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54223e519524SHoward Hinnant _Compare __comp) 54233e519524SHoward Hinnant{ 54243e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54253e519524SHoward Hinnant { 54263e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54273e519524SHoward Hinnant return false; 54283e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54293e519524SHoward Hinnant ++__first2; 54303e519524SHoward Hinnant } 54313e519524SHoward Hinnant return true; 54323e519524SHoward Hinnant} 54333e519524SHoward Hinnant 54343e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 54353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54363e519524SHoward Hinnantbool 54373e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54383e519524SHoward Hinnant _Compare __comp) 54393e519524SHoward Hinnant{ 5440145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54413e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54423e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54433e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5444145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54463e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5447145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54483e519524SHoward Hinnant} 54493e519524SHoward Hinnant 54503e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 54513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54523e519524SHoward Hinnantbool 54533e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 54543e519524SHoward Hinnant{ 5455ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 54563e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54573e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54583e519524SHoward Hinnant} 54593e519524SHoward Hinnant 54603e519524SHoward Hinnant// set_union 54613e519524SHoward Hinnant 54623e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54633e519524SHoward Hinnant_OutputIterator 54643e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54663e519524SHoward Hinnant{ 54673e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54683e519524SHoward Hinnant { 54693e519524SHoward Hinnant if (__first2 == __last2) 5470ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54713e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54723e519524SHoward Hinnant { 54733e519524SHoward Hinnant *__result = *__first2; 54743e519524SHoward Hinnant ++__first2; 54753e519524SHoward Hinnant } 54763e519524SHoward Hinnant else 54773e519524SHoward Hinnant { 54783e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54793e519524SHoward Hinnant ++__first2; 548005da5b02SMarshall Clow *__result = *__first1; 54813e519524SHoward Hinnant ++__first1; 54823e519524SHoward Hinnant } 54833e519524SHoward Hinnant } 5484ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54853e519524SHoward Hinnant} 54863e519524SHoward Hinnant 54873e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54893e519524SHoward Hinnant_OutputIterator 54903e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54923e519524SHoward Hinnant{ 5493145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54963e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5497145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54993e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5500145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55013e519524SHoward Hinnant} 55023e519524SHoward Hinnant 55033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55053e519524SHoward Hinnant_OutputIterator 55063e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55083e519524SHoward Hinnant{ 5509ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55103e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55113e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55123e519524SHoward Hinnant} 55133e519524SHoward Hinnant 55143e519524SHoward Hinnant// set_intersection 55153e519524SHoward Hinnant 55163e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55173e519524SHoward Hinnant_OutputIterator 55183e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55203e519524SHoward Hinnant{ 55213e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55223e519524SHoward Hinnant { 55233e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55243e519524SHoward Hinnant ++__first1; 55253e519524SHoward Hinnant else 55263e519524SHoward Hinnant { 55273e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55283e519524SHoward Hinnant { 55293e519524SHoward Hinnant *__result = *__first1; 55303e519524SHoward Hinnant ++__result; 55313e519524SHoward Hinnant ++__first1; 55323e519524SHoward Hinnant } 55333e519524SHoward Hinnant ++__first2; 55343e519524SHoward Hinnant } 55353e519524SHoward Hinnant } 55363e519524SHoward Hinnant return __result; 55373e519524SHoward Hinnant} 55383e519524SHoward Hinnant 55393e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55413e519524SHoward Hinnant_OutputIterator 55423e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55433e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55443e519524SHoward Hinnant{ 5545145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55463e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55473e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55483e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5549145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55503e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55513e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5552145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55533e519524SHoward Hinnant} 55543e519524SHoward Hinnant 55553e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55573e519524SHoward Hinnant_OutputIterator 55583e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55593e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55603e519524SHoward Hinnant{ 5561ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55623e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55633e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55643e519524SHoward Hinnant} 55653e519524SHoward Hinnant 55663e519524SHoward Hinnant// set_difference 55673e519524SHoward Hinnant 55683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55693e519524SHoward Hinnant_OutputIterator 55703e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55723e519524SHoward Hinnant{ 55733e519524SHoward Hinnant while (__first1 != __last1) 55743e519524SHoward Hinnant { 55753e519524SHoward Hinnant if (__first2 == __last2) 5576ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55773e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55783e519524SHoward Hinnant { 55793e519524SHoward Hinnant *__result = *__first1; 55803e519524SHoward Hinnant ++__result; 55813e519524SHoward Hinnant ++__first1; 55823e519524SHoward Hinnant } 55833e519524SHoward Hinnant else 55843e519524SHoward Hinnant { 55853e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55863e519524SHoward Hinnant ++__first1; 55873e519524SHoward Hinnant ++__first2; 55883e519524SHoward Hinnant } 55893e519524SHoward Hinnant } 55903e519524SHoward Hinnant return __result; 55913e519524SHoward Hinnant} 55923e519524SHoward Hinnant 55933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55953e519524SHoward Hinnant_OutputIterator 55963e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55973e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55983e519524SHoward Hinnant{ 5599145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56023e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5603145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56053e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5606145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56073e519524SHoward Hinnant} 56083e519524SHoward Hinnant 56093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56113e519524SHoward Hinnant_OutputIterator 56123e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56143e519524SHoward Hinnant{ 5615ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56163e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56173e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56183e519524SHoward Hinnant} 56193e519524SHoward Hinnant 56203e519524SHoward Hinnant// set_symmetric_difference 56213e519524SHoward Hinnant 56223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56233e519524SHoward Hinnant_OutputIterator 56243e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56263e519524SHoward Hinnant{ 56273e519524SHoward Hinnant while (__first1 != __last1) 56283e519524SHoward Hinnant { 56293e519524SHoward Hinnant if (__first2 == __last2) 5630ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56313e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56323e519524SHoward Hinnant { 56333e519524SHoward Hinnant *__result = *__first1; 56343e519524SHoward Hinnant ++__result; 56353e519524SHoward Hinnant ++__first1; 56363e519524SHoward Hinnant } 56373e519524SHoward Hinnant else 56383e519524SHoward Hinnant { 56393e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56403e519524SHoward Hinnant { 56413e519524SHoward Hinnant *__result = *__first2; 56423e519524SHoward Hinnant ++__result; 56433e519524SHoward Hinnant } 56443e519524SHoward Hinnant else 56453e519524SHoward Hinnant ++__first1; 56463e519524SHoward Hinnant ++__first2; 56473e519524SHoward Hinnant } 56483e519524SHoward Hinnant } 5649ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56503e519524SHoward Hinnant} 56513e519524SHoward Hinnant 56523e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56543e519524SHoward Hinnant_OutputIterator 56553e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56563e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56573e519524SHoward Hinnant{ 5658145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56613e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5662145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56643e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5665145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56663e519524SHoward Hinnant} 56673e519524SHoward Hinnant 56683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56703e519524SHoward Hinnant_OutputIterator 56713e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56733e519524SHoward Hinnant{ 5674ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56753e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56763e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56773e519524SHoward Hinnant} 56783e519524SHoward Hinnant 56793e519524SHoward Hinnant// lexicographical_compare 56803e519524SHoward Hinnant 56813e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56823e519524SHoward Hinnantbool 56833e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56853e519524SHoward Hinnant{ 5686910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56873e519524SHoward Hinnant { 56883e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56893e519524SHoward Hinnant return true; 56903e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56913e519524SHoward Hinnant return false; 56923e519524SHoward Hinnant } 56933e519524SHoward Hinnant return false; 56943e519524SHoward Hinnant} 56953e519524SHoward Hinnant 56963e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56983e519524SHoward Hinnantbool 56993e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57003e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57013e519524SHoward Hinnant{ 5702145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57033e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57043e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57053e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5706145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57073e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57083e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5709145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57103e519524SHoward Hinnant} 57113e519524SHoward Hinnant 57123e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57143e519524SHoward Hinnantbool 57153e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57163e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57173e519524SHoward Hinnant{ 5718ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57193e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57203e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57213e519524SHoward Hinnant} 57223e519524SHoward Hinnant 57233e519524SHoward Hinnant// next_permutation 57243e519524SHoward Hinnant 57253e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57263e519524SHoward Hinnantbool 57273e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57283e519524SHoward Hinnant{ 57293e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57303e519524SHoward Hinnant if (__first == __last || __first == --__i) 57313e519524SHoward Hinnant return false; 57323e519524SHoward Hinnant while (true) 57333e519524SHoward Hinnant { 57343e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57353e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57363e519524SHoward Hinnant { 57373e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57383e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57393e519524SHoward Hinnant ; 57403e519524SHoward Hinnant swap(*__i, *__j); 5741ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57423e519524SHoward Hinnant return true; 57433e519524SHoward Hinnant } 57443e519524SHoward Hinnant if (__i == __first) 57453e519524SHoward Hinnant { 5746ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57473e519524SHoward Hinnant return false; 57483e519524SHoward Hinnant } 57493e519524SHoward Hinnant } 57503e519524SHoward Hinnant} 57513e519524SHoward Hinnant 57523e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57543e519524SHoward Hinnantbool 57553e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57563e519524SHoward Hinnant{ 5757145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57583e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57593e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57603e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5761145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57633e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5764145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57653e519524SHoward Hinnant} 57663e519524SHoward Hinnant 57673e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57693e519524SHoward Hinnantbool 57703e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57713e519524SHoward Hinnant{ 5772ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57733e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57743e519524SHoward Hinnant} 57753e519524SHoward Hinnant 57763e519524SHoward Hinnant// prev_permutation 57773e519524SHoward Hinnant 57783e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57793e519524SHoward Hinnantbool 57803e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57813e519524SHoward Hinnant{ 57823e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57833e519524SHoward Hinnant if (__first == __last || __first == --__i) 57843e519524SHoward Hinnant return false; 57853e519524SHoward Hinnant while (true) 57863e519524SHoward Hinnant { 57873e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57883e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57893e519524SHoward Hinnant { 57903e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57913e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57923e519524SHoward Hinnant ; 57933e519524SHoward Hinnant swap(*__i, *__j); 5794ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57953e519524SHoward Hinnant return true; 57963e519524SHoward Hinnant } 57973e519524SHoward Hinnant if (__i == __first) 57983e519524SHoward Hinnant { 5799ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58003e519524SHoward Hinnant return false; 58013e519524SHoward Hinnant } 58023e519524SHoward Hinnant } 58033e519524SHoward Hinnant} 58043e519524SHoward Hinnant 58053e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58073e519524SHoward Hinnantbool 58083e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58093e519524SHoward Hinnant{ 5810145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58133e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5814145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58163e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5817145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58183e519524SHoward Hinnant} 58193e519524SHoward Hinnant 58203e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58223e519524SHoward Hinnantbool 58233e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58243e519524SHoward Hinnant{ 5825ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58263e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58273e519524SHoward Hinnant} 58283e519524SHoward Hinnant 58293e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58303e519524SHoward Hinnant 5831a016efb1SEric Fiselier_LIBCPP_POP_MACROS 5832a016efb1SEric Fiselier 58333e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5834