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 383e519524SHoward Hinnanttemplate <class InputIterator, class T> 393e519524SHoward Hinnant InputIterator 403e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 413e519524SHoward Hinnant 423e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 433e519524SHoward Hinnant InputIterator 443e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 473e519524SHoward Hinnant InputIterator 483e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 513e519524SHoward Hinnant ForwardIterator1 523e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 543e519524SHoward Hinnant 553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 563e519524SHoward Hinnant ForwardIterator1 573e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 593e519524SHoward Hinnant 603e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 613e519524SHoward Hinnant ForwardIterator1 623e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 633e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 643e519524SHoward Hinnant 653e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 663e519524SHoward Hinnant ForwardIterator1 673e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 683e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 693e519524SHoward Hinnant 703e519524SHoward Hinnanttemplate <class ForwardIterator> 713e519524SHoward Hinnant ForwardIterator 723e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 753e519524SHoward Hinnant ForwardIterator 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class InputIterator, class T> 793e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 803e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 833e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 843e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 873e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 883e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 893e519524SHoward Hinnant 900b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 910b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 920b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 930b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 940b0bbd2fSMarshall Clow 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 963e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 973e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 983e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 993e519524SHoward Hinnant 1000b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1010b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1020b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1030b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1040b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1050b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 1100b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1110b0bbd2fSMarshall Clow bool 1120b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1130b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1140b0bbd2fSMarshall Clow 1153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1163e519524SHoward Hinnant bool 1173e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1183e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1193e519524SHoward Hinnant 1200b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1210b0bbd2fSMarshall Clow bool 1220b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1230b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1240b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1250b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 1310b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1320b0bbd2fSMarshall Clow bool 1330b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1340b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1350b0bbd2fSMarshall Clow 1363e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1373e519524SHoward Hinnant bool 1383e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1393e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1403e519524SHoward Hinnant 1410b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1420b0bbd2fSMarshall Clow bool 1430b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1440b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1450b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1460b0bbd2fSMarshall Clow 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1483e519524SHoward Hinnant ForwardIterator1 1493e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1533e519524SHoward Hinnant ForwardIterator1 1543e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1553e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1583e519524SHoward Hinnant ForwardIterator 1593e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1623e519524SHoward Hinnant ForwardIterator 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1643e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1653e519524SHoward Hinnant 1663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1673e519524SHoward Hinnant OutputIterator 1683e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1733e519524SHoward Hinnant OutputIterator result, Predicate pred); 1743e519524SHoward Hinnant 1753e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1763e519524SHoward Hinnant OutputIterator 1773e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1803e519524SHoward Hinnant BidirectionalIterator2 1813e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1823e519524SHoward Hinnant BidirectionalIterator2 result); 1833e519524SHoward Hinnant 1843e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1853e519524SHoward Hinnant ForwardIterator2 1863e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant void 1903e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1933e519524SHoward Hinnant OutputIterator 1943e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1973e519524SHoward Hinnant OutputIterator 1983e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1993e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant void 2033e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2063e519524SHoward Hinnant void 2073e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2123e519524SHoward Hinnant const T& old_value, const T& new_value); 2133e519524SHoward Hinnant 2143e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2153e519524SHoward Hinnant OutputIterator 2163e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2193e519524SHoward Hinnant void 2203e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2233e519524SHoward Hinnant OutputIterator 2243e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2273e519524SHoward Hinnant void 2283e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2313e519524SHoward Hinnant OutputIterator 2323e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2353e519524SHoward Hinnant ForwardIterator 2363e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2393e519524SHoward Hinnant ForwardIterator 2403e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2433e519524SHoward Hinnant OutputIterator 2443e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2473e519524SHoward Hinnant OutputIterator 2483e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class ForwardIterator> 2513e519524SHoward Hinnant ForwardIterator 2523e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2593e519524SHoward Hinnant OutputIterator 2603e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2673e519524SHoward Hinnant void 2683e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2713e519524SHoward Hinnant OutputIterator 2723e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class ForwardIterator> 2753e519524SHoward Hinnant ForwardIterator 2763e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2793e519524SHoward Hinnant OutputIterator 2803e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2833e519524SHoward Hinnant void 28406965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 28806965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 28906965c1fSMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14 2903e519524SHoward Hinnant 291*e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 292*e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 293*e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 294*e7154709SEric Fiselier SampleIterator out, Distance n, 295*e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 296*e7154709SEric Fiselier 297f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 298f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 299fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 300f9d540b0SHoward Hinnant 3013e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 3023e519524SHoward Hinnant bool 3033e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 3043e519524SHoward Hinnant 3053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3063e519524SHoward Hinnant ForwardIterator 3073e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3083e519524SHoward Hinnant 3093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3103e519524SHoward Hinnant class OutputIterator2, class Predicate> 3113e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3123e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3133e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3143e519524SHoward Hinnant Predicate pred); 3153e519524SHoward Hinnant 3163e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3173e519524SHoward Hinnant ForwardIterator 3183e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3193e519524SHoward Hinnant 3203e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3213e519524SHoward Hinnant ForwardIterator 3223e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3233e519524SHoward Hinnant 3243e519524SHoward Hinnanttemplate <class ForwardIterator> 3253e519524SHoward Hinnant bool 3263e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3273e519524SHoward Hinnant 3283e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3293e519524SHoward Hinnant bool 3303e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3313e519524SHoward Hinnant 3323e519524SHoward Hinnanttemplate<class ForwardIterator> 3333e519524SHoward Hinnant ForwardIterator 3343e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3353e519524SHoward Hinnant 3363e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3373e519524SHoward Hinnant ForwardIterator 3383e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3393e519524SHoward Hinnant 3403e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3413e519524SHoward Hinnant void 3423e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3433e519524SHoward Hinnant 3443e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3453e519524SHoward Hinnant void 3463e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3473e519524SHoward Hinnant 3483e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3493e519524SHoward Hinnant void 3503e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3513e519524SHoward Hinnant 3523e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3533e519524SHoward Hinnant void 3543e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3553e519524SHoward Hinnant 3563e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3573e519524SHoward Hinnant void 3583e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3593e519524SHoward Hinnant 3603e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3613e519524SHoward Hinnant void 3623e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3633e519524SHoward Hinnant 3643e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3653e519524SHoward Hinnant RandomAccessIterator 3663e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3673e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3683e519524SHoward Hinnant 3693e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3703e519524SHoward Hinnant RandomAccessIterator 3713e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3723e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3733e519524SHoward Hinnant 3743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3753e519524SHoward Hinnant void 3763e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3773e519524SHoward Hinnant 3783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3793e519524SHoward Hinnant void 3803e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3813e519524SHoward Hinnant 3823e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3833e519524SHoward Hinnant ForwardIterator 3843e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3853e519524SHoward Hinnant 3863e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3873e519524SHoward Hinnant ForwardIterator 3883e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3893e519524SHoward Hinnant 3903e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3913e519524SHoward Hinnant ForwardIterator 3923e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3933e519524SHoward Hinnant 3943e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3953e519524SHoward Hinnant ForwardIterator 3963e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3973e519524SHoward Hinnant 3983e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3993e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 4003e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 4013e519524SHoward Hinnant 4023e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4033e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 4043e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4053e519524SHoward Hinnant 4063e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4073e519524SHoward Hinnant bool 4083e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4093e519524SHoward Hinnant 4103e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4113e519524SHoward Hinnant bool 4123e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4133e519524SHoward Hinnant 4143e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4153e519524SHoward Hinnant OutputIterator 4163e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4173e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4183e519524SHoward Hinnant 4193e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4203e519524SHoward Hinnant OutputIterator 4213e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4223e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4233e519524SHoward Hinnant 4243e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4253e519524SHoward Hinnant void 4263e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4273e519524SHoward Hinnant 4283e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4293e519524SHoward Hinnant void 4303e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4313e519524SHoward Hinnant 4323e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4333e519524SHoward Hinnant bool 4343e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4353e519524SHoward Hinnant 4363e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4373e519524SHoward Hinnant bool 4383e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4393e519524SHoward Hinnant 4403e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4413e519524SHoward Hinnant OutputIterator 4423e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4433e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4443e519524SHoward Hinnant 4453e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4463e519524SHoward Hinnant OutputIterator 4473e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4483e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4493e519524SHoward Hinnant 4503e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4513e519524SHoward Hinnant OutputIterator 4523e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4533e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4543e519524SHoward Hinnant 4553e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4563e519524SHoward Hinnant OutputIterator 4573e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4583e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4593e519524SHoward Hinnant 4603e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4613e519524SHoward Hinnant OutputIterator 4623e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4633e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4643e519524SHoward Hinnant 4653e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4663e519524SHoward Hinnant OutputIterator 4673e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4683e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4693e519524SHoward Hinnant 4703e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4713e519524SHoward Hinnant OutputIterator 4723e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4733e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4743e519524SHoward Hinnant 4753e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4763e519524SHoward Hinnant OutputIterator 4773e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4783e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4793e519524SHoward Hinnant 4803e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4813e519524SHoward Hinnant void 4823e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4833e519524SHoward Hinnant 4843e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4853e519524SHoward Hinnant void 4863e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4873e519524SHoward Hinnant 4883e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4893e519524SHoward Hinnant void 4903e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4913e519524SHoward Hinnant 4923e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4933e519524SHoward Hinnant void 4943e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4953e519524SHoward Hinnant 4963e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4973e519524SHoward Hinnant void 4983e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4993e519524SHoward Hinnant 5003e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5013e519524SHoward Hinnant void 5023e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5033e519524SHoward Hinnant 5043e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5053e519524SHoward Hinnant void 5063e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5073e519524SHoward Hinnant 5083e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5093e519524SHoward Hinnant void 5103e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5113e519524SHoward Hinnant 5123e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5133e519524SHoward Hinnant bool 5143e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5153e519524SHoward Hinnant 5163e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5173e519524SHoward Hinnant bool 5183e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5193e519524SHoward Hinnant 5203e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5213e519524SHoward Hinnant RandomAccessIterator 5223e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5233e519524SHoward Hinnant 5243e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5253e519524SHoward Hinnant RandomAccessIterator 5263e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5273e519524SHoward Hinnant 5284eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5294eb27b79SHoward Hinnant ForwardIterator 5300b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5314eb27b79SHoward Hinnant 5324eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5334eb27b79SHoward Hinnant ForwardIterator 5340b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5354eb27b79SHoward Hinnant 5363e519524SHoward Hinnanttemplate <class T> 5373e519524SHoward Hinnant const T& 5389d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5393e519524SHoward Hinnant 5403e519524SHoward Hinnanttemplate <class T, class Compare> 5413e519524SHoward Hinnant const T& 5429d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5433e519524SHoward Hinnant 5443e519524SHoward Hinnanttemplate<class T> 5454eb27b79SHoward Hinnant T 5469d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5473e519524SHoward Hinnant 5483e519524SHoward Hinnanttemplate<class T, class Compare> 5494eb27b79SHoward Hinnant T 5509d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5513e519524SHoward Hinnant 552146c14acSMarshall Clowtemplate<class T> 553146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 554146c14acSMarshall Clow 555146c14acSMarshall Clowtemplate<class T, class Compare> 556146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 557146c14acSMarshall Clow 5583e519524SHoward Hinnanttemplate <class ForwardIterator> 5593e519524SHoward Hinnant ForwardIterator 5600b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5613e519524SHoward Hinnant 5623e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5633e519524SHoward Hinnant ForwardIterator 5640b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5653e519524SHoward Hinnant 5664eb27b79SHoward Hinnanttemplate <class T> 5674eb27b79SHoward Hinnant const T& 5689d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5694eb27b79SHoward Hinnant 5704eb27b79SHoward Hinnanttemplate <class T, class Compare> 5714eb27b79SHoward Hinnant const T& 5729d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5734eb27b79SHoward Hinnant 5744eb27b79SHoward Hinnanttemplate<class T> 5754eb27b79SHoward Hinnant T 5769d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5774eb27b79SHoward Hinnant 5784eb27b79SHoward Hinnanttemplate<class T, class Compare> 5794eb27b79SHoward Hinnant T 5809d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5814eb27b79SHoward Hinnant 5824eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5834eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5840b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5854eb27b79SHoward Hinnant 5864eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5874eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5880b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5894eb27b79SHoward Hinnant 5904eb27b79SHoward Hinnanttemplate<class T> 5914eb27b79SHoward Hinnant pair<const T&, const T&> 5929d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5934eb27b79SHoward Hinnant 5944eb27b79SHoward Hinnanttemplate<class T, class Compare> 5954eb27b79SHoward Hinnant pair<const T&, const T&> 5969d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5974eb27b79SHoward Hinnant 5984eb27b79SHoward Hinnanttemplate<class T> 5994eb27b79SHoward Hinnant pair<T, T> 6009d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 6014eb27b79SHoward Hinnant 6024eb27b79SHoward Hinnanttemplate<class T, class Compare> 6034eb27b79SHoward Hinnant pair<T, T> 6049d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 6054eb27b79SHoward Hinnant 6063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6073e519524SHoward Hinnant bool 6083e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6093e519524SHoward Hinnant 6103e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6113e519524SHoward Hinnant bool 6123e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6133e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6143e519524SHoward Hinnant 6153e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6163e519524SHoward Hinnant bool 6173e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6183e519524SHoward Hinnant 6193e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6203e519524SHoward Hinnant bool 6213e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6223e519524SHoward Hinnant 6233e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6243e519524SHoward Hinnant bool 6253e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6263e519524SHoward Hinnant 6273e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6283e519524SHoward Hinnant bool 6293e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6303e519524SHoward Hinnant 6313e519524SHoward Hinnant} // std 6323e519524SHoward Hinnant 6333e519524SHoward Hinnant*/ 6343e519524SHoward Hinnant 6353e519524SHoward Hinnant#include <__config> 6363e519524SHoward Hinnant#include <initializer_list> 6373e519524SHoward Hinnant#include <type_traits> 6383e519524SHoward Hinnant#include <cstring> 639f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6403e519524SHoward Hinnant#include <memory> 6413e519524SHoward Hinnant#include <iterator> 642a1d07d57SHoward Hinnant#include <cstddef> 6433e519524SHoward Hinnant 6445d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6455d1a701dSHoward Hinnant#include "support/ibm/support.h" 6465d1a701dSHoward Hinnant#endif 6475f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6485f878d4bSHoward Hinnant#include "support/win32/support.h" 6495f878d4bSHoward Hinnant#endif 6505d1a701dSHoward Hinnant 651ab4f4382SHoward Hinnant#include <__undef_min_max> 652ab4f4382SHoward Hinnant 653c1bd9197SEric Fiselier#include <__debug> 654c1bd9197SEric Fiselier 655073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6563e519524SHoward Hinnant#pragma GCC system_header 657073458b1SHoward Hinnant#endif 6583e519524SHoward Hinnant 6593e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6603e519524SHoward Hinnant 6619d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6629d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6639d67c6d5SMarshall Clow// * We haven't included <functional> here. 6643e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6653e519524SHoward Hinnantstruct __equal_to 6663e519524SHoward Hinnant{ 6673e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6683e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6693e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6703e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6713e519524SHoward Hinnant}; 6723e519524SHoward Hinnant 6733e519524SHoward Hinnanttemplate <class _T1> 6743e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6753e519524SHoward Hinnant{ 6769d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6779d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6783e519524SHoward Hinnant}; 6793e519524SHoward Hinnant 6803e519524SHoward Hinnanttemplate <class _T1> 6813e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6823e519524SHoward Hinnant{ 6839d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6849d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6853e519524SHoward Hinnant}; 6863e519524SHoward Hinnant 6873e519524SHoward Hinnanttemplate <class _T1> 6883e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6893e519524SHoward Hinnant{ 6909d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6919d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6923e519524SHoward Hinnant}; 6933e519524SHoward Hinnant 6943e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6953e519524SHoward Hinnantstruct __less 6963e519524SHoward Hinnant{ 6979d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6989d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6999d67c6d5SMarshall Clow 7009d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7019d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 7029d67c6d5SMarshall Clow 7039d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7049d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 7059d67c6d5SMarshall Clow 7069d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7079d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7083e519524SHoward Hinnant}; 7093e519524SHoward Hinnant 7103e519524SHoward Hinnanttemplate <class _T1> 7113e519524SHoward Hinnantstruct __less<_T1, _T1> 7123e519524SHoward Hinnant{ 7139d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7149d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7153e519524SHoward Hinnant}; 7163e519524SHoward Hinnant 7173e519524SHoward Hinnanttemplate <class _T1> 7183e519524SHoward Hinnantstruct __less<const _T1, _T1> 7193e519524SHoward Hinnant{ 7209d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7219d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7223e519524SHoward Hinnant}; 7233e519524SHoward Hinnant 7243e519524SHoward Hinnanttemplate <class _T1> 7253e519524SHoward Hinnantstruct __less<_T1, const _T1> 7263e519524SHoward Hinnant{ 7279d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7289d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7293e519524SHoward Hinnant}; 7303e519524SHoward Hinnant 7313e519524SHoward Hinnanttemplate <class _Predicate> 7323e519524SHoward Hinnantclass __negate 7333e519524SHoward Hinnant{ 7343e519524SHoward Hinnantprivate: 7353e519524SHoward Hinnant _Predicate __p_; 7363e519524SHoward Hinnantpublic: 7373e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7383e519524SHoward Hinnant 7393e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7403e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7413e519524SHoward Hinnant 7423e519524SHoward Hinnant template <class _T1> 7433e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7443e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7453e519524SHoward Hinnant 7463e519524SHoward Hinnant template <class _T1, class _T2> 7473e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7483e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7493e519524SHoward Hinnant}; 7503e519524SHoward Hinnant 751145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7523e519524SHoward Hinnant 7533e519524SHoward Hinnanttemplate <class _Compare> 7543e519524SHoward Hinnantstruct __debug_less 7553e519524SHoward Hinnant{ 7563e519524SHoward Hinnant _Compare __comp_; 7573e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 758331d2159SEric Fiselier 7593e519524SHoward Hinnant template <class _Tp, class _Up> 7603e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7613e519524SHoward Hinnant { 7623e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7633e519524SHoward Hinnant if (__r) 764331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7653e519524SHoward Hinnant return __r; 7663e519524SHoward Hinnant } 767331d2159SEric Fiselier 768331d2159SEric Fiselier template <class _LHS, class _RHS> 769331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 770331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 771331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 772331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 773331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 774331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 775331d2159SEric Fiselier } 776331d2159SEric Fiselier 777331d2159SEric Fiselier template <class _LHS, class _RHS> 778331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 779331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7803e519524SHoward Hinnant}; 7813e519524SHoward Hinnant 782145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7833e519524SHoward Hinnant 784c8edcb36SHoward Hinnant// Precondition: __x != 0 785c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 786c206366fSHoward Hinnantunsigned 787c206366fSHoward Hinnant__ctz(unsigned __x) 788c206366fSHoward Hinnant{ 789c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 790c206366fSHoward Hinnant} 791c206366fSHoward Hinnant 792c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 793c206366fSHoward Hinnantunsigned long 794c206366fSHoward Hinnant__ctz(unsigned long __x) 795c206366fSHoward Hinnant{ 796c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 797c206366fSHoward Hinnant} 798c206366fSHoward Hinnant 799c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 800c206366fSHoward Hinnantunsigned long long 801c206366fSHoward Hinnant__ctz(unsigned long long __x) 802c206366fSHoward Hinnant{ 803c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 804c206366fSHoward Hinnant} 805c8edcb36SHoward Hinnant 806c8edcb36SHoward Hinnant// Precondition: __x != 0 807c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 808c206366fSHoward Hinnantunsigned 809c206366fSHoward Hinnant__clz(unsigned __x) 810c206366fSHoward Hinnant{ 811c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 812c206366fSHoward Hinnant} 813c206366fSHoward Hinnant 814c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 815c206366fSHoward Hinnantunsigned long 816c206366fSHoward Hinnant__clz(unsigned long __x) 817c206366fSHoward Hinnant{ 818c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 819c206366fSHoward Hinnant} 820c206366fSHoward Hinnant 821c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 822c206366fSHoward Hinnantunsigned long long 823c206366fSHoward Hinnant__clz(unsigned long long __x) 824c206366fSHoward Hinnant{ 825c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 826c206366fSHoward Hinnant} 827c8edcb36SHoward Hinnant 828c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 829c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 830c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 831c8edcb36SHoward Hinnant 8323e519524SHoward Hinnant// all_of 8333e519524SHoward Hinnant 8343e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8363e519524SHoward Hinnantbool 8373e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8383e519524SHoward Hinnant{ 8393e519524SHoward Hinnant for (; __first != __last; ++__first) 8403e519524SHoward Hinnant if (!__pred(*__first)) 8413e519524SHoward Hinnant return false; 8423e519524SHoward Hinnant return true; 8433e519524SHoward Hinnant} 8443e519524SHoward Hinnant 8453e519524SHoward Hinnant// any_of 8463e519524SHoward Hinnant 8473e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8493e519524SHoward Hinnantbool 8503e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8513e519524SHoward Hinnant{ 8523e519524SHoward Hinnant for (; __first != __last; ++__first) 8533e519524SHoward Hinnant if (__pred(*__first)) 8543e519524SHoward Hinnant return true; 8553e519524SHoward Hinnant return false; 8563e519524SHoward Hinnant} 8573e519524SHoward Hinnant 8583e519524SHoward Hinnant// none_of 8593e519524SHoward Hinnant 8603e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8623e519524SHoward Hinnantbool 8633e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8643e519524SHoward Hinnant{ 8653e519524SHoward Hinnant for (; __first != __last; ++__first) 8663e519524SHoward Hinnant if (__pred(*__first)) 8673e519524SHoward Hinnant return false; 8683e519524SHoward Hinnant return true; 8693e519524SHoward Hinnant} 8703e519524SHoward Hinnant 8713e519524SHoward Hinnant// for_each 8723e519524SHoward Hinnant 8733e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8753e519524SHoward Hinnant_Function 8763e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8773e519524SHoward Hinnant{ 8783e519524SHoward Hinnant for (; __first != __last; ++__first) 8793e519524SHoward Hinnant __f(*__first); 880251c6291SDimitry Andric return _LIBCPP_EXPLICIT_MOVE(__f); // explicitly moved for (emulated) C++03 8813e519524SHoward Hinnant} 8823e519524SHoward Hinnant 8833e519524SHoward Hinnant// find 8843e519524SHoward Hinnant 8853e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8873e519524SHoward Hinnant_InputIterator 888e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8893e519524SHoward Hinnant{ 8903e519524SHoward Hinnant for (; __first != __last; ++__first) 891e4383379SHoward Hinnant if (*__first == __value_) 8923e519524SHoward Hinnant break; 8933e519524SHoward Hinnant return __first; 8943e519524SHoward Hinnant} 8953e519524SHoward Hinnant 8963e519524SHoward Hinnant// find_if 8973e519524SHoward Hinnant 8983e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9003e519524SHoward Hinnant_InputIterator 9013e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9023e519524SHoward Hinnant{ 9033e519524SHoward Hinnant for (; __first != __last; ++__first) 9043e519524SHoward Hinnant if (__pred(*__first)) 9053e519524SHoward Hinnant break; 9063e519524SHoward Hinnant return __first; 9073e519524SHoward Hinnant} 9083e519524SHoward Hinnant 9093e519524SHoward Hinnant// find_if_not 9103e519524SHoward Hinnant 9113e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9133e519524SHoward Hinnant_InputIterator 9143e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9153e519524SHoward Hinnant{ 9163e519524SHoward Hinnant for (; __first != __last; ++__first) 9173e519524SHoward Hinnant if (!__pred(*__first)) 9183e519524SHoward Hinnant break; 9193e519524SHoward Hinnant return __first; 9203e519524SHoward Hinnant} 9213e519524SHoward Hinnant 9223e519524SHoward Hinnant// find_end 9233e519524SHoward Hinnant 9243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9253e519524SHoward Hinnant_ForwardIterator1 9263e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9273e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9283e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9293e519524SHoward Hinnant{ 9303e519524SHoward Hinnant // modeled after search algorithm 9313e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9323e519524SHoward Hinnant if (__first2 == __last2) 9333e519524SHoward Hinnant return __r; 9343e519524SHoward Hinnant while (true) 9353e519524SHoward Hinnant { 9363e519524SHoward Hinnant while (true) 9373e519524SHoward Hinnant { 9383e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9393e519524SHoward Hinnant return __r; // (or __last1 if never found) 9403e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9413e519524SHoward Hinnant break; 9423e519524SHoward Hinnant ++__first1; 9433e519524SHoward Hinnant } 9443e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9453e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9463e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9473e519524SHoward Hinnant while (true) 9483e519524SHoward Hinnant { 9493e519524SHoward Hinnant if (++__m2 == __last2) 9503e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9513e519524SHoward Hinnant __r = __first1; 9523e519524SHoward Hinnant ++__first1; 9533e519524SHoward Hinnant break; 9543e519524SHoward Hinnant } 9553e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9563e519524SHoward Hinnant return __r; 9573e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9583e519524SHoward Hinnant { 9593e519524SHoward Hinnant ++__first1; 9603e519524SHoward Hinnant break; 9613e519524SHoward Hinnant } // else there is a match, check next elements 9623e519524SHoward Hinnant } 9633e519524SHoward Hinnant } 9643e519524SHoward Hinnant} 9653e519524SHoward Hinnant 9663e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9673e519524SHoward Hinnant_BidirectionalIterator1 9683e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9693e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9703e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9713e519524SHoward Hinnant{ 9723e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9733e519524SHoward Hinnant if (__first2 == __last2) 9743e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9753e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9763e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9773e519524SHoward Hinnant --__l2; 9783e519524SHoward Hinnant while (true) 9793e519524SHoward Hinnant { 9803e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9813e519524SHoward Hinnant while (true) 9823e519524SHoward Hinnant { 9833e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9843e519524SHoward Hinnant return __last1; 9853e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9863e519524SHoward Hinnant break; 9873e519524SHoward Hinnant } 9883e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9893e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9903e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9913e519524SHoward Hinnant while (true) 9923e519524SHoward Hinnant { 9933e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9943e519524SHoward Hinnant return __m1; 9953e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9963e519524SHoward Hinnant return __last1; 9973e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9983e519524SHoward Hinnant { 9993e519524SHoward Hinnant break; 10003e519524SHoward Hinnant } // else there is a match, check next elements 10013e519524SHoward Hinnant } 10023e519524SHoward Hinnant } 10033e519524SHoward Hinnant} 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10069b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10073e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10083e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10093e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10103e519524SHoward Hinnant{ 10113e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10133e519524SHoward Hinnant if (__len2 == 0) 10143e519524SHoward Hinnant return __last1; 10153e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10163e519524SHoward Hinnant if (__len1 < __len2) 10173e519524SHoward Hinnant return __last1; 10183e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10193e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10203e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10213e519524SHoward Hinnant --__l2; 10223e519524SHoward Hinnant while (true) 10233e519524SHoward Hinnant { 10243e519524SHoward Hinnant while (true) 10253e519524SHoward Hinnant { 10263e519524SHoward Hinnant if (__s == __l1) 10273e519524SHoward Hinnant return __last1; 10283e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10293e519524SHoward Hinnant break; 10303e519524SHoward Hinnant } 10313e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10323e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10333e519524SHoward Hinnant while (true) 10343e519524SHoward Hinnant { 10353e519524SHoward Hinnant if (__m2 == __first2) 10363e519524SHoward Hinnant return __m1; 10373e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10383e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10393e519524SHoward Hinnant { 10403e519524SHoward Hinnant break; 10413e519524SHoward Hinnant } 10423e519524SHoward Hinnant } 10433e519524SHoward Hinnant } 10443e519524SHoward Hinnant} 10453e519524SHoward Hinnant 10463e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10483e519524SHoward Hinnant_ForwardIterator1 10493e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10503e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10513e519524SHoward Hinnant{ 1052ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10533e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10543e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10553e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10563e519524SHoward Hinnant} 10573e519524SHoward Hinnant 10583e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10603e519524SHoward Hinnant_ForwardIterator1 10613e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10623e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10633e519524SHoward Hinnant{ 10643e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10653e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1066ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10673e519524SHoward Hinnant} 10683e519524SHoward Hinnant 10693e519524SHoward Hinnant// find_first_of 10703e519524SHoward Hinnant 10713e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10729b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10739b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10743e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10753e519524SHoward Hinnant{ 10763e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10773e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10783e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10793e519524SHoward Hinnant return __first1; 10803e519524SHoward Hinnant return __last1; 10813e519524SHoward Hinnant} 10823e519524SHoward Hinnant 10839b0af34dSMarshall Clow 10849b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10859b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 10869b0af34dSMarshall Clow_ForwardIterator1 10879b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10889b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10899b0af34dSMarshall Clow{ 10909b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10919b0af34dSMarshall Clow} 10929b0af34dSMarshall Clow 10933e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10953e519524SHoward Hinnant_ForwardIterator1 10963e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10973e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10983e519524SHoward Hinnant{ 10993e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11003e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11019b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11023e519524SHoward Hinnant} 11033e519524SHoward Hinnant 11043e519524SHoward Hinnant// adjacent_find 11053e519524SHoward Hinnant 11063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11083e519524SHoward Hinnant_ForwardIterator 11093e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11103e519524SHoward Hinnant{ 11113e519524SHoward Hinnant if (__first != __last) 11123e519524SHoward Hinnant { 11133e519524SHoward Hinnant _ForwardIterator __i = __first; 11143e519524SHoward Hinnant while (++__i != __last) 11153e519524SHoward Hinnant { 11163e519524SHoward Hinnant if (__pred(*__first, *__i)) 11173e519524SHoward Hinnant return __first; 11183e519524SHoward Hinnant __first = __i; 11193e519524SHoward Hinnant } 11203e519524SHoward Hinnant } 11213e519524SHoward Hinnant return __last; 11223e519524SHoward Hinnant} 11233e519524SHoward Hinnant 11243e519524SHoward Hinnanttemplate <class _ForwardIterator> 11253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11263e519524SHoward Hinnant_ForwardIterator 11273e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11283e519524SHoward Hinnant{ 11293e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1130ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11313e519524SHoward Hinnant} 11323e519524SHoward Hinnant 11333e519524SHoward Hinnant// count 11343e519524SHoward Hinnant 11353e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11373e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1138e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11393e519524SHoward Hinnant{ 11403e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11413e519524SHoward Hinnant for (; __first != __last; ++__first) 1142e4383379SHoward Hinnant if (*__first == __value_) 11433e519524SHoward Hinnant ++__r; 11443e519524SHoward Hinnant return __r; 11453e519524SHoward Hinnant} 11463e519524SHoward Hinnant 11473e519524SHoward Hinnant// count_if 11483e519524SHoward Hinnant 11493e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11513e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11523e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11533e519524SHoward Hinnant{ 11543e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11553e519524SHoward Hinnant for (; __first != __last; ++__first) 11563e519524SHoward Hinnant if (__pred(*__first)) 11573e519524SHoward Hinnant ++__r; 11583e519524SHoward Hinnant return __r; 11593e519524SHoward Hinnant} 11603e519524SHoward Hinnant 11613e519524SHoward Hinnant// mismatch 11623e519524SHoward Hinnant 11633e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11653e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11663e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11673e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11683e519524SHoward Hinnant{ 1169bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11703e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11713e519524SHoward Hinnant break; 11723e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11733e519524SHoward Hinnant} 11743e519524SHoward Hinnant 11753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11773e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11783e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11813e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1182ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11833e519524SHoward Hinnant} 11843e519524SHoward Hinnant 11850b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11860b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11870b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11880b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11890b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11900b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11910b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11920b0bbd2fSMarshall Clow{ 1193bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11940b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11950b0bbd2fSMarshall Clow break; 11960b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11970b0bbd2fSMarshall Clow} 11980b0bbd2fSMarshall Clow 11990b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12000b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12010b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12020b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12030b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12040b0bbd2fSMarshall Clow{ 12050b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12060b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12070b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12080b0bbd2fSMarshall Clow} 12090b0bbd2fSMarshall Clow#endif 12100b0bbd2fSMarshall Clow 12113e519524SHoward Hinnant// equal 12123e519524SHoward Hinnant 12133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12153e519524SHoward Hinnantbool 12163e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12173e519524SHoward Hinnant{ 1218910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12193e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12203e519524SHoward Hinnant return false; 12213e519524SHoward Hinnant return true; 12223e519524SHoward Hinnant} 12233e519524SHoward Hinnant 12243e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12263e519524SHoward Hinnantbool 12273e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12283e519524SHoward Hinnant{ 12293e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12303e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1231ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12323e519524SHoward Hinnant} 12333e519524SHoward Hinnant 12340b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12350b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12360b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12370b0bbd2fSMarshall Clowbool 12380b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12390b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12400b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12410b0bbd2fSMarshall Clow{ 1242910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12430b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12440b0bbd2fSMarshall Clow return false; 12450b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12460b0bbd2fSMarshall Clow} 12470b0bbd2fSMarshall Clow 12480b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12490b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12500b0bbd2fSMarshall Clowbool 12510b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12520b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12530b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12540b0bbd2fSMarshall Clow{ 12550b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12560b0bbd2fSMarshall Clow return false; 12570b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12580b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12590b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12600b0bbd2fSMarshall Clow} 12610b0bbd2fSMarshall Clow 12620b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12630b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12640b0bbd2fSMarshall Clowbool 12650b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12660b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12670b0bbd2fSMarshall Clow{ 12680b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12690b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12700b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12710b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12720b0bbd2fSMarshall Clow} 12730b0bbd2fSMarshall Clow 12740b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12750b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12760b0bbd2fSMarshall Clowbool 12770b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12780b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12790b0bbd2fSMarshall Clow{ 12800b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12810b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12820b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12830b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12840b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12850b0bbd2fSMarshall Clow} 12860b0bbd2fSMarshall Clow#endif 12870b0bbd2fSMarshall Clow 12883e519524SHoward Hinnant// is_permutation 12893e519524SHoward Hinnant 12903e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12913e519524SHoward Hinnantbool 12923e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12933e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12943e519524SHoward Hinnant{ 12953e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1296910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12973e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12983e519524SHoward Hinnant goto __not_done; 12993e519524SHoward Hinnant return true; 13003e519524SHoward Hinnant__not_done: 13013e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 13023e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1303ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13043e519524SHoward Hinnant if (__l1 == _D1(1)) 13053e519524SHoward Hinnant return false; 1306ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13073e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13083e519524SHoward Hinnant // equal elements in [f2, l2) 13093e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13103e519524SHoward Hinnant { 13113e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 13123e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13133e519524SHoward Hinnant if (__pred(*__j, *__i)) 13143e519524SHoward Hinnant goto __next_iter; 13153e519524SHoward Hinnant { 13163e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13173e519524SHoward Hinnant _D1 __c2 = 0; 13183e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13193e519524SHoward Hinnant if (__pred(*__i, *__j)) 13203e519524SHoward Hinnant ++__c2; 13213e519524SHoward Hinnant if (__c2 == 0) 13223e519524SHoward Hinnant return false; 13233e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13243e519524SHoward Hinnant _D1 __c1 = 1; 1325ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13263e519524SHoward Hinnant if (__pred(*__i, *__j)) 13273e519524SHoward Hinnant ++__c1; 13283e519524SHoward Hinnant if (__c1 != __c2) 13293e519524SHoward Hinnant return false; 13303e519524SHoward Hinnant } 13313e519524SHoward Hinnant__next_iter:; 13323e519524SHoward Hinnant } 13333e519524SHoward Hinnant return true; 13343e519524SHoward Hinnant} 13353e519524SHoward Hinnant 13363e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13383e519524SHoward Hinnantbool 13393e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13403e519524SHoward Hinnant _ForwardIterator2 __first2) 13413e519524SHoward Hinnant{ 13423e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1344ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13453e519524SHoward Hinnant} 13463e519524SHoward Hinnant 13470b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13480b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13490b0bbd2fSMarshall Clowbool 13500b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13510b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13520b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13530b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13540b0bbd2fSMarshall Clow{ 13550b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1356847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13570b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13580b0bbd2fSMarshall Clow goto __not_done; 13590b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13600b0bbd2fSMarshall Clow__not_done: 13610b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13620b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13630b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13640b0bbd2fSMarshall Clow 13650b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1366fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13670b0bbd2fSMarshall Clow if (__l1 != __l2) 13680b0bbd2fSMarshall Clow return false; 13690b0bbd2fSMarshall Clow 13700b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13710b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13720b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13730b0bbd2fSMarshall Clow { 13740b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13750b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13760b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13770b0bbd2fSMarshall Clow goto __next_iter; 13780b0bbd2fSMarshall Clow { 13790b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13800b0bbd2fSMarshall Clow _D1 __c2 = 0; 13810b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13820b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13830b0bbd2fSMarshall Clow ++__c2; 13840b0bbd2fSMarshall Clow if (__c2 == 0) 13850b0bbd2fSMarshall Clow return false; 13860b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13870b0bbd2fSMarshall Clow _D1 __c1 = 1; 13880b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13890b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13900b0bbd2fSMarshall Clow ++__c1; 13910b0bbd2fSMarshall Clow if (__c1 != __c2) 13920b0bbd2fSMarshall Clow return false; 13930b0bbd2fSMarshall Clow } 13940b0bbd2fSMarshall Clow__next_iter:; 13950b0bbd2fSMarshall Clow } 13960b0bbd2fSMarshall Clow return true; 13970b0bbd2fSMarshall Clow} 13980b0bbd2fSMarshall Clow 13990b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14000b0bbd2fSMarshall Clowbool 14010b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14020b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14030b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14040b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14050b0bbd2fSMarshall Clow{ 14060b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14070b0bbd2fSMarshall Clow return false; 14080b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14090b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14100b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14110b0bbd2fSMarshall Clow} 14120b0bbd2fSMarshall Clow 14130b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14140b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14150b0bbd2fSMarshall Clowbool 14160b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14170b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14180b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14190b0bbd2fSMarshall Clow{ 14200b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14210b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14220b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14230b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14240b0bbd2fSMarshall Clow} 14250b0bbd2fSMarshall Clow 14260b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14270b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14280b0bbd2fSMarshall Clowbool 14290b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14300b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14310b0bbd2fSMarshall Clow{ 14320b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14330b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14340b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14350b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14360b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14370b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14380b0bbd2fSMarshall Clow} 14390b0bbd2fSMarshall Clow#endif 14400b0bbd2fSMarshall Clow 14413e519524SHoward Hinnant// search 14423e519524SHoward Hinnant 14433e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 144428cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 14453e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14463e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14473e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14483e519524SHoward Hinnant{ 14493e519524SHoward Hinnant if (__first2 == __last2) 145028cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 14513e519524SHoward Hinnant while (true) 14523e519524SHoward Hinnant { 14533e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14543e519524SHoward Hinnant while (true) 14553e519524SHoward Hinnant { 14563e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 145728cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14583e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14593e519524SHoward Hinnant break; 14603e519524SHoward Hinnant ++__first1; 14613e519524SHoward Hinnant } 14623e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14633e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14643e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14653e519524SHoward Hinnant while (true) 14663e519524SHoward Hinnant { 14673e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 146828cc4ddeSMarshall Clow return make_pair(__first1, __m1); 14693e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 147028cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14713e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14723e519524SHoward Hinnant { 14733e519524SHoward Hinnant ++__first1; 14743e519524SHoward Hinnant break; 14753e519524SHoward Hinnant } // else there is a match, check next elements 14763e519524SHoward Hinnant } 14773e519524SHoward Hinnant } 14783e519524SHoward Hinnant} 14793e519524SHoward Hinnant 14803e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 148128cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 148228cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 14833e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14843e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14853e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14863e519524SHoward Hinnant{ 148728cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 148828cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14893e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 149028cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 14913e519524SHoward Hinnant if (__len2 == 0) 149228cc4ddeSMarshall Clow return make_pair(__first1, __first1); 149328cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 14943e519524SHoward Hinnant if (__len1 < __len2) 149528cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14963e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14973e519524SHoward Hinnant while (true) 14983e519524SHoward Hinnant { 14993e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15003e519524SHoward Hinnant while (true) 15013e519524SHoward Hinnant { 15023e519524SHoward Hinnant if (__first1 == __s) 150328cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15043e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15053e519524SHoward Hinnant break; 15063e519524SHoward Hinnant ++__first1; 15073e519524SHoward Hinnant } 1508b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15093e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 15103e519524SHoward Hinnant { 15113e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15123e519524SHoward Hinnant goto __phase2; 15133e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15143e519524SHoward Hinnant goto __phase2; 15153e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15163e519524SHoward Hinnant goto __phase2; 15173e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15183e519524SHoward Hinnant goto __phase2; 15193e519524SHoward Hinnant ++__first1; 15203e519524SHoward Hinnant } 15213e519524SHoward Hinnant switch (__s - __first1) 15223e519524SHoward Hinnant { 15233e519524SHoward Hinnant case 3: 15243e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15253e519524SHoward Hinnant break; 15263e519524SHoward Hinnant ++__first1; 15273e519524SHoward Hinnant case 2: 15283e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15293e519524SHoward Hinnant break; 15303e519524SHoward Hinnant ++__first1; 15313e519524SHoward Hinnant case 1: 15323e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15333e519524SHoward Hinnant break; 15343e519524SHoward Hinnant case 0: 153528cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15363e519524SHoward Hinnant } 15373e519524SHoward Hinnant __phase2: 1538b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15393e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15403e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15413e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15423e519524SHoward Hinnant while (true) 15433e519524SHoward Hinnant { 15443e519524SHoward Hinnant if (++__m2 == __last2) 154528cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15463e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15473e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15483e519524SHoward Hinnant { 15493e519524SHoward Hinnant ++__first1; 15503e519524SHoward Hinnant break; 15513e519524SHoward Hinnant } 15523e519524SHoward Hinnant } 1553b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15543e519524SHoward Hinnant ++__m2; 15553e519524SHoward Hinnant ++__m1; 15563e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15573e519524SHoward Hinnant { 15583e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15593e519524SHoward Hinnant goto __continue; 15603e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15613e519524SHoward Hinnant goto __continue; 15623e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15633e519524SHoward Hinnant goto __continue; 15643e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15653e519524SHoward Hinnant goto __continue; 15663e519524SHoward Hinnant ++__m1; 15673e519524SHoward Hinnant ++__m2; 15683e519524SHoward Hinnant } 15693e519524SHoward Hinnant switch (__last2 - __m2) 15703e519524SHoward Hinnant { 15713e519524SHoward Hinnant case 3: 15723e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15733e519524SHoward Hinnant break; 15743e519524SHoward Hinnant ++__m1; 15753e519524SHoward Hinnant ++__m2; 15763e519524SHoward Hinnant case 2: 15773e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15783e519524SHoward Hinnant break; 15793e519524SHoward Hinnant ++__m1; 15803e519524SHoward Hinnant ++__m2; 15813e519524SHoward Hinnant case 1: 15823e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15833e519524SHoward Hinnant break; 15843e519524SHoward Hinnant case 0: 158528cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15863e519524SHoward Hinnant } 15873e519524SHoward Hinnant __continue: 15883e519524SHoward Hinnant ++__first1; 1589b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15903e519524SHoward Hinnant } 15913e519524SHoward Hinnant} 15923e519524SHoward Hinnant 15933e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15953e519524SHoward Hinnant_ForwardIterator1 15963e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15973e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15983e519524SHoward Hinnant{ 1599ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 16003e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 160128cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 160228cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 160328cc4ddeSMarshall Clow .first; 16043e519524SHoward Hinnant} 16053e519524SHoward Hinnant 16063e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16083e519524SHoward Hinnant_ForwardIterator1 16093e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16103e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16113e519524SHoward Hinnant{ 161228cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 161328cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1614ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16153e519524SHoward Hinnant} 16163e519524SHoward Hinnant 16173e519524SHoward Hinnant// search_n 16183e519524SHoward Hinnant 16193e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16203e519524SHoward Hinnant_ForwardIterator 16213e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1622e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16233e519524SHoward Hinnant{ 16243e519524SHoward Hinnant if (__count <= 0) 16253e519524SHoward Hinnant return __first; 16263e519524SHoward Hinnant while (true) 16273e519524SHoward Hinnant { 1628e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16293e519524SHoward Hinnant while (true) 16303e519524SHoward Hinnant { 1631e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16323e519524SHoward Hinnant return __last; 1633e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16343e519524SHoward Hinnant break; 16353e519524SHoward Hinnant ++__first; 16363e519524SHoward Hinnant } 1637e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16383e519524SHoward Hinnant _ForwardIterator __m = __first; 16393e519524SHoward Hinnant _Size __c(0); 16403e519524SHoward Hinnant while (true) 16413e519524SHoward Hinnant { 16423e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16433e519524SHoward Hinnant return __first; 16443e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16453e519524SHoward Hinnant return __last; 1646e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16473e519524SHoward Hinnant { 16483e519524SHoward Hinnant __first = __m; 16493e519524SHoward Hinnant ++__first; 16503e519524SHoward Hinnant break; 16513e519524SHoward Hinnant } // else there is a match, check next elements 16523e519524SHoward Hinnant } 16533e519524SHoward Hinnant } 16543e519524SHoward Hinnant} 16553e519524SHoward Hinnant 16563e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16573e519524SHoward Hinnant_RandomAccessIterator 16583e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1659e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16603e519524SHoward Hinnant{ 16613e519524SHoward Hinnant if (__count <= 0) 16623e519524SHoward Hinnant return __first; 16633e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16643e519524SHoward Hinnant if (__len < __count) 16653e519524SHoward Hinnant return __last; 16663e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16673e519524SHoward Hinnant while (true) 16683e519524SHoward Hinnant { 1669e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16703e519524SHoward Hinnant while (true) 16713e519524SHoward Hinnant { 1672b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16733e519524SHoward Hinnant return __last; 1674e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16753e519524SHoward Hinnant break; 16763e519524SHoward Hinnant ++__first; 16773e519524SHoward Hinnant } 1678e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16793e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16803e519524SHoward Hinnant _Size __c(0); 16813e519524SHoward Hinnant while (true) 16823e519524SHoward Hinnant { 16833e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16843e519524SHoward Hinnant return __first; 16853e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1686e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16873e519524SHoward Hinnant { 16883e519524SHoward Hinnant __first = __m; 16893e519524SHoward Hinnant ++__first; 16903e519524SHoward Hinnant break; 16913e519524SHoward Hinnant } // else there is a match, check next elements 16923e519524SHoward Hinnant } 16933e519524SHoward Hinnant } 16943e519524SHoward Hinnant} 16953e519524SHoward Hinnant 16963e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16983e519524SHoward Hinnant_ForwardIterator 16993e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1700e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 17013e519524SHoward Hinnant{ 1702ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 170351544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 170451544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 17053e519524SHoward Hinnant} 17063e519524SHoward Hinnant 17073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17093e519524SHoward Hinnant_ForwardIterator 1710e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17113e519524SHoward Hinnant{ 17123e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 171351544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 171451544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17153e519524SHoward Hinnant} 17163e519524SHoward Hinnant 17173e519524SHoward Hinnant// copy 17183e519524SHoward Hinnanttemplate <class _Iter> 17193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17203e519524SHoward Hinnant_Iter 17213e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17223e519524SHoward Hinnant{ 17233e519524SHoward Hinnant return __i; 17243e519524SHoward Hinnant} 17253e519524SHoward Hinnant 17263e519524SHoward Hinnanttemplate <class _Tp> 17273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17283e519524SHoward Hinnanttypename enable_if 17293e519524SHoward Hinnant< 1730ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17313e519524SHoward Hinnant _Tp* 17323e519524SHoward Hinnant>::type 17333e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17343e519524SHoward Hinnant{ 17353e519524SHoward Hinnant return __i.base(); 17363e519524SHoward Hinnant} 17373e519524SHoward Hinnant 1738fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1739fc88dbd2SHoward Hinnant 17403e519524SHoward Hinnanttemplate <class _Tp> 17413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17423e519524SHoward Hinnanttypename enable_if 17433e519524SHoward Hinnant< 1744ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17453e519524SHoward Hinnant _Tp* 17463e519524SHoward Hinnant>::type 17473e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17483e519524SHoward Hinnant{ 17493e519524SHoward Hinnant return __i.base(); 17503e519524SHoward Hinnant} 17513e519524SHoward Hinnant 1752fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1753fc88dbd2SHoward Hinnant 17543e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17563e519524SHoward Hinnant_OutputIterator 17573e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17583e519524SHoward Hinnant{ 1759910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17603e519524SHoward Hinnant *__result = *__first; 17613e519524SHoward Hinnant return __result; 17623e519524SHoward Hinnant} 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnanttypename enable_if 17673e519524SHoward Hinnant< 17683e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1769ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17703e519524SHoward Hinnant _Up* 17713e519524SHoward Hinnant>::type 17723e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17733e519524SHoward Hinnant{ 17743e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17755b312052SMarshall Clow if (__n > 0) 1776ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17773e519524SHoward Hinnant return __result + __n; 17783e519524SHoward Hinnant} 17793e519524SHoward Hinnant 17803e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17823e519524SHoward Hinnant_OutputIterator 17833e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17843e519524SHoward Hinnant{ 1785ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17863e519524SHoward Hinnant} 17873e519524SHoward Hinnant 17883e519524SHoward Hinnant// copy_backward 17893e519524SHoward Hinnant 1790d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17923e519524SHoward Hinnant_OutputIterator 1793d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17943e519524SHoward Hinnant{ 17953e519524SHoward Hinnant while (__first != __last) 17963e519524SHoward Hinnant *--__result = *--__last; 17973e519524SHoward Hinnant return __result; 17983e519524SHoward Hinnant} 17993e519524SHoward Hinnant 18003e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18023e519524SHoward Hinnanttypename enable_if 18033e519524SHoward Hinnant< 18043e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1805ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18063e519524SHoward Hinnant _Up* 18073e519524SHoward Hinnant>::type 18083e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18093e519524SHoward Hinnant{ 18103e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18115b312052SMarshall Clow if (__n > 0) 18125b312052SMarshall Clow { 18133e519524SHoward Hinnant __result -= __n; 1814ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18155b312052SMarshall Clow } 18163e519524SHoward Hinnant return __result; 18173e519524SHoward Hinnant} 18183e519524SHoward Hinnant 18193e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18213e519524SHoward Hinnant_BidirectionalIterator2 18223e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18233e519524SHoward Hinnant _BidirectionalIterator2 __result) 18243e519524SHoward Hinnant{ 1825ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18263e519524SHoward Hinnant} 18273e519524SHoward Hinnant 18283e519524SHoward Hinnant// copy_if 18293e519524SHoward Hinnant 18303e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18323e519524SHoward Hinnant_OutputIterator 18333e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18343e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18353e519524SHoward Hinnant{ 18363e519524SHoward Hinnant for (; __first != __last; ++__first) 18373e519524SHoward Hinnant { 18383e519524SHoward Hinnant if (__pred(*__first)) 18393e519524SHoward Hinnant { 18403e519524SHoward Hinnant *__result = *__first; 18413e519524SHoward Hinnant ++__result; 18423e519524SHoward Hinnant } 18433e519524SHoward Hinnant } 18443e519524SHoward Hinnant return __result; 18453e519524SHoward Hinnant} 18463e519524SHoward Hinnant 18473e519524SHoward Hinnant// copy_n 18483e519524SHoward Hinnant 18493e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18513e519524SHoward Hinnanttypename enable_if 18523e519524SHoward Hinnant< 18533e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18543e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18553e519524SHoward Hinnant _OutputIterator 18563e519524SHoward Hinnant>::type 185751544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18583e519524SHoward Hinnant{ 185951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 186051544023SEric Fiselier _IntegralSize __n = __orig_n; 186199847d2bSHoward Hinnant if (__n > 0) 186299847d2bSHoward Hinnant { 18633e519524SHoward Hinnant *__result = *__first; 186499847d2bSHoward Hinnant ++__result; 186599847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 186699847d2bSHoward Hinnant { 186799847d2bSHoward Hinnant ++__first; 186899847d2bSHoward Hinnant *__result = *__first; 186999847d2bSHoward Hinnant ++__result; 187099847d2bSHoward Hinnant } 187199847d2bSHoward Hinnant } 18723e519524SHoward Hinnant return __result; 18733e519524SHoward Hinnant} 18743e519524SHoward Hinnant 18753e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18773e519524SHoward Hinnanttypename enable_if 18783e519524SHoward Hinnant< 18793e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18803e519524SHoward Hinnant _OutputIterator 18813e519524SHoward Hinnant>::type 188251544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18833e519524SHoward Hinnant{ 188451544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 188551544023SEric Fiselier _IntegralSize __n = __orig_n; 1886ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18873e519524SHoward Hinnant} 18883e519524SHoward Hinnant 18893e519524SHoward Hinnant// move 18903e519524SHoward Hinnant 18913e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18933e519524SHoward Hinnant_OutputIterator 18943e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18953e519524SHoward Hinnant{ 1896910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1897ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18983e519524SHoward Hinnant return __result; 18993e519524SHoward Hinnant} 19003e519524SHoward Hinnant 19013e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19033e519524SHoward Hinnanttypename enable_if 19043e519524SHoward Hinnant< 19053e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1906ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19073e519524SHoward Hinnant _Up* 19083e519524SHoward Hinnant>::type 19093e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19103e519524SHoward Hinnant{ 19113e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19125b312052SMarshall Clow if (__n > 0) 1913ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19143e519524SHoward Hinnant return __result + __n; 19153e519524SHoward Hinnant} 19163e519524SHoward Hinnant 19173e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19193e519524SHoward Hinnant_OutputIterator 19203e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19213e519524SHoward Hinnant{ 1922ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19233e519524SHoward Hinnant} 19243e519524SHoward Hinnant 19253e519524SHoward Hinnant// move_backward 19263e519524SHoward Hinnant 19273e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19293e519524SHoward Hinnant_OutputIterator 19303e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19313e519524SHoward Hinnant{ 19323e519524SHoward Hinnant while (__first != __last) 1933ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19343e519524SHoward Hinnant return __result; 19353e519524SHoward Hinnant} 19363e519524SHoward Hinnant 19373e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19393e519524SHoward Hinnanttypename enable_if 19403e519524SHoward Hinnant< 19413e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1942ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19433e519524SHoward Hinnant _Up* 19443e519524SHoward Hinnant>::type 19453e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19463e519524SHoward Hinnant{ 19473e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19485b312052SMarshall Clow if (__n > 0) 19495b312052SMarshall Clow { 19503e519524SHoward Hinnant __result -= __n; 1951ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19525b312052SMarshall Clow } 19533e519524SHoward Hinnant return __result; 19543e519524SHoward Hinnant} 19553e519524SHoward Hinnant 19563e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19583e519524SHoward Hinnant_BidirectionalIterator2 19593e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19603e519524SHoward Hinnant _BidirectionalIterator2 __result) 19613e519524SHoward Hinnant{ 1962ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19633e519524SHoward Hinnant} 19643e519524SHoward Hinnant 19653e519524SHoward Hinnant// iter_swap 19663e519524SHoward Hinnant 1967a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// transform 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnant_OutputIterator 19743e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19753e519524SHoward Hinnant{ 1976910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19773e519524SHoward Hinnant *__result = __op(*__first); 19783e519524SHoward Hinnant return __result; 19793e519524SHoward Hinnant} 19803e519524SHoward Hinnant 19813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19833e519524SHoward Hinnant_OutputIterator 19843e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19853e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19863e519524SHoward Hinnant{ 1987910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19883e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19893e519524SHoward Hinnant return __result; 19903e519524SHoward Hinnant} 19913e519524SHoward Hinnant 19923e519524SHoward Hinnant// replace 19933e519524SHoward Hinnant 19943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19963e519524SHoward Hinnantvoid 19973e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19983e519524SHoward Hinnant{ 19993e519524SHoward Hinnant for (; __first != __last; ++__first) 20003e519524SHoward Hinnant if (*__first == __old_value) 20013e519524SHoward Hinnant *__first = __new_value; 20023e519524SHoward Hinnant} 20033e519524SHoward Hinnant 20043e519524SHoward Hinnant// replace_if 20053e519524SHoward Hinnant 20063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20083e519524SHoward Hinnantvoid 20093e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20103e519524SHoward Hinnant{ 20113e519524SHoward Hinnant for (; __first != __last; ++__first) 20123e519524SHoward Hinnant if (__pred(*__first)) 20133e519524SHoward Hinnant *__first = __new_value; 20143e519524SHoward Hinnant} 20153e519524SHoward Hinnant 20163e519524SHoward Hinnant// replace_copy 20173e519524SHoward Hinnant 20183e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20203e519524SHoward Hinnant_OutputIterator 20213e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20223e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20233e519524SHoward Hinnant{ 2024910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20253e519524SHoward Hinnant if (*__first == __old_value) 20263e519524SHoward Hinnant *__result = __new_value; 20273e519524SHoward Hinnant else 20283e519524SHoward Hinnant *__result = *__first; 20293e519524SHoward Hinnant return __result; 20303e519524SHoward Hinnant} 20313e519524SHoward Hinnant 20323e519524SHoward Hinnant// replace_copy_if 20333e519524SHoward Hinnant 20343e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20363e519524SHoward Hinnant_OutputIterator 20373e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20383e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20393e519524SHoward Hinnant{ 2040910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20413e519524SHoward Hinnant if (__pred(*__first)) 20423e519524SHoward Hinnant *__result = __new_value; 20433e519524SHoward Hinnant else 20443e519524SHoward Hinnant *__result = *__first; 20453e519524SHoward Hinnant return __result; 20463e519524SHoward Hinnant} 20473e519524SHoward Hinnant 20483e519524SHoward Hinnant// fill_n 20493e519524SHoward Hinnant 20503e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20523e519524SHoward Hinnant_OutputIterator 20530f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20543e519524SHoward Hinnant{ 2055910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2056e4383379SHoward Hinnant *__first = __value_; 20573e519524SHoward Hinnant return __first; 20583e519524SHoward Hinnant} 20593e519524SHoward Hinnant 20600f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20620f242beaSHoward Hinnanttypename enable_if 20630f242beaSHoward Hinnant< 20640f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20650f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20660f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20670f242beaSHoward Hinnant _Tp* 20680f242beaSHoward Hinnant>::type 20690f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20703e519524SHoward Hinnant{ 20713e519524SHoward Hinnant if (__n > 0) 2072e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20733e519524SHoward Hinnant return __first + __n; 20743e519524SHoward Hinnant} 20753e519524SHoward Hinnant 20763e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20783e519524SHoward Hinnant_OutputIterator 2079e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20803e519524SHoward Hinnant{ 208151544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20823e519524SHoward Hinnant} 20833e519524SHoward Hinnant 20843e519524SHoward Hinnant// fill 20853e519524SHoward Hinnant 20863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20883e519524SHoward Hinnantvoid 2089e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20903e519524SHoward Hinnant{ 20913e519524SHoward Hinnant for (; __first != __last; ++__first) 2092e4383379SHoward Hinnant *__first = __value_; 20933e519524SHoward Hinnant} 20943e519524SHoward Hinnant 20953e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20973e519524SHoward Hinnantvoid 2098e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20993e519524SHoward Hinnant{ 2100e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 21013e519524SHoward Hinnant} 21023e519524SHoward Hinnant 21033e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21053e519524SHoward Hinnantvoid 2106e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21073e519524SHoward Hinnant{ 2108e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21093e519524SHoward Hinnant} 21103e519524SHoward Hinnant 21113e519524SHoward Hinnant// generate 21123e519524SHoward Hinnant 21133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21153e519524SHoward Hinnantvoid 21163e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21173e519524SHoward Hinnant{ 21183e519524SHoward Hinnant for (; __first != __last; ++__first) 21193e519524SHoward Hinnant *__first = __gen(); 21203e519524SHoward Hinnant} 21213e519524SHoward Hinnant 21223e519524SHoward Hinnant// generate_n 21233e519524SHoward Hinnant 21243e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21263e519524SHoward Hinnant_OutputIterator 212751544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21283e519524SHoward Hinnant{ 212951544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 213051544023SEric Fiselier _IntegralSize __n = __orig_n; 2131910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21323e519524SHoward Hinnant *__first = __gen(); 21333e519524SHoward Hinnant return __first; 21343e519524SHoward Hinnant} 21353e519524SHoward Hinnant 21363e519524SHoward Hinnant// remove 21373e519524SHoward Hinnant 21383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21393e519524SHoward Hinnant_ForwardIterator 2140e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21413e519524SHoward Hinnant{ 2142e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21433e519524SHoward Hinnant if (__first != __last) 21443e519524SHoward Hinnant { 21453e519524SHoward Hinnant _ForwardIterator __i = __first; 21463e519524SHoward Hinnant while (++__i != __last) 21473e519524SHoward Hinnant { 2148e4383379SHoward Hinnant if (!(*__i == __value_)) 21493e519524SHoward Hinnant { 2150ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21513e519524SHoward Hinnant ++__first; 21523e519524SHoward Hinnant } 21533e519524SHoward Hinnant } 21543e519524SHoward Hinnant } 21553e519524SHoward Hinnant return __first; 21563e519524SHoward Hinnant} 21573e519524SHoward Hinnant 21583e519524SHoward Hinnant// remove_if 21593e519524SHoward Hinnant 21603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21613e519524SHoward Hinnant_ForwardIterator 21623e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21633e519524SHoward Hinnant{ 2164ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21653e519524SHoward Hinnant (__first, __last, __pred); 21663e519524SHoward Hinnant if (__first != __last) 21673e519524SHoward Hinnant { 21683e519524SHoward Hinnant _ForwardIterator __i = __first; 21693e519524SHoward Hinnant while (++__i != __last) 21703e519524SHoward Hinnant { 21713e519524SHoward Hinnant if (!__pred(*__i)) 21723e519524SHoward Hinnant { 2173ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21743e519524SHoward Hinnant ++__first; 21753e519524SHoward Hinnant } 21763e519524SHoward Hinnant } 21773e519524SHoward Hinnant } 21783e519524SHoward Hinnant return __first; 21793e519524SHoward Hinnant} 21803e519524SHoward Hinnant 21813e519524SHoward Hinnant// remove_copy 21823e519524SHoward Hinnant 21833e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21853e519524SHoward Hinnant_OutputIterator 2186e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21873e519524SHoward Hinnant{ 21883e519524SHoward Hinnant for (; __first != __last; ++__first) 21893e519524SHoward Hinnant { 2190e4383379SHoward Hinnant if (!(*__first == __value_)) 21913e519524SHoward Hinnant { 21923e519524SHoward Hinnant *__result = *__first; 21933e519524SHoward Hinnant ++__result; 21943e519524SHoward Hinnant } 21953e519524SHoward Hinnant } 21963e519524SHoward Hinnant return __result; 21973e519524SHoward Hinnant} 21983e519524SHoward Hinnant 21993e519524SHoward Hinnant// remove_copy_if 22003e519524SHoward Hinnant 22013e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 22023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22033e519524SHoward Hinnant_OutputIterator 22043e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 22053e519524SHoward Hinnant{ 22063e519524SHoward Hinnant for (; __first != __last; ++__first) 22073e519524SHoward Hinnant { 22083e519524SHoward Hinnant if (!__pred(*__first)) 22093e519524SHoward Hinnant { 22103e519524SHoward Hinnant *__result = *__first; 22113e519524SHoward Hinnant ++__result; 22123e519524SHoward Hinnant } 22133e519524SHoward Hinnant } 22143e519524SHoward Hinnant return __result; 22153e519524SHoward Hinnant} 22163e519524SHoward Hinnant 22173e519524SHoward Hinnant// unique 22183e519524SHoward Hinnant 22193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22203e519524SHoward Hinnant_ForwardIterator 22213e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22223e519524SHoward Hinnant{ 2223ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22243e519524SHoward Hinnant (__first, __last, __pred); 22253e519524SHoward Hinnant if (__first != __last) 22263e519524SHoward Hinnant { 22273e519524SHoward Hinnant // ... a a ? ... 22283e519524SHoward Hinnant // f i 22293e519524SHoward Hinnant _ForwardIterator __i = __first; 22303e519524SHoward Hinnant for (++__i; ++__i != __last;) 22313e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2232ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22333e519524SHoward Hinnant ++__first; 22343e519524SHoward Hinnant } 22353e519524SHoward Hinnant return __first; 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnanttemplate <class _ForwardIterator> 22393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22403e519524SHoward Hinnant_ForwardIterator 22413e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22423e519524SHoward Hinnant{ 22433e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2244ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22453e519524SHoward Hinnant} 22463e519524SHoward Hinnant 22473e519524SHoward Hinnant// unique_copy 22483e519524SHoward Hinnant 22493e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22503e519524SHoward Hinnant_OutputIterator 22513e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22523e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22533e519524SHoward Hinnant{ 22543e519524SHoward Hinnant if (__first != __last) 22553e519524SHoward Hinnant { 22563e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22573e519524SHoward Hinnant *__result = __t; 22583e519524SHoward Hinnant ++__result; 22593e519524SHoward Hinnant while (++__first != __last) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant if (!__pred(__t, *__first)) 22623e519524SHoward Hinnant { 22633e519524SHoward Hinnant __t = *__first; 22643e519524SHoward Hinnant *__result = __t; 22653e519524SHoward Hinnant ++__result; 22663e519524SHoward Hinnant } 22673e519524SHoward Hinnant } 22683e519524SHoward Hinnant } 22693e519524SHoward Hinnant return __result; 22703e519524SHoward Hinnant} 22713e519524SHoward Hinnant 22723e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22733e519524SHoward Hinnant_OutputIterator 22743e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22753e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22763e519524SHoward Hinnant{ 22773e519524SHoward Hinnant if (__first != __last) 22783e519524SHoward Hinnant { 22793e519524SHoward Hinnant _ForwardIterator __i = __first; 22803e519524SHoward Hinnant *__result = *__i; 22813e519524SHoward Hinnant ++__result; 22823e519524SHoward Hinnant while (++__first != __last) 22833e519524SHoward Hinnant { 22843e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22853e519524SHoward Hinnant { 22863e519524SHoward Hinnant *__result = *__first; 22873e519524SHoward Hinnant ++__result; 22883e519524SHoward Hinnant __i = __first; 22893e519524SHoward Hinnant } 22903e519524SHoward Hinnant } 22913e519524SHoward Hinnant } 22923e519524SHoward Hinnant return __result; 22933e519524SHoward Hinnant} 22943e519524SHoward Hinnant 22953e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22963e519524SHoward Hinnant_ForwardIterator 22973e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22983e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22993e519524SHoward Hinnant{ 23003e519524SHoward Hinnant if (__first != __last) 23013e519524SHoward Hinnant { 23023e519524SHoward Hinnant *__result = *__first; 23033e519524SHoward Hinnant while (++__first != __last) 23043e519524SHoward Hinnant if (!__pred(*__result, *__first)) 23053e519524SHoward Hinnant *++__result = *__first; 23063e519524SHoward Hinnant ++__result; 23073e519524SHoward Hinnant } 23083e519524SHoward Hinnant return __result; 23093e519524SHoward Hinnant} 23103e519524SHoward Hinnant 23113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23133e519524SHoward Hinnant_OutputIterator 23143e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23153e519524SHoward Hinnant{ 2316ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23173e519524SHoward Hinnant (__first, __last, __result, __pred, 23183e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23193e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23203e519524SHoward Hinnant} 23213e519524SHoward Hinnant 23223e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23243e519524SHoward Hinnant_OutputIterator 23253e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23263e519524SHoward Hinnant{ 23273e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2328ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23293e519524SHoward Hinnant} 23303e519524SHoward Hinnant 23313e519524SHoward Hinnant// reverse 23323e519524SHoward Hinnant 23333e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23353e519524SHoward Hinnantvoid 23363e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23373e519524SHoward Hinnant{ 23383e519524SHoward Hinnant while (__first != __last) 23393e519524SHoward Hinnant { 23403e519524SHoward Hinnant if (__first == --__last) 23413e519524SHoward Hinnant break; 2342def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23433e519524SHoward Hinnant ++__first; 23443e519524SHoward Hinnant } 23453e519524SHoward Hinnant} 23463e519524SHoward Hinnant 23473e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23493e519524SHoward Hinnantvoid 23503e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23513e519524SHoward Hinnant{ 23523e519524SHoward Hinnant if (__first != __last) 23533e519524SHoward Hinnant for (; __first < --__last; ++__first) 2354def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23553e519524SHoward Hinnant} 23563e519524SHoward Hinnant 23573e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23593e519524SHoward Hinnantvoid 23603e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23613e519524SHoward Hinnant{ 2362ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23633e519524SHoward Hinnant} 23643e519524SHoward Hinnant 23653e519524SHoward Hinnant// reverse_copy 23663e519524SHoward Hinnant 23673e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23693e519524SHoward Hinnant_OutputIterator 23703e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23713e519524SHoward Hinnant{ 23723e519524SHoward Hinnant for (; __first != __last; ++__result) 23733e519524SHoward Hinnant *__result = *--__last; 23743e519524SHoward Hinnant return __result; 23753e519524SHoward Hinnant} 23763e519524SHoward Hinnant 23773e519524SHoward Hinnant// rotate 23783e519524SHoward Hinnant 23793e519524SHoward Hinnanttemplate <class _ForwardIterator> 23803e519524SHoward Hinnant_ForwardIterator 2381aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23823e519524SHoward Hinnant{ 2383aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2384aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2385aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2386aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2387aca09de3SHoward Hinnant return __lm1; 2388aca09de3SHoward Hinnant} 2389aca09de3SHoward Hinnant 2390aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2391aca09de3SHoward Hinnant_BidirectionalIterator 2392aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2393aca09de3SHoward Hinnant{ 2394aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2395aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2396aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2397aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2398aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2399aca09de3SHoward Hinnant return __fp1; 2400aca09de3SHoward Hinnant} 2401aca09de3SHoward Hinnant 2402aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2403aca09de3SHoward Hinnant_ForwardIterator 2404aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2405aca09de3SHoward Hinnant{ 24063e519524SHoward Hinnant _ForwardIterator __i = __middle; 24073e519524SHoward Hinnant while (true) 24083e519524SHoward Hinnant { 24093e519524SHoward Hinnant swap(*__first, *__i); 24103e519524SHoward Hinnant ++__first; 24113e519524SHoward Hinnant if (++__i == __last) 24123e519524SHoward Hinnant break; 24133e519524SHoward Hinnant if (__first == __middle) 24143e519524SHoward Hinnant __middle = __i; 24153e519524SHoward Hinnant } 24163e519524SHoward Hinnant _ForwardIterator __r = __first; 24173e519524SHoward Hinnant if (__first != __middle) 24183e519524SHoward Hinnant { 24193e519524SHoward Hinnant __i = __middle; 24203e519524SHoward Hinnant while (true) 24213e519524SHoward Hinnant { 24223e519524SHoward Hinnant swap(*__first, *__i); 24233e519524SHoward Hinnant ++__first; 24243e519524SHoward Hinnant if (++__i == __last) 24253e519524SHoward Hinnant { 24263e519524SHoward Hinnant if (__first == __middle) 24273e519524SHoward Hinnant break; 24283e519524SHoward Hinnant __i = __middle; 24293e519524SHoward Hinnant } 24303e519524SHoward Hinnant else if (__first == __middle) 24313e519524SHoward Hinnant __middle = __i; 24323e519524SHoward Hinnant } 24333e519524SHoward Hinnant } 24343e519524SHoward Hinnant return __r; 24353e519524SHoward Hinnant} 24363e519524SHoward Hinnant 24373e519524SHoward Hinnanttemplate<typename _Integral> 24383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24393e519524SHoward Hinnant_Integral 244019b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24413e519524SHoward Hinnant{ 24423e519524SHoward Hinnant do 24433e519524SHoward Hinnant { 24443e519524SHoward Hinnant _Integral __t = __x % __y; 24453e519524SHoward Hinnant __x = __y; 24463e519524SHoward Hinnant __y = __t; 24473e519524SHoward Hinnant } while (__y); 24483e519524SHoward Hinnant return __x; 24493e519524SHoward Hinnant} 24503e519524SHoward Hinnant 24513e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24523e519524SHoward Hinnant_RandomAccessIterator 2453aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24543e519524SHoward Hinnant{ 24553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24563e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24573e519524SHoward Hinnant 24583e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24593e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24603e519524SHoward Hinnant if (__m1 == __m2) 24613e519524SHoward Hinnant { 2462ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24633e519524SHoward Hinnant return __middle; 24643e519524SHoward Hinnant } 246519b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24663e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24673e519524SHoward Hinnant { 2468aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24693e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24703e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24713e519524SHoward Hinnant do 24723e519524SHoward Hinnant { 2473aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24743e519524SHoward Hinnant __p1 = __p2; 24753e519524SHoward Hinnant const difference_type __d = __last - __p2; 24763e519524SHoward Hinnant if (__m1 < __d) 24773e519524SHoward Hinnant __p2 += __m1; 24783e519524SHoward Hinnant else 24793e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24803e519524SHoward Hinnant } while (__p2 != __p); 2481aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24823e519524SHoward Hinnant } 24833e519524SHoward Hinnant return __first + __m2; 24843e519524SHoward Hinnant} 24853e519524SHoward Hinnant 24863e519524SHoward Hinnanttemplate <class _ForwardIterator> 24873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24883e519524SHoward Hinnant_ForwardIterator 2489aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2490aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2491aca09de3SHoward Hinnant{ 2492aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2493aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2494aca09de3SHoward Hinnant { 2495aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2496aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2497aca09de3SHoward Hinnant } 2498aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2499aca09de3SHoward Hinnant} 2500aca09de3SHoward Hinnant 2501aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2502aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2503aca09de3SHoward Hinnant_BidirectionalIterator 2504aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2505aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2506aca09de3SHoward Hinnant{ 2507aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2508aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2509aca09de3SHoward Hinnant { 2510aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2511aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2512aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2513aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2514aca09de3SHoward Hinnant } 2515aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2516aca09de3SHoward Hinnant} 2517aca09de3SHoward Hinnant 2518aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2519aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2520aca09de3SHoward Hinnant_RandomAccessIterator 2521aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2522aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2523aca09de3SHoward Hinnant{ 2524aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2525aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2526aca09de3SHoward Hinnant { 2527aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2528aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2529aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2530aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2531aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2532aca09de3SHoward Hinnant } 2533aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2534aca09de3SHoward Hinnant} 2535aca09de3SHoward Hinnant 2536aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2537aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2538aca09de3SHoward Hinnant_ForwardIterator 25393e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25403e519524SHoward Hinnant{ 2541aca09de3SHoward Hinnant if (__first == __middle) 2542aca09de3SHoward Hinnant return __last; 2543aca09de3SHoward Hinnant if (__middle == __last) 2544aca09de3SHoward Hinnant return __first; 2545ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2546aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25473e519524SHoward Hinnant} 25483e519524SHoward Hinnant 25493e519524SHoward Hinnant// rotate_copy 25503e519524SHoward Hinnant 25513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25533e519524SHoward Hinnant_OutputIterator 25543e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25553e519524SHoward Hinnant{ 2556ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25573e519524SHoward Hinnant} 25583e519524SHoward Hinnant 25593e519524SHoward Hinnant// min_element 25603e519524SHoward Hinnant 25613e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25629d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25633e519524SHoward Hinnant_ForwardIterator 25640b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25653e519524SHoward Hinnant{ 25663e519524SHoward Hinnant if (__first != __last) 25673e519524SHoward Hinnant { 25683e519524SHoward Hinnant _ForwardIterator __i = __first; 25693e519524SHoward Hinnant while (++__i != __last) 25703e519524SHoward Hinnant if (__comp(*__i, *__first)) 25713e519524SHoward Hinnant __first = __i; 25723e519524SHoward Hinnant } 25733e519524SHoward Hinnant return __first; 25743e519524SHoward Hinnant} 25753e519524SHoward Hinnant 25763e519524SHoward Hinnanttemplate <class _ForwardIterator> 25770b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25783e519524SHoward Hinnant_ForwardIterator 25793e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25803e519524SHoward Hinnant{ 25810b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25824eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25834eb27b79SHoward Hinnant} 25844eb27b79SHoward Hinnant 25854eb27b79SHoward Hinnant// min 25864eb27b79SHoward Hinnant 25874eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25889d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25894eb27b79SHoward Hinnantconst _Tp& 25904eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25914eb27b79SHoward Hinnant{ 25924eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25934eb27b79SHoward Hinnant} 25944eb27b79SHoward Hinnant 25954eb27b79SHoward Hinnanttemplate <class _Tp> 25969d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25974eb27b79SHoward Hinnantconst _Tp& 25984eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25994eb27b79SHoward Hinnant{ 2600ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26014eb27b79SHoward Hinnant} 26024eb27b79SHoward Hinnant 260354976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260454976f26SHoward Hinnant 26054eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26069d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26074eb27b79SHoward Hinnant_Tp 26084eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26094eb27b79SHoward Hinnant{ 26100b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26114eb27b79SHoward Hinnant} 26124eb27b79SHoward Hinnant 26134eb27b79SHoward Hinnanttemplate<class _Tp> 26149d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26154eb27b79SHoward Hinnant_Tp 26164eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26174eb27b79SHoward Hinnant{ 26180b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26193e519524SHoward Hinnant} 26203e519524SHoward Hinnant 262154976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 262254976f26SHoward Hinnant 26233e519524SHoward Hinnant// max_element 26243e519524SHoward Hinnant 26253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26269d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26273e519524SHoward Hinnant_ForwardIterator 26280b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26293e519524SHoward Hinnant{ 26303e519524SHoward Hinnant if (__first != __last) 26313e519524SHoward Hinnant { 26323e519524SHoward Hinnant _ForwardIterator __i = __first; 26333e519524SHoward Hinnant while (++__i != __last) 26343e519524SHoward Hinnant if (__comp(*__first, *__i)) 26353e519524SHoward Hinnant __first = __i; 26363e519524SHoward Hinnant } 26373e519524SHoward Hinnant return __first; 26383e519524SHoward Hinnant} 26393e519524SHoward Hinnant 26409d67c6d5SMarshall Clow 26413e519524SHoward Hinnanttemplate <class _ForwardIterator> 26420b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26433e519524SHoward Hinnant_ForwardIterator 26443e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26453e519524SHoward Hinnant{ 26460b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26474eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26484eb27b79SHoward Hinnant} 26494eb27b79SHoward Hinnant 26504eb27b79SHoward Hinnant// max 26514eb27b79SHoward Hinnant 26524eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26539d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26544eb27b79SHoward Hinnantconst _Tp& 26554eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26564eb27b79SHoward Hinnant{ 26574eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26584eb27b79SHoward Hinnant} 26594eb27b79SHoward Hinnant 26604eb27b79SHoward Hinnanttemplate <class _Tp> 26619d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26624eb27b79SHoward Hinnantconst _Tp& 26634eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26644eb27b79SHoward Hinnant{ 2665ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26664eb27b79SHoward Hinnant} 26674eb27b79SHoward Hinnant 266854976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266954976f26SHoward Hinnant 26704eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26719d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26724eb27b79SHoward Hinnant_Tp 26734eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26744eb27b79SHoward Hinnant{ 26750b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26764eb27b79SHoward Hinnant} 26774eb27b79SHoward Hinnant 26784eb27b79SHoward Hinnanttemplate<class _Tp> 26799d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26804eb27b79SHoward Hinnant_Tp 26814eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26824eb27b79SHoward Hinnant{ 26830b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26843e519524SHoward Hinnant} 26853e519524SHoward Hinnant 268654976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 268754976f26SHoward Hinnant 2688146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2689146c14acSMarshall Clow// clamp 2690146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2691146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2692146c14acSMarshall Clowconst _Tp& 2693146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2694146c14acSMarshall Clow{ 2695146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2696146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2697146c14acSMarshall Clow 2698146c14acSMarshall Clow} 2699146c14acSMarshall Clow 2700146c14acSMarshall Clowtemplate<class _Tp> 2701146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2702146c14acSMarshall Clowconst _Tp& 2703146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2704146c14acSMarshall Clow{ 2705146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2706146c14acSMarshall Clow} 2707146c14acSMarshall Clow#endif 2708146c14acSMarshall Clow 27093e519524SHoward Hinnant// minmax_element 27103e519524SHoward Hinnant 27113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27120b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27133e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27143e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27153e519524SHoward Hinnant{ 27163e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27173e519524SHoward Hinnant if (__first != __last) 27183e519524SHoward Hinnant { 27193e519524SHoward Hinnant if (++__first != __last) 27203e519524SHoward Hinnant { 27213e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27223e519524SHoward Hinnant __result.first = __first; 27233e519524SHoward Hinnant else 27243e519524SHoward Hinnant __result.second = __first; 27253e519524SHoward Hinnant while (++__first != __last) 27263e519524SHoward Hinnant { 27273e519524SHoward Hinnant _ForwardIterator __i = __first; 27283e519524SHoward Hinnant if (++__first == __last) 27293e519524SHoward Hinnant { 27303e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27313e519524SHoward Hinnant __result.first = __i; 27323e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27333e519524SHoward Hinnant __result.second = __i; 27343e519524SHoward Hinnant break; 27353e519524SHoward Hinnant } 27363e519524SHoward Hinnant else 27373e519524SHoward Hinnant { 27383e519524SHoward Hinnant if (__comp(*__first, *__i)) 27393e519524SHoward Hinnant { 27403e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27413e519524SHoward Hinnant __result.first = __first; 27423e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27433e519524SHoward Hinnant __result.second = __i; 27443e519524SHoward Hinnant } 27453e519524SHoward Hinnant else 27463e519524SHoward Hinnant { 27473e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27483e519524SHoward Hinnant __result.first = __i; 27493e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27503e519524SHoward Hinnant __result.second = __first; 27513e519524SHoward Hinnant } 27523e519524SHoward Hinnant } 27533e519524SHoward Hinnant } 27543e519524SHoward Hinnant } 27553e519524SHoward Hinnant } 27563e519524SHoward Hinnant return __result; 27573e519524SHoward Hinnant} 27583e519524SHoward Hinnant 27593e519524SHoward Hinnanttemplate <class _ForwardIterator> 27600b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27613e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27623e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27633e519524SHoward Hinnant{ 27649d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27659d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27663e519524SHoward Hinnant} 27673e519524SHoward Hinnant 27684eb27b79SHoward Hinnant// minmax 27694eb27b79SHoward Hinnant 27704eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27719d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27724eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27734eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27744eb27b79SHoward Hinnant{ 27754eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27764eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27774eb27b79SHoward Hinnant} 27784eb27b79SHoward Hinnant 27794eb27b79SHoward Hinnanttemplate<class _Tp> 27809d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27814eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27824eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27834eb27b79SHoward Hinnant{ 2784ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27854eb27b79SHoward Hinnant} 27864eb27b79SHoward Hinnant 278754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 278854976f26SHoward Hinnant 27894eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27909d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27914eb27b79SHoward Hinnantpair<_Tp, _Tp> 27924eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27934eb27b79SHoward Hinnant{ 27949d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27959d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27969d67c6d5SMarshall Clow _Iter __last = __t.end(); 27979d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27989d67c6d5SMarshall Clow 27999d67c6d5SMarshall Clow ++__first; 28009d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28019d67c6d5SMarshall Clow { 28029d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28039d67c6d5SMarshall Clow __result.first = *__first; 28049d67c6d5SMarshall Clow else 28059d67c6d5SMarshall Clow __result.second = *__first; 28069d67c6d5SMarshall Clow ++__first; 28079d67c6d5SMarshall Clow } 28089d67c6d5SMarshall Clow 28099d67c6d5SMarshall Clow while (__first != __last) 28109d67c6d5SMarshall Clow { 28119d67c6d5SMarshall Clow _Tp __prev = *__first++; 2812002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2813002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2814002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28159d67c6d5SMarshall Clow } 28169d67c6d5SMarshall Clow else { 2817002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2818002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28199d67c6d5SMarshall Clow } 28209d67c6d5SMarshall Clow 28219d67c6d5SMarshall Clow __first++; 28229d67c6d5SMarshall Clow } 28239d67c6d5SMarshall Clow return __result; 28249d67c6d5SMarshall Clow} 28259d67c6d5SMarshall Clow 28269d67c6d5SMarshall Clowtemplate<class _Tp> 28279d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28289d67c6d5SMarshall Clowpair<_Tp, _Tp> 28299d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28309d67c6d5SMarshall Clow{ 28319d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28324eb27b79SHoward Hinnant} 28334eb27b79SHoward Hinnant 283454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 283554976f26SHoward Hinnant 28363e519524SHoward Hinnant// random_shuffle 28373e519524SHoward Hinnant 2838f9d540b0SHoward Hinnant// __independent_bits_engine 2839f9d540b0SHoward Hinnant 2840c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2841f9d540b0SHoward Hinnantstruct __log2_imp 28423e519524SHoward Hinnant{ 2843c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2844c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28453e519524SHoward Hinnant}; 28463e519524SHoward Hinnant 2847c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2848c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28493e519524SHoward Hinnant{ 2850f9d540b0SHoward Hinnant static const size_t value = 0; 28513e519524SHoward Hinnant}; 28523e519524SHoward Hinnant 2853c003db1fSHoward Hinnanttemplate <size_t _Rp> 2854c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28553e519524SHoward Hinnant{ 2856c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28573e519524SHoward Hinnant}; 28583e519524SHoward Hinnant 2859c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2860f9d540b0SHoward Hinnantstruct __log2 28613e519524SHoward Hinnant{ 2862c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2863f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28643e519524SHoward Hinnant}; 28653e519524SHoward Hinnant 2866f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2867f9d540b0SHoward Hinnantclass __independent_bits_engine 28683e519524SHoward Hinnant{ 2869f9d540b0SHoward Hinnantpublic: 2870f9d540b0SHoward Hinnant // types 2871f9d540b0SHoward Hinnant typedef _UIntType result_type; 2872f9d540b0SHoward Hinnant 2873f9d540b0SHoward Hinnantprivate: 2874f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2875f9d540b0SHoward Hinnant typedef typename conditional 2876f9d540b0SHoward Hinnant < 2877f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2878f9d540b0SHoward Hinnant result_type, 2879f9d540b0SHoward Hinnant _Engine_result_type 2880f9d540b0SHoward Hinnant >::type _Working_result_type; 2881f9d540b0SHoward Hinnant 2882f9d540b0SHoward Hinnant _Engine& __e_; 2883f9d540b0SHoward Hinnant size_t __w_; 2884f9d540b0SHoward Hinnant size_t __w0_; 2885f9d540b0SHoward Hinnant size_t __n_; 2886f9d540b0SHoward Hinnant size_t __n0_; 2887f9d540b0SHoward Hinnant _Working_result_type __y0_; 2888f9d540b0SHoward Hinnant _Working_result_type __y1_; 2889f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2890f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2891f9d540b0SHoward Hinnant 2892e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2893c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2894f9d540b0SHoward Hinnant + _Working_result_type(1); 2895e386b7b3SHoward Hinnant#else 2896e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2897e386b7b3SHoward Hinnant + _Working_result_type(1); 2898e386b7b3SHoward Hinnant#endif 2899e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2900e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2901e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2902f9d540b0SHoward Hinnant 2903f9d540b0SHoward Hinnantpublic: 2904f9d540b0SHoward Hinnant // constructors and seeding functions 2905f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2906f9d540b0SHoward Hinnant 2907f9d540b0SHoward Hinnant // generating functions 2908c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2909f9d540b0SHoward Hinnant 2910f9d540b0SHoward Hinnantprivate: 2911f9d540b0SHoward Hinnant result_type __eval(false_type); 2912f9d540b0SHoward Hinnant result_type __eval(true_type); 2913f9d540b0SHoward Hinnant}; 2914f9d540b0SHoward Hinnant 2915f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2916f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2917f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2918f9d540b0SHoward Hinnant : __e_(__e), 2919f9d540b0SHoward Hinnant __w_(__w) 2920f9d540b0SHoward Hinnant{ 2921f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2922f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2923c003db1fSHoward Hinnant if (_Rp == 0) 2924c003db1fSHoward Hinnant __y0_ = _Rp; 2925f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2926c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2927f9d540b0SHoward Hinnant else 2928f9d540b0SHoward Hinnant __y0_ = 0; 2929c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2930f9d540b0SHoward Hinnant { 2931f9d540b0SHoward Hinnant ++__n_; 2932f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2933f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2934c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2935f9d540b0SHoward Hinnant else 2936f9d540b0SHoward Hinnant __y0_ = 0; 2937f9d540b0SHoward Hinnant } 2938f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2939f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2940c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2941f9d540b0SHoward Hinnant else 2942f9d540b0SHoward Hinnant __y1_ = 0; 2943f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2944f9d540b0SHoward Hinnant _Engine_result_type(0); 2945f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2946f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2947f9d540b0SHoward Hinnant _Engine_result_type(~0); 29483e519524SHoward Hinnant} 29493e519524SHoward Hinnant 2950f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2951f9d540b0SHoward Hinnantinline 2952f9d540b0SHoward Hinnant_UIntType 2953f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29543e519524SHoward Hinnant{ 2955f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29563e519524SHoward Hinnant} 29573e519524SHoward Hinnant 2958f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2959f9d540b0SHoward Hinnant_UIntType 2960f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29613e519524SHoward Hinnant{ 2962c003db1fSHoward Hinnant result_type _Sp = 0; 2963f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2964f9d540b0SHoward Hinnant { 2965f9d540b0SHoward Hinnant _Engine_result_type __u; 29663e519524SHoward Hinnant do 2967f9d540b0SHoward Hinnant { 2968f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2969f9d540b0SHoward Hinnant } while (__u >= __y0_); 29700176bc6cSHoward Hinnant if (__w0_ < _WDt) 2971c003db1fSHoward Hinnant _Sp <<= __w0_; 2972f9d540b0SHoward Hinnant else 2973c003db1fSHoward Hinnant _Sp = 0; 2974c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2975f9d540b0SHoward Hinnant } 2976f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2977f9d540b0SHoward Hinnant { 2978f9d540b0SHoward Hinnant _Engine_result_type __u; 2979f9d540b0SHoward Hinnant do 2980f9d540b0SHoward Hinnant { 2981f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2982f9d540b0SHoward Hinnant } while (__u >= __y1_); 29830176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2984c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2985f9d540b0SHoward Hinnant else 2986c003db1fSHoward Hinnant _Sp = 0; 2987c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2988f9d540b0SHoward Hinnant } 2989c003db1fSHoward Hinnant return _Sp; 29903e519524SHoward Hinnant} 29913e519524SHoward Hinnant 2992f9d540b0SHoward Hinnant// uniform_int_distribution 29933e519524SHoward Hinnant 2994f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2995f9d540b0SHoward Hinnantclass uniform_int_distribution 29963e519524SHoward Hinnant{ 2997f9d540b0SHoward Hinnantpublic: 2998f9d540b0SHoward Hinnant // types 2999f9d540b0SHoward Hinnant typedef _IntType result_type; 3000f9d540b0SHoward Hinnant 3001f9d540b0SHoward Hinnant class param_type 3002f9d540b0SHoward Hinnant { 3003f9d540b0SHoward Hinnant result_type __a_; 3004f9d540b0SHoward Hinnant result_type __b_; 3005f9d540b0SHoward Hinnant public: 3006f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3007f9d540b0SHoward Hinnant 3008f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3009f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3010f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3011f9d540b0SHoward Hinnant 3012f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3013f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3014f9d540b0SHoward Hinnant 3015f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3016f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3017f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3018f9d540b0SHoward Hinnant {return !(__x == __y);} 30193e519524SHoward Hinnant }; 30203e519524SHoward Hinnant 3021f9d540b0SHoward Hinnantprivate: 3022f9d540b0SHoward Hinnant param_type __p_; 30233e519524SHoward Hinnant 3024f9d540b0SHoward Hinnantpublic: 3025f9d540b0SHoward Hinnant // constructors and reset functions 3026f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3027f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3028f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3029f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3030f9d540b0SHoward Hinnant void reset() {} 3031f9d540b0SHoward Hinnant 3032f9d540b0SHoward Hinnant // generating functions 3033f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3034f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3035f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3036f9d540b0SHoward Hinnant 3037f9d540b0SHoward Hinnant // property functions 3038f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3039f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3040f9d540b0SHoward Hinnant 3041f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3042f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3043f9d540b0SHoward Hinnant 3044f9d540b0SHoward Hinnant result_type min() const {return a();} 3045f9d540b0SHoward Hinnant result_type max() const {return b();} 3046f9d540b0SHoward Hinnant 3047f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3048f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3049f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3050f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3051f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3052f9d540b0SHoward Hinnant {return !(__x == __y);} 30533e519524SHoward Hinnant}; 30543e519524SHoward Hinnant 3055f9d540b0SHoward Hinnanttemplate<class _IntType> 3056f9d540b0SHoward Hinnanttemplate<class _URNG> 3057f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3058f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30593e519524SHoward Hinnant{ 3060f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3061f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3062c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3063c003db1fSHoward Hinnant if (_Rp == 1) 3064f9d540b0SHoward Hinnant return __p.a(); 3065f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3066f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3067c003db1fSHoward Hinnant if (_Rp == 0) 3068f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3069c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3070a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3071f9d540b0SHoward Hinnant ++__w; 3072f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3073f9d540b0SHoward Hinnant _UIntType __u; 3074f9d540b0SHoward Hinnant do 30753e519524SHoward Hinnant { 3076f9d540b0SHoward Hinnant __u = __e(); 3077c003db1fSHoward Hinnant } while (__u >= _Rp); 3078f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30793e519524SHoward Hinnant} 3080f9d540b0SHoward Hinnant 3081f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3082f9d540b0SHoward Hinnant 3083f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3084f9d540b0SHoward Hinnant 3085f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30863e519524SHoward Hinnant{ 3087f9d540b0SHoward Hinnant static unsigned __c_; 3088f9d540b0SHoward Hinnant 3089f9d540b0SHoward Hinnant __rs_default(); 3090f9d540b0SHoward Hinnantpublic: 3091b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3092f9d540b0SHoward Hinnant 3093f9d540b0SHoward Hinnant static const result_type _Min = 0; 3094f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3095f9d540b0SHoward Hinnant 3096f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3097f9d540b0SHoward Hinnant ~__rs_default(); 3098f9d540b0SHoward Hinnant 3099f9d540b0SHoward Hinnant result_type operator()(); 3100f9d540b0SHoward Hinnant 3101788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3102788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3103f9d540b0SHoward Hinnant 3104f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3105f9d540b0SHoward Hinnant}; 3106f9d540b0SHoward Hinnant 3107f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31083e519524SHoward Hinnant 31093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31103e519524SHoward Hinnantvoid 31113e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31123e519524SHoward Hinnant{ 31133e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3114c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3115c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31163e519524SHoward Hinnant difference_type __d = __last - __first; 31173e519524SHoward Hinnant if (__d > 1) 31183e519524SHoward Hinnant { 3119c003db1fSHoward Hinnant _Dp __uid; 3120f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3121f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3122007b26beSHoward Hinnant { 3123c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3124007b26beSHoward Hinnant if (__i != difference_type(0)) 3125007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3126007b26beSHoward Hinnant } 31273e519524SHoward Hinnant } 31283e519524SHoward Hinnant} 31293e519524SHoward Hinnant 31303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31313e519524SHoward Hinnantvoid 31323e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 31337609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 31343e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31353e519524SHoward Hinnant#else 31363e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31373e519524SHoward Hinnant#endif 31383e519524SHoward Hinnant{ 31393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31403e519524SHoward Hinnant difference_type __d = __last - __first; 31413e519524SHoward Hinnant if (__d > 1) 31423e519524SHoward Hinnant { 31433e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3144007b26beSHoward Hinnant { 3145007b26beSHoward Hinnant difference_type __i = __rand(__d); 3146007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3147007b26beSHoward Hinnant } 31483e519524SHoward Hinnant } 31493e519524SHoward Hinnant} 31503e519524SHoward Hinnant 3151*e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3152*e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3153*e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3154*e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3155*e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3156*e7154709SEric Fiselier _Distance __n, 3157*e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3158*e7154709SEric Fiselier input_iterator_tag) { 3159*e7154709SEric Fiselier 3160*e7154709SEric Fiselier _Distance __k = 0; 3161*e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 3162*e7154709SEric Fiselier __out[__k] = *__first; 3163*e7154709SEric Fiselier _Distance __sz = __k; 3164*e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3165*e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3166*e7154709SEric Fiselier if (__r < __sz) 3167*e7154709SEric Fiselier __out[__r] = *__first; 3168*e7154709SEric Fiselier } 3169*e7154709SEric Fiselier return __out + _VSTD::min(__n, __k); 3170*e7154709SEric Fiselier} 3171*e7154709SEric Fiselier 3172*e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3173*e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3174*e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3175*e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3176*e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3177*e7154709SEric Fiselier _Distance __n, 3178*e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3179*e7154709SEric Fiselier forward_iterator_tag) { 3180*e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3181*e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3182*e7154709SEric Fiselier _Distance __r = 3183*e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3184*e7154709SEric Fiselier if (__r < __n) { 3185*e7154709SEric Fiselier *__out++ = *__first; 3186*e7154709SEric Fiselier --__n; 3187*e7154709SEric Fiselier } 3188*e7154709SEric Fiselier } 3189*e7154709SEric Fiselier return __out; 3190*e7154709SEric Fiselier} 3191*e7154709SEric Fiselier 3192*e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3193*e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3194*e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3195*e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3196*e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3197*e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3198*e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3199*e7154709SEric Fiselier _PopCategory; 3200*e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3201*e7154709SEric Fiselier _Difference; 3202*e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3203*e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3204*e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3205*e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3206*e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3207*e7154709SEric Fiselier return _VSTD::__sample( 3208*e7154709SEric Fiselier __first, __last, __out, _CommonType(__n), 3209*e7154709SEric Fiselier __g, _PopCategory()); 3210*e7154709SEric Fiselier} 3211*e7154709SEric Fiselier 3212*e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3213*e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3214*e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3215*e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3216*e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 3217*e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3218*e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 3219*e7154709SEric Fiselier return _VSTD::__sample(__first, __last, __out, __n, __g); 3220*e7154709SEric Fiselier} 3221*e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3222*e7154709SEric Fiselier 3223f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3224f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3225fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3226fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3227fb340102SHoward Hinnant#else 3228f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3229fb340102SHoward Hinnant#endif 3230f9d540b0SHoward Hinnant{ 3231f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3232c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3233c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3234f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3235f9d540b0SHoward Hinnant if (__d > 1) 3236f9d540b0SHoward Hinnant { 3237c003db1fSHoward Hinnant _Dp __uid; 3238f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3239007b26beSHoward Hinnant { 3240c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3241007b26beSHoward Hinnant if (__i != difference_type(0)) 3242007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3243007b26beSHoward Hinnant } 3244f9d540b0SHoward Hinnant } 3245f9d540b0SHoward Hinnant} 3246f9d540b0SHoward Hinnant 32473e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 32483e519524SHoward Hinnantbool 32493e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32503e519524SHoward Hinnant{ 32513e519524SHoward Hinnant for (; __first != __last; ++__first) 32523e519524SHoward Hinnant if (!__pred(*__first)) 32533e519524SHoward Hinnant break; 3254b9595b79SMarshall Clow if ( __first == __last ) 3255b9595b79SMarshall Clow return true; 3256b9595b79SMarshall Clow ++__first; 32573e519524SHoward Hinnant for (; __first != __last; ++__first) 32583e519524SHoward Hinnant if (__pred(*__first)) 32593e519524SHoward Hinnant return false; 32603e519524SHoward Hinnant return true; 32613e519524SHoward Hinnant} 32623e519524SHoward Hinnant 32633e519524SHoward Hinnant// partition 32643e519524SHoward Hinnant 32653e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32663e519524SHoward Hinnant_ForwardIterator 32673e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32683e519524SHoward Hinnant{ 32693e519524SHoward Hinnant while (true) 32703e519524SHoward Hinnant { 32713e519524SHoward Hinnant if (__first == __last) 32723e519524SHoward Hinnant return __first; 32733e519524SHoward Hinnant if (!__pred(*__first)) 32743e519524SHoward Hinnant break; 32753e519524SHoward Hinnant ++__first; 32763e519524SHoward Hinnant } 32773e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32783e519524SHoward Hinnant { 32793e519524SHoward Hinnant if (__pred(*__p)) 32803e519524SHoward Hinnant { 32813e519524SHoward Hinnant swap(*__first, *__p); 32823e519524SHoward Hinnant ++__first; 32833e519524SHoward Hinnant } 32843e519524SHoward Hinnant } 32853e519524SHoward Hinnant return __first; 32863e519524SHoward Hinnant} 32873e519524SHoward Hinnant 32883e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32893e519524SHoward Hinnant_BidirectionalIterator 32903e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32913e519524SHoward Hinnant bidirectional_iterator_tag) 32923e519524SHoward Hinnant{ 32933e519524SHoward Hinnant while (true) 32943e519524SHoward Hinnant { 32953e519524SHoward Hinnant while (true) 32963e519524SHoward Hinnant { 32973e519524SHoward Hinnant if (__first == __last) 32983e519524SHoward Hinnant return __first; 32993e519524SHoward Hinnant if (!__pred(*__first)) 33003e519524SHoward Hinnant break; 33013e519524SHoward Hinnant ++__first; 33023e519524SHoward Hinnant } 33033e519524SHoward Hinnant do 33043e519524SHoward Hinnant { 33053e519524SHoward Hinnant if (__first == --__last) 33063e519524SHoward Hinnant return __first; 33073e519524SHoward Hinnant } while (!__pred(*__last)); 33083e519524SHoward Hinnant swap(*__first, *__last); 33093e519524SHoward Hinnant ++__first; 33103e519524SHoward Hinnant } 33113e519524SHoward Hinnant} 33123e519524SHoward Hinnant 33133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33153e519524SHoward Hinnant_ForwardIterator 33163e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33173e519524SHoward Hinnant{ 3318ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33193e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33203e519524SHoward Hinnant} 33213e519524SHoward Hinnant 33223e519524SHoward Hinnant// partition_copy 33233e519524SHoward Hinnant 33243e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33253e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33263e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33273e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33283e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33293e519524SHoward Hinnant _Predicate __pred) 33303e519524SHoward Hinnant{ 33313e519524SHoward Hinnant for (; __first != __last; ++__first) 33323e519524SHoward Hinnant { 33333e519524SHoward Hinnant if (__pred(*__first)) 33343e519524SHoward Hinnant { 33353e519524SHoward Hinnant *__out_true = *__first; 33363e519524SHoward Hinnant ++__out_true; 33373e519524SHoward Hinnant } 33383e519524SHoward Hinnant else 33393e519524SHoward Hinnant { 33403e519524SHoward Hinnant *__out_false = *__first; 33413e519524SHoward Hinnant ++__out_false; 33423e519524SHoward Hinnant } 33433e519524SHoward Hinnant } 33443e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33453e519524SHoward Hinnant} 33463e519524SHoward Hinnant 33473e519524SHoward Hinnant// partition_point 33483e519524SHoward Hinnant 33493e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 33503e519524SHoward Hinnant_ForwardIterator 33513e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33523e519524SHoward Hinnant{ 33533e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3354ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33553e519524SHoward Hinnant while (__len != 0) 33563e519524SHoward Hinnant { 33573e519524SHoward Hinnant difference_type __l2 = __len / 2; 33583e519524SHoward Hinnant _ForwardIterator __m = __first; 3359ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33603e519524SHoward Hinnant if (__pred(*__m)) 33613e519524SHoward Hinnant { 33623e519524SHoward Hinnant __first = ++__m; 33633e519524SHoward Hinnant __len -= __l2 + 1; 33643e519524SHoward Hinnant } 33653e519524SHoward Hinnant else 33663e519524SHoward Hinnant __len = __l2; 33673e519524SHoward Hinnant } 33683e519524SHoward Hinnant return __first; 33693e519524SHoward Hinnant} 33703e519524SHoward Hinnant 33713e519524SHoward Hinnant// stable_partition 33723e519524SHoward Hinnant 33733e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33743e519524SHoward Hinnant_ForwardIterator 33753e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33763e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33773e519524SHoward Hinnant{ 33783e519524SHoward Hinnant // *__first is known to be false 33793e519524SHoward Hinnant // __len >= 1 33803e519524SHoward Hinnant if (__len == 1) 33813e519524SHoward Hinnant return __first; 33823e519524SHoward Hinnant if (__len == 2) 33833e519524SHoward Hinnant { 33843e519524SHoward Hinnant _ForwardIterator __m = __first; 33853e519524SHoward Hinnant if (__pred(*++__m)) 33863e519524SHoward Hinnant { 33873e519524SHoward Hinnant swap(*__first, *__m); 33883e519524SHoward Hinnant return __m; 33893e519524SHoward Hinnant } 33903e519524SHoward Hinnant return __first; 33913e519524SHoward Hinnant } 33923e519524SHoward Hinnant if (__len <= __p.second) 33933e519524SHoward Hinnant { // The buffer is big enough to use 33943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33953e519524SHoward Hinnant __destruct_n __d(0); 33963e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33973e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33983e519524SHoward Hinnant // Update __first to always point to the end of the trues 33993e519524SHoward Hinnant value_type* __t = __p.first; 3400ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34013e519524SHoward Hinnant __d.__incr((value_type*)0); 34023e519524SHoward Hinnant ++__t; 34033e519524SHoward Hinnant _ForwardIterator __i = __first; 34043e519524SHoward Hinnant while (++__i != __last) 34053e519524SHoward Hinnant { 34063e519524SHoward Hinnant if (__pred(*__i)) 34073e519524SHoward Hinnant { 3408ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34093e519524SHoward Hinnant ++__first; 34103e519524SHoward Hinnant } 34113e519524SHoward Hinnant else 34123e519524SHoward Hinnant { 3413ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34143e519524SHoward Hinnant __d.__incr((value_type*)0); 34153e519524SHoward Hinnant ++__t; 34163e519524SHoward Hinnant } 34173e519524SHoward Hinnant } 34183e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34193e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34203e519524SHoward Hinnant __i = __first; 34213e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3422ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34233e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34243e519524SHoward Hinnant return __first; 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant // Else not enough buffer, do in place 34273e519524SHoward Hinnant // __len >= 3 34283e519524SHoward Hinnant _ForwardIterator __m = __first; 34293e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3430ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34313e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34323e519524SHoward Hinnant // F????????????????? 34333e519524SHoward Hinnant // f m l 34343e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34353e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34363e519524SHoward Hinnant // TTTFFFFF?????????? 34373e519524SHoward Hinnant // f ff m l 34383e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34393e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34403e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34413e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34423e519524SHoward Hinnant while (__pred(*__m1)) 34433e519524SHoward Hinnant { 34443e519524SHoward Hinnant if (++__m1 == __last) 34453e519524SHoward Hinnant goto __second_half_done; 34463e519524SHoward Hinnant --__len_half; 34473e519524SHoward Hinnant } 34483e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34493e519524SHoward Hinnant // f ff m m1 l 34503e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34513e519524SHoward Hinnant__second_half_done: 34523e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34533e519524SHoward Hinnant // f ff m sf l 3454ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34553e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34563e519524SHoward Hinnant // | 34573e519524SHoward Hinnant} 34583e519524SHoward Hinnant 34593e519524SHoward Hinnantstruct __return_temporary_buffer 34603e519524SHoward Hinnant{ 34613e519524SHoward Hinnant template <class _Tp> 3462ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34633e519524SHoward Hinnant}; 34643e519524SHoward Hinnant 34653e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34663e519524SHoward Hinnant_ForwardIterator 34673e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34683e519524SHoward Hinnant forward_iterator_tag) 34693e519524SHoward Hinnant{ 34703e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34713e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34723e519524SHoward Hinnant while (true) 34733e519524SHoward Hinnant { 34743e519524SHoward Hinnant if (__first == __last) 34753e519524SHoward Hinnant return __first; 34763e519524SHoward Hinnant if (!__pred(*__first)) 34773e519524SHoward Hinnant break; 34783e519524SHoward Hinnant ++__first; 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34813e519524SHoward Hinnant // *__first is known to be false 34823e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3484ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34853e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34863e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34873e519524SHoward Hinnant if (__len >= __alloc_limit) 34883e519524SHoward Hinnant { 3489ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34903e519524SHoward Hinnant __h.reset(__p.first); 34913e519524SHoward Hinnant } 34923e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34933e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34943e519524SHoward Hinnant} 34953e519524SHoward Hinnant 34963e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34973e519524SHoward Hinnant_BidirectionalIterator 34983e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34993e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 35003e519524SHoward Hinnant{ 35013e519524SHoward Hinnant // *__first is known to be false 35023e519524SHoward Hinnant // *__last is known to be true 35033e519524SHoward Hinnant // __len >= 2 35043e519524SHoward Hinnant if (__len == 2) 35053e519524SHoward Hinnant { 35063e519524SHoward Hinnant swap(*__first, *__last); 35073e519524SHoward Hinnant return __last; 35083e519524SHoward Hinnant } 35093e519524SHoward Hinnant if (__len == 3) 35103e519524SHoward Hinnant { 35113e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35123e519524SHoward Hinnant if (__pred(*++__m)) 35133e519524SHoward Hinnant { 35143e519524SHoward Hinnant swap(*__first, *__m); 35153e519524SHoward Hinnant swap(*__m, *__last); 35163e519524SHoward Hinnant return __last; 35173e519524SHoward Hinnant } 35183e519524SHoward Hinnant swap(*__m, *__last); 35193e519524SHoward Hinnant swap(*__first, *__m); 35203e519524SHoward Hinnant return __m; 35213e519524SHoward Hinnant } 35223e519524SHoward Hinnant if (__len <= __p.second) 35233e519524SHoward Hinnant { // The buffer is big enough to use 35243e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35253e519524SHoward Hinnant __destruct_n __d(0); 35263e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35273e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35283e519524SHoward Hinnant // Update __first to always point to the end of the trues 35293e519524SHoward Hinnant value_type* __t = __p.first; 3530ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35313e519524SHoward Hinnant __d.__incr((value_type*)0); 35323e519524SHoward Hinnant ++__t; 35333e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35343e519524SHoward Hinnant while (++__i != __last) 35353e519524SHoward Hinnant { 35363e519524SHoward Hinnant if (__pred(*__i)) 35373e519524SHoward Hinnant { 3538ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35393e519524SHoward Hinnant ++__first; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant else 35423e519524SHoward Hinnant { 3543ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35443e519524SHoward Hinnant __d.__incr((value_type*)0); 35453e519524SHoward Hinnant ++__t; 35463e519524SHoward Hinnant } 35473e519524SHoward Hinnant } 35483e519524SHoward Hinnant // move *__last, known to be true 3549ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35503e519524SHoward Hinnant __i = ++__first; 35513e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35523e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35533e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3554ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35553e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35563e519524SHoward Hinnant return __first; 35573e519524SHoward Hinnant } 35583e519524SHoward Hinnant // Else not enough buffer, do in place 35593e519524SHoward Hinnant // __len >= 4 35603e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35613e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3562ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35633e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35643e519524SHoward Hinnant // F????????????????T 35653e519524SHoward Hinnant // f m l 35663e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35673e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35683e519524SHoward Hinnant _Distance __len_half = __len2; 35693e519524SHoward Hinnant while (!__pred(*--__m1)) 35703e519524SHoward Hinnant { 35713e519524SHoward Hinnant if (__m1 == __first) 35723e519524SHoward Hinnant goto __first_half_done; 35733e519524SHoward Hinnant --__len_half; 35743e519524SHoward Hinnant } 35753e519524SHoward Hinnant // F???TFFF?????????T 35763e519524SHoward Hinnant // f m1 m l 35773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35783e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35793e519524SHoward Hinnant__first_half_done: 35803e519524SHoward Hinnant // TTTFFFFF?????????T 35813e519524SHoward Hinnant // f ff m l 35823e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35833e519524SHoward Hinnant __m1 = __m; 35843e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35853e519524SHoward Hinnant ++__second_false; 35863e519524SHoward Hinnant __len_half = __len - __len2; 35873e519524SHoward Hinnant while (__pred(*__m1)) 35883e519524SHoward Hinnant { 35893e519524SHoward Hinnant if (++__m1 == __last) 35903e519524SHoward Hinnant goto __second_half_done; 35913e519524SHoward Hinnant --__len_half; 35923e519524SHoward Hinnant } 35933e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35943e519524SHoward Hinnant // f ff m m1 l 35953e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35963e519524SHoward Hinnant__second_half_done: 35973e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35983e519524SHoward Hinnant // f ff m sf l 3599ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 36003e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 36013e519524SHoward Hinnant // | 36023e519524SHoward Hinnant} 36033e519524SHoward Hinnant 36043e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 36053e519524SHoward Hinnant_BidirectionalIterator 36063e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36073e519524SHoward Hinnant bidirectional_iterator_tag) 36083e519524SHoward Hinnant{ 36093e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36103e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36113e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 36123e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36133e519524SHoward Hinnant while (true) 36143e519524SHoward Hinnant { 36153e519524SHoward Hinnant if (__first == __last) 36163e519524SHoward Hinnant return __first; 36173e519524SHoward Hinnant if (!__pred(*__first)) 36183e519524SHoward Hinnant break; 36193e519524SHoward Hinnant ++__first; 36203e519524SHoward Hinnant } 36213e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36223e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36233e519524SHoward Hinnant do 36243e519524SHoward Hinnant { 36253e519524SHoward Hinnant if (__first == --__last) 36263e519524SHoward Hinnant return __first; 36273e519524SHoward Hinnant } while (!__pred(*__last)); 36283e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36293e519524SHoward Hinnant // *__first is known to be false 36303e519524SHoward Hinnant // *__last is known to be true 36313e519524SHoward Hinnant // __len >= 2 3632ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36333e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36343e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36353e519524SHoward Hinnant if (__len >= __alloc_limit) 36363e519524SHoward Hinnant { 3637ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36383e519524SHoward Hinnant __h.reset(__p.first); 36393e519524SHoward Hinnant } 36403e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36413e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36423e519524SHoward Hinnant} 36433e519524SHoward Hinnant 36443e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36463e519524SHoward Hinnant_ForwardIterator 36473e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36483e519524SHoward Hinnant{ 36493e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36503e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36513e519524SHoward Hinnant} 36523e519524SHoward Hinnant 36533e519524SHoward Hinnant// is_sorted_until 36543e519524SHoward Hinnant 36553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36563e519524SHoward Hinnant_ForwardIterator 36573e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36583e519524SHoward Hinnant{ 36593e519524SHoward Hinnant if (__first != __last) 36603e519524SHoward Hinnant { 36613e519524SHoward Hinnant _ForwardIterator __i = __first; 36623e519524SHoward Hinnant while (++__i != __last) 36633e519524SHoward Hinnant { 36643e519524SHoward Hinnant if (__comp(*__i, *__first)) 36653e519524SHoward Hinnant return __i; 36663e519524SHoward Hinnant __first = __i; 36673e519524SHoward Hinnant } 36683e519524SHoward Hinnant } 36693e519524SHoward Hinnant return __last; 36703e519524SHoward Hinnant} 36713e519524SHoward Hinnant 36723e519524SHoward Hinnanttemplate<class _ForwardIterator> 36733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36743e519524SHoward Hinnant_ForwardIterator 36753e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36763e519524SHoward Hinnant{ 3677ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36783e519524SHoward Hinnant} 36793e519524SHoward Hinnant 36803e519524SHoward Hinnant// is_sorted 36813e519524SHoward Hinnant 36823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36843e519524SHoward Hinnantbool 36853e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36863e519524SHoward Hinnant{ 3687ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36883e519524SHoward Hinnant} 36893e519524SHoward Hinnant 36903e519524SHoward Hinnanttemplate<class _ForwardIterator> 36913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36923e519524SHoward Hinnantbool 36933e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36943e519524SHoward Hinnant{ 3695ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36963e519524SHoward Hinnant} 36973e519524SHoward Hinnant 36983e519524SHoward Hinnant// sort 36993e519524SHoward Hinnant 37003e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 37013e519524SHoward Hinnant 37023e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37033e519524SHoward Hinnantunsigned 37043e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 37053e519524SHoward Hinnant{ 37063e519524SHoward Hinnant unsigned __r = 0; 37073e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 37083e519524SHoward Hinnant { 37093e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 37103e519524SHoward Hinnant return __r; // x <= y && y <= z 37113e519524SHoward Hinnant // x <= y && y > z 37123e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 37133e519524SHoward Hinnant __r = 1; 37143e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37153e519524SHoward Hinnant { 37163e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37173e519524SHoward Hinnant __r = 2; 37183e519524SHoward Hinnant } 37193e519524SHoward Hinnant return __r; // x <= y && y < z 37203e519524SHoward Hinnant } 37213e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37223e519524SHoward Hinnant { 37233e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37243e519524SHoward Hinnant __r = 1; 37253e519524SHoward Hinnant return __r; 37263e519524SHoward Hinnant } 37273e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37283e519524SHoward Hinnant __r = 1; // x < y && x <= z 37293e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37303e519524SHoward Hinnant { 37313e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37323e519524SHoward Hinnant __r = 2; 37333e519524SHoward Hinnant } 37343e519524SHoward Hinnant return __r; 37353e519524SHoward Hinnant} // x <= y && y <= z 37363e519524SHoward Hinnant 37373e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37383e519524SHoward Hinnant 37393e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37403e519524SHoward Hinnantunsigned 37413e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37423e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37433e519524SHoward Hinnant{ 37443e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37453e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37463e519524SHoward Hinnant { 37473e519524SHoward Hinnant swap(*__x3, *__x4); 37483e519524SHoward Hinnant ++__r; 37493e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37503e519524SHoward Hinnant { 37513e519524SHoward Hinnant swap(*__x2, *__x3); 37523e519524SHoward Hinnant ++__r; 37533e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37543e519524SHoward Hinnant { 37553e519524SHoward Hinnant swap(*__x1, *__x2); 37563e519524SHoward Hinnant ++__r; 37573e519524SHoward Hinnant } 37583e519524SHoward Hinnant } 37593e519524SHoward Hinnant } 37603e519524SHoward Hinnant return __r; 37613e519524SHoward Hinnant} 37623e519524SHoward Hinnant 37633e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37643e519524SHoward Hinnant 37653e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37663e519524SHoward Hinnantunsigned 37673e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37683e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37693e519524SHoward Hinnant{ 37703e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37713e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37723e519524SHoward Hinnant { 37733e519524SHoward Hinnant swap(*__x4, *__x5); 37743e519524SHoward Hinnant ++__r; 37753e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37763e519524SHoward Hinnant { 37773e519524SHoward Hinnant swap(*__x3, *__x4); 37783e519524SHoward Hinnant ++__r; 37793e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37803e519524SHoward Hinnant { 37813e519524SHoward Hinnant swap(*__x2, *__x3); 37823e519524SHoward Hinnant ++__r; 37833e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37843e519524SHoward Hinnant { 37853e519524SHoward Hinnant swap(*__x1, *__x2); 37863e519524SHoward Hinnant ++__r; 37873e519524SHoward Hinnant } 37883e519524SHoward Hinnant } 37893e519524SHoward Hinnant } 37903e519524SHoward Hinnant } 37913e519524SHoward Hinnant return __r; 37923e519524SHoward Hinnant} 37933e519524SHoward Hinnant 37943e519524SHoward Hinnant// Assumes size > 0 37953e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37963e519524SHoward Hinnantvoid 37973e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37983e519524SHoward Hinnant{ 37993e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 38003e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 38013e519524SHoward Hinnant { 3802ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 38033e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 38043e519524SHoward Hinnant (__first, __last, __comp); 38053e519524SHoward Hinnant if (__i != __first) 38063e519524SHoward Hinnant swap(*__first, *__i); 38073e519524SHoward Hinnant } 38083e519524SHoward Hinnant} 38093e519524SHoward Hinnant 38103e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38113e519524SHoward Hinnantvoid 38123e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38133e519524SHoward Hinnant{ 38143e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38153e519524SHoward Hinnant if (__first != __last) 38163e519524SHoward Hinnant { 38173e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38183e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38193e519524SHoward Hinnant { 38203e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3821ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38223e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3823ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3824ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38253e519524SHoward Hinnant } 38263e519524SHoward Hinnant } 38273e519524SHoward Hinnant} 38283e519524SHoward Hinnant 38293e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38303e519524SHoward Hinnantvoid 38313e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38323e519524SHoward Hinnant{ 38333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38343e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38353e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38363e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38373e519524SHoward Hinnant { 38383e519524SHoward Hinnant if (__comp(*__i, *__j)) 38393e519524SHoward Hinnant { 3840ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38413e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38423e519524SHoward Hinnant __j = __i; 38433e519524SHoward Hinnant do 38443e519524SHoward Hinnant { 3845ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38463e519524SHoward Hinnant __j = __k; 38473e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3848ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38493e519524SHoward Hinnant } 38503e519524SHoward Hinnant __j = __i; 38513e519524SHoward Hinnant } 38523e519524SHoward Hinnant} 38533e519524SHoward Hinnant 38543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38553e519524SHoward Hinnantbool 38563e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38573e519524SHoward Hinnant{ 38583e519524SHoward Hinnant switch (__last - __first) 38593e519524SHoward Hinnant { 38603e519524SHoward Hinnant case 0: 38613e519524SHoward Hinnant case 1: 38623e519524SHoward Hinnant return true; 38633e519524SHoward Hinnant case 2: 38643e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38653e519524SHoward Hinnant swap(*__first, *__last); 38663e519524SHoward Hinnant return true; 38673e519524SHoward Hinnant case 3: 3868ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38693e519524SHoward Hinnant return true; 38703e519524SHoward Hinnant case 4: 3871ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38723e519524SHoward Hinnant return true; 38733e519524SHoward Hinnant case 5: 3874ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38753e519524SHoward Hinnant return true; 38763e519524SHoward Hinnant } 38773e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38783e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38793e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38803e519524SHoward Hinnant const unsigned __limit = 8; 38813e519524SHoward Hinnant unsigned __count = 0; 38823e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38833e519524SHoward Hinnant { 38843e519524SHoward Hinnant if (__comp(*__i, *__j)) 38853e519524SHoward Hinnant { 3886ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38873e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38883e519524SHoward Hinnant __j = __i; 38893e519524SHoward Hinnant do 38903e519524SHoward Hinnant { 3891ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38923e519524SHoward Hinnant __j = __k; 38933e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3894ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38953e519524SHoward Hinnant if (++__count == __limit) 38963e519524SHoward Hinnant return ++__i == __last; 38973e519524SHoward Hinnant } 38983e519524SHoward Hinnant __j = __i; 38993e519524SHoward Hinnant } 39003e519524SHoward Hinnant return true; 39013e519524SHoward Hinnant} 39023e519524SHoward Hinnant 39033e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 39043e519524SHoward Hinnantvoid 39053e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 39063e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 39073e519524SHoward Hinnant{ 39083e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 39093e519524SHoward Hinnant if (__first1 != __last1) 39103e519524SHoward Hinnant { 39113e519524SHoward Hinnant __destruct_n __d(0); 39123e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39133e519524SHoward Hinnant value_type* __last2 = __first2; 3914ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39153e519524SHoward Hinnant __d.__incr((value_type*)0); 39163e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant value_type* __j2 = __last2; 39193e519524SHoward Hinnant value_type* __i2 = __j2; 39203e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39213e519524SHoward Hinnant { 3922ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39233e519524SHoward Hinnant __d.__incr((value_type*)0); 39243e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3925ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3926ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39273e519524SHoward Hinnant } 39283e519524SHoward Hinnant else 39293e519524SHoward Hinnant { 3930ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39313e519524SHoward Hinnant __d.__incr((value_type*)0); 39323e519524SHoward Hinnant } 39333e519524SHoward Hinnant } 39343e519524SHoward Hinnant __h.release(); 39353e519524SHoward Hinnant } 39363e519524SHoward Hinnant} 39373e519524SHoward Hinnant 39383e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39393e519524SHoward Hinnantvoid 39403e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39413e519524SHoward Hinnant{ 39423e519524SHoward Hinnant // _Compare is known to be a reference type 39433e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3945ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3946ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39473e519524SHoward Hinnant while (true) 39483e519524SHoward Hinnant { 39493e519524SHoward Hinnant __restart: 39503e519524SHoward Hinnant difference_type __len = __last - __first; 39513e519524SHoward Hinnant switch (__len) 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant case 0: 39543e519524SHoward Hinnant case 1: 39553e519524SHoward Hinnant return; 39563e519524SHoward Hinnant case 2: 39573e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39583e519524SHoward Hinnant swap(*__first, *__last); 39593e519524SHoward Hinnant return; 39603e519524SHoward Hinnant case 3: 3961ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39623e519524SHoward Hinnant return; 39633e519524SHoward Hinnant case 4: 3964ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39653e519524SHoward Hinnant return; 39663e519524SHoward Hinnant case 5: 3967ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39683e519524SHoward Hinnant return; 39693e519524SHoward Hinnant } 39703e519524SHoward Hinnant if (__len <= __limit) 39713e519524SHoward Hinnant { 3972ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39733e519524SHoward Hinnant return; 39743e519524SHoward Hinnant } 39753e519524SHoward Hinnant // __len > 5 39763e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39773e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39783e519524SHoward Hinnant --__lm1; 39793e519524SHoward Hinnant unsigned __n_swaps; 39803e519524SHoward Hinnant { 39813e519524SHoward Hinnant difference_type __delta; 39823e519524SHoward Hinnant if (__len >= 1000) 39833e519524SHoward Hinnant { 39843e519524SHoward Hinnant __delta = __len/2; 39853e519524SHoward Hinnant __m += __delta; 39863e519524SHoward Hinnant __delta /= 2; 3987ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39883e519524SHoward Hinnant } 39893e519524SHoward Hinnant else 39903e519524SHoward Hinnant { 39913e519524SHoward Hinnant __delta = __len/2; 39923e519524SHoward Hinnant __m += __delta; 3993ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39943e519524SHoward Hinnant } 39953e519524SHoward Hinnant } 39963e519524SHoward Hinnant // *__m is median 39973e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39983e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39993e519524SHoward Hinnant _RandomAccessIterator __i = __first; 40003e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 40013e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40023e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 40033e519524SHoward Hinnant // Prime the downward search with a guard. 40043e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 40053e519524SHoward Hinnant { 40063e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 40073e519524SHoward Hinnant // manually guard downward moving __j against __i 40083e519524SHoward Hinnant while (true) 40093e519524SHoward Hinnant { 40103e519524SHoward Hinnant if (__i == --__j) 40113e519524SHoward Hinnant { 40123e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40133e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40143e519524SHoward Hinnant ++__i; // __first + 1 40153e519524SHoward Hinnant __j = __last; 40163e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40173e519524SHoward Hinnant { 40183e519524SHoward Hinnant while (true) 40193e519524SHoward Hinnant { 40203e519524SHoward Hinnant if (__i == __j) 40213e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40223e519524SHoward Hinnant if (__comp(*__first, *__i)) 40233e519524SHoward Hinnant { 40243e519524SHoward Hinnant swap(*__i, *__j); 40253e519524SHoward Hinnant ++__n_swaps; 40263e519524SHoward Hinnant ++__i; 40273e519524SHoward Hinnant break; 40283e519524SHoward Hinnant } 40293e519524SHoward Hinnant ++__i; 40303e519524SHoward Hinnant } 40313e519524SHoward Hinnant } 40323e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40333e519524SHoward Hinnant if (__i == __j) 40343e519524SHoward Hinnant return; 40353e519524SHoward Hinnant while (true) 40363e519524SHoward Hinnant { 40373e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40383e519524SHoward Hinnant ++__i; 40393e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40403e519524SHoward Hinnant ; 40413e519524SHoward Hinnant if (__i >= __j) 40423e519524SHoward Hinnant break; 40433e519524SHoward Hinnant swap(*__i, *__j); 40443e519524SHoward Hinnant ++__n_swaps; 40453e519524SHoward Hinnant ++__i; 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40483e519524SHoward Hinnant // The first part is sorted, sort the secod part 4049ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40503e519524SHoward Hinnant __first = __i; 40513e519524SHoward Hinnant goto __restart; 40523e519524SHoward Hinnant } 40533e519524SHoward Hinnant if (__comp(*__j, *__m)) 40543e519524SHoward Hinnant { 40553e519524SHoward Hinnant swap(*__i, *__j); 40563e519524SHoward Hinnant ++__n_swaps; 40573e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40583e519524SHoward Hinnant } 40593e519524SHoward Hinnant } 40603e519524SHoward Hinnant } 40613e519524SHoward Hinnant // It is known that *__i < *__m 40623e519524SHoward Hinnant ++__i; 40633e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40643e519524SHoward Hinnant // if not yet partitioned... 40653e519524SHoward Hinnant if (__i < __j) 40663e519524SHoward Hinnant { 40673e519524SHoward Hinnant // known that *(__i - 1) < *__m 40683e519524SHoward Hinnant // known that __i <= __m 40693e519524SHoward Hinnant while (true) 40703e519524SHoward Hinnant { 40713e519524SHoward Hinnant // __m still guards upward moving __i 40723e519524SHoward Hinnant while (__comp(*__i, *__m)) 40733e519524SHoward Hinnant ++__i; 40743e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40753e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40763e519524SHoward Hinnant ; 40773e519524SHoward Hinnant if (__i > __j) 40783e519524SHoward Hinnant break; 40793e519524SHoward Hinnant swap(*__i, *__j); 40803e519524SHoward Hinnant ++__n_swaps; 40813e519524SHoward Hinnant // It is known that __m != __j 40823e519524SHoward Hinnant // If __m just moved, follow it 40833e519524SHoward Hinnant if (__m == __i) 40843e519524SHoward Hinnant __m = __j; 40853e519524SHoward Hinnant ++__i; 40863e519524SHoward Hinnant } 40873e519524SHoward Hinnant } 40883e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40893e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40903e519524SHoward Hinnant { 40913e519524SHoward Hinnant swap(*__i, *__m); 40923e519524SHoward Hinnant ++__n_swaps; 40933e519524SHoward Hinnant } 40943e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40953e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40963e519524SHoward Hinnant if (__n_swaps == 0) 40973e519524SHoward Hinnant { 4098ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4099ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 41003e519524SHoward Hinnant { 41013e519524SHoward Hinnant if (__fs) 41023e519524SHoward Hinnant return; 41033e519524SHoward Hinnant __last = __i; 41043e519524SHoward Hinnant continue; 41053e519524SHoward Hinnant } 41063e519524SHoward Hinnant else 41073e519524SHoward Hinnant { 41083e519524SHoward Hinnant if (__fs) 41093e519524SHoward Hinnant { 41103e519524SHoward Hinnant __first = ++__i; 41113e519524SHoward Hinnant continue; 41123e519524SHoward Hinnant } 41133e519524SHoward Hinnant } 41143e519524SHoward Hinnant } 41153e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41163e519524SHoward Hinnant if (__i - __first < __last - __i) 41173e519524SHoward Hinnant { 4118ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4119ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41203e519524SHoward Hinnant __first = ++__i; 41213e519524SHoward Hinnant } 41223e519524SHoward Hinnant else 41233e519524SHoward Hinnant { 4124ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4125ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41263e519524SHoward Hinnant __last = __i; 41273e519524SHoward Hinnant } 41283e519524SHoward Hinnant } 41293e519524SHoward Hinnant} 41303e519524SHoward Hinnant 41313e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41323e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41343e519524SHoward Hinnantvoid 41353e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41363e519524SHoward Hinnant{ 4137145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41403e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4141145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41433e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4144145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41453e519524SHoward Hinnant} 41463e519524SHoward Hinnant 41473e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41493e519524SHoward Hinnantvoid 41503e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41513e519524SHoward Hinnant{ 4152ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41533e519524SHoward Hinnant} 41543e519524SHoward Hinnant 41553e519524SHoward Hinnanttemplate <class _Tp> 41563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41573e519524SHoward Hinnantvoid 41583e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41593e519524SHoward Hinnant{ 4160ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41613e519524SHoward Hinnant} 41623e519524SHoward Hinnant 41633e519524SHoward Hinnanttemplate <class _Tp> 41643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41653e519524SHoward Hinnantvoid 41663e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41673e519524SHoward Hinnant{ 4168ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41693e519524SHoward Hinnant} 41703e519524SHoward Hinnant 4171f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4172f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4173f554add5SHoward Hinnantvoid 4174f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4175f554add5SHoward Hinnant{ 4176f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4177f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4178f554add5SHoward Hinnant} 4179f554add5SHoward Hinnant 41800be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4181e4383379SHoward Hinnant#pragma warning( push ) 4182e4383379SHoward Hinnant#pragma warning( disable: 4231) 41830be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4184f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4185f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4186f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4187f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4188f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4189f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4190f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4191f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4192f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4193f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4194f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4195f0544c20SHoward 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>&)) 4196f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4197f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4198f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41993e519524SHoward Hinnant 4200f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4201f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4202f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4203f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4204f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4205f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4206f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4207f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4208f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4209f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4210f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4211f0544c20SHoward 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>&)) 4212f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4213f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4214f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42153e519524SHoward Hinnant 4216f0544c20SHoward 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>&)) 42170be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4218e4383379SHoward Hinnant#pragma warning( pop ) 42190be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 42203e519524SHoward Hinnant 42213e519524SHoward Hinnant// lower_bound 42223e519524SHoward Hinnant 42233e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42243e519524SHoward Hinnant_ForwardIterator 4225e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42263e519524SHoward Hinnant{ 42273e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4228ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42293e519524SHoward Hinnant while (__len != 0) 42303e519524SHoward Hinnant { 42313e519524SHoward Hinnant difference_type __l2 = __len / 2; 42323e519524SHoward Hinnant _ForwardIterator __m = __first; 4233ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4234e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42353e519524SHoward Hinnant { 42363e519524SHoward Hinnant __first = ++__m; 42373e519524SHoward Hinnant __len -= __l2 + 1; 42383e519524SHoward Hinnant } 42393e519524SHoward Hinnant else 42403e519524SHoward Hinnant __len = __l2; 42413e519524SHoward Hinnant } 42423e519524SHoward Hinnant return __first; 42433e519524SHoward Hinnant} 42443e519524SHoward Hinnant 42453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42473e519524SHoward Hinnant_ForwardIterator 4248e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42493e519524SHoward Hinnant{ 4250145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42513e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42523e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4253e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4254145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42553e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4256e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4257145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42583e519524SHoward Hinnant} 42593e519524SHoward Hinnant 42603e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42623e519524SHoward Hinnant_ForwardIterator 4263e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42643e519524SHoward Hinnant{ 4265e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42663e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42673e519524SHoward Hinnant} 42683e519524SHoward Hinnant 42693e519524SHoward Hinnant// upper_bound 42703e519524SHoward Hinnant 42713e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42723e519524SHoward Hinnant_ForwardIterator 4273e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42743e519524SHoward Hinnant{ 42753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4276ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42773e519524SHoward Hinnant while (__len != 0) 42783e519524SHoward Hinnant { 42793e519524SHoward Hinnant difference_type __l2 = __len / 2; 42803e519524SHoward Hinnant _ForwardIterator __m = __first; 4281ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4282e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42833e519524SHoward Hinnant __len = __l2; 42843e519524SHoward Hinnant else 42853e519524SHoward Hinnant { 42863e519524SHoward Hinnant __first = ++__m; 42873e519524SHoward Hinnant __len -= __l2 + 1; 42883e519524SHoward Hinnant } 42893e519524SHoward Hinnant } 42903e519524SHoward Hinnant return __first; 42913e519524SHoward Hinnant} 42923e519524SHoward Hinnant 42933e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42953e519524SHoward Hinnant_ForwardIterator 4296e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42973e519524SHoward Hinnant{ 4298145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4301e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4302145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4304e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4305145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43063e519524SHoward Hinnant} 43073e519524SHoward Hinnant 43083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43103e519524SHoward Hinnant_ForwardIterator 4311e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43123e519524SHoward Hinnant{ 4313e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43143e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43153e519524SHoward Hinnant} 43163e519524SHoward Hinnant 43173e519524SHoward Hinnant// equal_range 43183e519524SHoward Hinnant 43193e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43203e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4321e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43223e519524SHoward Hinnant{ 43233e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4324ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43253e519524SHoward Hinnant while (__len != 0) 43263e519524SHoward Hinnant { 43273e519524SHoward Hinnant difference_type __l2 = __len / 2; 43283e519524SHoward Hinnant _ForwardIterator __m = __first; 4329ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4330e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43313e519524SHoward Hinnant { 43323e519524SHoward Hinnant __first = ++__m; 43333e519524SHoward Hinnant __len -= __l2 + 1; 43343e519524SHoward Hinnant } 4335e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43363e519524SHoward Hinnant { 43373e519524SHoward Hinnant __last = __m; 43383e519524SHoward Hinnant __len = __l2; 43393e519524SHoward Hinnant } 43403e519524SHoward Hinnant else 43413e519524SHoward Hinnant { 43423e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43433e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43443e519524SHoward Hinnant ( 4345e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4346e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43473e519524SHoward Hinnant ); 43483e519524SHoward Hinnant } 43493e519524SHoward Hinnant } 43503e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43513e519524SHoward Hinnant} 43523e519524SHoward Hinnant 43533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43553e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4356e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43573e519524SHoward Hinnant{ 4358145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4361e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4362145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4364e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4365145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43663e519524SHoward Hinnant} 43673e519524SHoward Hinnant 43683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43703e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4371e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43723e519524SHoward Hinnant{ 4373e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43743e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43753e519524SHoward Hinnant} 43763e519524SHoward Hinnant 43773e519524SHoward Hinnant// binary_search 43783e519524SHoward Hinnant 43793e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43813e519524SHoward Hinnantbool 4382e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43833e519524SHoward Hinnant{ 4384e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4385e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43863e519524SHoward Hinnant} 43873e519524SHoward Hinnant 43883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43903e519524SHoward Hinnantbool 4391e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43923e519524SHoward Hinnant{ 4393145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4396e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4397145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4399e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4400145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44013e519524SHoward Hinnant} 44023e519524SHoward Hinnant 44033e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44053e519524SHoward Hinnantbool 4406e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44073e519524SHoward Hinnant{ 4408e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44093e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44103e519524SHoward Hinnant} 44113e519524SHoward Hinnant 44123e519524SHoward Hinnant// merge 44133e519524SHoward Hinnant 44143e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44153e519524SHoward Hinnant_OutputIterator 44163e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44183e519524SHoward Hinnant{ 44193e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44203e519524SHoward Hinnant { 44213e519524SHoward Hinnant if (__first2 == __last2) 4422ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44233e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44243e519524SHoward Hinnant { 44253e519524SHoward Hinnant *__result = *__first2; 44263e519524SHoward Hinnant ++__first2; 44273e519524SHoward Hinnant } 44283e519524SHoward Hinnant else 44293e519524SHoward Hinnant { 44303e519524SHoward Hinnant *__result = *__first1; 44313e519524SHoward Hinnant ++__first1; 44323e519524SHoward Hinnant } 44333e519524SHoward Hinnant } 4434ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44353e519524SHoward Hinnant} 44363e519524SHoward Hinnant 44373e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44393e519524SHoward Hinnant_OutputIterator 44403e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44413e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44423e519524SHoward Hinnant{ 4443145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44443e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44453e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4446ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4447145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44483e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4449ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4450145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44513e519524SHoward Hinnant} 44523e519524SHoward Hinnant 44533e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44553e519524SHoward Hinnant_OutputIterator 44563e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44573e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44583e519524SHoward Hinnant{ 44593e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44603e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44613e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44623e519524SHoward Hinnant} 44633e519524SHoward Hinnant 44643e519524SHoward Hinnant// inplace_merge 44653e519524SHoward Hinnant 4466adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4467adfdae18SMarshall Clow class _OutputIterator> 4468adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4469adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4470adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4471adfdae18SMarshall Clow{ 4472adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4473adfdae18SMarshall Clow { 4474adfdae18SMarshall Clow if (__first2 == __last2) 4475adfdae18SMarshall Clow { 4476adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4477adfdae18SMarshall Clow return; 4478adfdae18SMarshall Clow } 4479adfdae18SMarshall Clow 4480adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4481adfdae18SMarshall Clow { 4482adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4483adfdae18SMarshall Clow ++__first2; 4484adfdae18SMarshall Clow } 4485adfdae18SMarshall Clow else 4486adfdae18SMarshall Clow { 4487adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4488adfdae18SMarshall Clow ++__first1; 4489adfdae18SMarshall Clow } 4490adfdae18SMarshall Clow } 4491adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4492adfdae18SMarshall Clow} 4493adfdae18SMarshall Clow 44943e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44953e519524SHoward Hinnantvoid 44963e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44973e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44983e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44993e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45003e519524SHoward Hinnant{ 45013e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45023e519524SHoward Hinnant __destruct_n __d(0); 45033e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45043e519524SHoward Hinnant if (__len1 <= __len2) 45053e519524SHoward Hinnant { 45063e519524SHoward Hinnant value_type* __p = __buff; 4507910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4508ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4509adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 45103e519524SHoward Hinnant } 45113e519524SHoward Hinnant else 45123e519524SHoward Hinnant { 45133e519524SHoward Hinnant value_type* __p = __buff; 4514910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4515ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 45163e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45173e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4518adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4519adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 45203e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 45213e519524SHoward Hinnant } 45223e519524SHoward Hinnant} 45233e519524SHoward Hinnant 45243e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45253e519524SHoward Hinnantvoid 45263e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45273e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45283e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45293e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45303e519524SHoward Hinnant{ 45313e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45323e519524SHoward Hinnant while (true) 45333e519524SHoward Hinnant { 45343e519524SHoward Hinnant // if __middle == __last, we're done 45353e519524SHoward Hinnant if (__len2 == 0) 45363e519524SHoward Hinnant return; 4537526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4538526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4539526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45403e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4541910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45423e519524SHoward Hinnant { 45433e519524SHoward Hinnant if (__len1 == 0) 45443e519524SHoward Hinnant return; 45453e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45463e519524SHoward Hinnant break; 45473e519524SHoward Hinnant } 45483e519524SHoward Hinnant // __first < __middle < __last 45493e519524SHoward Hinnant // *__first > *__middle 45503e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45513e519524SHoward Hinnant // all elements in: 45523e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45533e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45543e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45553e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45563e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45573e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45583e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45593e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45603e519524SHoward Hinnant // binary search smaller range 45613e519524SHoward Hinnant if (__len1 < __len2) 45623e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45633e519524SHoward Hinnant __len21 = __len2 / 2; 45643e519524SHoward Hinnant __m2 = __middle; 4565ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45663e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4567ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45683e519524SHoward Hinnant } 45693e519524SHoward Hinnant else 45703e519524SHoward Hinnant { 45713e519524SHoward Hinnant if (__len1 == 1) 45723e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45733e519524SHoward Hinnant // It is known *__first > *__middle 45743e519524SHoward Hinnant swap(*__first, *__middle); 45753e519524SHoward Hinnant return; 45763e519524SHoward Hinnant } 45773e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45783e519524SHoward Hinnant __len11 = __len1 / 2; 45793e519524SHoward Hinnant __m1 = __first; 4580ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45813e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4582ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45833e519524SHoward Hinnant } 45843e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45853e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45863e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45873e519524SHoward Hinnant // swap middle two partitions 4588ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45893e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45903e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45913e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45923e519524SHoward Hinnant { 45933e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45943e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45953e519524SHoward Hinnant __first = __middle; 45963e519524SHoward Hinnant __middle = __m2; 45973e519524SHoward Hinnant __len1 = __len12; 45983e519524SHoward Hinnant __len2 = __len22; 45993e519524SHoward Hinnant } 46003e519524SHoward Hinnant else 46013e519524SHoward Hinnant { 46023e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46033e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46043e519524SHoward Hinnant __last = __middle; 46053e519524SHoward Hinnant __middle = __m1; 46063e519524SHoward Hinnant __len1 = __len11; 46073e519524SHoward Hinnant __len2 = __len21; 46083e519524SHoward Hinnant } 46093e519524SHoward Hinnant } 46103e519524SHoward Hinnant} 46113e519524SHoward Hinnant 46123e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46143e519524SHoward Hinnantvoid 46153e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46163e519524SHoward Hinnant _Compare __comp) 46173e519524SHoward Hinnant{ 46183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46193e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4620ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4621ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4622ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46230b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46240b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46250b48cf9aSMarshall Clow 4626145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46273e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46283e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4629ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46303e519524SHoward Hinnant __buf.first, __buf.second); 4631145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4633ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46343e519524SHoward Hinnant __buf.first, __buf.second); 4635145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46363e519524SHoward Hinnant} 46373e519524SHoward Hinnant 46383e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46403e519524SHoward Hinnantvoid 46413e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46423e519524SHoward Hinnant{ 4643ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46443e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46453e519524SHoward Hinnant} 46463e519524SHoward Hinnant 46473e519524SHoward Hinnant// stable_sort 46483e519524SHoward Hinnant 46493e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 46503e519524SHoward Hinnantvoid 46513e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 46523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46533e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 46543e519524SHoward Hinnant{ 46553e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46563e519524SHoward Hinnant __destruct_n __d(0); 46573e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46583e519524SHoward Hinnant for (; true; ++__result) 46593e519524SHoward Hinnant { 46603e519524SHoward Hinnant if (__first1 == __last1) 46613e519524SHoward Hinnant { 46623e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4663ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46643e519524SHoward Hinnant __h.release(); 46653e519524SHoward Hinnant return; 46663e519524SHoward Hinnant } 46673e519524SHoward Hinnant if (__first2 == __last2) 46683e519524SHoward Hinnant { 46693e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4670ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46713e519524SHoward Hinnant __h.release(); 46723e519524SHoward Hinnant return; 46733e519524SHoward Hinnant } 46743e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46753e519524SHoward Hinnant { 4676ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46773e519524SHoward Hinnant __d.__incr((value_type*)0); 46783e519524SHoward Hinnant ++__first2; 46793e519524SHoward Hinnant } 46803e519524SHoward Hinnant else 46813e519524SHoward Hinnant { 4682ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46833e519524SHoward Hinnant __d.__incr((value_type*)0); 46843e519524SHoward Hinnant ++__first1; 46853e519524SHoward Hinnant } 46863e519524SHoward Hinnant } 46873e519524SHoward Hinnant} 46883e519524SHoward Hinnant 46893e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46903e519524SHoward Hinnantvoid 46913e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46933e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46943e519524SHoward Hinnant{ 46953e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46963e519524SHoward Hinnant { 46973e519524SHoward Hinnant if (__first2 == __last2) 46983e519524SHoward Hinnant { 46993e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4700ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47013e519524SHoward Hinnant return; 47023e519524SHoward Hinnant } 47033e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47043e519524SHoward Hinnant { 4705ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47063e519524SHoward Hinnant ++__first2; 47073e519524SHoward Hinnant } 47083e519524SHoward Hinnant else 47093e519524SHoward Hinnant { 4710ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47113e519524SHoward Hinnant ++__first1; 47123e519524SHoward Hinnant } 47133e519524SHoward Hinnant } 47143e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4715ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47163e519524SHoward Hinnant} 47173e519524SHoward Hinnant 47183e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47193e519524SHoward Hinnantvoid 47203e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47213e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47223e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47233e519524SHoward Hinnant 47243e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47253e519524SHoward Hinnantvoid 47263e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47273e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47283e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47293e519524SHoward Hinnant{ 47303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47313e519524SHoward Hinnant switch (__len) 47323e519524SHoward Hinnant { 47333e519524SHoward Hinnant case 0: 47343e519524SHoward Hinnant return; 47353e519524SHoward Hinnant case 1: 4736ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47373e519524SHoward Hinnant return; 47383e519524SHoward Hinnant case 2: 47393e519524SHoward Hinnant __destruct_n __d(0); 47403e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47413e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47423e519524SHoward Hinnant { 4743ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47443e519524SHoward Hinnant __d.__incr((value_type*)0); 47453e519524SHoward Hinnant ++__first2; 4746ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47473e519524SHoward Hinnant } 47483e519524SHoward Hinnant else 47493e519524SHoward Hinnant { 4750ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47513e519524SHoward Hinnant __d.__incr((value_type*)0); 47523e519524SHoward Hinnant ++__first2; 4753ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47543e519524SHoward Hinnant } 47553e519524SHoward Hinnant __h2.release(); 47563e519524SHoward Hinnant return; 47573e519524SHoward Hinnant } 47583e519524SHoward Hinnant if (__len <= 8) 47593e519524SHoward Hinnant { 47603e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47613e519524SHoward Hinnant return; 47623e519524SHoward Hinnant } 47633e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47643e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47653e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47663e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47673e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47683e519524SHoward Hinnant} 47693e519524SHoward Hinnant 47703e519524SHoward Hinnanttemplate <class _Tp> 47713e519524SHoward Hinnantstruct __stable_sort_switch 47723e519524SHoward Hinnant{ 4773ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47743e519524SHoward Hinnant}; 47753e519524SHoward Hinnant 47763e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47773e519524SHoward Hinnantvoid 47783e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47793e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47803e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47813e519524SHoward Hinnant{ 47823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47843e519524SHoward Hinnant switch (__len) 47853e519524SHoward Hinnant { 47863e519524SHoward Hinnant case 0: 47873e519524SHoward Hinnant case 1: 47883e519524SHoward Hinnant return; 47893e519524SHoward Hinnant case 2: 47903e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47913e519524SHoward Hinnant swap(*__first, *__last); 47923e519524SHoward Hinnant return; 47933e519524SHoward Hinnant } 47943e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47953e519524SHoward Hinnant { 47963e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47973e519524SHoward Hinnant return; 47983e519524SHoward Hinnant } 47993e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48003e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48013e519524SHoward Hinnant if (__len <= __buff_size) 48023e519524SHoward Hinnant { 48033e519524SHoward Hinnant __destruct_n __d(0); 48043e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48053e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 48063e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 48073e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 48083e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 48093e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48103e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 48113e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48123e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48133e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48143e519524SHoward Hinnant// __first, __comp); 48153e519524SHoward Hinnant return; 48163e519524SHoward Hinnant } 48173e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48183e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48193e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48203e519524SHoward Hinnant} 48213e519524SHoward Hinnant 48223e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48243e519524SHoward Hinnantvoid 48253e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48263e519524SHoward Hinnant{ 48273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48293e519524SHoward Hinnant difference_type __len = __last - __first; 48303e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48313e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48323e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48333e519524SHoward Hinnant { 4834ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48353e519524SHoward Hinnant __h.reset(__buf.first); 48363e519524SHoward Hinnant } 4837145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48403e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4841145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48433e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4844145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48453e519524SHoward Hinnant} 48463e519524SHoward Hinnant 48473e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48493e519524SHoward Hinnantvoid 48503e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 48513e519524SHoward Hinnant{ 4852ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48533e519524SHoward Hinnant} 48543e519524SHoward Hinnant 48553e519524SHoward Hinnant// is_heap_until 48563e519524SHoward Hinnant 48573e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48583e519524SHoward Hinnant_RandomAccessIterator 48593e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48603e519524SHoward Hinnant{ 4861ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48623e519524SHoward Hinnant difference_type __len = __last - __first; 48633e519524SHoward Hinnant difference_type __p = 0; 48643e519524SHoward Hinnant difference_type __c = 1; 48653e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48663e519524SHoward Hinnant while (__c < __len) 48673e519524SHoward Hinnant { 48683e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48693e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48703e519524SHoward Hinnant return __cp; 48713e519524SHoward Hinnant ++__c; 48723e519524SHoward Hinnant ++__cp; 48733e519524SHoward Hinnant if (__c == __len) 48743e519524SHoward Hinnant return __last; 48753e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48763e519524SHoward Hinnant return __cp; 48773e519524SHoward Hinnant ++__p; 48783e519524SHoward Hinnant ++__pp; 48793e519524SHoward Hinnant __c = 2 * __p + 1; 48803e519524SHoward Hinnant } 48813e519524SHoward Hinnant return __last; 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48863e519524SHoward Hinnant_RandomAccessIterator 48873e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48883e519524SHoward Hinnant{ 4889ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48903e519524SHoward Hinnant} 48913e519524SHoward Hinnant 48923e519524SHoward Hinnant// is_heap 48933e519524SHoward Hinnant 48943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48963e519524SHoward Hinnantbool 48973e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48983e519524SHoward Hinnant{ 4899ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49003e519524SHoward Hinnant} 49013e519524SHoward Hinnant 49023e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49043e519524SHoward Hinnantbool 49053e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49063e519524SHoward Hinnant{ 4907ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49083e519524SHoward Hinnant} 49093e519524SHoward Hinnant 49103e519524SHoward Hinnant// push_heap 49113e519524SHoward Hinnant 49123e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49133e519524SHoward Hinnantvoid 49148b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49153e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49163e519524SHoward Hinnant{ 49173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49183e519524SHoward Hinnant if (__len > 1) 49193e519524SHoward Hinnant { 49203e519524SHoward Hinnant __len = (__len - 2) / 2; 49213e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49223e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49233e519524SHoward Hinnant { 4924ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49253e519524SHoward Hinnant do 49263e519524SHoward Hinnant { 4927ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49283e519524SHoward Hinnant __last = __ptr; 49293e519524SHoward Hinnant if (__len == 0) 49303e519524SHoward Hinnant break; 49313e519524SHoward Hinnant __len = (__len - 1) / 2; 49323e519524SHoward Hinnant __ptr = __first + __len; 49333e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4934ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49353e519524SHoward Hinnant } 49363e519524SHoward Hinnant } 49373e519524SHoward Hinnant} 49383e519524SHoward Hinnant 49393e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49413e519524SHoward Hinnantvoid 49423e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49433e519524SHoward Hinnant{ 4944145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49478b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4948145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49508b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4951145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49523e519524SHoward Hinnant} 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49563e519524SHoward Hinnantvoid 49573e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49583e519524SHoward Hinnant{ 4959ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49603e519524SHoward Hinnant} 49613e519524SHoward Hinnant 49623e519524SHoward Hinnant// pop_heap 49633e519524SHoward Hinnant 49643e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49658b512602SDavid Majnemervoid 49668b512602SDavid Majnemer__sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49678b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49688b512602SDavid Majnemer _RandomAccessIterator __start) 49698b512602SDavid Majnemer{ 49708b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49718b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49728b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49738b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49748b512602SDavid Majnemer difference_type __child = __start - __first; 49758b512602SDavid Majnemer 49768b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49778b512602SDavid Majnemer return; 49788b512602SDavid Majnemer 49798b512602SDavid Majnemer __child = 2 * __child + 1; 49808b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49818b512602SDavid Majnemer 49828b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49838b512602SDavid Majnemer // right-child exists and is greater than left-child 49848b512602SDavid Majnemer ++__child_i; 49858b512602SDavid Majnemer ++__child; 49868b512602SDavid Majnemer } 49878b512602SDavid Majnemer 49888b512602SDavid Majnemer // check if we are in heap-order 49898b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49908b512602SDavid Majnemer // we are, __start is larger than it's largest child 49918b512602SDavid Majnemer return; 49928b512602SDavid Majnemer 49938b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49948b512602SDavid Majnemer do 49958b512602SDavid Majnemer { 49968b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49978b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49988b512602SDavid Majnemer __start = __child_i; 49998b512602SDavid Majnemer 50008b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50018b512602SDavid Majnemer break; 50028b512602SDavid Majnemer 50038b512602SDavid Majnemer // recompute the child based off of the updated parent 50048b512602SDavid Majnemer __child = 2 * __child + 1; 50058b512602SDavid Majnemer __child_i = __first + __child; 50068b512602SDavid Majnemer 50078b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50088b512602SDavid Majnemer // right-child exists and is greater than left-child 50098b512602SDavid Majnemer ++__child_i; 50108b512602SDavid Majnemer ++__child; 50118b512602SDavid Majnemer } 50128b512602SDavid Majnemer 50138b512602SDavid Majnemer // check if we are in heap-order 50148b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50158b512602SDavid Majnemer *__start = _VSTD::move(__top); 50168b512602SDavid Majnemer} 50178b512602SDavid Majnemer 50188b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50203e519524SHoward Hinnantvoid 50213e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50223e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50233e519524SHoward Hinnant{ 50243e519524SHoward Hinnant if (__len > 1) 50253e519524SHoward Hinnant { 50263e519524SHoward Hinnant swap(*__first, *--__last); 50278b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50283e519524SHoward Hinnant } 50293e519524SHoward Hinnant} 50303e519524SHoward Hinnant 50313e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50333e519524SHoward Hinnantvoid 50343e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50353e519524SHoward Hinnant{ 5036145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50373e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50383e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50393e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5040145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50413e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50423e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5043145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50443e519524SHoward Hinnant} 50453e519524SHoward Hinnant 50463e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50483e519524SHoward Hinnantvoid 50493e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50503e519524SHoward Hinnant{ 5051ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50523e519524SHoward Hinnant} 50533e519524SHoward Hinnant 50543e519524SHoward Hinnant// make_heap 50553e519524SHoward Hinnant 50563e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50573e519524SHoward Hinnantvoid 50583e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50593e519524SHoward Hinnant{ 50603e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50613e519524SHoward Hinnant difference_type __n = __last - __first; 50623e519524SHoward Hinnant if (__n > 1) 50633e519524SHoward Hinnant { 50648b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50658b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50668b512602SDavid Majnemer { 50678b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 50688b512602SDavid Majnemer } 50693e519524SHoward Hinnant } 50703e519524SHoward Hinnant} 50713e519524SHoward Hinnant 50723e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50743e519524SHoward Hinnantvoid 50753e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50763e519524SHoward Hinnant{ 5077145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50803e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5081145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50833e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5084145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50853e519524SHoward Hinnant} 50863e519524SHoward Hinnant 50873e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50893e519524SHoward Hinnantvoid 50903e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50913e519524SHoward Hinnant{ 5092ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50933e519524SHoward Hinnant} 50943e519524SHoward Hinnant 50953e519524SHoward Hinnant// sort_heap 50963e519524SHoward Hinnant 50973e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50983e519524SHoward Hinnantvoid 50993e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51003e519524SHoward Hinnant{ 51013e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51023e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 51033e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 51043e519524SHoward Hinnant} 51053e519524SHoward Hinnant 51063e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51083e519524SHoward Hinnantvoid 51093e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51103e519524SHoward Hinnant{ 5111145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51143e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5115145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51173e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5118145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51193e519524SHoward Hinnant} 51203e519524SHoward Hinnant 51213e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51233e519524SHoward Hinnantvoid 51243e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51253e519524SHoward Hinnant{ 5126ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51273e519524SHoward Hinnant} 51283e519524SHoward Hinnant 51293e519524SHoward Hinnant// partial_sort 51303e519524SHoward Hinnant 51313e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51323e519524SHoward Hinnantvoid 51333e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51343e519524SHoward Hinnant _Compare __comp) 51353e519524SHoward Hinnant{ 51363e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51383e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51393e519524SHoward Hinnant { 51403e519524SHoward Hinnant if (__comp(*__i, *__first)) 51413e519524SHoward Hinnant { 51423e519524SHoward Hinnant swap(*__i, *__first); 51438b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51443e519524SHoward Hinnant } 51453e519524SHoward Hinnant } 51463e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51473e519524SHoward Hinnant} 51483e519524SHoward Hinnant 51493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51513e519524SHoward Hinnantvoid 51523e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51533e519524SHoward Hinnant _Compare __comp) 51543e519524SHoward Hinnant{ 5155145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51563e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51573e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51583e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5159145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51613e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5162145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51633e519524SHoward Hinnant} 51643e519524SHoward Hinnant 51653e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51673e519524SHoward Hinnantvoid 51683e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51693e519524SHoward Hinnant{ 5170ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 51713e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51723e519524SHoward Hinnant} 51733e519524SHoward Hinnant 51743e519524SHoward Hinnant// partial_sort_copy 51753e519524SHoward Hinnant 51763e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 51773e519524SHoward Hinnant_RandomAccessIterator 51783e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51793e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51803e519524SHoward Hinnant{ 51813e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51823e519524SHoward Hinnant if (__r != __result_last) 51833e519524SHoward Hinnant { 5184910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51853e519524SHoward Hinnant *__r = *__first; 51863e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51878b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51883e519524SHoward Hinnant for (; __first != __last; ++__first) 51893e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51903e519524SHoward Hinnant { 51913e519524SHoward Hinnant *__result_first = *__first; 51928b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51933e519524SHoward Hinnant } 51943e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51953e519524SHoward Hinnant } 51963e519524SHoward Hinnant return __r; 51973e519524SHoward Hinnant} 51983e519524SHoward Hinnant 51993e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52013e519524SHoward Hinnant_RandomAccessIterator 52023e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52033e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52043e519524SHoward Hinnant{ 5205145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52083e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5209145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52113e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5212145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52133e519524SHoward Hinnant} 52143e519524SHoward Hinnant 52153e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52173e519524SHoward Hinnant_RandomAccessIterator 52183e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52193e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52203e519524SHoward Hinnant{ 5221ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52223e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52233e519524SHoward Hinnant} 52243e519524SHoward Hinnant 52253e519524SHoward Hinnant// nth_element 52263e519524SHoward Hinnant 52273e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52283e519524SHoward Hinnantvoid 52293e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52303e519524SHoward Hinnant{ 52313e519524SHoward Hinnant // _Compare is known to be a reference type 52323e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52333e519524SHoward Hinnant const difference_type __limit = 7; 52343e519524SHoward Hinnant while (true) 52353e519524SHoward Hinnant { 52363e519524SHoward Hinnant __restart: 5237b34b4819SHoward Hinnant if (__nth == __last) 5238b34b4819SHoward Hinnant return; 52393e519524SHoward Hinnant difference_type __len = __last - __first; 52403e519524SHoward Hinnant switch (__len) 52413e519524SHoward Hinnant { 52423e519524SHoward Hinnant case 0: 52433e519524SHoward Hinnant case 1: 52443e519524SHoward Hinnant return; 52453e519524SHoward Hinnant case 2: 52463e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52473e519524SHoward Hinnant swap(*__first, *__last); 52483e519524SHoward Hinnant return; 52493e519524SHoward Hinnant case 3: 52503e519524SHoward Hinnant { 52513e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5252ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52533e519524SHoward Hinnant return; 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnant } 52563e519524SHoward Hinnant if (__len <= __limit) 52573e519524SHoward Hinnant { 52583e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 52593e519524SHoward Hinnant return; 52603e519524SHoward Hinnant } 52613e519524SHoward Hinnant // __len > __limit >= 3 52623e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 52633e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5264ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52653e519524SHoward Hinnant // *__m is median 52663e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 52673e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 52683e519524SHoward Hinnant _RandomAccessIterator __i = __first; 52693e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 52703e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52713e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 52723e519524SHoward Hinnant // Prime the downward search with a guard. 52733e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 52743e519524SHoward Hinnant { 52753e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 52763e519524SHoward Hinnant // manually guard downward moving __j against __i 52773e519524SHoward Hinnant while (true) 52783e519524SHoward Hinnant { 52793e519524SHoward Hinnant if (__i == --__j) 52803e519524SHoward Hinnant { 52813e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52823e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52833e519524SHoward Hinnant ++__i; // __first + 1 52843e519524SHoward Hinnant __j = __last; 52853e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52863e519524SHoward Hinnant { 52873e519524SHoward Hinnant while (true) 52883e519524SHoward Hinnant { 52893e519524SHoward Hinnant if (__i == __j) 52903e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52913e519524SHoward Hinnant if (__comp(*__first, *__i)) 52923e519524SHoward Hinnant { 52933e519524SHoward Hinnant swap(*__i, *__j); 52943e519524SHoward Hinnant ++__n_swaps; 52953e519524SHoward Hinnant ++__i; 52963e519524SHoward Hinnant break; 52973e519524SHoward Hinnant } 52983e519524SHoward Hinnant ++__i; 52993e519524SHoward Hinnant } 53003e519524SHoward Hinnant } 53013e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53023e519524SHoward Hinnant if (__i == __j) 53033e519524SHoward Hinnant return; 53043e519524SHoward Hinnant while (true) 53053e519524SHoward Hinnant { 53063e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53073e519524SHoward Hinnant ++__i; 53083e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53093e519524SHoward Hinnant ; 53103e519524SHoward Hinnant if (__i >= __j) 53113e519524SHoward Hinnant break; 53123e519524SHoward Hinnant swap(*__i, *__j); 53133e519524SHoward Hinnant ++__n_swaps; 53143e519524SHoward Hinnant ++__i; 53153e519524SHoward Hinnant } 53163e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53173e519524SHoward Hinnant // The first part is sorted, 53183e519524SHoward Hinnant if (__nth < __i) 53193e519524SHoward Hinnant return; 53203e519524SHoward Hinnant // __nth_element the secod part 53213e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53223e519524SHoward Hinnant __first = __i; 53233e519524SHoward Hinnant goto __restart; 53243e519524SHoward Hinnant } 53253e519524SHoward Hinnant if (__comp(*__j, *__m)) 53263e519524SHoward Hinnant { 53273e519524SHoward Hinnant swap(*__i, *__j); 53283e519524SHoward Hinnant ++__n_swaps; 53293e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53303e519524SHoward Hinnant } 53313e519524SHoward Hinnant } 53323e519524SHoward Hinnant } 53333e519524SHoward Hinnant ++__i; 53343e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53353e519524SHoward Hinnant // if not yet partitioned... 53363e519524SHoward Hinnant if (__i < __j) 53373e519524SHoward Hinnant { 53383e519524SHoward Hinnant // known that *(__i - 1) < *__m 53393e519524SHoward Hinnant while (true) 53403e519524SHoward Hinnant { 53413e519524SHoward Hinnant // __m still guards upward moving __i 53423e519524SHoward Hinnant while (__comp(*__i, *__m)) 53433e519524SHoward Hinnant ++__i; 53443e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53453e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53463e519524SHoward Hinnant ; 53473e519524SHoward Hinnant if (__i >= __j) 53483e519524SHoward Hinnant break; 53493e519524SHoward Hinnant swap(*__i, *__j); 53503e519524SHoward Hinnant ++__n_swaps; 53513e519524SHoward Hinnant // It is known that __m != __j 53523e519524SHoward Hinnant // If __m just moved, follow it 53533e519524SHoward Hinnant if (__m == __i) 53543e519524SHoward Hinnant __m = __j; 53553e519524SHoward Hinnant ++__i; 53563e519524SHoward Hinnant } 53573e519524SHoward Hinnant } 53583e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53593e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53603e519524SHoward Hinnant { 53613e519524SHoward Hinnant swap(*__i, *__m); 53623e519524SHoward Hinnant ++__n_swaps; 53633e519524SHoward Hinnant } 53643e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53653e519524SHoward Hinnant if (__nth == __i) 53663e519524SHoward Hinnant return; 53673e519524SHoward Hinnant if (__n_swaps == 0) 53683e519524SHoward Hinnant { 53693e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53703e519524SHoward Hinnant if (__nth < __i) 53713e519524SHoward Hinnant { 53723e519524SHoward Hinnant // Check for [__first, __i) already sorted 53733e519524SHoward Hinnant __j = __m = __first; 53743e519524SHoward Hinnant while (++__j != __i) 53753e519524SHoward Hinnant { 53763e519524SHoward Hinnant if (__comp(*__j, *__m)) 53773e519524SHoward Hinnant // not yet sorted, so sort 53783e519524SHoward Hinnant goto not_sorted; 53793e519524SHoward Hinnant __m = __j; 53803e519524SHoward Hinnant } 53813e519524SHoward Hinnant // [__first, __i) sorted 53823e519524SHoward Hinnant return; 53833e519524SHoward Hinnant } 53843e519524SHoward Hinnant else 53853e519524SHoward Hinnant { 53863e519524SHoward Hinnant // Check for [__i, __last) already sorted 53873e519524SHoward Hinnant __j = __m = __i; 53883e519524SHoward Hinnant while (++__j != __last) 53893e519524SHoward Hinnant { 53903e519524SHoward Hinnant if (__comp(*__j, *__m)) 53913e519524SHoward Hinnant // not yet sorted, so sort 53923e519524SHoward Hinnant goto not_sorted; 53933e519524SHoward Hinnant __m = __j; 53943e519524SHoward Hinnant } 53953e519524SHoward Hinnant // [__i, __last) sorted 53963e519524SHoward Hinnant return; 53973e519524SHoward Hinnant } 53983e519524SHoward Hinnant } 53993e519524SHoward Hinnantnot_sorted: 54003e519524SHoward Hinnant // __nth_element on range containing __nth 54013e519524SHoward Hinnant if (__nth < __i) 54023e519524SHoward Hinnant { 54033e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 54043e519524SHoward Hinnant __last = __i; 54053e519524SHoward Hinnant } 54063e519524SHoward Hinnant else 54073e519524SHoward Hinnant { 54083e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 54093e519524SHoward Hinnant __first = ++__i; 54103e519524SHoward Hinnant } 54113e519524SHoward Hinnant } 54123e519524SHoward Hinnant} 54133e519524SHoward Hinnant 54143e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54163e519524SHoward Hinnantvoid 54173e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54183e519524SHoward Hinnant{ 5419145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54223e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5423145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54253e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5426145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54273e519524SHoward Hinnant} 54283e519524SHoward Hinnant 54293e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54313e519524SHoward Hinnantvoid 54323e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54333e519524SHoward Hinnant{ 5434ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54353e519524SHoward Hinnant} 54363e519524SHoward Hinnant 54373e519524SHoward Hinnant// includes 54383e519524SHoward Hinnant 54393e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54403e519524SHoward Hinnantbool 54413e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54423e519524SHoward Hinnant _Compare __comp) 54433e519524SHoward Hinnant{ 54443e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54453e519524SHoward Hinnant { 54463e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54473e519524SHoward Hinnant return false; 54483e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54493e519524SHoward Hinnant ++__first2; 54503e519524SHoward Hinnant } 54513e519524SHoward Hinnant return true; 54523e519524SHoward Hinnant} 54533e519524SHoward Hinnant 54543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 54553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54563e519524SHoward Hinnantbool 54573e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54583e519524SHoward Hinnant _Compare __comp) 54593e519524SHoward Hinnant{ 5460145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54633e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5464145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54653e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54663e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5467145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54683e519524SHoward Hinnant} 54693e519524SHoward Hinnant 54703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 54713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54723e519524SHoward Hinnantbool 54733e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 54743e519524SHoward Hinnant{ 5475ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 54763e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54773e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54783e519524SHoward Hinnant} 54793e519524SHoward Hinnant 54803e519524SHoward Hinnant// set_union 54813e519524SHoward Hinnant 54823e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54833e519524SHoward Hinnant_OutputIterator 54843e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54863e519524SHoward Hinnant{ 54873e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54883e519524SHoward Hinnant { 54893e519524SHoward Hinnant if (__first2 == __last2) 5490ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54913e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54923e519524SHoward Hinnant { 54933e519524SHoward Hinnant *__result = *__first2; 54943e519524SHoward Hinnant ++__first2; 54953e519524SHoward Hinnant } 54963e519524SHoward Hinnant else 54973e519524SHoward Hinnant { 54983e519524SHoward Hinnant *__result = *__first1; 54993e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55003e519524SHoward Hinnant ++__first2; 55013e519524SHoward Hinnant ++__first1; 55023e519524SHoward Hinnant } 55033e519524SHoward Hinnant } 5504ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55053e519524SHoward Hinnant} 55063e519524SHoward Hinnant 55073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55093e519524SHoward Hinnant_OutputIterator 55103e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55123e519524SHoward Hinnant{ 5513145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55163e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5517145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55193e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5520145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55213e519524SHoward Hinnant} 55223e519524SHoward Hinnant 55233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55253e519524SHoward Hinnant_OutputIterator 55263e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55273e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55283e519524SHoward Hinnant{ 5529ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55303e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55313e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55323e519524SHoward Hinnant} 55333e519524SHoward Hinnant 55343e519524SHoward Hinnant// set_intersection 55353e519524SHoward Hinnant 55363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55373e519524SHoward Hinnant_OutputIterator 55383e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55403e519524SHoward Hinnant{ 55413e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55423e519524SHoward Hinnant { 55433e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55443e519524SHoward Hinnant ++__first1; 55453e519524SHoward Hinnant else 55463e519524SHoward Hinnant { 55473e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55483e519524SHoward Hinnant { 55493e519524SHoward Hinnant *__result = *__first1; 55503e519524SHoward Hinnant ++__result; 55513e519524SHoward Hinnant ++__first1; 55523e519524SHoward Hinnant } 55533e519524SHoward Hinnant ++__first2; 55543e519524SHoward Hinnant } 55553e519524SHoward Hinnant } 55563e519524SHoward Hinnant return __result; 55573e519524SHoward Hinnant} 55583e519524SHoward Hinnant 55593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55613e519524SHoward Hinnant_OutputIterator 55623e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55643e519524SHoward Hinnant{ 5565145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55683e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5569145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55713e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5572145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55733e519524SHoward Hinnant} 55743e519524SHoward Hinnant 55753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55773e519524SHoward Hinnant_OutputIterator 55783e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55803e519524SHoward Hinnant{ 5581ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55823e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55833e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55843e519524SHoward Hinnant} 55853e519524SHoward Hinnant 55863e519524SHoward Hinnant// set_difference 55873e519524SHoward Hinnant 55883e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55893e519524SHoward Hinnant_OutputIterator 55903e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55923e519524SHoward Hinnant{ 55933e519524SHoward Hinnant while (__first1 != __last1) 55943e519524SHoward Hinnant { 55953e519524SHoward Hinnant if (__first2 == __last2) 5596ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55973e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55983e519524SHoward Hinnant { 55993e519524SHoward Hinnant *__result = *__first1; 56003e519524SHoward Hinnant ++__result; 56013e519524SHoward Hinnant ++__first1; 56023e519524SHoward Hinnant } 56033e519524SHoward Hinnant else 56043e519524SHoward Hinnant { 56053e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56063e519524SHoward Hinnant ++__first1; 56073e519524SHoward Hinnant ++__first2; 56083e519524SHoward Hinnant } 56093e519524SHoward Hinnant } 56103e519524SHoward Hinnant return __result; 56113e519524SHoward Hinnant} 56123e519524SHoward Hinnant 56133e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56153e519524SHoward Hinnant_OutputIterator 56163e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56173e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56183e519524SHoward Hinnant{ 5619145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56203e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56213e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56223e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5623145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56243e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56253e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5626145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56273e519524SHoward Hinnant} 56283e519524SHoward Hinnant 56293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56313e519524SHoward Hinnant_OutputIterator 56323e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56343e519524SHoward Hinnant{ 5635ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56363e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56373e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56383e519524SHoward Hinnant} 56393e519524SHoward Hinnant 56403e519524SHoward Hinnant// set_symmetric_difference 56413e519524SHoward Hinnant 56423e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56433e519524SHoward Hinnant_OutputIterator 56443e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56453e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56463e519524SHoward Hinnant{ 56473e519524SHoward Hinnant while (__first1 != __last1) 56483e519524SHoward Hinnant { 56493e519524SHoward Hinnant if (__first2 == __last2) 5650ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56513e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56523e519524SHoward Hinnant { 56533e519524SHoward Hinnant *__result = *__first1; 56543e519524SHoward Hinnant ++__result; 56553e519524SHoward Hinnant ++__first1; 56563e519524SHoward Hinnant } 56573e519524SHoward Hinnant else 56583e519524SHoward Hinnant { 56593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56603e519524SHoward Hinnant { 56613e519524SHoward Hinnant *__result = *__first2; 56623e519524SHoward Hinnant ++__result; 56633e519524SHoward Hinnant } 56643e519524SHoward Hinnant else 56653e519524SHoward Hinnant ++__first1; 56663e519524SHoward Hinnant ++__first2; 56673e519524SHoward Hinnant } 56683e519524SHoward Hinnant } 5669ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56703e519524SHoward Hinnant} 56713e519524SHoward Hinnant 56723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56743e519524SHoward Hinnant_OutputIterator 56753e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56763e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56773e519524SHoward Hinnant{ 5678145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56813e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5682145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56843e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5685145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56863e519524SHoward Hinnant} 56873e519524SHoward Hinnant 56883e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56903e519524SHoward Hinnant_OutputIterator 56913e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56923e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56933e519524SHoward Hinnant{ 5694ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56953e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56963e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56973e519524SHoward Hinnant} 56983e519524SHoward Hinnant 56993e519524SHoward Hinnant// lexicographical_compare 57003e519524SHoward Hinnant 57013e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57023e519524SHoward Hinnantbool 57033e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57043e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57053e519524SHoward Hinnant{ 5706910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57073e519524SHoward Hinnant { 57083e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57093e519524SHoward Hinnant return true; 57103e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57113e519524SHoward Hinnant return false; 57123e519524SHoward Hinnant } 57133e519524SHoward Hinnant return false; 57143e519524SHoward Hinnant} 57153e519524SHoward Hinnant 57163e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57183e519524SHoward Hinnantbool 57193e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57213e519524SHoward Hinnant{ 5722145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57253e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5726145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57283e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5729145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57303e519524SHoward Hinnant} 57313e519524SHoward Hinnant 57323e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57343e519524SHoward Hinnantbool 57353e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57363e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57373e519524SHoward Hinnant{ 5738ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57393e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57403e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57413e519524SHoward Hinnant} 57423e519524SHoward Hinnant 57433e519524SHoward Hinnant// next_permutation 57443e519524SHoward Hinnant 57453e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57463e519524SHoward Hinnantbool 57473e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57483e519524SHoward Hinnant{ 57493e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57503e519524SHoward Hinnant if (__first == __last || __first == --__i) 57513e519524SHoward Hinnant return false; 57523e519524SHoward Hinnant while (true) 57533e519524SHoward Hinnant { 57543e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57553e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57563e519524SHoward Hinnant { 57573e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57583e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57593e519524SHoward Hinnant ; 57603e519524SHoward Hinnant swap(*__i, *__j); 5761ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57623e519524SHoward Hinnant return true; 57633e519524SHoward Hinnant } 57643e519524SHoward Hinnant if (__i == __first) 57653e519524SHoward Hinnant { 5766ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57673e519524SHoward Hinnant return false; 57683e519524SHoward Hinnant } 57693e519524SHoward Hinnant } 57703e519524SHoward Hinnant} 57713e519524SHoward Hinnant 57723e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57743e519524SHoward Hinnantbool 57753e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57763e519524SHoward Hinnant{ 5777145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57803e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5781145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57833e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5784145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57853e519524SHoward Hinnant} 57863e519524SHoward Hinnant 57873e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57893e519524SHoward Hinnantbool 57903e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57913e519524SHoward Hinnant{ 5792ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57933e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57943e519524SHoward Hinnant} 57953e519524SHoward Hinnant 57963e519524SHoward Hinnant// prev_permutation 57973e519524SHoward Hinnant 57983e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57993e519524SHoward Hinnantbool 58003e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58013e519524SHoward Hinnant{ 58023e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58033e519524SHoward Hinnant if (__first == __last || __first == --__i) 58043e519524SHoward Hinnant return false; 58053e519524SHoward Hinnant while (true) 58063e519524SHoward Hinnant { 58073e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58083e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58093e519524SHoward Hinnant { 58103e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58113e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58123e519524SHoward Hinnant ; 58133e519524SHoward Hinnant swap(*__i, *__j); 5814ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58153e519524SHoward Hinnant return true; 58163e519524SHoward Hinnant } 58173e519524SHoward Hinnant if (__i == __first) 58183e519524SHoward Hinnant { 5819ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58203e519524SHoward Hinnant return false; 58213e519524SHoward Hinnant } 58223e519524SHoward Hinnant } 58233e519524SHoward Hinnant} 58243e519524SHoward Hinnant 58253e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58273e519524SHoward Hinnantbool 58283e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58293e519524SHoward Hinnant{ 5830145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58333e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5834145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58363e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5837145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58383e519524SHoward Hinnant} 58393e519524SHoward Hinnant 58403e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58423e519524SHoward Hinnantbool 58433e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58443e519524SHoward Hinnant{ 5845ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58463e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58473e519524SHoward Hinnant} 58483e519524SHoward Hinnant 58493e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58503e519524SHoward Hinnant 58513e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5852