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 291e7154709SEric Fiseliertemplate<class PopulationIterator, class SampleIterator, 292e7154709SEric Fiselier class Distance, class UniformRandomBitGenerator> 293e7154709SEric Fiselier SampleIterator sample(PopulationIterator first, PopulationIterator last, 294e7154709SEric Fiselier SampleIterator out, Distance n, 295e7154709SEric Fiselier UniformRandomBitGenerator&& g); // C++17 296e7154709SEric 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); 8801c7fe126SMarshall Clow return __f; 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 1497b9775795SAditya Kumar 14983e519524SHoward Hinnant while (true) 14993e519524SHoward Hinnant { 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 } 1508b9775795SAditya Kumar 15093e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15103e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15113e519524SHoward Hinnant while (true) 15123e519524SHoward Hinnant { 15133e519524SHoward Hinnant if (++__m2 == __last2) 151428cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15153e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15163e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15173e519524SHoward Hinnant { 15183e519524SHoward Hinnant ++__first1; 15193e519524SHoward Hinnant break; 15203e519524SHoward Hinnant } 15213e519524SHoward Hinnant } 15223e519524SHoward Hinnant } 15233e519524SHoward Hinnant} 15243e519524SHoward Hinnant 15253e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15273e519524SHoward Hinnant_ForwardIterator1 15283e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15293e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15303e519524SHoward Hinnant{ 1531ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15323e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 153328cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 153428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 153528cc4ddeSMarshall Clow .first; 15363e519524SHoward Hinnant} 15373e519524SHoward Hinnant 15383e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15403e519524SHoward Hinnant_ForwardIterator1 15413e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15423e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15433e519524SHoward Hinnant{ 154428cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 154528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1546ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15473e519524SHoward Hinnant} 15483e519524SHoward Hinnant 15493e519524SHoward Hinnant// search_n 15503e519524SHoward Hinnant 15513e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15523e519524SHoward Hinnant_ForwardIterator 15533e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1554e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15553e519524SHoward Hinnant{ 15563e519524SHoward Hinnant if (__count <= 0) 15573e519524SHoward Hinnant return __first; 15583e519524SHoward Hinnant while (true) 15593e519524SHoward Hinnant { 1560e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 15613e519524SHoward Hinnant while (true) 15623e519524SHoward Hinnant { 1563e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 15643e519524SHoward Hinnant return __last; 1565e4383379SHoward Hinnant if (__pred(*__first, __value_)) 15663e519524SHoward Hinnant break; 15673e519524SHoward Hinnant ++__first; 15683e519524SHoward Hinnant } 1569e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 15703e519524SHoward Hinnant _ForwardIterator __m = __first; 15713e519524SHoward Hinnant _Size __c(0); 15723e519524SHoward Hinnant while (true) 15733e519524SHoward Hinnant { 15743e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 15753e519524SHoward Hinnant return __first; 15763e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 15773e519524SHoward Hinnant return __last; 1578e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 15793e519524SHoward Hinnant { 15803e519524SHoward Hinnant __first = __m; 15813e519524SHoward Hinnant ++__first; 15823e519524SHoward Hinnant break; 15833e519524SHoward Hinnant } // else there is a match, check next elements 15843e519524SHoward Hinnant } 15853e519524SHoward Hinnant } 15863e519524SHoward Hinnant} 15873e519524SHoward Hinnant 15883e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 15893e519524SHoward Hinnant_RandomAccessIterator 15903e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1591e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 15923e519524SHoward Hinnant{ 15933e519524SHoward Hinnant if (__count <= 0) 15943e519524SHoward Hinnant return __first; 15953e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 15963e519524SHoward Hinnant if (__len < __count) 15973e519524SHoward Hinnant return __last; 15983e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 15993e519524SHoward Hinnant while (true) 16003e519524SHoward Hinnant { 1601e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16023e519524SHoward Hinnant while (true) 16033e519524SHoward Hinnant { 1604b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16053e519524SHoward Hinnant return __last; 1606e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16073e519524SHoward Hinnant break; 16083e519524SHoward Hinnant ++__first; 16093e519524SHoward Hinnant } 1610e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16113e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16123e519524SHoward Hinnant _Size __c(0); 16133e519524SHoward Hinnant while (true) 16143e519524SHoward Hinnant { 16153e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16163e519524SHoward Hinnant return __first; 16173e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1618e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16193e519524SHoward Hinnant { 16203e519524SHoward Hinnant __first = __m; 16213e519524SHoward Hinnant ++__first; 16223e519524SHoward Hinnant break; 16233e519524SHoward Hinnant } // else there is a match, check next elements 16243e519524SHoward Hinnant } 16253e519524SHoward Hinnant } 16263e519524SHoward Hinnant} 16273e519524SHoward Hinnant 16283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16303e519524SHoward Hinnant_ForwardIterator 16313e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1632e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16333e519524SHoward Hinnant{ 1634ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 163551544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 163651544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16373e519524SHoward Hinnant} 16383e519524SHoward Hinnant 16393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16413e519524SHoward Hinnant_ForwardIterator 1642e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16433e519524SHoward Hinnant{ 16443e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 164551544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 164651544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16473e519524SHoward Hinnant} 16483e519524SHoward Hinnant 16493e519524SHoward Hinnant// copy 16503e519524SHoward Hinnanttemplate <class _Iter> 16513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16523e519524SHoward Hinnant_Iter 16533e519524SHoward Hinnant__unwrap_iter(_Iter __i) 16543e519524SHoward Hinnant{ 16553e519524SHoward Hinnant return __i; 16563e519524SHoward Hinnant} 16573e519524SHoward Hinnant 16583e519524SHoward Hinnanttemplate <class _Tp> 16593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16603e519524SHoward Hinnanttypename enable_if 16613e519524SHoward Hinnant< 1662ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16633e519524SHoward Hinnant _Tp* 16643e519524SHoward Hinnant>::type 16653e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 16663e519524SHoward Hinnant{ 16673e519524SHoward Hinnant return __i.base(); 16683e519524SHoward Hinnant} 16693e519524SHoward Hinnant 1670fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1671fc88dbd2SHoward Hinnant 16723e519524SHoward Hinnanttemplate <class _Tp> 16733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16743e519524SHoward Hinnanttypename enable_if 16753e519524SHoward Hinnant< 1676ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 16773e519524SHoward Hinnant _Tp* 16783e519524SHoward Hinnant>::type 16793e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 16803e519524SHoward Hinnant{ 16813e519524SHoward Hinnant return __i.base(); 16823e519524SHoward Hinnant} 16833e519524SHoward Hinnant 1684fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1685fc88dbd2SHoward Hinnant 16863e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 16873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16883e519524SHoward Hinnant_OutputIterator 16893e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 16903e519524SHoward Hinnant{ 1691910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 16923e519524SHoward Hinnant *__result = *__first; 16933e519524SHoward Hinnant return __result; 16943e519524SHoward Hinnant} 16953e519524SHoward Hinnant 16963e519524SHoward Hinnanttemplate <class _Tp, class _Up> 16973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16983e519524SHoward Hinnanttypename enable_if 16993e519524SHoward Hinnant< 17003e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1701ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17023e519524SHoward Hinnant _Up* 17033e519524SHoward Hinnant>::type 17043e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17075b312052SMarshall Clow if (__n > 0) 1708ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17093e519524SHoward Hinnant return __result + __n; 17103e519524SHoward Hinnant} 17113e519524SHoward Hinnant 17123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17143e519524SHoward Hinnant_OutputIterator 17153e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17163e519524SHoward Hinnant{ 1717ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17183e519524SHoward Hinnant} 17193e519524SHoward Hinnant 17203e519524SHoward Hinnant// copy_backward 17213e519524SHoward Hinnant 1722d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17243e519524SHoward Hinnant_OutputIterator 1725d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17263e519524SHoward Hinnant{ 17273e519524SHoward Hinnant while (__first != __last) 17283e519524SHoward Hinnant *--__result = *--__last; 17293e519524SHoward Hinnant return __result; 17303e519524SHoward Hinnant} 17313e519524SHoward Hinnant 17323e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17343e519524SHoward Hinnanttypename enable_if 17353e519524SHoward Hinnant< 17363e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1737ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17383e519524SHoward Hinnant _Up* 17393e519524SHoward Hinnant>::type 17403e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17413e519524SHoward Hinnant{ 17423e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17435b312052SMarshall Clow if (__n > 0) 17445b312052SMarshall Clow { 17453e519524SHoward Hinnant __result -= __n; 1746ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17475b312052SMarshall Clow } 17483e519524SHoward Hinnant return __result; 17493e519524SHoward Hinnant} 17503e519524SHoward Hinnant 17513e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 17523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17533e519524SHoward Hinnant_BidirectionalIterator2 17543e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 17553e519524SHoward Hinnant _BidirectionalIterator2 __result) 17563e519524SHoward Hinnant{ 1757*fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1758*fd838227SEric Fiselier __unwrap_iter(__last), 1759*fd838227SEric Fiselier __unwrap_iter(__result)); 17603e519524SHoward Hinnant} 17613e519524SHoward Hinnant 17623e519524SHoward Hinnant// copy_if 17633e519524SHoward Hinnant 17643e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 17653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17663e519524SHoward Hinnant_OutputIterator 17673e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 17683e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 17693e519524SHoward Hinnant{ 17703e519524SHoward Hinnant for (; __first != __last; ++__first) 17713e519524SHoward Hinnant { 17723e519524SHoward Hinnant if (__pred(*__first)) 17733e519524SHoward Hinnant { 17743e519524SHoward Hinnant *__result = *__first; 17753e519524SHoward Hinnant ++__result; 17763e519524SHoward Hinnant } 17773e519524SHoward Hinnant } 17783e519524SHoward Hinnant return __result; 17793e519524SHoward Hinnant} 17803e519524SHoward Hinnant 17813e519524SHoward Hinnant// copy_n 17823e519524SHoward Hinnant 17833e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 17843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17853e519524SHoward Hinnanttypename enable_if 17863e519524SHoward Hinnant< 17873e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 17883e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 17893e519524SHoward Hinnant _OutputIterator 17903e519524SHoward Hinnant>::type 179151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 17923e519524SHoward Hinnant{ 179351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 179451544023SEric Fiselier _IntegralSize __n = __orig_n; 179599847d2bSHoward Hinnant if (__n > 0) 179699847d2bSHoward Hinnant { 17973e519524SHoward Hinnant *__result = *__first; 179899847d2bSHoward Hinnant ++__result; 179999847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 180099847d2bSHoward Hinnant { 180199847d2bSHoward Hinnant ++__first; 180299847d2bSHoward Hinnant *__result = *__first; 180399847d2bSHoward Hinnant ++__result; 180499847d2bSHoward Hinnant } 180599847d2bSHoward Hinnant } 18063e519524SHoward Hinnant return __result; 18073e519524SHoward Hinnant} 18083e519524SHoward Hinnant 18093e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18113e519524SHoward Hinnanttypename enable_if 18123e519524SHoward Hinnant< 18133e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18143e519524SHoward Hinnant _OutputIterator 18153e519524SHoward Hinnant>::type 181651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18173e519524SHoward Hinnant{ 181851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 181951544023SEric Fiselier _IntegralSize __n = __orig_n; 1820ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18213e519524SHoward Hinnant} 18223e519524SHoward Hinnant 18233e519524SHoward Hinnant// move 18243e519524SHoward Hinnant 18253e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18273e519524SHoward Hinnant_OutputIterator 18283e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18293e519524SHoward Hinnant{ 1830910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1831ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18323e519524SHoward Hinnant return __result; 18333e519524SHoward Hinnant} 18343e519524SHoward Hinnant 18353e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18373e519524SHoward Hinnanttypename enable_if 18383e519524SHoward Hinnant< 18393e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1840ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18413e519524SHoward Hinnant _Up* 18423e519524SHoward Hinnant>::type 18433e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18443e519524SHoward Hinnant{ 18453e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18465b312052SMarshall Clow if (__n > 0) 1847ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18483e519524SHoward Hinnant return __result + __n; 18493e519524SHoward Hinnant} 18503e519524SHoward Hinnant 18513e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18533e519524SHoward Hinnant_OutputIterator 18543e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18553e519524SHoward Hinnant{ 1856ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18573e519524SHoward Hinnant} 18583e519524SHoward Hinnant 18593e519524SHoward Hinnant// move_backward 18603e519524SHoward Hinnant 18613e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18633e519524SHoward Hinnant_OutputIterator 18643e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18653e519524SHoward Hinnant{ 18663e519524SHoward Hinnant while (__first != __last) 1867ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 18683e519524SHoward Hinnant return __result; 18693e519524SHoward Hinnant} 18703e519524SHoward Hinnant 18713e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18733e519524SHoward Hinnanttypename enable_if 18743e519524SHoward Hinnant< 18753e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1876ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18773e519524SHoward Hinnant _Up* 18783e519524SHoward Hinnant>::type 18793e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 18803e519524SHoward Hinnant{ 18813e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18825b312052SMarshall Clow if (__n > 0) 18835b312052SMarshall Clow { 18843e519524SHoward Hinnant __result -= __n; 1885ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18865b312052SMarshall Clow } 18873e519524SHoward Hinnant return __result; 18883e519524SHoward Hinnant} 18893e519524SHoward Hinnant 18903e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18923e519524SHoward Hinnant_BidirectionalIterator2 18933e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18943e519524SHoward Hinnant _BidirectionalIterator2 __result) 18953e519524SHoward Hinnant{ 1896ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18973e519524SHoward Hinnant} 18983e519524SHoward Hinnant 18993e519524SHoward Hinnant// iter_swap 19003e519524SHoward Hinnant 1901a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19023e519524SHoward Hinnant 19033e519524SHoward Hinnant// transform 19043e519524SHoward Hinnant 19053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19073e519524SHoward Hinnant_OutputIterator 19083e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19093e519524SHoward Hinnant{ 1910910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19113e519524SHoward Hinnant *__result = __op(*__first); 19123e519524SHoward Hinnant return __result; 19133e519524SHoward Hinnant} 19143e519524SHoward Hinnant 19153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19173e519524SHoward Hinnant_OutputIterator 19183e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19193e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19203e519524SHoward Hinnant{ 1921910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19223e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19233e519524SHoward Hinnant return __result; 19243e519524SHoward Hinnant} 19253e519524SHoward Hinnant 19263e519524SHoward Hinnant// replace 19273e519524SHoward Hinnant 19283e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19303e519524SHoward Hinnantvoid 19313e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19323e519524SHoward Hinnant{ 19333e519524SHoward Hinnant for (; __first != __last; ++__first) 19343e519524SHoward Hinnant if (*__first == __old_value) 19353e519524SHoward Hinnant *__first = __new_value; 19363e519524SHoward Hinnant} 19373e519524SHoward Hinnant 19383e519524SHoward Hinnant// replace_if 19393e519524SHoward Hinnant 19403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19423e519524SHoward Hinnantvoid 19433e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19443e519524SHoward Hinnant{ 19453e519524SHoward Hinnant for (; __first != __last; ++__first) 19463e519524SHoward Hinnant if (__pred(*__first)) 19473e519524SHoward Hinnant *__first = __new_value; 19483e519524SHoward Hinnant} 19493e519524SHoward Hinnant 19503e519524SHoward Hinnant// replace_copy 19513e519524SHoward Hinnant 19523e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19543e519524SHoward Hinnant_OutputIterator 19553e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19563e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 19573e519524SHoward Hinnant{ 1958910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19593e519524SHoward Hinnant if (*__first == __old_value) 19603e519524SHoward Hinnant *__result = __new_value; 19613e519524SHoward Hinnant else 19623e519524SHoward Hinnant *__result = *__first; 19633e519524SHoward Hinnant return __result; 19643e519524SHoward Hinnant} 19653e519524SHoward Hinnant 19663e519524SHoward Hinnant// replace_copy_if 19673e519524SHoward Hinnant 19683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 19693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19703e519524SHoward Hinnant_OutputIterator 19713e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19723e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 19733e519524SHoward Hinnant{ 1974910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19753e519524SHoward Hinnant if (__pred(*__first)) 19763e519524SHoward Hinnant *__result = __new_value; 19773e519524SHoward Hinnant else 19783e519524SHoward Hinnant *__result = *__first; 19793e519524SHoward Hinnant return __result; 19803e519524SHoward Hinnant} 19813e519524SHoward Hinnant 19823e519524SHoward Hinnant// fill_n 19833e519524SHoward Hinnant 19843e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 19853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19863e519524SHoward Hinnant_OutputIterator 19870f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 19883e519524SHoward Hinnant{ 1989910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 1990e4383379SHoward Hinnant *__first = __value_; 19913e519524SHoward Hinnant return __first; 19923e519524SHoward Hinnant} 19933e519524SHoward Hinnant 19940f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 19953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19960f242beaSHoward Hinnanttypename enable_if 19970f242beaSHoward Hinnant< 19980f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 19990f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20000f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20010f242beaSHoward Hinnant _Tp* 20020f242beaSHoward Hinnant>::type 20030f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20043e519524SHoward Hinnant{ 20053e519524SHoward Hinnant if (__n > 0) 2006e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20073e519524SHoward Hinnant return __first + __n; 20083e519524SHoward Hinnant} 20093e519524SHoward Hinnant 20103e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20123e519524SHoward Hinnant_OutputIterator 2013e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20143e519524SHoward Hinnant{ 201551544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20163e519524SHoward Hinnant} 20173e519524SHoward Hinnant 20183e519524SHoward Hinnant// fill 20193e519524SHoward Hinnant 20203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20223e519524SHoward Hinnantvoid 2023e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20243e519524SHoward Hinnant{ 20253e519524SHoward Hinnant for (; __first != __last; ++__first) 2026e4383379SHoward Hinnant *__first = __value_; 20273e519524SHoward Hinnant} 20283e519524SHoward Hinnant 20293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20313e519524SHoward Hinnantvoid 2032e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20333e519524SHoward Hinnant{ 2034e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20393e519524SHoward Hinnantvoid 2040e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20413e519524SHoward Hinnant{ 2042e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20433e519524SHoward Hinnant} 20443e519524SHoward Hinnant 20453e519524SHoward Hinnant// generate 20463e519524SHoward Hinnant 20473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20493e519524SHoward Hinnantvoid 20503e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20513e519524SHoward Hinnant{ 20523e519524SHoward Hinnant for (; __first != __last; ++__first) 20533e519524SHoward Hinnant *__first = __gen(); 20543e519524SHoward Hinnant} 20553e519524SHoward Hinnant 20563e519524SHoward Hinnant// generate_n 20573e519524SHoward Hinnant 20583e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 20593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20603e519524SHoward Hinnant_OutputIterator 206151544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 20623e519524SHoward Hinnant{ 206351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 206451544023SEric Fiselier _IntegralSize __n = __orig_n; 2065910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 20663e519524SHoward Hinnant *__first = __gen(); 20673e519524SHoward Hinnant return __first; 20683e519524SHoward Hinnant} 20693e519524SHoward Hinnant 20703e519524SHoward Hinnant// remove 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20733e519524SHoward Hinnant_ForwardIterator 2074e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20753e519524SHoward Hinnant{ 2076e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 20773e519524SHoward Hinnant if (__first != __last) 20783e519524SHoward Hinnant { 20793e519524SHoward Hinnant _ForwardIterator __i = __first; 20803e519524SHoward Hinnant while (++__i != __last) 20813e519524SHoward Hinnant { 2082e4383379SHoward Hinnant if (!(*__i == __value_)) 20833e519524SHoward Hinnant { 2084ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 20853e519524SHoward Hinnant ++__first; 20863e519524SHoward Hinnant } 20873e519524SHoward Hinnant } 20883e519524SHoward Hinnant } 20893e519524SHoward Hinnant return __first; 20903e519524SHoward Hinnant} 20913e519524SHoward Hinnant 20923e519524SHoward Hinnant// remove_if 20933e519524SHoward Hinnant 20943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 20953e519524SHoward Hinnant_ForwardIterator 20963e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 20973e519524SHoward Hinnant{ 2098ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 20993e519524SHoward Hinnant (__first, __last, __pred); 21003e519524SHoward Hinnant if (__first != __last) 21013e519524SHoward Hinnant { 21023e519524SHoward Hinnant _ForwardIterator __i = __first; 21033e519524SHoward Hinnant while (++__i != __last) 21043e519524SHoward Hinnant { 21053e519524SHoward Hinnant if (!__pred(*__i)) 21063e519524SHoward Hinnant { 2107ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21083e519524SHoward Hinnant ++__first; 21093e519524SHoward Hinnant } 21103e519524SHoward Hinnant } 21113e519524SHoward Hinnant } 21123e519524SHoward Hinnant return __first; 21133e519524SHoward Hinnant} 21143e519524SHoward Hinnant 21153e519524SHoward Hinnant// remove_copy 21163e519524SHoward Hinnant 21173e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21193e519524SHoward Hinnant_OutputIterator 2120e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21213e519524SHoward Hinnant{ 21223e519524SHoward Hinnant for (; __first != __last; ++__first) 21233e519524SHoward Hinnant { 2124e4383379SHoward Hinnant if (!(*__first == __value_)) 21253e519524SHoward Hinnant { 21263e519524SHoward Hinnant *__result = *__first; 21273e519524SHoward Hinnant ++__result; 21283e519524SHoward Hinnant } 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant return __result; 21313e519524SHoward Hinnant} 21323e519524SHoward Hinnant 21333e519524SHoward Hinnant// remove_copy_if 21343e519524SHoward Hinnant 21353e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21373e519524SHoward Hinnant_OutputIterator 21383e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21393e519524SHoward Hinnant{ 21403e519524SHoward Hinnant for (; __first != __last; ++__first) 21413e519524SHoward Hinnant { 21423e519524SHoward Hinnant if (!__pred(*__first)) 21433e519524SHoward Hinnant { 21443e519524SHoward Hinnant *__result = *__first; 21453e519524SHoward Hinnant ++__result; 21463e519524SHoward Hinnant } 21473e519524SHoward Hinnant } 21483e519524SHoward Hinnant return __result; 21493e519524SHoward Hinnant} 21503e519524SHoward Hinnant 21513e519524SHoward Hinnant// unique 21523e519524SHoward Hinnant 21533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21543e519524SHoward Hinnant_ForwardIterator 21553e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21563e519524SHoward Hinnant{ 2157ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21583e519524SHoward Hinnant (__first, __last, __pred); 21593e519524SHoward Hinnant if (__first != __last) 21603e519524SHoward Hinnant { 21613e519524SHoward Hinnant // ... a a ? ... 21623e519524SHoward Hinnant // f i 21633e519524SHoward Hinnant _ForwardIterator __i = __first; 21643e519524SHoward Hinnant for (++__i; ++__i != __last;) 21653e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2166ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 21673e519524SHoward Hinnant ++__first; 21683e519524SHoward Hinnant } 21693e519524SHoward Hinnant return __first; 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnanttemplate <class _ForwardIterator> 21733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21743e519524SHoward Hinnant_ForwardIterator 21753e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 21763e519524SHoward Hinnant{ 21773e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2178ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 21793e519524SHoward Hinnant} 21803e519524SHoward Hinnant 21813e519524SHoward Hinnant// unique_copy 21823e519524SHoward Hinnant 21833e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 21843e519524SHoward Hinnant_OutputIterator 21853e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 21863e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 21873e519524SHoward Hinnant{ 21883e519524SHoward Hinnant if (__first != __last) 21893e519524SHoward Hinnant { 21903e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 21913e519524SHoward Hinnant *__result = __t; 21923e519524SHoward Hinnant ++__result; 21933e519524SHoward Hinnant while (++__first != __last) 21943e519524SHoward Hinnant { 21953e519524SHoward Hinnant if (!__pred(__t, *__first)) 21963e519524SHoward Hinnant { 21973e519524SHoward Hinnant __t = *__first; 21983e519524SHoward Hinnant *__result = __t; 21993e519524SHoward Hinnant ++__result; 22003e519524SHoward Hinnant } 22013e519524SHoward Hinnant } 22023e519524SHoward Hinnant } 22033e519524SHoward Hinnant return __result; 22043e519524SHoward Hinnant} 22053e519524SHoward Hinnant 22063e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22073e519524SHoward Hinnant_OutputIterator 22083e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22093e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22103e519524SHoward Hinnant{ 22113e519524SHoward Hinnant if (__first != __last) 22123e519524SHoward Hinnant { 22133e519524SHoward Hinnant _ForwardIterator __i = __first; 22143e519524SHoward Hinnant *__result = *__i; 22153e519524SHoward Hinnant ++__result; 22163e519524SHoward Hinnant while (++__first != __last) 22173e519524SHoward Hinnant { 22183e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22193e519524SHoward Hinnant { 22203e519524SHoward Hinnant *__result = *__first; 22213e519524SHoward Hinnant ++__result; 22223e519524SHoward Hinnant __i = __first; 22233e519524SHoward Hinnant } 22243e519524SHoward Hinnant } 22253e519524SHoward Hinnant } 22263e519524SHoward Hinnant return __result; 22273e519524SHoward Hinnant} 22283e519524SHoward Hinnant 22293e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22303e519524SHoward Hinnant_ForwardIterator 22313e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22323e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22333e519524SHoward Hinnant{ 22343e519524SHoward Hinnant if (__first != __last) 22353e519524SHoward Hinnant { 22363e519524SHoward Hinnant *__result = *__first; 22373e519524SHoward Hinnant while (++__first != __last) 22383e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22393e519524SHoward Hinnant *++__result = *__first; 22403e519524SHoward Hinnant ++__result; 22413e519524SHoward Hinnant } 22423e519524SHoward Hinnant return __result; 22433e519524SHoward Hinnant} 22443e519524SHoward Hinnant 22453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22473e519524SHoward Hinnant_OutputIterator 22483e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22493e519524SHoward Hinnant{ 2250ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22513e519524SHoward Hinnant (__first, __last, __result, __pred, 22523e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22533e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22543e519524SHoward Hinnant} 22553e519524SHoward Hinnant 22563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22583e519524SHoward Hinnant_OutputIterator 22593e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 22603e519524SHoward Hinnant{ 22613e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2262ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 22633e519524SHoward Hinnant} 22643e519524SHoward Hinnant 22653e519524SHoward Hinnant// reverse 22663e519524SHoward Hinnant 22673e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22693e519524SHoward Hinnantvoid 22703e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 22713e519524SHoward Hinnant{ 22723e519524SHoward Hinnant while (__first != __last) 22733e519524SHoward Hinnant { 22743e519524SHoward Hinnant if (__first == --__last) 22753e519524SHoward Hinnant break; 2276def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22773e519524SHoward Hinnant ++__first; 22783e519524SHoward Hinnant } 22793e519524SHoward Hinnant} 22803e519524SHoward Hinnant 22813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 22823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22833e519524SHoward Hinnantvoid 22843e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 22853e519524SHoward Hinnant{ 22863e519524SHoward Hinnant if (__first != __last) 22873e519524SHoward Hinnant for (; __first < --__last; ++__first) 2288def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 22893e519524SHoward Hinnant} 22903e519524SHoward Hinnant 22913e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 22923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22933e519524SHoward Hinnantvoid 22943e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 22953e519524SHoward Hinnant{ 2296ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 22973e519524SHoward Hinnant} 22983e519524SHoward Hinnant 22993e519524SHoward Hinnant// reverse_copy 23003e519524SHoward Hinnant 23013e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23033e519524SHoward Hinnant_OutputIterator 23043e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23053e519524SHoward Hinnant{ 23063e519524SHoward Hinnant for (; __first != __last; ++__result) 23073e519524SHoward Hinnant *__result = *--__last; 23083e519524SHoward Hinnant return __result; 23093e519524SHoward Hinnant} 23103e519524SHoward Hinnant 23113e519524SHoward Hinnant// rotate 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <class _ForwardIterator> 23143e519524SHoward Hinnant_ForwardIterator 2315aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23163e519524SHoward Hinnant{ 2317aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2318aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2319aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2320aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2321aca09de3SHoward Hinnant return __lm1; 2322aca09de3SHoward Hinnant} 2323aca09de3SHoward Hinnant 2324aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2325aca09de3SHoward Hinnant_BidirectionalIterator 2326aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2327aca09de3SHoward Hinnant{ 2328aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2329aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2330aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2331aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2332aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2333aca09de3SHoward Hinnant return __fp1; 2334aca09de3SHoward Hinnant} 2335aca09de3SHoward Hinnant 2336aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2337aca09de3SHoward Hinnant_ForwardIterator 2338aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2339aca09de3SHoward Hinnant{ 23403e519524SHoward Hinnant _ForwardIterator __i = __middle; 23413e519524SHoward Hinnant while (true) 23423e519524SHoward Hinnant { 23433e519524SHoward Hinnant swap(*__first, *__i); 23443e519524SHoward Hinnant ++__first; 23453e519524SHoward Hinnant if (++__i == __last) 23463e519524SHoward Hinnant break; 23473e519524SHoward Hinnant if (__first == __middle) 23483e519524SHoward Hinnant __middle = __i; 23493e519524SHoward Hinnant } 23503e519524SHoward Hinnant _ForwardIterator __r = __first; 23513e519524SHoward Hinnant if (__first != __middle) 23523e519524SHoward Hinnant { 23533e519524SHoward Hinnant __i = __middle; 23543e519524SHoward Hinnant while (true) 23553e519524SHoward Hinnant { 23563e519524SHoward Hinnant swap(*__first, *__i); 23573e519524SHoward Hinnant ++__first; 23583e519524SHoward Hinnant if (++__i == __last) 23593e519524SHoward Hinnant { 23603e519524SHoward Hinnant if (__first == __middle) 23613e519524SHoward Hinnant break; 23623e519524SHoward Hinnant __i = __middle; 23633e519524SHoward Hinnant } 23643e519524SHoward Hinnant else if (__first == __middle) 23653e519524SHoward Hinnant __middle = __i; 23663e519524SHoward Hinnant } 23673e519524SHoward Hinnant } 23683e519524SHoward Hinnant return __r; 23693e519524SHoward Hinnant} 23703e519524SHoward Hinnant 23713e519524SHoward Hinnanttemplate<typename _Integral> 23723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23733e519524SHoward Hinnant_Integral 237419b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 23753e519524SHoward Hinnant{ 23763e519524SHoward Hinnant do 23773e519524SHoward Hinnant { 23783e519524SHoward Hinnant _Integral __t = __x % __y; 23793e519524SHoward Hinnant __x = __y; 23803e519524SHoward Hinnant __y = __t; 23813e519524SHoward Hinnant } while (__y); 23823e519524SHoward Hinnant return __x; 23833e519524SHoward Hinnant} 23843e519524SHoward Hinnant 23853e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 23863e519524SHoward Hinnant_RandomAccessIterator 2387aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 23883e519524SHoward Hinnant{ 23893e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 23903e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 23913e519524SHoward Hinnant 23923e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 23933e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 23943e519524SHoward Hinnant if (__m1 == __m2) 23953e519524SHoward Hinnant { 2396ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 23973e519524SHoward Hinnant return __middle; 23983e519524SHoward Hinnant } 239919b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24003e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24013e519524SHoward Hinnant { 2402aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24033e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24043e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24053e519524SHoward Hinnant do 24063e519524SHoward Hinnant { 2407aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24083e519524SHoward Hinnant __p1 = __p2; 24093e519524SHoward Hinnant const difference_type __d = __last - __p2; 24103e519524SHoward Hinnant if (__m1 < __d) 24113e519524SHoward Hinnant __p2 += __m1; 24123e519524SHoward Hinnant else 24133e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24143e519524SHoward Hinnant } while (__p2 != __p); 2415aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24163e519524SHoward Hinnant } 24173e519524SHoward Hinnant return __first + __m2; 24183e519524SHoward Hinnant} 24193e519524SHoward Hinnant 24203e519524SHoward Hinnanttemplate <class _ForwardIterator> 24213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24223e519524SHoward Hinnant_ForwardIterator 2423aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2424aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2425aca09de3SHoward Hinnant{ 2426aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2427aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2428aca09de3SHoward Hinnant { 2429aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2430aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2431aca09de3SHoward Hinnant } 2432aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2433aca09de3SHoward Hinnant} 2434aca09de3SHoward Hinnant 2435aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2436aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2437aca09de3SHoward Hinnant_BidirectionalIterator 2438aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2439aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2440aca09de3SHoward Hinnant{ 2441aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2442aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2443aca09de3SHoward Hinnant { 2444aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2445aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2446aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2447aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2448aca09de3SHoward Hinnant } 2449aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2450aca09de3SHoward Hinnant} 2451aca09de3SHoward Hinnant 2452aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2453aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2454aca09de3SHoward Hinnant_RandomAccessIterator 2455aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2456aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2457aca09de3SHoward Hinnant{ 2458aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2459aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2460aca09de3SHoward Hinnant { 2461aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2462aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2463aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2464aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2465aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2466aca09de3SHoward Hinnant } 2467aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2468aca09de3SHoward Hinnant} 2469aca09de3SHoward Hinnant 2470aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2471aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2472aca09de3SHoward Hinnant_ForwardIterator 24733e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 24743e519524SHoward Hinnant{ 2475aca09de3SHoward Hinnant if (__first == __middle) 2476aca09de3SHoward Hinnant return __last; 2477aca09de3SHoward Hinnant if (__middle == __last) 2478aca09de3SHoward Hinnant return __first; 2479ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2480aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 24813e519524SHoward Hinnant} 24823e519524SHoward Hinnant 24833e519524SHoward Hinnant// rotate_copy 24843e519524SHoward Hinnant 24853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 24863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24873e519524SHoward Hinnant_OutputIterator 24883e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 24893e519524SHoward Hinnant{ 2490ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 24913e519524SHoward Hinnant} 24923e519524SHoward Hinnant 24933e519524SHoward Hinnant// min_element 24943e519524SHoward Hinnant 24953e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 24969d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 24973e519524SHoward Hinnant_ForwardIterator 24980b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 24993e519524SHoward Hinnant{ 25003e519524SHoward Hinnant if (__first != __last) 25013e519524SHoward Hinnant { 25023e519524SHoward Hinnant _ForwardIterator __i = __first; 25033e519524SHoward Hinnant while (++__i != __last) 25043e519524SHoward Hinnant if (__comp(*__i, *__first)) 25053e519524SHoward Hinnant __first = __i; 25063e519524SHoward Hinnant } 25073e519524SHoward Hinnant return __first; 25083e519524SHoward Hinnant} 25093e519524SHoward Hinnant 25103e519524SHoward Hinnanttemplate <class _ForwardIterator> 25110b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25123e519524SHoward Hinnant_ForwardIterator 25133e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25143e519524SHoward Hinnant{ 25150b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25164eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25174eb27b79SHoward Hinnant} 25184eb27b79SHoward Hinnant 25194eb27b79SHoward Hinnant// min 25204eb27b79SHoward Hinnant 25214eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25229d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25234eb27b79SHoward Hinnantconst _Tp& 25244eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25254eb27b79SHoward Hinnant{ 25264eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25274eb27b79SHoward Hinnant} 25284eb27b79SHoward Hinnant 25294eb27b79SHoward Hinnanttemplate <class _Tp> 25309d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25314eb27b79SHoward Hinnantconst _Tp& 25324eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25334eb27b79SHoward Hinnant{ 2534ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25354eb27b79SHoward Hinnant} 25364eb27b79SHoward Hinnant 253754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 253854976f26SHoward Hinnant 25394eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25414eb27b79SHoward Hinnant_Tp 25424eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25434eb27b79SHoward Hinnant{ 25440b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 25454eb27b79SHoward Hinnant} 25464eb27b79SHoward Hinnant 25474eb27b79SHoward Hinnanttemplate<class _Tp> 25489d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25494eb27b79SHoward Hinnant_Tp 25504eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 25514eb27b79SHoward Hinnant{ 25520b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 25533e519524SHoward Hinnant} 25543e519524SHoward Hinnant 255554976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 255654976f26SHoward Hinnant 25573e519524SHoward Hinnant// max_element 25583e519524SHoward Hinnant 25593e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25613e519524SHoward Hinnant_ForwardIterator 25620b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25633e519524SHoward Hinnant{ 25643e519524SHoward Hinnant if (__first != __last) 25653e519524SHoward Hinnant { 25663e519524SHoward Hinnant _ForwardIterator __i = __first; 25673e519524SHoward Hinnant while (++__i != __last) 25683e519524SHoward Hinnant if (__comp(*__first, *__i)) 25693e519524SHoward Hinnant __first = __i; 25703e519524SHoward Hinnant } 25713e519524SHoward Hinnant return __first; 25723e519524SHoward Hinnant} 25733e519524SHoward Hinnant 25749d67c6d5SMarshall Clow 25753e519524SHoward Hinnanttemplate <class _ForwardIterator> 25760b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25773e519524SHoward Hinnant_ForwardIterator 25783e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 25793e519524SHoward Hinnant{ 25800b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 25814eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25824eb27b79SHoward Hinnant} 25834eb27b79SHoward Hinnant 25844eb27b79SHoward Hinnant// max 25854eb27b79SHoward Hinnant 25864eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25879d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25884eb27b79SHoward Hinnantconst _Tp& 25894eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 25904eb27b79SHoward Hinnant{ 25914eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 25924eb27b79SHoward Hinnant} 25934eb27b79SHoward Hinnant 25944eb27b79SHoward Hinnanttemplate <class _Tp> 25959d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25964eb27b79SHoward Hinnantconst _Tp& 25974eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 25984eb27b79SHoward Hinnant{ 2599ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26004eb27b79SHoward Hinnant} 26014eb27b79SHoward Hinnant 260254976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260354976f26SHoward Hinnant 26044eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26059d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26064eb27b79SHoward Hinnant_Tp 26074eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26084eb27b79SHoward Hinnant{ 26090b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26104eb27b79SHoward Hinnant} 26114eb27b79SHoward Hinnant 26124eb27b79SHoward Hinnanttemplate<class _Tp> 26139d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26144eb27b79SHoward Hinnant_Tp 26154eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26164eb27b79SHoward Hinnant{ 26170b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26183e519524SHoward Hinnant} 26193e519524SHoward Hinnant 262054976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 262154976f26SHoward Hinnant 2622146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2623146c14acSMarshall Clow// clamp 2624146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2625146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2626146c14acSMarshall Clowconst _Tp& 2627146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2628146c14acSMarshall Clow{ 2629146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2630146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2631146c14acSMarshall Clow 2632146c14acSMarshall Clow} 2633146c14acSMarshall Clow 2634146c14acSMarshall Clowtemplate<class _Tp> 2635146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2636146c14acSMarshall Clowconst _Tp& 2637146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2638146c14acSMarshall Clow{ 2639146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2640146c14acSMarshall Clow} 2641146c14acSMarshall Clow#endif 2642146c14acSMarshall Clow 26433e519524SHoward Hinnant// minmax_element 26443e519524SHoward Hinnant 26453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26460b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26473e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26483e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26493e519524SHoward Hinnant{ 26503e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26513e519524SHoward Hinnant if (__first != __last) 26523e519524SHoward Hinnant { 26533e519524SHoward Hinnant if (++__first != __last) 26543e519524SHoward Hinnant { 26553e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26563e519524SHoward Hinnant __result.first = __first; 26573e519524SHoward Hinnant else 26583e519524SHoward Hinnant __result.second = __first; 26593e519524SHoward Hinnant while (++__first != __last) 26603e519524SHoward Hinnant { 26613e519524SHoward Hinnant _ForwardIterator __i = __first; 26623e519524SHoward Hinnant if (++__first == __last) 26633e519524SHoward Hinnant { 26643e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26653e519524SHoward Hinnant __result.first = __i; 26663e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 26673e519524SHoward Hinnant __result.second = __i; 26683e519524SHoward Hinnant break; 26693e519524SHoward Hinnant } 26703e519524SHoward Hinnant else 26713e519524SHoward Hinnant { 26723e519524SHoward Hinnant if (__comp(*__first, *__i)) 26733e519524SHoward Hinnant { 26743e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26753e519524SHoward Hinnant __result.first = __first; 26763e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 26773e519524SHoward Hinnant __result.second = __i; 26783e519524SHoward Hinnant } 26793e519524SHoward Hinnant else 26803e519524SHoward Hinnant { 26813e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 26823e519524SHoward Hinnant __result.first = __i; 26833e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 26843e519524SHoward Hinnant __result.second = __first; 26853e519524SHoward Hinnant } 26863e519524SHoward Hinnant } 26873e519524SHoward Hinnant } 26883e519524SHoward Hinnant } 26893e519524SHoward Hinnant } 26903e519524SHoward Hinnant return __result; 26913e519524SHoward Hinnant} 26923e519524SHoward Hinnant 26933e519524SHoward Hinnanttemplate <class _ForwardIterator> 26940b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26953e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26963e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 26973e519524SHoward Hinnant{ 26989d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 26999d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27003e519524SHoward Hinnant} 27013e519524SHoward Hinnant 27024eb27b79SHoward Hinnant// minmax 27034eb27b79SHoward Hinnant 27044eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27059d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27064eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27074eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27084eb27b79SHoward Hinnant{ 27094eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27104eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27114eb27b79SHoward Hinnant} 27124eb27b79SHoward Hinnant 27134eb27b79SHoward Hinnanttemplate<class _Tp> 27149d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27154eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27164eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27174eb27b79SHoward Hinnant{ 2718ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27194eb27b79SHoward Hinnant} 27204eb27b79SHoward Hinnant 272154976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 272254976f26SHoward Hinnant 27234eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27249d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27254eb27b79SHoward Hinnantpair<_Tp, _Tp> 27264eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27274eb27b79SHoward Hinnant{ 27289d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27299d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27309d67c6d5SMarshall Clow _Iter __last = __t.end(); 27319d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27329d67c6d5SMarshall Clow 27339d67c6d5SMarshall Clow ++__first; 27349d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27359d67c6d5SMarshall Clow { 27369d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27379d67c6d5SMarshall Clow __result.first = *__first; 27389d67c6d5SMarshall Clow else 27399d67c6d5SMarshall Clow __result.second = *__first; 27409d67c6d5SMarshall Clow ++__first; 27419d67c6d5SMarshall Clow } 27429d67c6d5SMarshall Clow 27439d67c6d5SMarshall Clow while (__first != __last) 27449d67c6d5SMarshall Clow { 27459d67c6d5SMarshall Clow _Tp __prev = *__first++; 2746002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2747002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2748002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27499d67c6d5SMarshall Clow } 27509d67c6d5SMarshall Clow else { 2751002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2752002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27539d67c6d5SMarshall Clow } 27549d67c6d5SMarshall Clow 27559d67c6d5SMarshall Clow __first++; 27569d67c6d5SMarshall Clow } 27579d67c6d5SMarshall Clow return __result; 27589d67c6d5SMarshall Clow} 27599d67c6d5SMarshall Clow 27609d67c6d5SMarshall Clowtemplate<class _Tp> 27619d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27629d67c6d5SMarshall Clowpair<_Tp, _Tp> 27639d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 27649d67c6d5SMarshall Clow{ 27659d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 27664eb27b79SHoward Hinnant} 27674eb27b79SHoward Hinnant 276854976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 276954976f26SHoward Hinnant 27703e519524SHoward Hinnant// random_shuffle 27713e519524SHoward Hinnant 2772f9d540b0SHoward Hinnant// __independent_bits_engine 2773f9d540b0SHoward Hinnant 2774c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2775f9d540b0SHoward Hinnantstruct __log2_imp 27763e519524SHoward Hinnant{ 2777c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2778c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 27793e519524SHoward Hinnant}; 27803e519524SHoward Hinnant 2781c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2782c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 27833e519524SHoward Hinnant{ 2784f9d540b0SHoward Hinnant static const size_t value = 0; 27853e519524SHoward Hinnant}; 27863e519524SHoward Hinnant 2787c003db1fSHoward Hinnanttemplate <size_t _Rp> 2788c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 27893e519524SHoward Hinnant{ 2790c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 27913e519524SHoward Hinnant}; 27923e519524SHoward Hinnant 2793c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2794f9d540b0SHoward Hinnantstruct __log2 27953e519524SHoward Hinnant{ 2796c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2797f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 27983e519524SHoward Hinnant}; 27993e519524SHoward Hinnant 2800f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2801f9d540b0SHoward Hinnantclass __independent_bits_engine 28023e519524SHoward Hinnant{ 2803f9d540b0SHoward Hinnantpublic: 2804f9d540b0SHoward Hinnant // types 2805f9d540b0SHoward Hinnant typedef _UIntType result_type; 2806f9d540b0SHoward Hinnant 2807f9d540b0SHoward Hinnantprivate: 2808f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2809f9d540b0SHoward Hinnant typedef typename conditional 2810f9d540b0SHoward Hinnant < 2811f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2812f9d540b0SHoward Hinnant result_type, 2813f9d540b0SHoward Hinnant _Engine_result_type 2814f9d540b0SHoward Hinnant >::type _Working_result_type; 2815f9d540b0SHoward Hinnant 2816f9d540b0SHoward Hinnant _Engine& __e_; 2817f9d540b0SHoward Hinnant size_t __w_; 2818f9d540b0SHoward Hinnant size_t __w0_; 2819f9d540b0SHoward Hinnant size_t __n_; 2820f9d540b0SHoward Hinnant size_t __n0_; 2821f9d540b0SHoward Hinnant _Working_result_type __y0_; 2822f9d540b0SHoward Hinnant _Working_result_type __y1_; 2823f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2824f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2825f9d540b0SHoward Hinnant 2826e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2827c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2828f9d540b0SHoward Hinnant + _Working_result_type(1); 2829e386b7b3SHoward Hinnant#else 2830e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2831e386b7b3SHoward Hinnant + _Working_result_type(1); 2832e386b7b3SHoward Hinnant#endif 2833e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2834e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2835e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2836f9d540b0SHoward Hinnant 2837f9d540b0SHoward Hinnantpublic: 2838f9d540b0SHoward Hinnant // constructors and seeding functions 2839f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2840f9d540b0SHoward Hinnant 2841f9d540b0SHoward Hinnant // generating functions 2842c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2843f9d540b0SHoward Hinnant 2844f9d540b0SHoward Hinnantprivate: 2845f9d540b0SHoward Hinnant result_type __eval(false_type); 2846f9d540b0SHoward Hinnant result_type __eval(true_type); 2847f9d540b0SHoward Hinnant}; 2848f9d540b0SHoward Hinnant 2849f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2850f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2851f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2852f9d540b0SHoward Hinnant : __e_(__e), 2853f9d540b0SHoward Hinnant __w_(__w) 2854f9d540b0SHoward Hinnant{ 2855f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2856f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2857c003db1fSHoward Hinnant if (_Rp == 0) 2858c003db1fSHoward Hinnant __y0_ = _Rp; 2859f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2860c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2861f9d540b0SHoward Hinnant else 2862f9d540b0SHoward Hinnant __y0_ = 0; 2863c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2864f9d540b0SHoward Hinnant { 2865f9d540b0SHoward Hinnant ++__n_; 2866f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2867f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2868c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2869f9d540b0SHoward Hinnant else 2870f9d540b0SHoward Hinnant __y0_ = 0; 2871f9d540b0SHoward Hinnant } 2872f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2873f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2874c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2875f9d540b0SHoward Hinnant else 2876f9d540b0SHoward Hinnant __y1_ = 0; 2877f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2878f9d540b0SHoward Hinnant _Engine_result_type(0); 2879f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2880f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2881f9d540b0SHoward Hinnant _Engine_result_type(~0); 28823e519524SHoward Hinnant} 28833e519524SHoward Hinnant 2884f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2885f9d540b0SHoward Hinnantinline 2886f9d540b0SHoward Hinnant_UIntType 2887f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 28883e519524SHoward Hinnant{ 2889f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 28903e519524SHoward Hinnant} 28913e519524SHoward Hinnant 2892f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2893f9d540b0SHoward Hinnant_UIntType 2894f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 28953e519524SHoward Hinnant{ 2896c003db1fSHoward Hinnant result_type _Sp = 0; 2897f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2898f9d540b0SHoward Hinnant { 2899f9d540b0SHoward Hinnant _Engine_result_type __u; 29003e519524SHoward Hinnant do 2901f9d540b0SHoward Hinnant { 2902f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2903f9d540b0SHoward Hinnant } while (__u >= __y0_); 29040176bc6cSHoward Hinnant if (__w0_ < _WDt) 2905c003db1fSHoward Hinnant _Sp <<= __w0_; 2906f9d540b0SHoward Hinnant else 2907c003db1fSHoward Hinnant _Sp = 0; 2908c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2909f9d540b0SHoward Hinnant } 2910f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2911f9d540b0SHoward Hinnant { 2912f9d540b0SHoward Hinnant _Engine_result_type __u; 2913f9d540b0SHoward Hinnant do 2914f9d540b0SHoward Hinnant { 2915f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2916f9d540b0SHoward Hinnant } while (__u >= __y1_); 29170176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2918c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2919f9d540b0SHoward Hinnant else 2920c003db1fSHoward Hinnant _Sp = 0; 2921c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2922f9d540b0SHoward Hinnant } 2923c003db1fSHoward Hinnant return _Sp; 29243e519524SHoward Hinnant} 29253e519524SHoward Hinnant 2926f9d540b0SHoward Hinnant// uniform_int_distribution 29273e519524SHoward Hinnant 2928f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2929f9d540b0SHoward Hinnantclass uniform_int_distribution 29303e519524SHoward Hinnant{ 2931f9d540b0SHoward Hinnantpublic: 2932f9d540b0SHoward Hinnant // types 2933f9d540b0SHoward Hinnant typedef _IntType result_type; 2934f9d540b0SHoward Hinnant 2935f9d540b0SHoward Hinnant class param_type 2936f9d540b0SHoward Hinnant { 2937f9d540b0SHoward Hinnant result_type __a_; 2938f9d540b0SHoward Hinnant result_type __b_; 2939f9d540b0SHoward Hinnant public: 2940f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2941f9d540b0SHoward Hinnant 2942f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2943f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2944f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2945f9d540b0SHoward Hinnant 2946f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2947f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2948f9d540b0SHoward Hinnant 2949f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2950f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2951f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2952f9d540b0SHoward Hinnant {return !(__x == __y);} 29533e519524SHoward Hinnant }; 29543e519524SHoward Hinnant 2955f9d540b0SHoward Hinnantprivate: 2956f9d540b0SHoward Hinnant param_type __p_; 29573e519524SHoward Hinnant 2958f9d540b0SHoward Hinnantpublic: 2959f9d540b0SHoward Hinnant // constructors and reset functions 2960f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2961f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2962f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2963f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2964f9d540b0SHoward Hinnant void reset() {} 2965f9d540b0SHoward Hinnant 2966f9d540b0SHoward Hinnant // generating functions 2967f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 2968f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 2969f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 2970f9d540b0SHoward Hinnant 2971f9d540b0SHoward Hinnant // property functions 2972f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 2973f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 2974f9d540b0SHoward Hinnant 2975f9d540b0SHoward Hinnant param_type param() const {return __p_;} 2976f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 2977f9d540b0SHoward Hinnant 2978f9d540b0SHoward Hinnant result_type min() const {return a();} 2979f9d540b0SHoward Hinnant result_type max() const {return b();} 2980f9d540b0SHoward Hinnant 2981f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 2982f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2983f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 2984f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 2985f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 2986f9d540b0SHoward Hinnant {return !(__x == __y);} 29873e519524SHoward Hinnant}; 29883e519524SHoward Hinnant 2989f9d540b0SHoward Hinnanttemplate<class _IntType> 2990f9d540b0SHoward Hinnanttemplate<class _URNG> 2991f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 2992f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 29933e519524SHoward Hinnant{ 2994f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 2995f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 2996c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 2997c003db1fSHoward Hinnant if (_Rp == 1) 2998f9d540b0SHoward Hinnant return __p.a(); 2999f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3000f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3001c003db1fSHoward Hinnant if (_Rp == 0) 3002f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3003c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3004a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3005f9d540b0SHoward Hinnant ++__w; 3006f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3007f9d540b0SHoward Hinnant _UIntType __u; 3008f9d540b0SHoward Hinnant do 30093e519524SHoward Hinnant { 3010f9d540b0SHoward Hinnant __u = __e(); 3011c003db1fSHoward Hinnant } while (__u >= _Rp); 3012f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30133e519524SHoward Hinnant} 3014f9d540b0SHoward Hinnant 3015f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3016f9d540b0SHoward Hinnant 3017f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3018f9d540b0SHoward Hinnant 3019f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30203e519524SHoward Hinnant{ 3021f9d540b0SHoward Hinnant static unsigned __c_; 3022f9d540b0SHoward Hinnant 3023f9d540b0SHoward Hinnant __rs_default(); 3024f9d540b0SHoward Hinnantpublic: 3025b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3026f9d540b0SHoward Hinnant 3027f9d540b0SHoward Hinnant static const result_type _Min = 0; 3028f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3029f9d540b0SHoward Hinnant 3030f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3031f9d540b0SHoward Hinnant ~__rs_default(); 3032f9d540b0SHoward Hinnant 3033f9d540b0SHoward Hinnant result_type operator()(); 3034f9d540b0SHoward Hinnant 3035788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3036788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3037f9d540b0SHoward Hinnant 3038f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3039f9d540b0SHoward Hinnant}; 3040f9d540b0SHoward Hinnant 3041f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30423e519524SHoward Hinnant 30433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30443e519524SHoward Hinnantvoid 30453e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30463e519524SHoward Hinnant{ 30473e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3048c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3049c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30503e519524SHoward Hinnant difference_type __d = __last - __first; 30513e519524SHoward Hinnant if (__d > 1) 30523e519524SHoward Hinnant { 3053c003db1fSHoward Hinnant _Dp __uid; 3054f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3055f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3056007b26beSHoward Hinnant { 3057c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3058007b26beSHoward Hinnant if (__i != difference_type(0)) 3059007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3060007b26beSHoward Hinnant } 30613e519524SHoward Hinnant } 30623e519524SHoward Hinnant} 30633e519524SHoward Hinnant 30643e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 30653e519524SHoward Hinnantvoid 30663e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 30677609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 30683e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 30693e519524SHoward Hinnant#else 30703e519524SHoward Hinnant _RandomNumberGenerator& __rand) 30713e519524SHoward Hinnant#endif 30723e519524SHoward Hinnant{ 30733e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 30743e519524SHoward Hinnant difference_type __d = __last - __first; 30753e519524SHoward Hinnant if (__d > 1) 30763e519524SHoward Hinnant { 30773e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3078007b26beSHoward Hinnant { 3079007b26beSHoward Hinnant difference_type __i = __rand(__d); 3080007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3081007b26beSHoward Hinnant } 30823e519524SHoward Hinnant } 30833e519524SHoward Hinnant} 30843e519524SHoward Hinnant 3085e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3086e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3087e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3088e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3089e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3090e7154709SEric Fiselier _Distance __n, 3091e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3092e7154709SEric Fiselier input_iterator_tag) { 3093e7154709SEric Fiselier 3094e7154709SEric Fiselier _Distance __k = 0; 3095e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 3096e7154709SEric Fiselier __out[__k] = *__first; 3097e7154709SEric Fiselier _Distance __sz = __k; 3098e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3099e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3100e7154709SEric Fiselier if (__r < __sz) 3101e7154709SEric Fiselier __out[__r] = *__first; 3102e7154709SEric Fiselier } 3103e7154709SEric Fiselier return __out + _VSTD::min(__n, __k); 3104e7154709SEric Fiselier} 3105e7154709SEric Fiselier 3106e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3107e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3108e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3109e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3110e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3111e7154709SEric Fiselier _Distance __n, 3112e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3113e7154709SEric Fiselier forward_iterator_tag) { 3114e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3115e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3116e7154709SEric Fiselier _Distance __r = 3117e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3118e7154709SEric Fiselier if (__r < __n) { 3119e7154709SEric Fiselier *__out++ = *__first; 3120e7154709SEric Fiselier --__n; 3121e7154709SEric Fiselier } 3122e7154709SEric Fiselier } 3123e7154709SEric Fiselier return __out; 3124e7154709SEric Fiselier} 3125e7154709SEric Fiselier 3126e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3127e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3128e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3129e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 3130e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3131e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3132e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3133e7154709SEric Fiselier _PopCategory; 3134e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3135e7154709SEric Fiselier _Difference; 3136e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3137e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3138e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3139e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3140e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3141e7154709SEric Fiselier return _VSTD::__sample( 3142e7154709SEric Fiselier __first, __last, __out, _CommonType(__n), 3143e7154709SEric Fiselier __g, _PopCategory()); 3144e7154709SEric Fiselier} 3145e7154709SEric Fiselier 3146e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3147e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3148e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3149e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3150e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 3151e7154709SEric Fiselier _PopulationIterator __last, _SampleIterator __out, 3152e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 3153e7154709SEric Fiselier return _VSTD::__sample(__first, __last, __out, __n, __g); 3154e7154709SEric Fiselier} 3155e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3156e7154709SEric Fiselier 3157f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3158f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3159fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3160fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3161fb340102SHoward Hinnant#else 3162f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3163fb340102SHoward Hinnant#endif 3164f9d540b0SHoward Hinnant{ 3165f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3166c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3167c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3168f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3169f9d540b0SHoward Hinnant if (__d > 1) 3170f9d540b0SHoward Hinnant { 3171c003db1fSHoward Hinnant _Dp __uid; 3172f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3173007b26beSHoward Hinnant { 3174c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3175007b26beSHoward Hinnant if (__i != difference_type(0)) 3176007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3177007b26beSHoward Hinnant } 3178f9d540b0SHoward Hinnant } 3179f9d540b0SHoward Hinnant} 3180f9d540b0SHoward Hinnant 31813e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31823e519524SHoward Hinnantbool 31833e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31843e519524SHoward Hinnant{ 31853e519524SHoward Hinnant for (; __first != __last; ++__first) 31863e519524SHoward Hinnant if (!__pred(*__first)) 31873e519524SHoward Hinnant break; 3188b9595b79SMarshall Clow if ( __first == __last ) 3189b9595b79SMarshall Clow return true; 3190b9595b79SMarshall Clow ++__first; 31913e519524SHoward Hinnant for (; __first != __last; ++__first) 31923e519524SHoward Hinnant if (__pred(*__first)) 31933e519524SHoward Hinnant return false; 31943e519524SHoward Hinnant return true; 31953e519524SHoward Hinnant} 31963e519524SHoward Hinnant 31973e519524SHoward Hinnant// partition 31983e519524SHoward Hinnant 31993e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32003e519524SHoward Hinnant_ForwardIterator 32013e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 32023e519524SHoward Hinnant{ 32033e519524SHoward Hinnant while (true) 32043e519524SHoward Hinnant { 32053e519524SHoward Hinnant if (__first == __last) 32063e519524SHoward Hinnant return __first; 32073e519524SHoward Hinnant if (!__pred(*__first)) 32083e519524SHoward Hinnant break; 32093e519524SHoward Hinnant ++__first; 32103e519524SHoward Hinnant } 32113e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32123e519524SHoward Hinnant { 32133e519524SHoward Hinnant if (__pred(*__p)) 32143e519524SHoward Hinnant { 32153e519524SHoward Hinnant swap(*__first, *__p); 32163e519524SHoward Hinnant ++__first; 32173e519524SHoward Hinnant } 32183e519524SHoward Hinnant } 32193e519524SHoward Hinnant return __first; 32203e519524SHoward Hinnant} 32213e519524SHoward Hinnant 32223e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32233e519524SHoward Hinnant_BidirectionalIterator 32243e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32253e519524SHoward Hinnant bidirectional_iterator_tag) 32263e519524SHoward Hinnant{ 32273e519524SHoward Hinnant while (true) 32283e519524SHoward Hinnant { 32293e519524SHoward Hinnant while (true) 32303e519524SHoward Hinnant { 32313e519524SHoward Hinnant if (__first == __last) 32323e519524SHoward Hinnant return __first; 32333e519524SHoward Hinnant if (!__pred(*__first)) 32343e519524SHoward Hinnant break; 32353e519524SHoward Hinnant ++__first; 32363e519524SHoward Hinnant } 32373e519524SHoward Hinnant do 32383e519524SHoward Hinnant { 32393e519524SHoward Hinnant if (__first == --__last) 32403e519524SHoward Hinnant return __first; 32413e519524SHoward Hinnant } while (!__pred(*__last)); 32423e519524SHoward Hinnant swap(*__first, *__last); 32433e519524SHoward Hinnant ++__first; 32443e519524SHoward Hinnant } 32453e519524SHoward Hinnant} 32463e519524SHoward Hinnant 32473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32493e519524SHoward Hinnant_ForwardIterator 32503e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32513e519524SHoward Hinnant{ 3252ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32533e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32543e519524SHoward Hinnant} 32553e519524SHoward Hinnant 32563e519524SHoward Hinnant// partition_copy 32573e519524SHoward Hinnant 32583e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32593e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32603e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32613e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32623e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32633e519524SHoward Hinnant _Predicate __pred) 32643e519524SHoward Hinnant{ 32653e519524SHoward Hinnant for (; __first != __last; ++__first) 32663e519524SHoward Hinnant { 32673e519524SHoward Hinnant if (__pred(*__first)) 32683e519524SHoward Hinnant { 32693e519524SHoward Hinnant *__out_true = *__first; 32703e519524SHoward Hinnant ++__out_true; 32713e519524SHoward Hinnant } 32723e519524SHoward Hinnant else 32733e519524SHoward Hinnant { 32743e519524SHoward Hinnant *__out_false = *__first; 32753e519524SHoward Hinnant ++__out_false; 32763e519524SHoward Hinnant } 32773e519524SHoward Hinnant } 32783e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32793e519524SHoward Hinnant} 32803e519524SHoward Hinnant 32813e519524SHoward Hinnant// partition_point 32823e519524SHoward Hinnant 32833e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32843e519524SHoward Hinnant_ForwardIterator 32853e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32863e519524SHoward Hinnant{ 32873e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3288ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32893e519524SHoward Hinnant while (__len != 0) 32903e519524SHoward Hinnant { 32913e519524SHoward Hinnant difference_type __l2 = __len / 2; 32923e519524SHoward Hinnant _ForwardIterator __m = __first; 3293ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32943e519524SHoward Hinnant if (__pred(*__m)) 32953e519524SHoward Hinnant { 32963e519524SHoward Hinnant __first = ++__m; 32973e519524SHoward Hinnant __len -= __l2 + 1; 32983e519524SHoward Hinnant } 32993e519524SHoward Hinnant else 33003e519524SHoward Hinnant __len = __l2; 33013e519524SHoward Hinnant } 33023e519524SHoward Hinnant return __first; 33033e519524SHoward Hinnant} 33043e519524SHoward Hinnant 33053e519524SHoward Hinnant// stable_partition 33063e519524SHoward Hinnant 33073e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 33083e519524SHoward Hinnant_ForwardIterator 33093e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33103e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 33113e519524SHoward Hinnant{ 33123e519524SHoward Hinnant // *__first is known to be false 33133e519524SHoward Hinnant // __len >= 1 33143e519524SHoward Hinnant if (__len == 1) 33153e519524SHoward Hinnant return __first; 33163e519524SHoward Hinnant if (__len == 2) 33173e519524SHoward Hinnant { 33183e519524SHoward Hinnant _ForwardIterator __m = __first; 33193e519524SHoward Hinnant if (__pred(*++__m)) 33203e519524SHoward Hinnant { 33213e519524SHoward Hinnant swap(*__first, *__m); 33223e519524SHoward Hinnant return __m; 33233e519524SHoward Hinnant } 33243e519524SHoward Hinnant return __first; 33253e519524SHoward Hinnant } 33263e519524SHoward Hinnant if (__len <= __p.second) 33273e519524SHoward Hinnant { // The buffer is big enough to use 33283e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33293e519524SHoward Hinnant __destruct_n __d(0); 33303e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33313e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33323e519524SHoward Hinnant // Update __first to always point to the end of the trues 33333e519524SHoward Hinnant value_type* __t = __p.first; 3334ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33353e519524SHoward Hinnant __d.__incr((value_type*)0); 33363e519524SHoward Hinnant ++__t; 33373e519524SHoward Hinnant _ForwardIterator __i = __first; 33383e519524SHoward Hinnant while (++__i != __last) 33393e519524SHoward Hinnant { 33403e519524SHoward Hinnant if (__pred(*__i)) 33413e519524SHoward Hinnant { 3342ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33433e519524SHoward Hinnant ++__first; 33443e519524SHoward Hinnant } 33453e519524SHoward Hinnant else 33463e519524SHoward Hinnant { 3347ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33483e519524SHoward Hinnant __d.__incr((value_type*)0); 33493e519524SHoward Hinnant ++__t; 33503e519524SHoward Hinnant } 33513e519524SHoward Hinnant } 33523e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33533e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33543e519524SHoward Hinnant __i = __first; 33553e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3356ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33573e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33583e519524SHoward Hinnant return __first; 33593e519524SHoward Hinnant } 33603e519524SHoward Hinnant // Else not enough buffer, do in place 33613e519524SHoward Hinnant // __len >= 3 33623e519524SHoward Hinnant _ForwardIterator __m = __first; 33633e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3364ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33653e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33663e519524SHoward Hinnant // F????????????????? 33673e519524SHoward Hinnant // f m l 33683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33693e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33703e519524SHoward Hinnant // TTTFFFFF?????????? 33713e519524SHoward Hinnant // f ff m l 33723e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33733e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33743e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33753e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33763e519524SHoward Hinnant while (__pred(*__m1)) 33773e519524SHoward Hinnant { 33783e519524SHoward Hinnant if (++__m1 == __last) 33793e519524SHoward Hinnant goto __second_half_done; 33803e519524SHoward Hinnant --__len_half; 33813e519524SHoward Hinnant } 33823e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33833e519524SHoward Hinnant // f ff m m1 l 33843e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33853e519524SHoward Hinnant__second_half_done: 33863e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33873e519524SHoward Hinnant // f ff m sf l 3388ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33893e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33903e519524SHoward Hinnant // | 33913e519524SHoward Hinnant} 33923e519524SHoward Hinnant 33933e519524SHoward Hinnantstruct __return_temporary_buffer 33943e519524SHoward Hinnant{ 33953e519524SHoward Hinnant template <class _Tp> 3396ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33973e519524SHoward Hinnant}; 33983e519524SHoward Hinnant 33993e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34003e519524SHoward Hinnant_ForwardIterator 34013e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34023e519524SHoward Hinnant forward_iterator_tag) 34033e519524SHoward Hinnant{ 34043e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 34053e519524SHoward Hinnant // Either prove all true and return __first or point to first false 34063e519524SHoward Hinnant while (true) 34073e519524SHoward Hinnant { 34083e519524SHoward Hinnant if (__first == __last) 34093e519524SHoward Hinnant return __first; 34103e519524SHoward Hinnant if (!__pred(*__first)) 34113e519524SHoward Hinnant break; 34123e519524SHoward Hinnant ++__first; 34133e519524SHoward Hinnant } 34143e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34153e519524SHoward Hinnant // *__first is known to be false 34163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34173e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3418ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34193e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34203e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34213e519524SHoward Hinnant if (__len >= __alloc_limit) 34223e519524SHoward Hinnant { 3423ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34243e519524SHoward Hinnant __h.reset(__p.first); 34253e519524SHoward Hinnant } 34263e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34273e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34283e519524SHoward Hinnant} 34293e519524SHoward Hinnant 34303e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34313e519524SHoward Hinnant_BidirectionalIterator 34323e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34333e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34343e519524SHoward Hinnant{ 34353e519524SHoward Hinnant // *__first is known to be false 34363e519524SHoward Hinnant // *__last is known to be true 34373e519524SHoward Hinnant // __len >= 2 34383e519524SHoward Hinnant if (__len == 2) 34393e519524SHoward Hinnant { 34403e519524SHoward Hinnant swap(*__first, *__last); 34413e519524SHoward Hinnant return __last; 34423e519524SHoward Hinnant } 34433e519524SHoward Hinnant if (__len == 3) 34443e519524SHoward Hinnant { 34453e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34463e519524SHoward Hinnant if (__pred(*++__m)) 34473e519524SHoward Hinnant { 34483e519524SHoward Hinnant swap(*__first, *__m); 34493e519524SHoward Hinnant swap(*__m, *__last); 34503e519524SHoward Hinnant return __last; 34513e519524SHoward Hinnant } 34523e519524SHoward Hinnant swap(*__m, *__last); 34533e519524SHoward Hinnant swap(*__first, *__m); 34543e519524SHoward Hinnant return __m; 34553e519524SHoward Hinnant } 34563e519524SHoward Hinnant if (__len <= __p.second) 34573e519524SHoward Hinnant { // The buffer is big enough to use 34583e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34593e519524SHoward Hinnant __destruct_n __d(0); 34603e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34613e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34623e519524SHoward Hinnant // Update __first to always point to the end of the trues 34633e519524SHoward Hinnant value_type* __t = __p.first; 3464ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34653e519524SHoward Hinnant __d.__incr((value_type*)0); 34663e519524SHoward Hinnant ++__t; 34673e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34683e519524SHoward Hinnant while (++__i != __last) 34693e519524SHoward Hinnant { 34703e519524SHoward Hinnant if (__pred(*__i)) 34713e519524SHoward Hinnant { 3472ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34733e519524SHoward Hinnant ++__first; 34743e519524SHoward Hinnant } 34753e519524SHoward Hinnant else 34763e519524SHoward Hinnant { 3477ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34783e519524SHoward Hinnant __d.__incr((value_type*)0); 34793e519524SHoward Hinnant ++__t; 34803e519524SHoward Hinnant } 34813e519524SHoward Hinnant } 34823e519524SHoward Hinnant // move *__last, known to be true 3483ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34843e519524SHoward Hinnant __i = ++__first; 34853e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34863e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34873e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3488ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34893e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34903e519524SHoward Hinnant return __first; 34913e519524SHoward Hinnant } 34923e519524SHoward Hinnant // Else not enough buffer, do in place 34933e519524SHoward Hinnant // __len >= 4 34943e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34953e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3496ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34973e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34983e519524SHoward Hinnant // F????????????????T 34993e519524SHoward Hinnant // f m l 35003e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35013e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 35023e519524SHoward Hinnant _Distance __len_half = __len2; 35033e519524SHoward Hinnant while (!__pred(*--__m1)) 35043e519524SHoward Hinnant { 35053e519524SHoward Hinnant if (__m1 == __first) 35063e519524SHoward Hinnant goto __first_half_done; 35073e519524SHoward Hinnant --__len_half; 35083e519524SHoward Hinnant } 35093e519524SHoward Hinnant // F???TFFF?????????T 35103e519524SHoward Hinnant // f m1 m l 35113e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35123e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35133e519524SHoward Hinnant__first_half_done: 35143e519524SHoward Hinnant // TTTFFFFF?????????T 35153e519524SHoward Hinnant // f ff m l 35163e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35173e519524SHoward Hinnant __m1 = __m; 35183e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35193e519524SHoward Hinnant ++__second_false; 35203e519524SHoward Hinnant __len_half = __len - __len2; 35213e519524SHoward Hinnant while (__pred(*__m1)) 35223e519524SHoward Hinnant { 35233e519524SHoward Hinnant if (++__m1 == __last) 35243e519524SHoward Hinnant goto __second_half_done; 35253e519524SHoward Hinnant --__len_half; 35263e519524SHoward Hinnant } 35273e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35283e519524SHoward Hinnant // f ff m m1 l 35293e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35303e519524SHoward Hinnant__second_half_done: 35313e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35323e519524SHoward Hinnant // f ff m sf l 3533ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35343e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35353e519524SHoward Hinnant // | 35363e519524SHoward Hinnant} 35373e519524SHoward Hinnant 35383e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35393e519524SHoward Hinnant_BidirectionalIterator 35403e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35413e519524SHoward Hinnant bidirectional_iterator_tag) 35423e519524SHoward Hinnant{ 35433e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35443e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35453e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35463e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35473e519524SHoward Hinnant while (true) 35483e519524SHoward Hinnant { 35493e519524SHoward Hinnant if (__first == __last) 35503e519524SHoward Hinnant return __first; 35513e519524SHoward Hinnant if (!__pred(*__first)) 35523e519524SHoward Hinnant break; 35533e519524SHoward Hinnant ++__first; 35543e519524SHoward Hinnant } 35553e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35563e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35573e519524SHoward Hinnant do 35583e519524SHoward Hinnant { 35593e519524SHoward Hinnant if (__first == --__last) 35603e519524SHoward Hinnant return __first; 35613e519524SHoward Hinnant } while (!__pred(*__last)); 35623e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35633e519524SHoward Hinnant // *__first is known to be false 35643e519524SHoward Hinnant // *__last is known to be true 35653e519524SHoward Hinnant // __len >= 2 3566ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35673e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35683e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35693e519524SHoward Hinnant if (__len >= __alloc_limit) 35703e519524SHoward Hinnant { 3571ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35723e519524SHoward Hinnant __h.reset(__p.first); 35733e519524SHoward Hinnant } 35743e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35753e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35763e519524SHoward Hinnant} 35773e519524SHoward Hinnant 35783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35803e519524SHoward Hinnant_ForwardIterator 35813e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35823e519524SHoward Hinnant{ 35833e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35843e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35853e519524SHoward Hinnant} 35863e519524SHoward Hinnant 35873e519524SHoward Hinnant// is_sorted_until 35883e519524SHoward Hinnant 35893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35903e519524SHoward Hinnant_ForwardIterator 35913e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35923e519524SHoward Hinnant{ 35933e519524SHoward Hinnant if (__first != __last) 35943e519524SHoward Hinnant { 35953e519524SHoward Hinnant _ForwardIterator __i = __first; 35963e519524SHoward Hinnant while (++__i != __last) 35973e519524SHoward Hinnant { 35983e519524SHoward Hinnant if (__comp(*__i, *__first)) 35993e519524SHoward Hinnant return __i; 36003e519524SHoward Hinnant __first = __i; 36013e519524SHoward Hinnant } 36023e519524SHoward Hinnant } 36033e519524SHoward Hinnant return __last; 36043e519524SHoward Hinnant} 36053e519524SHoward Hinnant 36063e519524SHoward Hinnanttemplate<class _ForwardIterator> 36073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36083e519524SHoward Hinnant_ForwardIterator 36093e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 36103e519524SHoward Hinnant{ 3611ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36123e519524SHoward Hinnant} 36133e519524SHoward Hinnant 36143e519524SHoward Hinnant// is_sorted 36153e519524SHoward Hinnant 36163e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36183e519524SHoward Hinnantbool 36193e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36203e519524SHoward Hinnant{ 3621ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36223e519524SHoward Hinnant} 36233e519524SHoward Hinnant 36243e519524SHoward Hinnanttemplate<class _ForwardIterator> 36253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36263e519524SHoward Hinnantbool 36273e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36283e519524SHoward Hinnant{ 3629ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36303e519524SHoward Hinnant} 36313e519524SHoward Hinnant 36323e519524SHoward Hinnant// sort 36333e519524SHoward Hinnant 36343e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36353e519524SHoward Hinnant 36363e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36373e519524SHoward Hinnantunsigned 36383e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36393e519524SHoward Hinnant{ 36403e519524SHoward Hinnant unsigned __r = 0; 36413e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36423e519524SHoward Hinnant { 36433e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36443e519524SHoward Hinnant return __r; // x <= y && y <= z 36453e519524SHoward Hinnant // x <= y && y > z 36463e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36473e519524SHoward Hinnant __r = 1; 36483e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36493e519524SHoward Hinnant { 36503e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36513e519524SHoward Hinnant __r = 2; 36523e519524SHoward Hinnant } 36533e519524SHoward Hinnant return __r; // x <= y && y < z 36543e519524SHoward Hinnant } 36553e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36563e519524SHoward Hinnant { 36573e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36583e519524SHoward Hinnant __r = 1; 36593e519524SHoward Hinnant return __r; 36603e519524SHoward Hinnant } 36613e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36623e519524SHoward Hinnant __r = 1; // x < y && x <= z 36633e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36643e519524SHoward Hinnant { 36653e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36663e519524SHoward Hinnant __r = 2; 36673e519524SHoward Hinnant } 36683e519524SHoward Hinnant return __r; 36693e519524SHoward Hinnant} // x <= y && y <= z 36703e519524SHoward Hinnant 36713e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36723e519524SHoward Hinnant 36733e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36743e519524SHoward Hinnantunsigned 36753e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36763e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36773e519524SHoward Hinnant{ 36783e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36793e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36803e519524SHoward Hinnant { 36813e519524SHoward Hinnant swap(*__x3, *__x4); 36823e519524SHoward Hinnant ++__r; 36833e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36843e519524SHoward Hinnant { 36853e519524SHoward Hinnant swap(*__x2, *__x3); 36863e519524SHoward Hinnant ++__r; 36873e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36883e519524SHoward Hinnant { 36893e519524SHoward Hinnant swap(*__x1, *__x2); 36903e519524SHoward Hinnant ++__r; 36913e519524SHoward Hinnant } 36923e519524SHoward Hinnant } 36933e519524SHoward Hinnant } 36943e519524SHoward Hinnant return __r; 36953e519524SHoward Hinnant} 36963e519524SHoward Hinnant 36973e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36983e519524SHoward Hinnant 36993e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37003e519524SHoward Hinnantunsigned 37013e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37023e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 37033e519524SHoward Hinnant{ 37043e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 37053e519524SHoward Hinnant if (__c(*__x5, *__x4)) 37063e519524SHoward Hinnant { 37073e519524SHoward Hinnant swap(*__x4, *__x5); 37083e519524SHoward Hinnant ++__r; 37093e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37103e519524SHoward Hinnant { 37113e519524SHoward Hinnant swap(*__x3, *__x4); 37123e519524SHoward Hinnant ++__r; 37133e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37143e519524SHoward Hinnant { 37153e519524SHoward Hinnant swap(*__x2, *__x3); 37163e519524SHoward Hinnant ++__r; 37173e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37183e519524SHoward Hinnant { 37193e519524SHoward Hinnant swap(*__x1, *__x2); 37203e519524SHoward Hinnant ++__r; 37213e519524SHoward Hinnant } 37223e519524SHoward Hinnant } 37233e519524SHoward Hinnant } 37243e519524SHoward Hinnant } 37253e519524SHoward Hinnant return __r; 37263e519524SHoward Hinnant} 37273e519524SHoward Hinnant 37283e519524SHoward Hinnant// Assumes size > 0 37293e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37303e519524SHoward Hinnantvoid 37313e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37323e519524SHoward Hinnant{ 37333e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37343e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37353e519524SHoward Hinnant { 3736ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37373e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37383e519524SHoward Hinnant (__first, __last, __comp); 37393e519524SHoward Hinnant if (__i != __first) 37403e519524SHoward Hinnant swap(*__first, *__i); 37413e519524SHoward Hinnant } 37423e519524SHoward Hinnant} 37433e519524SHoward Hinnant 37443e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37453e519524SHoward Hinnantvoid 37463e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37473e519524SHoward Hinnant{ 37483e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37493e519524SHoward Hinnant if (__first != __last) 37503e519524SHoward Hinnant { 37513e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37523e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37533e519524SHoward Hinnant { 37543e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3755ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37563e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3757ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3758ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37593e519524SHoward Hinnant } 37603e519524SHoward Hinnant } 37613e519524SHoward Hinnant} 37623e519524SHoward Hinnant 37633e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37643e519524SHoward Hinnantvoid 37653e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37663e519524SHoward Hinnant{ 37673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37683e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37693e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37703e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37713e519524SHoward Hinnant { 37723e519524SHoward Hinnant if (__comp(*__i, *__j)) 37733e519524SHoward Hinnant { 3774ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37753e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37763e519524SHoward Hinnant __j = __i; 37773e519524SHoward Hinnant do 37783e519524SHoward Hinnant { 3779ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37803e519524SHoward Hinnant __j = __k; 37813e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3782ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37833e519524SHoward Hinnant } 37843e519524SHoward Hinnant __j = __i; 37853e519524SHoward Hinnant } 37863e519524SHoward Hinnant} 37873e519524SHoward Hinnant 37883e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37893e519524SHoward Hinnantbool 37903e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37913e519524SHoward Hinnant{ 37923e519524SHoward Hinnant switch (__last - __first) 37933e519524SHoward Hinnant { 37943e519524SHoward Hinnant case 0: 37953e519524SHoward Hinnant case 1: 37963e519524SHoward Hinnant return true; 37973e519524SHoward Hinnant case 2: 37983e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37993e519524SHoward Hinnant swap(*__first, *__last); 38003e519524SHoward Hinnant return true; 38013e519524SHoward Hinnant case 3: 3802ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38033e519524SHoward Hinnant return true; 38043e519524SHoward Hinnant case 4: 3805ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38063e519524SHoward Hinnant return true; 38073e519524SHoward Hinnant case 5: 3808ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38093e519524SHoward Hinnant return true; 38103e519524SHoward Hinnant } 38113e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38123e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38133e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38143e519524SHoward Hinnant const unsigned __limit = 8; 38153e519524SHoward Hinnant unsigned __count = 0; 38163e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38173e519524SHoward Hinnant { 38183e519524SHoward Hinnant if (__comp(*__i, *__j)) 38193e519524SHoward Hinnant { 3820ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38213e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38223e519524SHoward Hinnant __j = __i; 38233e519524SHoward Hinnant do 38243e519524SHoward Hinnant { 3825ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38263e519524SHoward Hinnant __j = __k; 38273e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3828ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38293e519524SHoward Hinnant if (++__count == __limit) 38303e519524SHoward Hinnant return ++__i == __last; 38313e519524SHoward Hinnant } 38323e519524SHoward Hinnant __j = __i; 38333e519524SHoward Hinnant } 38343e519524SHoward Hinnant return true; 38353e519524SHoward Hinnant} 38363e519524SHoward Hinnant 38373e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38383e519524SHoward Hinnantvoid 38393e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38403e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38413e519524SHoward Hinnant{ 38423e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38433e519524SHoward Hinnant if (__first1 != __last1) 38443e519524SHoward Hinnant { 38453e519524SHoward Hinnant __destruct_n __d(0); 38463e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38473e519524SHoward Hinnant value_type* __last2 = __first2; 3848ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38493e519524SHoward Hinnant __d.__incr((value_type*)0); 38503e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38513e519524SHoward Hinnant { 38523e519524SHoward Hinnant value_type* __j2 = __last2; 38533e519524SHoward Hinnant value_type* __i2 = __j2; 38543e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38553e519524SHoward Hinnant { 3856ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38573e519524SHoward Hinnant __d.__incr((value_type*)0); 38583e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3859ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3860ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38613e519524SHoward Hinnant } 38623e519524SHoward Hinnant else 38633e519524SHoward Hinnant { 3864ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38653e519524SHoward Hinnant __d.__incr((value_type*)0); 38663e519524SHoward Hinnant } 38673e519524SHoward Hinnant } 38683e519524SHoward Hinnant __h.release(); 38693e519524SHoward Hinnant } 38703e519524SHoward Hinnant} 38713e519524SHoward Hinnant 38723e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38733e519524SHoward Hinnantvoid 38743e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38753e519524SHoward Hinnant{ 38763e519524SHoward Hinnant // _Compare is known to be a reference type 38773e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38783e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3879ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3880ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38813e519524SHoward Hinnant while (true) 38823e519524SHoward Hinnant { 38833e519524SHoward Hinnant __restart: 38843e519524SHoward Hinnant difference_type __len = __last - __first; 38853e519524SHoward Hinnant switch (__len) 38863e519524SHoward Hinnant { 38873e519524SHoward Hinnant case 0: 38883e519524SHoward Hinnant case 1: 38893e519524SHoward Hinnant return; 38903e519524SHoward Hinnant case 2: 38913e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38923e519524SHoward Hinnant swap(*__first, *__last); 38933e519524SHoward Hinnant return; 38943e519524SHoward Hinnant case 3: 3895ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38963e519524SHoward Hinnant return; 38973e519524SHoward Hinnant case 4: 3898ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38993e519524SHoward Hinnant return; 39003e519524SHoward Hinnant case 5: 3901ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39023e519524SHoward Hinnant return; 39033e519524SHoward Hinnant } 39043e519524SHoward Hinnant if (__len <= __limit) 39053e519524SHoward Hinnant { 3906ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 39073e519524SHoward Hinnant return; 39083e519524SHoward Hinnant } 39093e519524SHoward Hinnant // __len > 5 39103e519524SHoward Hinnant _RandomAccessIterator __m = __first; 39113e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39123e519524SHoward Hinnant --__lm1; 39133e519524SHoward Hinnant unsigned __n_swaps; 39143e519524SHoward Hinnant { 39153e519524SHoward Hinnant difference_type __delta; 39163e519524SHoward Hinnant if (__len >= 1000) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant __delta = __len/2; 39193e519524SHoward Hinnant __m += __delta; 39203e519524SHoward Hinnant __delta /= 2; 3921ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39223e519524SHoward Hinnant } 39233e519524SHoward Hinnant else 39243e519524SHoward Hinnant { 39253e519524SHoward Hinnant __delta = __len/2; 39263e519524SHoward Hinnant __m += __delta; 3927ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39283e519524SHoward Hinnant } 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant // *__m is median 39313e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39323e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39333e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39343e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39353e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39363e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39373e519524SHoward Hinnant // Prime the downward search with a guard. 39383e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39393e519524SHoward Hinnant { 39403e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39413e519524SHoward Hinnant // manually guard downward moving __j against __i 39423e519524SHoward Hinnant while (true) 39433e519524SHoward Hinnant { 39443e519524SHoward Hinnant if (__i == --__j) 39453e519524SHoward Hinnant { 39463e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39473e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39483e519524SHoward Hinnant ++__i; // __first + 1 39493e519524SHoward Hinnant __j = __last; 39503e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39513e519524SHoward Hinnant { 39523e519524SHoward Hinnant while (true) 39533e519524SHoward Hinnant { 39543e519524SHoward Hinnant if (__i == __j) 39553e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39563e519524SHoward Hinnant if (__comp(*__first, *__i)) 39573e519524SHoward Hinnant { 39583e519524SHoward Hinnant swap(*__i, *__j); 39593e519524SHoward Hinnant ++__n_swaps; 39603e519524SHoward Hinnant ++__i; 39613e519524SHoward Hinnant break; 39623e519524SHoward Hinnant } 39633e519524SHoward Hinnant ++__i; 39643e519524SHoward Hinnant } 39653e519524SHoward Hinnant } 39663e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39673e519524SHoward Hinnant if (__i == __j) 39683e519524SHoward Hinnant return; 39693e519524SHoward Hinnant while (true) 39703e519524SHoward Hinnant { 39713e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39723e519524SHoward Hinnant ++__i; 39733e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39743e519524SHoward Hinnant ; 39753e519524SHoward Hinnant if (__i >= __j) 39763e519524SHoward Hinnant break; 39773e519524SHoward Hinnant swap(*__i, *__j); 39783e519524SHoward Hinnant ++__n_swaps; 39793e519524SHoward Hinnant ++__i; 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39823e519524SHoward Hinnant // The first part is sorted, sort the secod part 3983ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39843e519524SHoward Hinnant __first = __i; 39853e519524SHoward Hinnant goto __restart; 39863e519524SHoward Hinnant } 39873e519524SHoward Hinnant if (__comp(*__j, *__m)) 39883e519524SHoward Hinnant { 39893e519524SHoward Hinnant swap(*__i, *__j); 39903e519524SHoward Hinnant ++__n_swaps; 39913e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39923e519524SHoward Hinnant } 39933e519524SHoward Hinnant } 39943e519524SHoward Hinnant } 39953e519524SHoward Hinnant // It is known that *__i < *__m 39963e519524SHoward Hinnant ++__i; 39973e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39983e519524SHoward Hinnant // if not yet partitioned... 39993e519524SHoward Hinnant if (__i < __j) 40003e519524SHoward Hinnant { 40013e519524SHoward Hinnant // known that *(__i - 1) < *__m 40023e519524SHoward Hinnant // known that __i <= __m 40033e519524SHoward Hinnant while (true) 40043e519524SHoward Hinnant { 40053e519524SHoward Hinnant // __m still guards upward moving __i 40063e519524SHoward Hinnant while (__comp(*__i, *__m)) 40073e519524SHoward Hinnant ++__i; 40083e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 40093e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 40103e519524SHoward Hinnant ; 40113e519524SHoward Hinnant if (__i > __j) 40123e519524SHoward Hinnant break; 40133e519524SHoward Hinnant swap(*__i, *__j); 40143e519524SHoward Hinnant ++__n_swaps; 40153e519524SHoward Hinnant // It is known that __m != __j 40163e519524SHoward Hinnant // If __m just moved, follow it 40173e519524SHoward Hinnant if (__m == __i) 40183e519524SHoward Hinnant __m = __j; 40193e519524SHoward Hinnant ++__i; 40203e519524SHoward Hinnant } 40213e519524SHoward Hinnant } 40223e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40233e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40243e519524SHoward Hinnant { 40253e519524SHoward Hinnant swap(*__i, *__m); 40263e519524SHoward Hinnant ++__n_swaps; 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40293e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40303e519524SHoward Hinnant if (__n_swaps == 0) 40313e519524SHoward Hinnant { 4032ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4033ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40343e519524SHoward Hinnant { 40353e519524SHoward Hinnant if (__fs) 40363e519524SHoward Hinnant return; 40373e519524SHoward Hinnant __last = __i; 40383e519524SHoward Hinnant continue; 40393e519524SHoward Hinnant } 40403e519524SHoward Hinnant else 40413e519524SHoward Hinnant { 40423e519524SHoward Hinnant if (__fs) 40433e519524SHoward Hinnant { 40443e519524SHoward Hinnant __first = ++__i; 40453e519524SHoward Hinnant continue; 40463e519524SHoward Hinnant } 40473e519524SHoward Hinnant } 40483e519524SHoward Hinnant } 40493e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40503e519524SHoward Hinnant if (__i - __first < __last - __i) 40513e519524SHoward Hinnant { 4052ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4053ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40543e519524SHoward Hinnant __first = ++__i; 40553e519524SHoward Hinnant } 40563e519524SHoward Hinnant else 40573e519524SHoward Hinnant { 4058ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4059ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40603e519524SHoward Hinnant __last = __i; 40613e519524SHoward Hinnant } 40623e519524SHoward Hinnant } 40633e519524SHoward Hinnant} 40643e519524SHoward Hinnant 40653e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40683e519524SHoward Hinnantvoid 40693e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40703e519524SHoward Hinnant{ 4071145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40743e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4075145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40773e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4078145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40793e519524SHoward Hinnant} 40803e519524SHoward Hinnant 40813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40833e519524SHoward Hinnantvoid 40843e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40853e519524SHoward Hinnant{ 4086ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40873e519524SHoward Hinnant} 40883e519524SHoward Hinnant 40893e519524SHoward Hinnanttemplate <class _Tp> 40903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40913e519524SHoward Hinnantvoid 40923e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40933e519524SHoward Hinnant{ 4094ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40953e519524SHoward Hinnant} 40963e519524SHoward Hinnant 40973e519524SHoward Hinnanttemplate <class _Tp> 40983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40993e519524SHoward Hinnantvoid 41003e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41013e519524SHoward Hinnant{ 4102ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 41033e519524SHoward Hinnant} 41043e519524SHoward Hinnant 4105f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4106f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4107f554add5SHoward Hinnantvoid 4108f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4109f554add5SHoward Hinnant{ 4110f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4111f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4112f554add5SHoward Hinnant} 4113f554add5SHoward Hinnant 41140be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4115e4383379SHoward Hinnant#pragma warning( push ) 4116e4383379SHoward Hinnant#pragma warning( disable: 4231) 41170be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4118f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4119f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4120f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4121f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4122f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4123f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4124f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4125f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4126f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4127f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4128f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4129f0544c20SHoward 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>&)) 4130f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4131f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4132f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41333e519524SHoward Hinnant 4134f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4135f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4136f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4137f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4138f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4139f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4140f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4141f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4142f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4143f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4144f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4145f0544c20SHoward 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>&)) 4146f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4147f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4148f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41493e519524SHoward Hinnant 4150f0544c20SHoward 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>&)) 41510be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4152e4383379SHoward Hinnant#pragma warning( pop ) 41530be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41543e519524SHoward Hinnant 41553e519524SHoward Hinnant// lower_bound 41563e519524SHoward Hinnant 41573e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41583e519524SHoward Hinnant_ForwardIterator 4159e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41603e519524SHoward Hinnant{ 41613e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4162ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41633e519524SHoward Hinnant while (__len != 0) 41643e519524SHoward Hinnant { 41653e519524SHoward Hinnant difference_type __l2 = __len / 2; 41663e519524SHoward Hinnant _ForwardIterator __m = __first; 4167ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4168e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41693e519524SHoward Hinnant { 41703e519524SHoward Hinnant __first = ++__m; 41713e519524SHoward Hinnant __len -= __l2 + 1; 41723e519524SHoward Hinnant } 41733e519524SHoward Hinnant else 41743e519524SHoward Hinnant __len = __l2; 41753e519524SHoward Hinnant } 41763e519524SHoward Hinnant return __first; 41773e519524SHoward Hinnant} 41783e519524SHoward Hinnant 41793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41813e519524SHoward Hinnant_ForwardIterator 4182e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41833e519524SHoward Hinnant{ 4184145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41853e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41863e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4187e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4188145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41893e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4190e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4191145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41923e519524SHoward Hinnant} 41933e519524SHoward Hinnant 41943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41963e519524SHoward Hinnant_ForwardIterator 4197e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41983e519524SHoward Hinnant{ 4199e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42003e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42013e519524SHoward Hinnant} 42023e519524SHoward Hinnant 42033e519524SHoward Hinnant// upper_bound 42043e519524SHoward Hinnant 42053e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42063e519524SHoward Hinnant_ForwardIterator 4207e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42083e519524SHoward Hinnant{ 42093e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4210ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42113e519524SHoward Hinnant while (__len != 0) 42123e519524SHoward Hinnant { 42133e519524SHoward Hinnant difference_type __l2 = __len / 2; 42143e519524SHoward Hinnant _ForwardIterator __m = __first; 4215ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4216e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42173e519524SHoward Hinnant __len = __l2; 42183e519524SHoward Hinnant else 42193e519524SHoward Hinnant { 42203e519524SHoward Hinnant __first = ++__m; 42213e519524SHoward Hinnant __len -= __l2 + 1; 42223e519524SHoward Hinnant } 42233e519524SHoward Hinnant } 42243e519524SHoward Hinnant return __first; 42253e519524SHoward Hinnant} 42263e519524SHoward Hinnant 42273e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42293e519524SHoward Hinnant_ForwardIterator 4230e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42313e519524SHoward Hinnant{ 4232145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42333e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42343e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4235e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4236145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42373e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4238e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4239145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42403e519524SHoward Hinnant} 42413e519524SHoward Hinnant 42423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42443e519524SHoward Hinnant_ForwardIterator 4245e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42463e519524SHoward Hinnant{ 4247e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42483e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42493e519524SHoward Hinnant} 42503e519524SHoward Hinnant 42513e519524SHoward Hinnant// equal_range 42523e519524SHoward Hinnant 42533e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42543e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4255e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42563e519524SHoward Hinnant{ 42573e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4258ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42593e519524SHoward Hinnant while (__len != 0) 42603e519524SHoward Hinnant { 42613e519524SHoward Hinnant difference_type __l2 = __len / 2; 42623e519524SHoward Hinnant _ForwardIterator __m = __first; 4263ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4264e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42653e519524SHoward Hinnant { 42663e519524SHoward Hinnant __first = ++__m; 42673e519524SHoward Hinnant __len -= __l2 + 1; 42683e519524SHoward Hinnant } 4269e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42703e519524SHoward Hinnant { 42713e519524SHoward Hinnant __last = __m; 42723e519524SHoward Hinnant __len = __l2; 42733e519524SHoward Hinnant } 42743e519524SHoward Hinnant else 42753e519524SHoward Hinnant { 42763e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42773e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42783e519524SHoward Hinnant ( 4279e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4280e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42813e519524SHoward Hinnant ); 42823e519524SHoward Hinnant } 42833e519524SHoward Hinnant } 42843e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42853e519524SHoward Hinnant} 42863e519524SHoward Hinnant 42873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42893e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4290e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42913e519524SHoward Hinnant{ 4292145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4295e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4296145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4298e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4299145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43003e519524SHoward Hinnant} 43013e519524SHoward Hinnant 43023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43043e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4305e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43063e519524SHoward Hinnant{ 4307e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 43083e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43093e519524SHoward Hinnant} 43103e519524SHoward Hinnant 43113e519524SHoward Hinnant// binary_search 43123e519524SHoward Hinnant 43133e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43153e519524SHoward Hinnantbool 4316e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43173e519524SHoward Hinnant{ 4318e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4319e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43203e519524SHoward Hinnant} 43213e519524SHoward Hinnant 43223e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43243e519524SHoward Hinnantbool 4325e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43263e519524SHoward Hinnant{ 4327145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4330e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4331145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4333e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4334145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43353e519524SHoward Hinnant} 43363e519524SHoward Hinnant 43373e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43393e519524SHoward Hinnantbool 4340e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43413e519524SHoward Hinnant{ 4342e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43433e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43443e519524SHoward Hinnant} 43453e519524SHoward Hinnant 43463e519524SHoward Hinnant// merge 43473e519524SHoward Hinnant 43483e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43493e519524SHoward Hinnant_OutputIterator 43503e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43523e519524SHoward Hinnant{ 43533e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43543e519524SHoward Hinnant { 43553e519524SHoward Hinnant if (__first2 == __last2) 4356ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43573e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43583e519524SHoward Hinnant { 43593e519524SHoward Hinnant *__result = *__first2; 43603e519524SHoward Hinnant ++__first2; 43613e519524SHoward Hinnant } 43623e519524SHoward Hinnant else 43633e519524SHoward Hinnant { 43643e519524SHoward Hinnant *__result = *__first1; 43653e519524SHoward Hinnant ++__first1; 43663e519524SHoward Hinnant } 43673e519524SHoward Hinnant } 4368ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43693e519524SHoward Hinnant} 43703e519524SHoward Hinnant 43713e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43733e519524SHoward Hinnant_OutputIterator 43743e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43753e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43763e519524SHoward Hinnant{ 4377145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4380ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4381145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4383ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4384145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43853e519524SHoward Hinnant} 43863e519524SHoward Hinnant 43873e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43893e519524SHoward Hinnant_OutputIterator 43903e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43913e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43923e519524SHoward Hinnant{ 43933e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43943e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43953e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43963e519524SHoward Hinnant} 43973e519524SHoward Hinnant 43983e519524SHoward Hinnant// inplace_merge 43993e519524SHoward Hinnant 4400adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4401adfdae18SMarshall Clow class _OutputIterator> 4402adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4403adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4404adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4405adfdae18SMarshall Clow{ 4406adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4407adfdae18SMarshall Clow { 4408adfdae18SMarshall Clow if (__first2 == __last2) 4409adfdae18SMarshall Clow { 4410adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4411adfdae18SMarshall Clow return; 4412adfdae18SMarshall Clow } 4413adfdae18SMarshall Clow 4414adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4415adfdae18SMarshall Clow { 4416adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4417adfdae18SMarshall Clow ++__first2; 4418adfdae18SMarshall Clow } 4419adfdae18SMarshall Clow else 4420adfdae18SMarshall Clow { 4421adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4422adfdae18SMarshall Clow ++__first1; 4423adfdae18SMarshall Clow } 4424adfdae18SMarshall Clow } 4425adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4426adfdae18SMarshall Clow} 4427adfdae18SMarshall Clow 44283e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44293e519524SHoward Hinnantvoid 44303e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44313e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44323e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44333e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44343e519524SHoward Hinnant{ 44353e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44363e519524SHoward Hinnant __destruct_n __d(0); 44373e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44383e519524SHoward Hinnant if (__len1 <= __len2) 44393e519524SHoward Hinnant { 44403e519524SHoward Hinnant value_type* __p = __buff; 4441910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4442ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4443adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44443e519524SHoward Hinnant } 44453e519524SHoward Hinnant else 44463e519524SHoward Hinnant { 44473e519524SHoward Hinnant value_type* __p = __buff; 4448910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4449ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44503e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44513e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4452adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4453adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 44543e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 44553e519524SHoward Hinnant } 44563e519524SHoward Hinnant} 44573e519524SHoward Hinnant 44583e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44593e519524SHoward Hinnantvoid 44603e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44613e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44623e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44633e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44643e519524SHoward Hinnant{ 44653e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44663e519524SHoward Hinnant while (true) 44673e519524SHoward Hinnant { 44683e519524SHoward Hinnant // if __middle == __last, we're done 44693e519524SHoward Hinnant if (__len2 == 0) 44703e519524SHoward Hinnant return; 4471526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4472526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4473526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44743e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4475910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44763e519524SHoward Hinnant { 44773e519524SHoward Hinnant if (__len1 == 0) 44783e519524SHoward Hinnant return; 44793e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44803e519524SHoward Hinnant break; 44813e519524SHoward Hinnant } 44823e519524SHoward Hinnant // __first < __middle < __last 44833e519524SHoward Hinnant // *__first > *__middle 44843e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44853e519524SHoward Hinnant // all elements in: 44863e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44873e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44883e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44893e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44903e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44913e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44923e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44933e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44943e519524SHoward Hinnant // binary search smaller range 44953e519524SHoward Hinnant if (__len1 < __len2) 44963e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44973e519524SHoward Hinnant __len21 = __len2 / 2; 44983e519524SHoward Hinnant __m2 = __middle; 4499ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45003e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4501ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 45023e519524SHoward Hinnant } 45033e519524SHoward Hinnant else 45043e519524SHoward Hinnant { 45053e519524SHoward Hinnant if (__len1 == 1) 45063e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 45073e519524SHoward Hinnant // It is known *__first > *__middle 45083e519524SHoward Hinnant swap(*__first, *__middle); 45093e519524SHoward Hinnant return; 45103e519524SHoward Hinnant } 45113e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45123e519524SHoward Hinnant __len11 = __len1 / 2; 45133e519524SHoward Hinnant __m1 = __first; 4514ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45153e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4516ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45173e519524SHoward Hinnant } 45183e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45193e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45203e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45213e519524SHoward Hinnant // swap middle two partitions 4522ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45233e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45243e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45253e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45263e519524SHoward Hinnant { 45273e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45283e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45293e519524SHoward Hinnant __first = __middle; 45303e519524SHoward Hinnant __middle = __m2; 45313e519524SHoward Hinnant __len1 = __len12; 45323e519524SHoward Hinnant __len2 = __len22; 45333e519524SHoward Hinnant } 45343e519524SHoward Hinnant else 45353e519524SHoward Hinnant { 45363e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45373e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45383e519524SHoward Hinnant __last = __middle; 45393e519524SHoward Hinnant __middle = __m1; 45403e519524SHoward Hinnant __len1 = __len11; 45413e519524SHoward Hinnant __len2 = __len21; 45423e519524SHoward Hinnant } 45433e519524SHoward Hinnant } 45443e519524SHoward Hinnant} 45453e519524SHoward Hinnant 45463e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45483e519524SHoward Hinnantvoid 45493e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45503e519524SHoward Hinnant _Compare __comp) 45513e519524SHoward Hinnant{ 45523e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4554ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4555ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4556ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45570b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45580b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45590b48cf9aSMarshall Clow 4560145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45613e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45623e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4563ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45643e519524SHoward Hinnant __buf.first, __buf.second); 4565145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4567ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45683e519524SHoward Hinnant __buf.first, __buf.second); 4569145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45703e519524SHoward Hinnant} 45713e519524SHoward Hinnant 45723e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45743e519524SHoward Hinnantvoid 45753e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45763e519524SHoward Hinnant{ 4577ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45783e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45793e519524SHoward Hinnant} 45803e519524SHoward Hinnant 45813e519524SHoward Hinnant// stable_sort 45823e519524SHoward Hinnant 45833e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45843e519524SHoward Hinnantvoid 45853e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45863e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45873e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45883e519524SHoward Hinnant{ 45893e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45903e519524SHoward Hinnant __destruct_n __d(0); 45913e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45923e519524SHoward Hinnant for (; true; ++__result) 45933e519524SHoward Hinnant { 45943e519524SHoward Hinnant if (__first1 == __last1) 45953e519524SHoward Hinnant { 45963e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4597ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45983e519524SHoward Hinnant __h.release(); 45993e519524SHoward Hinnant return; 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant if (__first2 == __last2) 46023e519524SHoward Hinnant { 46033e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4604ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46053e519524SHoward Hinnant __h.release(); 46063e519524SHoward Hinnant return; 46073e519524SHoward Hinnant } 46083e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46093e519524SHoward Hinnant { 4610ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46113e519524SHoward Hinnant __d.__incr((value_type*)0); 46123e519524SHoward Hinnant ++__first2; 46133e519524SHoward Hinnant } 46143e519524SHoward Hinnant else 46153e519524SHoward Hinnant { 4616ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46173e519524SHoward Hinnant __d.__incr((value_type*)0); 46183e519524SHoward Hinnant ++__first1; 46193e519524SHoward Hinnant } 46203e519524SHoward Hinnant } 46213e519524SHoward Hinnant} 46223e519524SHoward Hinnant 46233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46243e519524SHoward Hinnantvoid 46253e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46273e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46283e519524SHoward Hinnant{ 46293e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46303e519524SHoward Hinnant { 46313e519524SHoward Hinnant if (__first2 == __last2) 46323e519524SHoward Hinnant { 46333e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4634ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46353e519524SHoward Hinnant return; 46363e519524SHoward Hinnant } 46373e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46383e519524SHoward Hinnant { 4639ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46403e519524SHoward Hinnant ++__first2; 46413e519524SHoward Hinnant } 46423e519524SHoward Hinnant else 46433e519524SHoward Hinnant { 4644ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46453e519524SHoward Hinnant ++__first1; 46463e519524SHoward Hinnant } 46473e519524SHoward Hinnant } 46483e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4649ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46503e519524SHoward Hinnant} 46513e519524SHoward Hinnant 46523e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46533e519524SHoward Hinnantvoid 46543e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46563e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46573e519524SHoward Hinnant 46583e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46593e519524SHoward Hinnantvoid 46603e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46613e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46623e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46633e519524SHoward Hinnant{ 46643e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46653e519524SHoward Hinnant switch (__len) 46663e519524SHoward Hinnant { 46673e519524SHoward Hinnant case 0: 46683e519524SHoward Hinnant return; 46693e519524SHoward Hinnant case 1: 4670ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46713e519524SHoward Hinnant return; 46723e519524SHoward Hinnant case 2: 46733e519524SHoward Hinnant __destruct_n __d(0); 46743e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46753e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46763e519524SHoward Hinnant { 4677ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46783e519524SHoward Hinnant __d.__incr((value_type*)0); 46793e519524SHoward Hinnant ++__first2; 4680ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46813e519524SHoward Hinnant } 46823e519524SHoward Hinnant else 46833e519524SHoward Hinnant { 4684ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46853e519524SHoward Hinnant __d.__incr((value_type*)0); 46863e519524SHoward Hinnant ++__first2; 4687ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46883e519524SHoward Hinnant } 46893e519524SHoward Hinnant __h2.release(); 46903e519524SHoward Hinnant return; 46913e519524SHoward Hinnant } 46923e519524SHoward Hinnant if (__len <= 8) 46933e519524SHoward Hinnant { 46943e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46953e519524SHoward Hinnant return; 46963e519524SHoward Hinnant } 46973e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46983e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46993e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47003e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47013e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 47023e519524SHoward Hinnant} 47033e519524SHoward Hinnant 47043e519524SHoward Hinnanttemplate <class _Tp> 47053e519524SHoward Hinnantstruct __stable_sort_switch 47063e519524SHoward Hinnant{ 4707ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 47083e519524SHoward Hinnant}; 47093e519524SHoward Hinnant 47103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47113e519524SHoward Hinnantvoid 47123e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47133e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47143e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47153e519524SHoward Hinnant{ 47163e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47173e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47183e519524SHoward Hinnant switch (__len) 47193e519524SHoward Hinnant { 47203e519524SHoward Hinnant case 0: 47213e519524SHoward Hinnant case 1: 47223e519524SHoward Hinnant return; 47233e519524SHoward Hinnant case 2: 47243e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47253e519524SHoward Hinnant swap(*__first, *__last); 47263e519524SHoward Hinnant return; 47273e519524SHoward Hinnant } 47283e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47293e519524SHoward Hinnant { 47303e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47313e519524SHoward Hinnant return; 47323e519524SHoward Hinnant } 47333e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47343e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47353e519524SHoward Hinnant if (__len <= __buff_size) 47363e519524SHoward Hinnant { 47373e519524SHoward Hinnant __destruct_n __d(0); 47383e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47393e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47403e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47413e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47423e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47433e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47443e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47453e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47463e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47473e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47483e519524SHoward Hinnant// __first, __comp); 47493e519524SHoward Hinnant return; 47503e519524SHoward Hinnant } 47513e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47523e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47533e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47543e519524SHoward Hinnant} 47553e519524SHoward Hinnant 47563e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47583e519524SHoward Hinnantvoid 47593e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47603e519524SHoward Hinnant{ 47613e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47633e519524SHoward Hinnant difference_type __len = __last - __first; 47643e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47653e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47663e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47673e519524SHoward Hinnant { 4768ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47693e519524SHoward Hinnant __h.reset(__buf.first); 47703e519524SHoward Hinnant } 4771145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47743e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4775145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47773e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4778145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47793e519524SHoward Hinnant} 47803e519524SHoward Hinnant 47813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47833e519524SHoward Hinnantvoid 47843e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47853e519524SHoward Hinnant{ 4786ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47873e519524SHoward Hinnant} 47883e519524SHoward Hinnant 47893e519524SHoward Hinnant// is_heap_until 47903e519524SHoward Hinnant 47913e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47923e519524SHoward Hinnant_RandomAccessIterator 47933e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47943e519524SHoward Hinnant{ 4795ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47963e519524SHoward Hinnant difference_type __len = __last - __first; 47973e519524SHoward Hinnant difference_type __p = 0; 47983e519524SHoward Hinnant difference_type __c = 1; 47993e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48003e519524SHoward Hinnant while (__c < __len) 48013e519524SHoward Hinnant { 48023e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 48033e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48043e519524SHoward Hinnant return __cp; 48053e519524SHoward Hinnant ++__c; 48063e519524SHoward Hinnant ++__cp; 48073e519524SHoward Hinnant if (__c == __len) 48083e519524SHoward Hinnant return __last; 48093e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 48103e519524SHoward Hinnant return __cp; 48113e519524SHoward Hinnant ++__p; 48123e519524SHoward Hinnant ++__pp; 48133e519524SHoward Hinnant __c = 2 * __p + 1; 48143e519524SHoward Hinnant } 48153e519524SHoward Hinnant return __last; 48163e519524SHoward Hinnant} 48173e519524SHoward Hinnant 48183e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48203e519524SHoward Hinnant_RandomAccessIterator 48213e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48223e519524SHoward Hinnant{ 4823ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48243e519524SHoward Hinnant} 48253e519524SHoward Hinnant 48263e519524SHoward Hinnant// is_heap 48273e519524SHoward Hinnant 48283e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48303e519524SHoward Hinnantbool 48313e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48323e519524SHoward Hinnant{ 4833ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48343e519524SHoward Hinnant} 48353e519524SHoward Hinnant 48363e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48383e519524SHoward Hinnantbool 48393e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48403e519524SHoward Hinnant{ 4841ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48423e519524SHoward Hinnant} 48433e519524SHoward Hinnant 48443e519524SHoward Hinnant// push_heap 48453e519524SHoward Hinnant 48463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48473e519524SHoward Hinnantvoid 48488b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48493e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48503e519524SHoward Hinnant{ 48513e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48523e519524SHoward Hinnant if (__len > 1) 48533e519524SHoward Hinnant { 48543e519524SHoward Hinnant __len = (__len - 2) / 2; 48553e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48563e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48573e519524SHoward Hinnant { 4858ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48593e519524SHoward Hinnant do 48603e519524SHoward Hinnant { 4861ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48623e519524SHoward Hinnant __last = __ptr; 48633e519524SHoward Hinnant if (__len == 0) 48643e519524SHoward Hinnant break; 48653e519524SHoward Hinnant __len = (__len - 1) / 2; 48663e519524SHoward Hinnant __ptr = __first + __len; 48673e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4868ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48693e519524SHoward Hinnant } 48703e519524SHoward Hinnant } 48713e519524SHoward Hinnant} 48723e519524SHoward Hinnant 48733e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48753e519524SHoward Hinnantvoid 48763e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48773e519524SHoward Hinnant{ 4878145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48793e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48803e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48818b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4882145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48833e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48848b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4885145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48863e519524SHoward Hinnant} 48873e519524SHoward Hinnant 48883e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48903e519524SHoward Hinnantvoid 48913e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48923e519524SHoward Hinnant{ 4893ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48943e519524SHoward Hinnant} 48953e519524SHoward Hinnant 48963e519524SHoward Hinnant// pop_heap 48973e519524SHoward Hinnant 48983e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48998b512602SDavid Majnemervoid 4900*fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4901*fd838227SEric Fiselier _Compare __comp, 49028b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 49038b512602SDavid Majnemer _RandomAccessIterator __start) 49048b512602SDavid Majnemer{ 49058b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49068b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49078b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 49088b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 49098b512602SDavid Majnemer difference_type __child = __start - __first; 49108b512602SDavid Majnemer 49118b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 49128b512602SDavid Majnemer return; 49138b512602SDavid Majnemer 49148b512602SDavid Majnemer __child = 2 * __child + 1; 49158b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49168b512602SDavid Majnemer 49178b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49188b512602SDavid Majnemer // right-child exists and is greater than left-child 49198b512602SDavid Majnemer ++__child_i; 49208b512602SDavid Majnemer ++__child; 49218b512602SDavid Majnemer } 49228b512602SDavid Majnemer 49238b512602SDavid Majnemer // check if we are in heap-order 49248b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49258b512602SDavid Majnemer // we are, __start is larger than it's largest child 49268b512602SDavid Majnemer return; 49278b512602SDavid Majnemer 49288b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49298b512602SDavid Majnemer do 49308b512602SDavid Majnemer { 49318b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49328b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49338b512602SDavid Majnemer __start = __child_i; 49348b512602SDavid Majnemer 49358b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49368b512602SDavid Majnemer break; 49378b512602SDavid Majnemer 49388b512602SDavid Majnemer // recompute the child based off of the updated parent 49398b512602SDavid Majnemer __child = 2 * __child + 1; 49408b512602SDavid Majnemer __child_i = __first + __child; 49418b512602SDavid Majnemer 49428b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49438b512602SDavid Majnemer // right-child exists and is greater than left-child 49448b512602SDavid Majnemer ++__child_i; 49458b512602SDavid Majnemer ++__child; 49468b512602SDavid Majnemer } 49478b512602SDavid Majnemer 49488b512602SDavid Majnemer // check if we are in heap-order 49498b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49508b512602SDavid Majnemer *__start = _VSTD::move(__top); 49518b512602SDavid Majnemer} 49528b512602SDavid Majnemer 49538b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49553e519524SHoward Hinnantvoid 49563e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49573e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49583e519524SHoward Hinnant{ 49593e519524SHoward Hinnant if (__len > 1) 49603e519524SHoward Hinnant { 49613e519524SHoward Hinnant swap(*__first, *--__last); 49628b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49633e519524SHoward Hinnant } 49643e519524SHoward Hinnant} 49653e519524SHoward Hinnant 49663e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49683e519524SHoward Hinnantvoid 49693e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49703e519524SHoward Hinnant{ 4971145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49723e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49733e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49743e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4975145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49763e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49773e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4978145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49793e519524SHoward Hinnant} 49803e519524SHoward Hinnant 49813e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49833e519524SHoward Hinnantvoid 49843e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49853e519524SHoward Hinnant{ 4986ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49873e519524SHoward Hinnant} 49883e519524SHoward Hinnant 49893e519524SHoward Hinnant// make_heap 49903e519524SHoward Hinnant 49913e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49923e519524SHoward Hinnantvoid 49933e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49943e519524SHoward Hinnant{ 49953e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49963e519524SHoward Hinnant difference_type __n = __last - __first; 49973e519524SHoward Hinnant if (__n > 1) 49983e519524SHoward Hinnant { 49998b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50008b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50018b512602SDavid Majnemer { 50028b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 50038b512602SDavid Majnemer } 50043e519524SHoward Hinnant } 50053e519524SHoward Hinnant} 50063e519524SHoward Hinnant 50073e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50093e519524SHoward Hinnantvoid 50103e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50113e519524SHoward Hinnant{ 5012145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50153e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5016145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50183e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5019145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50203e519524SHoward Hinnant} 50213e519524SHoward Hinnant 50223e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50243e519524SHoward Hinnantvoid 50253e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50263e519524SHoward Hinnant{ 5027ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50283e519524SHoward Hinnant} 50293e519524SHoward Hinnant 50303e519524SHoward Hinnant// sort_heap 50313e519524SHoward Hinnant 50323e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50333e519524SHoward Hinnantvoid 50343e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50353e519524SHoward Hinnant{ 50363e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50373e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50383e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50393e519524SHoward Hinnant} 50403e519524SHoward Hinnant 50413e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50433e519524SHoward Hinnantvoid 50443e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50453e519524SHoward Hinnant{ 5046145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50493e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5050145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50523e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5053145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50543e519524SHoward Hinnant} 50553e519524SHoward Hinnant 50563e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50583e519524SHoward Hinnantvoid 50593e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50603e519524SHoward Hinnant{ 5061ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50623e519524SHoward Hinnant} 50633e519524SHoward Hinnant 50643e519524SHoward Hinnant// partial_sort 50653e519524SHoward Hinnant 50663e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50673e519524SHoward Hinnantvoid 50683e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50693e519524SHoward Hinnant _Compare __comp) 50703e519524SHoward Hinnant{ 50713e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50723e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50733e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50743e519524SHoward Hinnant { 50753e519524SHoward Hinnant if (__comp(*__i, *__first)) 50763e519524SHoward Hinnant { 50773e519524SHoward Hinnant swap(*__i, *__first); 50788b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50793e519524SHoward Hinnant } 50803e519524SHoward Hinnant } 50813e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50823e519524SHoward Hinnant} 50833e519524SHoward Hinnant 50843e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50863e519524SHoward Hinnantvoid 50873e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50883e519524SHoward Hinnant _Compare __comp) 50893e519524SHoward Hinnant{ 5090145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50933e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5094145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50963e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5097145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50983e519524SHoward Hinnant} 50993e519524SHoward Hinnant 51003e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51023e519524SHoward Hinnantvoid 51033e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 51043e519524SHoward Hinnant{ 5105ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 51063e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51073e519524SHoward Hinnant} 51083e519524SHoward Hinnant 51093e519524SHoward Hinnant// partial_sort_copy 51103e519524SHoward Hinnant 51113e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 51123e519524SHoward Hinnant_RandomAccessIterator 51133e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51143e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51153e519524SHoward Hinnant{ 51163e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51173e519524SHoward Hinnant if (__r != __result_last) 51183e519524SHoward Hinnant { 5119910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51203e519524SHoward Hinnant *__r = *__first; 51213e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51228b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51233e519524SHoward Hinnant for (; __first != __last; ++__first) 51243e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51253e519524SHoward Hinnant { 51263e519524SHoward Hinnant *__result_first = *__first; 51278b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51283e519524SHoward Hinnant } 51293e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51303e519524SHoward Hinnant } 51313e519524SHoward Hinnant return __r; 51323e519524SHoward Hinnant} 51333e519524SHoward Hinnant 51343e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51363e519524SHoward Hinnant_RandomAccessIterator 51373e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51383e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51393e519524SHoward Hinnant{ 5140145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51413e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51423e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51433e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5144145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51453e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51463e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5147145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51483e519524SHoward Hinnant} 51493e519524SHoward Hinnant 51503e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51523e519524SHoward Hinnant_RandomAccessIterator 51533e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51543e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51553e519524SHoward Hinnant{ 5156ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51573e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51583e519524SHoward Hinnant} 51593e519524SHoward Hinnant 51603e519524SHoward Hinnant// nth_element 51613e519524SHoward Hinnant 51623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51633e519524SHoward Hinnantvoid 51643e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51653e519524SHoward Hinnant{ 51663e519524SHoward Hinnant // _Compare is known to be a reference type 51673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51683e519524SHoward Hinnant const difference_type __limit = 7; 51693e519524SHoward Hinnant while (true) 51703e519524SHoward Hinnant { 51713e519524SHoward Hinnant __restart: 5172b34b4819SHoward Hinnant if (__nth == __last) 5173b34b4819SHoward Hinnant return; 51743e519524SHoward Hinnant difference_type __len = __last - __first; 51753e519524SHoward Hinnant switch (__len) 51763e519524SHoward Hinnant { 51773e519524SHoward Hinnant case 0: 51783e519524SHoward Hinnant case 1: 51793e519524SHoward Hinnant return; 51803e519524SHoward Hinnant case 2: 51813e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51823e519524SHoward Hinnant swap(*__first, *__last); 51833e519524SHoward Hinnant return; 51843e519524SHoward Hinnant case 3: 51853e519524SHoward Hinnant { 51863e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5187ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51883e519524SHoward Hinnant return; 51893e519524SHoward Hinnant } 51903e519524SHoward Hinnant } 51913e519524SHoward Hinnant if (__len <= __limit) 51923e519524SHoward Hinnant { 51933e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51943e519524SHoward Hinnant return; 51953e519524SHoward Hinnant } 51963e519524SHoward Hinnant // __len > __limit >= 3 51973e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51983e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5199ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52003e519524SHoward Hinnant // *__m is median 52013e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 52023e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 52033e519524SHoward Hinnant _RandomAccessIterator __i = __first; 52043e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 52053e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52063e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 52073e519524SHoward Hinnant // Prime the downward search with a guard. 52083e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 52093e519524SHoward Hinnant { 52103e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 52113e519524SHoward Hinnant // manually guard downward moving __j against __i 52123e519524SHoward Hinnant while (true) 52133e519524SHoward Hinnant { 52143e519524SHoward Hinnant if (__i == --__j) 52153e519524SHoward Hinnant { 52163e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52173e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52183e519524SHoward Hinnant ++__i; // __first + 1 52193e519524SHoward Hinnant __j = __last; 52203e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52213e519524SHoward Hinnant { 52223e519524SHoward Hinnant while (true) 52233e519524SHoward Hinnant { 52243e519524SHoward Hinnant if (__i == __j) 52253e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52263e519524SHoward Hinnant if (__comp(*__first, *__i)) 52273e519524SHoward Hinnant { 52283e519524SHoward Hinnant swap(*__i, *__j); 52293e519524SHoward Hinnant ++__n_swaps; 52303e519524SHoward Hinnant ++__i; 52313e519524SHoward Hinnant break; 52323e519524SHoward Hinnant } 52333e519524SHoward Hinnant ++__i; 52343e519524SHoward Hinnant } 52353e519524SHoward Hinnant } 52363e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52373e519524SHoward Hinnant if (__i == __j) 52383e519524SHoward Hinnant return; 52393e519524SHoward Hinnant while (true) 52403e519524SHoward Hinnant { 52413e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52423e519524SHoward Hinnant ++__i; 52433e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52443e519524SHoward Hinnant ; 52453e519524SHoward Hinnant if (__i >= __j) 52463e519524SHoward Hinnant break; 52473e519524SHoward Hinnant swap(*__i, *__j); 52483e519524SHoward Hinnant ++__n_swaps; 52493e519524SHoward Hinnant ++__i; 52503e519524SHoward Hinnant } 52513e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52523e519524SHoward Hinnant // The first part is sorted, 52533e519524SHoward Hinnant if (__nth < __i) 52543e519524SHoward Hinnant return; 52553e519524SHoward Hinnant // __nth_element the secod part 52563e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52573e519524SHoward Hinnant __first = __i; 52583e519524SHoward Hinnant goto __restart; 52593e519524SHoward Hinnant } 52603e519524SHoward Hinnant if (__comp(*__j, *__m)) 52613e519524SHoward Hinnant { 52623e519524SHoward Hinnant swap(*__i, *__j); 52633e519524SHoward Hinnant ++__n_swaps; 52643e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52653e519524SHoward Hinnant } 52663e519524SHoward Hinnant } 52673e519524SHoward Hinnant } 52683e519524SHoward Hinnant ++__i; 52693e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52703e519524SHoward Hinnant // if not yet partitioned... 52713e519524SHoward Hinnant if (__i < __j) 52723e519524SHoward Hinnant { 52733e519524SHoward Hinnant // known that *(__i - 1) < *__m 52743e519524SHoward Hinnant while (true) 52753e519524SHoward Hinnant { 52763e519524SHoward Hinnant // __m still guards upward moving __i 52773e519524SHoward Hinnant while (__comp(*__i, *__m)) 52783e519524SHoward Hinnant ++__i; 52793e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52803e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52813e519524SHoward Hinnant ; 52823e519524SHoward Hinnant if (__i >= __j) 52833e519524SHoward Hinnant break; 52843e519524SHoward Hinnant swap(*__i, *__j); 52853e519524SHoward Hinnant ++__n_swaps; 52863e519524SHoward Hinnant // It is known that __m != __j 52873e519524SHoward Hinnant // If __m just moved, follow it 52883e519524SHoward Hinnant if (__m == __i) 52893e519524SHoward Hinnant __m = __j; 52903e519524SHoward Hinnant ++__i; 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52943e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52953e519524SHoward Hinnant { 52963e519524SHoward Hinnant swap(*__i, *__m); 52973e519524SHoward Hinnant ++__n_swaps; 52983e519524SHoward Hinnant } 52993e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53003e519524SHoward Hinnant if (__nth == __i) 53013e519524SHoward Hinnant return; 53023e519524SHoward Hinnant if (__n_swaps == 0) 53033e519524SHoward Hinnant { 53043e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 53053e519524SHoward Hinnant if (__nth < __i) 53063e519524SHoward Hinnant { 53073e519524SHoward Hinnant // Check for [__first, __i) already sorted 53083e519524SHoward Hinnant __j = __m = __first; 53093e519524SHoward Hinnant while (++__j != __i) 53103e519524SHoward Hinnant { 53113e519524SHoward Hinnant if (__comp(*__j, *__m)) 53123e519524SHoward Hinnant // not yet sorted, so sort 53133e519524SHoward Hinnant goto not_sorted; 53143e519524SHoward Hinnant __m = __j; 53153e519524SHoward Hinnant } 53163e519524SHoward Hinnant // [__first, __i) sorted 53173e519524SHoward Hinnant return; 53183e519524SHoward Hinnant } 53193e519524SHoward Hinnant else 53203e519524SHoward Hinnant { 53213e519524SHoward Hinnant // Check for [__i, __last) already sorted 53223e519524SHoward Hinnant __j = __m = __i; 53233e519524SHoward Hinnant while (++__j != __last) 53243e519524SHoward Hinnant { 53253e519524SHoward Hinnant if (__comp(*__j, *__m)) 53263e519524SHoward Hinnant // not yet sorted, so sort 53273e519524SHoward Hinnant goto not_sorted; 53283e519524SHoward Hinnant __m = __j; 53293e519524SHoward Hinnant } 53303e519524SHoward Hinnant // [__i, __last) sorted 53313e519524SHoward Hinnant return; 53323e519524SHoward Hinnant } 53333e519524SHoward Hinnant } 53343e519524SHoward Hinnantnot_sorted: 53353e519524SHoward Hinnant // __nth_element on range containing __nth 53363e519524SHoward Hinnant if (__nth < __i) 53373e519524SHoward Hinnant { 53383e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53393e519524SHoward Hinnant __last = __i; 53403e519524SHoward Hinnant } 53413e519524SHoward Hinnant else 53423e519524SHoward Hinnant { 53433e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53443e519524SHoward Hinnant __first = ++__i; 53453e519524SHoward Hinnant } 53463e519524SHoward Hinnant } 53473e519524SHoward Hinnant} 53483e519524SHoward Hinnant 53493e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53513e519524SHoward Hinnantvoid 53523e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53533e519524SHoward Hinnant{ 5354145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53573e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5358145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53603e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5361145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53623e519524SHoward Hinnant} 53633e519524SHoward Hinnant 53643e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53663e519524SHoward Hinnantvoid 53673e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53683e519524SHoward Hinnant{ 5369ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53703e519524SHoward Hinnant} 53713e519524SHoward Hinnant 53723e519524SHoward Hinnant// includes 53733e519524SHoward Hinnant 53743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53753e519524SHoward Hinnantbool 53763e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53773e519524SHoward Hinnant _Compare __comp) 53783e519524SHoward Hinnant{ 53793e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53803e519524SHoward Hinnant { 53813e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53823e519524SHoward Hinnant return false; 53833e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53843e519524SHoward Hinnant ++__first2; 53853e519524SHoward Hinnant } 53863e519524SHoward Hinnant return true; 53873e519524SHoward Hinnant} 53883e519524SHoward Hinnant 53893e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53913e519524SHoward Hinnantbool 53923e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53933e519524SHoward Hinnant _Compare __comp) 53943e519524SHoward Hinnant{ 5395145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53963e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53973e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53983e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5399145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54003e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54013e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5402145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54033e519524SHoward Hinnant} 54043e519524SHoward Hinnant 54053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 54063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54073e519524SHoward Hinnantbool 54083e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 54093e519524SHoward Hinnant{ 5410ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 54113e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54123e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54133e519524SHoward Hinnant} 54143e519524SHoward Hinnant 54153e519524SHoward Hinnant// set_union 54163e519524SHoward Hinnant 54173e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54183e519524SHoward Hinnant_OutputIterator 54193e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54203e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54213e519524SHoward Hinnant{ 54223e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54233e519524SHoward Hinnant { 54243e519524SHoward Hinnant if (__first2 == __last2) 5425ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54263e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54273e519524SHoward Hinnant { 54283e519524SHoward Hinnant *__result = *__first2; 54293e519524SHoward Hinnant ++__first2; 54303e519524SHoward Hinnant } 54313e519524SHoward Hinnant else 54323e519524SHoward Hinnant { 54333e519524SHoward Hinnant *__result = *__first1; 54343e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54353e519524SHoward Hinnant ++__first2; 54363e519524SHoward Hinnant ++__first1; 54373e519524SHoward Hinnant } 54383e519524SHoward Hinnant } 5439ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54403e519524SHoward Hinnant} 54413e519524SHoward Hinnant 54423e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54443e519524SHoward Hinnant_OutputIterator 54453e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54463e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54473e519524SHoward Hinnant{ 5448145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54513e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5452145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54543e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5455145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54563e519524SHoward Hinnant} 54573e519524SHoward Hinnant 54583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54603e519524SHoward Hinnant_OutputIterator 54613e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54633e519524SHoward Hinnant{ 5464ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54653e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54663e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54673e519524SHoward Hinnant} 54683e519524SHoward Hinnant 54693e519524SHoward Hinnant// set_intersection 54703e519524SHoward Hinnant 54713e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54723e519524SHoward Hinnant_OutputIterator 54733e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54753e519524SHoward Hinnant{ 54763e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54773e519524SHoward Hinnant { 54783e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54793e519524SHoward Hinnant ++__first1; 54803e519524SHoward Hinnant else 54813e519524SHoward Hinnant { 54823e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54833e519524SHoward Hinnant { 54843e519524SHoward Hinnant *__result = *__first1; 54853e519524SHoward Hinnant ++__result; 54863e519524SHoward Hinnant ++__first1; 54873e519524SHoward Hinnant } 54883e519524SHoward Hinnant ++__first2; 54893e519524SHoward Hinnant } 54903e519524SHoward Hinnant } 54913e519524SHoward Hinnant return __result; 54923e519524SHoward Hinnant} 54933e519524SHoward Hinnant 54943e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54963e519524SHoward Hinnant_OutputIterator 54973e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54993e519524SHoward Hinnant{ 5500145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55033e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5504145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55063e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5507145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55083e519524SHoward Hinnant} 55093e519524SHoward Hinnant 55103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55123e519524SHoward Hinnant_OutputIterator 55133e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55153e519524SHoward Hinnant{ 5516ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55173e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55183e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55193e519524SHoward Hinnant} 55203e519524SHoward Hinnant 55213e519524SHoward Hinnant// set_difference 55223e519524SHoward Hinnant 55233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55243e519524SHoward Hinnant_OutputIterator 55253e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55273e519524SHoward Hinnant{ 55283e519524SHoward Hinnant while (__first1 != __last1) 55293e519524SHoward Hinnant { 55303e519524SHoward Hinnant if (__first2 == __last2) 5531ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55323e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55333e519524SHoward Hinnant { 55343e519524SHoward Hinnant *__result = *__first1; 55353e519524SHoward Hinnant ++__result; 55363e519524SHoward Hinnant ++__first1; 55373e519524SHoward Hinnant } 55383e519524SHoward Hinnant else 55393e519524SHoward Hinnant { 55403e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55413e519524SHoward Hinnant ++__first1; 55423e519524SHoward Hinnant ++__first2; 55433e519524SHoward Hinnant } 55443e519524SHoward Hinnant } 55453e519524SHoward Hinnant return __result; 55463e519524SHoward Hinnant} 55473e519524SHoward Hinnant 55483e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55503e519524SHoward Hinnant_OutputIterator 55513e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55523e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55533e519524SHoward Hinnant{ 5554145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55553e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55563e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55573e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5558145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55593e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55603e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5561145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55623e519524SHoward Hinnant} 55633e519524SHoward Hinnant 55643e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55663e519524SHoward Hinnant_OutputIterator 55673e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55683e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55693e519524SHoward Hinnant{ 5570ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55713e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55723e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55733e519524SHoward Hinnant} 55743e519524SHoward Hinnant 55753e519524SHoward Hinnant// set_symmetric_difference 55763e519524SHoward Hinnant 55773e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55783e519524SHoward Hinnant_OutputIterator 55793e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55803e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55813e519524SHoward Hinnant{ 55823e519524SHoward Hinnant while (__first1 != __last1) 55833e519524SHoward Hinnant { 55843e519524SHoward Hinnant if (__first2 == __last2) 5585ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55863e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55873e519524SHoward Hinnant { 55883e519524SHoward Hinnant *__result = *__first1; 55893e519524SHoward Hinnant ++__result; 55903e519524SHoward Hinnant ++__first1; 55913e519524SHoward Hinnant } 55923e519524SHoward Hinnant else 55933e519524SHoward Hinnant { 55943e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55953e519524SHoward Hinnant { 55963e519524SHoward Hinnant *__result = *__first2; 55973e519524SHoward Hinnant ++__result; 55983e519524SHoward Hinnant } 55993e519524SHoward Hinnant else 56003e519524SHoward Hinnant ++__first1; 56013e519524SHoward Hinnant ++__first2; 56023e519524SHoward Hinnant } 56033e519524SHoward Hinnant } 5604ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 56053e519524SHoward Hinnant} 56063e519524SHoward Hinnant 56073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56093e519524SHoward Hinnant_OutputIterator 56103e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56123e519524SHoward Hinnant{ 5613145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56143e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56153e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56163e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5617145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56183e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56193e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5620145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56213e519524SHoward Hinnant} 56223e519524SHoward Hinnant 56233e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56253e519524SHoward Hinnant_OutputIterator 56263e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56273e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56283e519524SHoward Hinnant{ 5629ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56303e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56313e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56323e519524SHoward Hinnant} 56333e519524SHoward Hinnant 56343e519524SHoward Hinnant// lexicographical_compare 56353e519524SHoward Hinnant 56363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56373e519524SHoward Hinnantbool 56383e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56403e519524SHoward Hinnant{ 5641910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56423e519524SHoward Hinnant { 56433e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56443e519524SHoward Hinnant return true; 56453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56463e519524SHoward Hinnant return false; 56473e519524SHoward Hinnant } 56483e519524SHoward Hinnant return false; 56493e519524SHoward Hinnant} 56503e519524SHoward Hinnant 56513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56533e519524SHoward Hinnantbool 56543e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56563e519524SHoward Hinnant{ 5657145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56583e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56593e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56603e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5661145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56623e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56633e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5664145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56653e519524SHoward Hinnant} 56663e519524SHoward Hinnant 56673e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56693e519524SHoward Hinnantbool 56703e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56723e519524SHoward Hinnant{ 5673ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56743e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56753e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56763e519524SHoward Hinnant} 56773e519524SHoward Hinnant 56783e519524SHoward Hinnant// next_permutation 56793e519524SHoward Hinnant 56803e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56813e519524SHoward Hinnantbool 56823e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56833e519524SHoward Hinnant{ 56843e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56853e519524SHoward Hinnant if (__first == __last || __first == --__i) 56863e519524SHoward Hinnant return false; 56873e519524SHoward Hinnant while (true) 56883e519524SHoward Hinnant { 56893e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56903e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56913e519524SHoward Hinnant { 56923e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56933e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56943e519524SHoward Hinnant ; 56953e519524SHoward Hinnant swap(*__i, *__j); 5696ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56973e519524SHoward Hinnant return true; 56983e519524SHoward Hinnant } 56993e519524SHoward Hinnant if (__i == __first) 57003e519524SHoward Hinnant { 5701ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57023e519524SHoward Hinnant return false; 57033e519524SHoward Hinnant } 57043e519524SHoward Hinnant } 57053e519524SHoward Hinnant} 57063e519524SHoward Hinnant 57073e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57093e519524SHoward Hinnantbool 57103e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57113e519524SHoward Hinnant{ 5712145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57133e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57143e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57153e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5716145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57183e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5719145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57203e519524SHoward Hinnant} 57213e519524SHoward Hinnant 57223e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57243e519524SHoward Hinnantbool 57253e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57263e519524SHoward Hinnant{ 5727ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57283e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57293e519524SHoward Hinnant} 57303e519524SHoward Hinnant 57313e519524SHoward Hinnant// prev_permutation 57323e519524SHoward Hinnant 57333e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57343e519524SHoward Hinnantbool 57353e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57363e519524SHoward Hinnant{ 57373e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57383e519524SHoward Hinnant if (__first == __last || __first == --__i) 57393e519524SHoward Hinnant return false; 57403e519524SHoward Hinnant while (true) 57413e519524SHoward Hinnant { 57423e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57433e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57443e519524SHoward Hinnant { 57453e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57463e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57473e519524SHoward Hinnant ; 57483e519524SHoward Hinnant swap(*__i, *__j); 5749ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57503e519524SHoward Hinnant return true; 57513e519524SHoward Hinnant } 57523e519524SHoward Hinnant if (__i == __first) 57533e519524SHoward Hinnant { 5754ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57553e519524SHoward Hinnant return false; 57563e519524SHoward Hinnant } 57573e519524SHoward Hinnant } 57583e519524SHoward Hinnant} 57593e519524SHoward Hinnant 57603e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57623e519524SHoward Hinnantbool 57633e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57643e519524SHoward Hinnant{ 5765145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57683e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5769145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57713e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5772145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57733e519524SHoward Hinnant} 57743e519524SHoward Hinnant 57753e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57773e519524SHoward Hinnantbool 57783e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57793e519524SHoward Hinnant{ 5780ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57813e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57823e519524SHoward Hinnant} 57833e519524SHoward Hinnant 57843e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57853e519524SHoward Hinnant 57863e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5787