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 2840f37a410SMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 28806965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 2890f37a410SMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14, removed in C++17 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 6475d50aa32SEric Fiselier#if defined(_LIBCPP_COMPILER_MSVC) 648*80f8cfb3SEric Fiselier#include <intrin.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 786*80f8cfb3SEric Fiselierunsigned __ctz(unsigned __x) { 787*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 788c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 789*80f8cfb3SEric Fiselier#else 790*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 791*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 792*80f8cfb3SEric Fiselier unsigned long where; 793*80f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 794*80f8cfb3SEric Fiselier // Returns zero if no set bit is found. 795*80f8cfb3SEric Fiselier if (_BitScanForward(&where, mask)) 796*80f8cfb3SEric Fiselier return where; 797*80f8cfb3SEric Fiselier return 32; 798*80f8cfb3SEric Fiselier#endif 799c206366fSHoward Hinnant} 800c206366fSHoward Hinnant 801c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 802*80f8cfb3SEric Fiselierunsigned long __ctz(unsigned long __x) { 803*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 804c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 805*80f8cfb3SEric Fiselier#else 806*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == sizeof(unsigned), ""); 807*80f8cfb3SEric Fiselier return __ctz(static_cast<unsigned>(__x)); 808*80f8cfb3SEric Fiselier#endif 809c206366fSHoward Hinnant} 810c206366fSHoward Hinnant 811c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 812*80f8cfb3SEric Fiselierunsigned long long __ctz(unsigned long long __x) { 813*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 814c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 815*80f8cfb3SEric Fiselier#else 816*80f8cfb3SEric Fiselier unsigned long where; 817*80f8cfb3SEric Fiselier// Search from LSB to MSB for first set bit. 818*80f8cfb3SEric Fiselier// Returns zero if no set bit is found. 819*80f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 820*80f8cfb3SEric Fiselier (defined(_M_AMD64) || defined(__x86_64__)) 821*80f8cfb3SEric Fiselier if (_BitScanForward64(&where, mask)) 822*80f8cfb3SEric Fiselier return static_cast<int>(where); 823*80f8cfb3SEric Fiselier#else 824*80f8cfb3SEric Fiselier // Win32 doesn't have _BitScanForward64 so emulate it with two 32 bit calls. 825*80f8cfb3SEric Fiselier // Scan the Low Word. 826*80f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask))) 827*80f8cfb3SEric Fiselier return where; 828*80f8cfb3SEric Fiselier // Scan the High Word. 829*80f8cfb3SEric Fiselier if (_BitScanForward(&where, static_cast<unsigned long>(mask >> 32))) 830*80f8cfb3SEric Fiselier return where + 32; // Create a bit offset from the LSB. 831*80f8cfb3SEric Fiselier#endif 832*80f8cfb3SEric Fiselier return 64; 833*80f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 834c206366fSHoward Hinnant} 835c8edcb36SHoward Hinnant 836c8edcb36SHoward Hinnant// Precondition: __x != 0 837c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 838*80f8cfb3SEric Fiselierunsigned __clz(unsigned __x) { 839*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 840c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 841*80f8cfb3SEric Fiselier#else 842*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 843*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 844*80f8cfb3SEric Fiselier unsigned long where; 845*80f8cfb3SEric Fiselier // Search from LSB to MSB for first set bit. 846*80f8cfb3SEric Fiselier // Returns zero if no set bit is found. 847*80f8cfb3SEric Fiselier if (_BitScanReverse(&where, mask)) 848*80f8cfb3SEric Fiselier return 31 - where; 849*80f8cfb3SEric Fiselier return 32; // Undefined Behavior. 850*80f8cfb3SEric Fiselier#endif 851c206366fSHoward Hinnant} 852c206366fSHoward Hinnant 853c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 854*80f8cfb3SEric Fiselierunsigned long __clz(unsigned long __x) { 855*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 856c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 857*80f8cfb3SEric Fiselier#else 858*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == sizeof(unsigned long), ""); 859*80f8cfb3SEric Fiselier return __clz(static_cast<unsigned>(__x)); 860*80f8cfb3SEric Fiselier#endif 861c206366fSHoward Hinnant} 862c206366fSHoward Hinnant 863c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 864*80f8cfb3SEric Fiselierunsigned long long __clz(unsigned long long __x) { 865*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 866c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 867*80f8cfb3SEric Fiselier#else 868*80f8cfb3SEric Fiselier unsigned long where; 869*80f8cfb3SEric Fiselier// BitScanReverse scans from MSB to LSB for first set bit. 870*80f8cfb3SEric Fiselier// Returns 0 if no set bit is found. 871*80f8cfb3SEric Fiselier#if defined(_LIBCPP_HAS_BITSCAN64) 872*80f8cfb3SEric Fiselier if (_BitScanReverse64(&where, mask)) 873*80f8cfb3SEric Fiselier return static_cast<int>(63 - where); 874*80f8cfb3SEric Fiselier#else 875*80f8cfb3SEric Fiselier // Scan the high 32 bits. 876*80f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask >> 32))) 877*80f8cfb3SEric Fiselier return 63 - (where + 32); // Create a bit offset from the MSB. 878*80f8cfb3SEric Fiselier // Scan the low 32 bits. 879*80f8cfb3SEric Fiselier if (_BitScanReverse(&where, static_cast<unsigned long>(mask))) 880*80f8cfb3SEric Fiselier return 63 - where; 881*80f8cfb3SEric Fiselier#endif 882*80f8cfb3SEric Fiselier return 64; // Undefined Behavior. 883*80f8cfb3SEric Fiselier#endif // _LIBCPP_COMPILER_MSVC 884c206366fSHoward Hinnant} 885c8edcb36SHoward Hinnant 886*80f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) { 887*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 888*80f8cfb3SEric Fiselier return __builtin_popcount (__x); 889*80f8cfb3SEric Fiselier#else 890*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned) == 4, ""); 891*80f8cfb3SEric Fiselier return __popcnt(__x); 892*80f8cfb3SEric Fiselier#endif 893*80f8cfb3SEric Fiselier} 894*80f8cfb3SEric Fiselier 895*80f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) { 896*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 897*80f8cfb3SEric Fiselier return __builtin_popcountl (__x); 898*80f8cfb3SEric Fiselier#else 899*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned long) == 4, ""); 900*80f8cfb3SEric Fiselier return __popcnt(__x); 901*80f8cfb3SEric Fiselier#endif 902*80f8cfb3SEric Fiselier} 903*80f8cfb3SEric Fiselier 904*80f8cfb3SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) { 905*80f8cfb3SEric Fiselier#ifndef _LIBCPP_COMPILER_MSVC 906*80f8cfb3SEric Fiselier return __builtin_popcountll(__x); 907*80f8cfb3SEric Fiselier#else 908*80f8cfb3SEric Fiselier static_assert(sizeof(unsigned long long) == 8, ""); 909*80f8cfb3SEric Fiselier return __popcnt64(__x); 910*80f8cfb3SEric Fiselier#endif 911*80f8cfb3SEric Fiselier} 912c8edcb36SHoward Hinnant 9133e519524SHoward Hinnant// all_of 9143e519524SHoward Hinnant 9153e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9173e519524SHoward Hinnantbool 9183e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9193e519524SHoward Hinnant{ 9203e519524SHoward Hinnant for (; __first != __last; ++__first) 9213e519524SHoward Hinnant if (!__pred(*__first)) 9223e519524SHoward Hinnant return false; 9233e519524SHoward Hinnant return true; 9243e519524SHoward Hinnant} 9253e519524SHoward Hinnant 9263e519524SHoward Hinnant// any_of 9273e519524SHoward Hinnant 9283e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9303e519524SHoward Hinnantbool 9313e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9323e519524SHoward Hinnant{ 9333e519524SHoward Hinnant for (; __first != __last; ++__first) 9343e519524SHoward Hinnant if (__pred(*__first)) 9353e519524SHoward Hinnant return true; 9363e519524SHoward Hinnant return false; 9373e519524SHoward Hinnant} 9383e519524SHoward Hinnant 9393e519524SHoward Hinnant// none_of 9403e519524SHoward Hinnant 9413e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9433e519524SHoward Hinnantbool 9443e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9453e519524SHoward Hinnant{ 9463e519524SHoward Hinnant for (; __first != __last; ++__first) 9473e519524SHoward Hinnant if (__pred(*__first)) 9483e519524SHoward Hinnant return false; 9493e519524SHoward Hinnant return true; 9503e519524SHoward Hinnant} 9513e519524SHoward Hinnant 9523e519524SHoward Hinnant// for_each 9533e519524SHoward Hinnant 9543e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 9553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9563e519524SHoward Hinnant_Function 9573e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 9583e519524SHoward Hinnant{ 9593e519524SHoward Hinnant for (; __first != __last; ++__first) 9603e519524SHoward Hinnant __f(*__first); 9611c7fe126SMarshall Clow return __f; 9623e519524SHoward Hinnant} 9633e519524SHoward Hinnant 9643e519524SHoward Hinnant// find 9653e519524SHoward Hinnant 9663e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 9673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9683e519524SHoward Hinnant_InputIterator 969e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 9703e519524SHoward Hinnant{ 9713e519524SHoward Hinnant for (; __first != __last; ++__first) 972e4383379SHoward Hinnant if (*__first == __value_) 9733e519524SHoward Hinnant break; 9743e519524SHoward Hinnant return __first; 9753e519524SHoward Hinnant} 9763e519524SHoward Hinnant 9773e519524SHoward Hinnant// find_if 9783e519524SHoward Hinnant 9793e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 9803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9813e519524SHoward Hinnant_InputIterator 9823e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9833e519524SHoward Hinnant{ 9843e519524SHoward Hinnant for (; __first != __last; ++__first) 9853e519524SHoward Hinnant if (__pred(*__first)) 9863e519524SHoward Hinnant break; 9873e519524SHoward Hinnant return __first; 9883e519524SHoward Hinnant} 9893e519524SHoward Hinnant 9903e519524SHoward Hinnant// find_if_not 9913e519524SHoward Hinnant 9923e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9943e519524SHoward Hinnant_InputIterator 9953e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9963e519524SHoward Hinnant{ 9973e519524SHoward Hinnant for (; __first != __last; ++__first) 9983e519524SHoward Hinnant if (!__pred(*__first)) 9993e519524SHoward Hinnant break; 10003e519524SHoward Hinnant return __first; 10013e519524SHoward Hinnant} 10023e519524SHoward Hinnant 10033e519524SHoward Hinnant// find_end 10043e519524SHoward Hinnant 10053e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 10063e519524SHoward Hinnant_ForwardIterator1 10073e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10083e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 10093e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 10103e519524SHoward Hinnant{ 10113e519524SHoward Hinnant // modeled after search algorithm 10123e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 10133e519524SHoward Hinnant if (__first2 == __last2) 10143e519524SHoward Hinnant return __r; 10153e519524SHoward Hinnant while (true) 10163e519524SHoward Hinnant { 10173e519524SHoward Hinnant while (true) 10183e519524SHoward Hinnant { 10193e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 10203e519524SHoward Hinnant return __r; // (or __last1 if never found) 10213e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 10223e519524SHoward Hinnant break; 10233e519524SHoward Hinnant ++__first1; 10243e519524SHoward Hinnant } 10253e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 10263e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 10273e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 10283e519524SHoward Hinnant while (true) 10293e519524SHoward Hinnant { 10303e519524SHoward Hinnant if (++__m2 == __last2) 10313e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 10323e519524SHoward Hinnant __r = __first1; 10333e519524SHoward Hinnant ++__first1; 10343e519524SHoward Hinnant break; 10353e519524SHoward Hinnant } 10363e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 10373e519524SHoward Hinnant return __r; 10383e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 10393e519524SHoward Hinnant { 10403e519524SHoward Hinnant ++__first1; 10413e519524SHoward Hinnant break; 10423e519524SHoward Hinnant } // else there is a match, check next elements 10433e519524SHoward Hinnant } 10443e519524SHoward Hinnant } 10453e519524SHoward Hinnant} 10463e519524SHoward Hinnant 10473e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 10483e519524SHoward Hinnant_BidirectionalIterator1 10493e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 10503e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 10513e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 10523e519524SHoward Hinnant{ 10533e519524SHoward Hinnant // modeled after search algorithm (in reverse) 10543e519524SHoward Hinnant if (__first2 == __last2) 10553e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 10563e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 10573e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 10583e519524SHoward Hinnant --__l2; 10593e519524SHoward Hinnant while (true) 10603e519524SHoward Hinnant { 10613e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 10623e519524SHoward Hinnant while (true) 10633e519524SHoward Hinnant { 10643e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 10653e519524SHoward Hinnant return __last1; 10663e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10673e519524SHoward Hinnant break; 10683e519524SHoward Hinnant } 10693e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 10703e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 10713e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 10723e519524SHoward Hinnant while (true) 10733e519524SHoward Hinnant { 10743e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 10753e519524SHoward Hinnant return __m1; 10763e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 10773e519524SHoward Hinnant return __last1; 10783e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 10793e519524SHoward Hinnant { 10803e519524SHoward Hinnant break; 10813e519524SHoward Hinnant } // else there is a match, check next elements 10823e519524SHoward Hinnant } 10833e519524SHoward Hinnant } 10843e519524SHoward Hinnant} 10853e519524SHoward Hinnant 10863e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10879b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10883e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10893e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10903e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10913e519524SHoward Hinnant{ 10923e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10933e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10943e519524SHoward Hinnant if (__len2 == 0) 10953e519524SHoward Hinnant return __last1; 10963e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10973e519524SHoward Hinnant if (__len1 < __len2) 10983e519524SHoward Hinnant return __last1; 10993e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 11003e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 11013e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 11023e519524SHoward Hinnant --__l2; 11033e519524SHoward Hinnant while (true) 11043e519524SHoward Hinnant { 11053e519524SHoward Hinnant while (true) 11063e519524SHoward Hinnant { 11073e519524SHoward Hinnant if (__s == __l1) 11083e519524SHoward Hinnant return __last1; 11093e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 11103e519524SHoward Hinnant break; 11113e519524SHoward Hinnant } 11123e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 11133e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 11143e519524SHoward Hinnant while (true) 11153e519524SHoward Hinnant { 11163e519524SHoward Hinnant if (__m2 == __first2) 11173e519524SHoward Hinnant return __m1; 11183e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 11193e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 11203e519524SHoward Hinnant { 11213e519524SHoward Hinnant break; 11223e519524SHoward Hinnant } 11233e519524SHoward Hinnant } 11243e519524SHoward Hinnant } 11253e519524SHoward Hinnant} 11263e519524SHoward Hinnant 11273e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11293e519524SHoward Hinnant_ForwardIterator1 11303e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11313e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11323e519524SHoward Hinnant{ 1133ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 11343e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 11353e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 11363e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 11373e519524SHoward Hinnant} 11383e519524SHoward Hinnant 11393e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11413e519524SHoward Hinnant_ForwardIterator1 11423e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11433e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11443e519524SHoward Hinnant{ 11453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11463e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1147ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11483e519524SHoward Hinnant} 11493e519524SHoward Hinnant 11503e519524SHoward Hinnant// find_first_of 11513e519524SHoward Hinnant 11523e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11539b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 11549b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11553e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11563e519524SHoward Hinnant{ 11573e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 11583e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 11593e519524SHoward Hinnant if (__pred(*__first1, *__j)) 11603e519524SHoward Hinnant return __first1; 11613e519524SHoward Hinnant return __last1; 11623e519524SHoward Hinnant} 11633e519524SHoward Hinnant 11649b0af34dSMarshall Clow 11659b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 11669b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11679b0af34dSMarshall Clow_ForwardIterator1 11689b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11699b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 11709b0af34dSMarshall Clow{ 11719b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 11729b0af34dSMarshall Clow} 11739b0af34dSMarshall Clow 11743e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 11753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11763e519524SHoward Hinnant_ForwardIterator1 11773e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 11783e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 11793e519524SHoward Hinnant{ 11803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 11813e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 11829b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11833e519524SHoward Hinnant} 11843e519524SHoward Hinnant 11853e519524SHoward Hinnant// adjacent_find 11863e519524SHoward Hinnant 11873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11893e519524SHoward Hinnant_ForwardIterator 11903e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11913e519524SHoward Hinnant{ 11923e519524SHoward Hinnant if (__first != __last) 11933e519524SHoward Hinnant { 11943e519524SHoward Hinnant _ForwardIterator __i = __first; 11953e519524SHoward Hinnant while (++__i != __last) 11963e519524SHoward Hinnant { 11973e519524SHoward Hinnant if (__pred(*__first, *__i)) 11983e519524SHoward Hinnant return __first; 11993e519524SHoward Hinnant __first = __i; 12003e519524SHoward Hinnant } 12013e519524SHoward Hinnant } 12023e519524SHoward Hinnant return __last; 12033e519524SHoward Hinnant} 12043e519524SHoward Hinnant 12053e519524SHoward Hinnanttemplate <class _ForwardIterator> 12063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12073e519524SHoward Hinnant_ForwardIterator 12083e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 12093e519524SHoward Hinnant{ 12103e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1211ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 12123e519524SHoward Hinnant} 12133e519524SHoward Hinnant 12143e519524SHoward Hinnant// count 12153e519524SHoward Hinnant 12163e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 12173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12183e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1219e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 12203e519524SHoward Hinnant{ 12213e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12223e519524SHoward Hinnant for (; __first != __last; ++__first) 1223e4383379SHoward Hinnant if (*__first == __value_) 12243e519524SHoward Hinnant ++__r; 12253e519524SHoward Hinnant return __r; 12263e519524SHoward Hinnant} 12273e519524SHoward Hinnant 12283e519524SHoward Hinnant// count_if 12293e519524SHoward Hinnant 12303e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 12313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12323e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 12333e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 12343e519524SHoward Hinnant{ 12353e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 12363e519524SHoward Hinnant for (; __first != __last; ++__first) 12373e519524SHoward Hinnant if (__pred(*__first)) 12383e519524SHoward Hinnant ++__r; 12393e519524SHoward Hinnant return __r; 12403e519524SHoward Hinnant} 12413e519524SHoward Hinnant 12423e519524SHoward Hinnant// mismatch 12433e519524SHoward Hinnant 12443e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12463e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12473e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12483e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 12493e519524SHoward Hinnant{ 1250bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 12513e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12523e519524SHoward Hinnant break; 12533e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12543e519524SHoward Hinnant} 12553e519524SHoward Hinnant 12563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12583e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 12593e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12603e519524SHoward Hinnant{ 12613e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12623e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1263ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12643e519524SHoward Hinnant} 12653e519524SHoward Hinnant 12660b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12670b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12680b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12690b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12700b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12710b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 12720b0bbd2fSMarshall Clow _BinaryPredicate __pred) 12730b0bbd2fSMarshall Clow{ 1274bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12750b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12760b0bbd2fSMarshall Clow break; 12770b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 12780b0bbd2fSMarshall Clow} 12790b0bbd2fSMarshall Clow 12800b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12810b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12820b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 12830b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 12840b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12850b0bbd2fSMarshall Clow{ 12860b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12870b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12880b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12890b0bbd2fSMarshall Clow} 12900b0bbd2fSMarshall Clow#endif 12910b0bbd2fSMarshall Clow 12923e519524SHoward Hinnant// equal 12933e519524SHoward Hinnant 12943e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12963e519524SHoward Hinnantbool 12973e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12983e519524SHoward Hinnant{ 1299910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13003e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13013e519524SHoward Hinnant return false; 13023e519524SHoward Hinnant return true; 13033e519524SHoward Hinnant} 13043e519524SHoward Hinnant 13053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 13063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13073e519524SHoward Hinnantbool 13083e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 13093e519524SHoward Hinnant{ 13103e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13113e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1312ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13133e519524SHoward Hinnant} 13143e519524SHoward Hinnant 13150b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13160b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 13170b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13180b0bbd2fSMarshall Clowbool 13190b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 13200b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 13210b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 13220b0bbd2fSMarshall Clow{ 1323910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13240b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13250b0bbd2fSMarshall Clow return false; 13260b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13270b0bbd2fSMarshall Clow} 13280b0bbd2fSMarshall Clow 13290b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13300b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13310b0bbd2fSMarshall Clowbool 13320b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 13330b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 13340b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13350b0bbd2fSMarshall Clow{ 13360b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13370b0bbd2fSMarshall Clow return false; 13380b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 13390b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13400b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13410b0bbd2fSMarshall Clow} 13420b0bbd2fSMarshall Clow 13430b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 13440b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13450b0bbd2fSMarshall Clowbool 13460b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13470b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 13480b0bbd2fSMarshall Clow{ 13490b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 13500b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13510b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13520b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13530b0bbd2fSMarshall Clow} 13540b0bbd2fSMarshall Clow 13550b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 13560b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13570b0bbd2fSMarshall Clowbool 13580b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 13590b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 13600b0bbd2fSMarshall Clow{ 13610b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 13620b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 13630b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 13640b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 13650b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 13660b0bbd2fSMarshall Clow} 13670b0bbd2fSMarshall Clow#endif 13680b0bbd2fSMarshall Clow 13693e519524SHoward Hinnant// is_permutation 13703e519524SHoward Hinnant 13713e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13723e519524SHoward Hinnantbool 13733e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13743e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 13753e519524SHoward Hinnant{ 13763e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1377910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 13783e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 13793e519524SHoward Hinnant goto __not_done; 13803e519524SHoward Hinnant return true; 13813e519524SHoward Hinnant__not_done: 13823e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 13833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1384ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 13853e519524SHoward Hinnant if (__l1 == _D1(1)) 13863e519524SHoward Hinnant return false; 1387ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13883e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13893e519524SHoward Hinnant // equal elements in [f2, l2) 13903e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13913e519524SHoward Hinnant { 13923e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 13933e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13943e519524SHoward Hinnant if (__pred(*__j, *__i)) 13953e519524SHoward Hinnant goto __next_iter; 13963e519524SHoward Hinnant { 13973e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13983e519524SHoward Hinnant _D1 __c2 = 0; 13993e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14003e519524SHoward Hinnant if (__pred(*__i, *__j)) 14013e519524SHoward Hinnant ++__c2; 14023e519524SHoward Hinnant if (__c2 == 0) 14033e519524SHoward Hinnant return false; 14043e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 14053e519524SHoward Hinnant _D1 __c1 = 1; 1406ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14073e519524SHoward Hinnant if (__pred(*__i, *__j)) 14083e519524SHoward Hinnant ++__c1; 14093e519524SHoward Hinnant if (__c1 != __c2) 14103e519524SHoward Hinnant return false; 14113e519524SHoward Hinnant } 14123e519524SHoward Hinnant__next_iter:; 14133e519524SHoward Hinnant } 14143e519524SHoward Hinnant return true; 14153e519524SHoward Hinnant} 14163e519524SHoward Hinnant 14173e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 14183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 14193e519524SHoward Hinnantbool 14203e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14213e519524SHoward Hinnant _ForwardIterator2 __first2) 14223e519524SHoward Hinnant{ 14233e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14243e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1425ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 14263e519524SHoward Hinnant} 14273e519524SHoward Hinnant 14280b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 14290b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14300b0bbd2fSMarshall Clowbool 14310b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14320b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14330b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14340b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 14350b0bbd2fSMarshall Clow{ 14360b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1437847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 14380b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 14390b0bbd2fSMarshall Clow goto __not_done; 14400b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 14410b0bbd2fSMarshall Clow__not_done: 14420b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 14430b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 14440b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 14450b0bbd2fSMarshall Clow 14460b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1447fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 14480b0bbd2fSMarshall Clow if (__l1 != __l2) 14490b0bbd2fSMarshall Clow return false; 14500b0bbd2fSMarshall Clow 14510b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 14520b0bbd2fSMarshall Clow // equal elements in [f2, l2) 14530b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 14540b0bbd2fSMarshall Clow { 14550b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 14560b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 14570b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 14580b0bbd2fSMarshall Clow goto __next_iter; 14590b0bbd2fSMarshall Clow { 14600b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 14610b0bbd2fSMarshall Clow _D1 __c2 = 0; 14620b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 14630b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14640b0bbd2fSMarshall Clow ++__c2; 14650b0bbd2fSMarshall Clow if (__c2 == 0) 14660b0bbd2fSMarshall Clow return false; 14670b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 14680b0bbd2fSMarshall Clow _D1 __c1 = 1; 14690b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 14700b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 14710b0bbd2fSMarshall Clow ++__c1; 14720b0bbd2fSMarshall Clow if (__c1 != __c2) 14730b0bbd2fSMarshall Clow return false; 14740b0bbd2fSMarshall Clow } 14750b0bbd2fSMarshall Clow__next_iter:; 14760b0bbd2fSMarshall Clow } 14770b0bbd2fSMarshall Clow return true; 14780b0bbd2fSMarshall Clow} 14790b0bbd2fSMarshall Clow 14800b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14810b0bbd2fSMarshall Clowbool 14820b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 14830b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 14840b0bbd2fSMarshall Clow _BinaryPredicate __pred, 14850b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 14860b0bbd2fSMarshall Clow{ 14870b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14880b0bbd2fSMarshall Clow return false; 14890b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14900b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14910b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14920b0bbd2fSMarshall Clow} 14930b0bbd2fSMarshall Clow 14940b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14950b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14960b0bbd2fSMarshall Clowbool 14970b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14980b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14990b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 15000b0bbd2fSMarshall Clow{ 15010b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 15020b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 15030b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15040b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15050b0bbd2fSMarshall Clow} 15060b0bbd2fSMarshall Clow 15070b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 15080b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 15090b0bbd2fSMarshall Clowbool 15100b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15110b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15120b0bbd2fSMarshall Clow{ 15130b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 15140b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 15150b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 15160b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 15170b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 15180b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 15190b0bbd2fSMarshall Clow} 15200b0bbd2fSMarshall Clow#endif 15210b0bbd2fSMarshall Clow 15223e519524SHoward Hinnant// search 15233e519524SHoward Hinnant 15243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 152528cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 15263e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15273e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 15283e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 15293e519524SHoward Hinnant{ 15303e519524SHoward Hinnant if (__first2 == __last2) 153128cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 15323e519524SHoward Hinnant while (true) 15333e519524SHoward Hinnant { 15343e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 15353e519524SHoward Hinnant while (true) 15363e519524SHoward Hinnant { 15373e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 153828cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15393e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15403e519524SHoward Hinnant break; 15413e519524SHoward Hinnant ++__first1; 15423e519524SHoward Hinnant } 15433e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 15443e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 15453e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 15463e519524SHoward Hinnant while (true) 15473e519524SHoward Hinnant { 15483e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 154928cc4ddeSMarshall Clow return make_pair(__first1, __m1); 15503e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 155128cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15523e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 15533e519524SHoward Hinnant { 15543e519524SHoward Hinnant ++__first1; 15553e519524SHoward Hinnant break; 15563e519524SHoward Hinnant } // else there is a match, check next elements 15573e519524SHoward Hinnant } 15583e519524SHoward Hinnant } 15593e519524SHoward Hinnant} 15603e519524SHoward Hinnant 15613e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 156228cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 156328cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 15643e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 15653e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 15663e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 15673e519524SHoward Hinnant{ 156828cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 156928cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 15703e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 157128cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 15723e519524SHoward Hinnant if (__len2 == 0) 157328cc4ddeSMarshall Clow return make_pair(__first1, __first1); 157428cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 15753e519524SHoward Hinnant if (__len1 < __len2) 157628cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15773e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 1578b9775795SAditya Kumar 15793e519524SHoward Hinnant while (true) 15803e519524SHoward Hinnant { 15813e519524SHoward Hinnant while (true) 15823e519524SHoward Hinnant { 15833e519524SHoward Hinnant if (__first1 == __s) 158428cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15853e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15863e519524SHoward Hinnant break; 15873e519524SHoward Hinnant ++__first1; 15883e519524SHoward Hinnant } 1589b9775795SAditya Kumar 15903e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15913e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15923e519524SHoward Hinnant while (true) 15933e519524SHoward Hinnant { 15943e519524SHoward Hinnant if (++__m2 == __last2) 159528cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15963e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15973e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15983e519524SHoward Hinnant { 15993e519524SHoward Hinnant ++__first1; 16003e519524SHoward Hinnant break; 16013e519524SHoward Hinnant } 16023e519524SHoward Hinnant } 16033e519524SHoward Hinnant } 16043e519524SHoward Hinnant} 16053e519524SHoward Hinnant 16063e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 16073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16083e519524SHoward Hinnant_ForwardIterator1 16093e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16103e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 16113e519524SHoward Hinnant{ 1612ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 16133e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 161428cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 161528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 161628cc4ddeSMarshall Clow .first; 16173e519524SHoward Hinnant} 16183e519524SHoward Hinnant 16193e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16213e519524SHoward Hinnant_ForwardIterator1 16223e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16233e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16243e519524SHoward Hinnant{ 162528cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 162628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1627ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16283e519524SHoward Hinnant} 16293e519524SHoward Hinnant 16303e519524SHoward Hinnant// search_n 16313e519524SHoward Hinnant 16323e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16333e519524SHoward Hinnant_ForwardIterator 16343e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1635e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16363e519524SHoward Hinnant{ 16373e519524SHoward Hinnant if (__count <= 0) 16383e519524SHoward Hinnant return __first; 16393e519524SHoward Hinnant while (true) 16403e519524SHoward Hinnant { 1641e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16423e519524SHoward Hinnant while (true) 16433e519524SHoward Hinnant { 1644e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16453e519524SHoward Hinnant return __last; 1646e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16473e519524SHoward Hinnant break; 16483e519524SHoward Hinnant ++__first; 16493e519524SHoward Hinnant } 1650e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16513e519524SHoward Hinnant _ForwardIterator __m = __first; 16523e519524SHoward Hinnant _Size __c(0); 16533e519524SHoward Hinnant while (true) 16543e519524SHoward Hinnant { 16553e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16563e519524SHoward Hinnant return __first; 16573e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16583e519524SHoward Hinnant return __last; 1659e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16603e519524SHoward Hinnant { 16613e519524SHoward Hinnant __first = __m; 16623e519524SHoward Hinnant ++__first; 16633e519524SHoward Hinnant break; 16643e519524SHoward Hinnant } // else there is a match, check next elements 16653e519524SHoward Hinnant } 16663e519524SHoward Hinnant } 16673e519524SHoward Hinnant} 16683e519524SHoward Hinnant 16693e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16703e519524SHoward Hinnant_RandomAccessIterator 16713e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1672e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16733e519524SHoward Hinnant{ 16743e519524SHoward Hinnant if (__count <= 0) 16753e519524SHoward Hinnant return __first; 16763e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16773e519524SHoward Hinnant if (__len < __count) 16783e519524SHoward Hinnant return __last; 16793e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16803e519524SHoward Hinnant while (true) 16813e519524SHoward Hinnant { 1682e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16833e519524SHoward Hinnant while (true) 16843e519524SHoward Hinnant { 1685b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16863e519524SHoward Hinnant return __last; 1687e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16883e519524SHoward Hinnant break; 16893e519524SHoward Hinnant ++__first; 16903e519524SHoward Hinnant } 1691e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16923e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16933e519524SHoward Hinnant _Size __c(0); 16943e519524SHoward Hinnant while (true) 16953e519524SHoward Hinnant { 16963e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16973e519524SHoward Hinnant return __first; 16983e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1699e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 17003e519524SHoward Hinnant { 17013e519524SHoward Hinnant __first = __m; 17023e519524SHoward Hinnant ++__first; 17033e519524SHoward Hinnant break; 17043e519524SHoward Hinnant } // else there is a match, check next elements 17053e519524SHoward Hinnant } 17063e519524SHoward Hinnant } 17073e519524SHoward Hinnant} 17083e519524SHoward Hinnant 17093e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 17103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17113e519524SHoward Hinnant_ForwardIterator 17123e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1713e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 17143e519524SHoward Hinnant{ 1715ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 171651544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 171751544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 17183e519524SHoward Hinnant} 17193e519524SHoward Hinnant 17203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17223e519524SHoward Hinnant_ForwardIterator 1723e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17243e519524SHoward Hinnant{ 17253e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 172651544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 172751544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17283e519524SHoward Hinnant} 17293e519524SHoward Hinnant 17303e519524SHoward Hinnant// copy 17313e519524SHoward Hinnanttemplate <class _Iter> 17323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17333e519524SHoward Hinnant_Iter 17343e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17353e519524SHoward Hinnant{ 17363e519524SHoward Hinnant return __i; 17373e519524SHoward Hinnant} 17383e519524SHoward Hinnant 17393e519524SHoward Hinnanttemplate <class _Tp> 17403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17413e519524SHoward Hinnanttypename enable_if 17423e519524SHoward Hinnant< 1743ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17443e519524SHoward Hinnant _Tp* 17453e519524SHoward Hinnant>::type 17463e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17473e519524SHoward Hinnant{ 17483e519524SHoward Hinnant return __i.base(); 17493e519524SHoward Hinnant} 17503e519524SHoward Hinnant 1751fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1752fc88dbd2SHoward Hinnant 17533e519524SHoward Hinnanttemplate <class _Tp> 17543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17553e519524SHoward Hinnanttypename enable_if 17563e519524SHoward Hinnant< 1757ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17583e519524SHoward Hinnant _Tp* 17593e519524SHoward Hinnant>::type 17603e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17613e519524SHoward Hinnant{ 17623e519524SHoward Hinnant return __i.base(); 17633e519524SHoward Hinnant} 17643e519524SHoward Hinnant 176514bd0bf0SEric Fiselier#else 176614bd0bf0SEric Fiselier 176714bd0bf0SEric Fiseliertemplate <class _Tp> 176814bd0bf0SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 176914bd0bf0SEric Fiseliertypename enable_if 177014bd0bf0SEric Fiselier< 177114bd0bf0SEric Fiselier is_trivially_copy_assignable<_Tp>::value, 177214bd0bf0SEric Fiselier __wrap_iter<_Tp*> 177314bd0bf0SEric Fiselier>::type 177414bd0bf0SEric Fiselier__unwrap_iter(__wrap_iter<_Tp*> __i) 177514bd0bf0SEric Fiselier{ 177614bd0bf0SEric Fiselier return __i; 177714bd0bf0SEric Fiselier} 177814bd0bf0SEric Fiselier 1779fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1780fc88dbd2SHoward Hinnant 17813e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17833e519524SHoward Hinnant_OutputIterator 17843e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17853e519524SHoward Hinnant{ 1786910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17873e519524SHoward Hinnant *__result = *__first; 17883e519524SHoward Hinnant return __result; 17893e519524SHoward Hinnant} 17903e519524SHoward Hinnant 17913e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17933e519524SHoward Hinnanttypename enable_if 17943e519524SHoward Hinnant< 17953e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1796ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17973e519524SHoward Hinnant _Up* 17983e519524SHoward Hinnant>::type 17993e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 18003e519524SHoward Hinnant{ 18013e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18025b312052SMarshall Clow if (__n > 0) 1803ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18043e519524SHoward Hinnant return __result + __n; 18053e519524SHoward Hinnant} 18063e519524SHoward Hinnant 18073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18093e519524SHoward Hinnant_OutputIterator 18103e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18113e519524SHoward Hinnant{ 1812ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18133e519524SHoward Hinnant} 18143e519524SHoward Hinnant 18153e519524SHoward Hinnant// copy_backward 18163e519524SHoward Hinnant 1817d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 18183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18193e519524SHoward Hinnant_OutputIterator 1820d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 18213e519524SHoward Hinnant{ 18223e519524SHoward Hinnant while (__first != __last) 18233e519524SHoward Hinnant *--__result = *--__last; 18243e519524SHoward Hinnant return __result; 18253e519524SHoward Hinnant} 18263e519524SHoward Hinnant 18273e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18293e519524SHoward Hinnanttypename enable_if 18303e519524SHoward Hinnant< 18313e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1832ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18333e519524SHoward Hinnant _Up* 18343e519524SHoward Hinnant>::type 18353e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18363e519524SHoward Hinnant{ 18373e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18385b312052SMarshall Clow if (__n > 0) 18395b312052SMarshall Clow { 18403e519524SHoward Hinnant __result -= __n; 1841ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18425b312052SMarshall Clow } 18433e519524SHoward Hinnant return __result; 18443e519524SHoward Hinnant} 18453e519524SHoward Hinnant 18463e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18483e519524SHoward Hinnant_BidirectionalIterator2 18493e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18503e519524SHoward Hinnant _BidirectionalIterator2 __result) 18513e519524SHoward Hinnant{ 1852fd838227SEric Fiselier return _VSTD::__copy_backward(__unwrap_iter(__first), 1853fd838227SEric Fiselier __unwrap_iter(__last), 1854fd838227SEric Fiselier __unwrap_iter(__result)); 18553e519524SHoward Hinnant} 18563e519524SHoward Hinnant 18573e519524SHoward Hinnant// copy_if 18583e519524SHoward Hinnant 18593e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18613e519524SHoward Hinnant_OutputIterator 18623e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18633e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18643e519524SHoward Hinnant{ 18653e519524SHoward Hinnant for (; __first != __last; ++__first) 18663e519524SHoward Hinnant { 18673e519524SHoward Hinnant if (__pred(*__first)) 18683e519524SHoward Hinnant { 18693e519524SHoward Hinnant *__result = *__first; 18703e519524SHoward Hinnant ++__result; 18713e519524SHoward Hinnant } 18723e519524SHoward Hinnant } 18733e519524SHoward Hinnant return __result; 18743e519524SHoward Hinnant} 18753e519524SHoward Hinnant 18763e519524SHoward Hinnant// copy_n 18773e519524SHoward Hinnant 18783e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18803e519524SHoward Hinnanttypename enable_if 18813e519524SHoward Hinnant< 18823e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18833e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18843e519524SHoward Hinnant _OutputIterator 18853e519524SHoward Hinnant>::type 188651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18873e519524SHoward Hinnant{ 188851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 188951544023SEric Fiselier _IntegralSize __n = __orig_n; 189099847d2bSHoward Hinnant if (__n > 0) 189199847d2bSHoward Hinnant { 18923e519524SHoward Hinnant *__result = *__first; 189399847d2bSHoward Hinnant ++__result; 189499847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 189599847d2bSHoward Hinnant { 189699847d2bSHoward Hinnant ++__first; 189799847d2bSHoward Hinnant *__result = *__first; 189899847d2bSHoward Hinnant ++__result; 189999847d2bSHoward Hinnant } 190099847d2bSHoward Hinnant } 19013e519524SHoward Hinnant return __result; 19023e519524SHoward Hinnant} 19033e519524SHoward Hinnant 19043e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 19053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19063e519524SHoward Hinnanttypename enable_if 19073e519524SHoward Hinnant< 19083e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 19093e519524SHoward Hinnant _OutputIterator 19103e519524SHoward Hinnant>::type 191151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 19123e519524SHoward Hinnant{ 191351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 191451544023SEric Fiselier _IntegralSize __n = __orig_n; 1915ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 19163e519524SHoward Hinnant} 19173e519524SHoward Hinnant 19183e519524SHoward Hinnant// move 19193e519524SHoward Hinnant 19203e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19223e519524SHoward Hinnant_OutputIterator 19233e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19243e519524SHoward Hinnant{ 1925910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1926ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 19273e519524SHoward Hinnant return __result; 19283e519524SHoward Hinnant} 19293e519524SHoward Hinnant 19303e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19323e519524SHoward Hinnanttypename enable_if 19333e519524SHoward Hinnant< 19343e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1935ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19363e519524SHoward Hinnant _Up* 19373e519524SHoward Hinnant>::type 19383e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19393e519524SHoward Hinnant{ 19403e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19415b312052SMarshall Clow if (__n > 0) 1942ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19433e519524SHoward Hinnant return __result + __n; 19443e519524SHoward Hinnant} 19453e519524SHoward Hinnant 19463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19483e519524SHoward Hinnant_OutputIterator 19493e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19503e519524SHoward Hinnant{ 1951ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19523e519524SHoward Hinnant} 19533e519524SHoward Hinnant 19543e519524SHoward Hinnant// move_backward 19553e519524SHoward Hinnant 19563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19583e519524SHoward Hinnant_OutputIterator 19593e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19603e519524SHoward Hinnant{ 19613e519524SHoward Hinnant while (__first != __last) 1962ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19633e519524SHoward Hinnant return __result; 19643e519524SHoward Hinnant} 19653e519524SHoward Hinnant 19663e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19683e519524SHoward Hinnanttypename enable_if 19693e519524SHoward Hinnant< 19703e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1971ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19723e519524SHoward Hinnant _Up* 19733e519524SHoward Hinnant>::type 19743e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19753e519524SHoward Hinnant{ 19763e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19775b312052SMarshall Clow if (__n > 0) 19785b312052SMarshall Clow { 19793e519524SHoward Hinnant __result -= __n; 1980ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19815b312052SMarshall Clow } 19823e519524SHoward Hinnant return __result; 19833e519524SHoward Hinnant} 19843e519524SHoward Hinnant 19853e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19873e519524SHoward Hinnant_BidirectionalIterator2 19883e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19893e519524SHoward Hinnant _BidirectionalIterator2 __result) 19903e519524SHoward Hinnant{ 1991ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19923e519524SHoward Hinnant} 19933e519524SHoward Hinnant 19943e519524SHoward Hinnant// iter_swap 19953e519524SHoward Hinnant 1996a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19973e519524SHoward Hinnant 19983e519524SHoward Hinnant// transform 19993e519524SHoward Hinnant 20003e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 20013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20023e519524SHoward Hinnant_OutputIterator 20033e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 20043e519524SHoward Hinnant{ 2005910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20063e519524SHoward Hinnant *__result = __op(*__first); 20073e519524SHoward Hinnant return __result; 20083e519524SHoward Hinnant} 20093e519524SHoward Hinnant 20103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 20113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20123e519524SHoward Hinnant_OutputIterator 20133e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 20143e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 20153e519524SHoward Hinnant{ 2016910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 20173e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 20183e519524SHoward Hinnant return __result; 20193e519524SHoward Hinnant} 20203e519524SHoward Hinnant 20213e519524SHoward Hinnant// replace 20223e519524SHoward Hinnant 20233e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20253e519524SHoward Hinnantvoid 20263e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 20273e519524SHoward Hinnant{ 20283e519524SHoward Hinnant for (; __first != __last; ++__first) 20293e519524SHoward Hinnant if (*__first == __old_value) 20303e519524SHoward Hinnant *__first = __new_value; 20313e519524SHoward Hinnant} 20323e519524SHoward Hinnant 20333e519524SHoward Hinnant// replace_if 20343e519524SHoward Hinnant 20353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20373e519524SHoward Hinnantvoid 20383e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20393e519524SHoward Hinnant{ 20403e519524SHoward Hinnant for (; __first != __last; ++__first) 20413e519524SHoward Hinnant if (__pred(*__first)) 20423e519524SHoward Hinnant *__first = __new_value; 20433e519524SHoward Hinnant} 20443e519524SHoward Hinnant 20453e519524SHoward Hinnant// replace_copy 20463e519524SHoward Hinnant 20473e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20493e519524SHoward Hinnant_OutputIterator 20503e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20513e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20523e519524SHoward Hinnant{ 2053910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20543e519524SHoward Hinnant if (*__first == __old_value) 20553e519524SHoward Hinnant *__result = __new_value; 20563e519524SHoward Hinnant else 20573e519524SHoward Hinnant *__result = *__first; 20583e519524SHoward Hinnant return __result; 20593e519524SHoward Hinnant} 20603e519524SHoward Hinnant 20613e519524SHoward Hinnant// replace_copy_if 20623e519524SHoward Hinnant 20633e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20653e519524SHoward Hinnant_OutputIterator 20663e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20673e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20683e519524SHoward Hinnant{ 2069910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20703e519524SHoward Hinnant if (__pred(*__first)) 20713e519524SHoward Hinnant *__result = __new_value; 20723e519524SHoward Hinnant else 20733e519524SHoward Hinnant *__result = *__first; 20743e519524SHoward Hinnant return __result; 20753e519524SHoward Hinnant} 20763e519524SHoward Hinnant 20773e519524SHoward Hinnant// fill_n 20783e519524SHoward Hinnant 20793e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20813e519524SHoward Hinnant_OutputIterator 20820f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20833e519524SHoward Hinnant{ 2084910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2085e4383379SHoward Hinnant *__first = __value_; 20863e519524SHoward Hinnant return __first; 20873e519524SHoward Hinnant} 20883e519524SHoward Hinnant 20890f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20910f242beaSHoward Hinnanttypename enable_if 20920f242beaSHoward Hinnant< 20930f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20940f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20950f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20960f242beaSHoward Hinnant _Tp* 20970f242beaSHoward Hinnant>::type 20980f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20993e519524SHoward Hinnant{ 21003e519524SHoward Hinnant if (__n > 0) 2101e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 21023e519524SHoward Hinnant return __first + __n; 21033e519524SHoward Hinnant} 21043e519524SHoward Hinnant 21053e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 21063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21073e519524SHoward Hinnant_OutputIterator 2108e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 21093e519524SHoward Hinnant{ 211051544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 21113e519524SHoward Hinnant} 21123e519524SHoward Hinnant 21133e519524SHoward Hinnant// fill 21143e519524SHoward Hinnant 21153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21173e519524SHoward Hinnantvoid 2118e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 21193e519524SHoward Hinnant{ 21203e519524SHoward Hinnant for (; __first != __last; ++__first) 2121e4383379SHoward Hinnant *__first = __value_; 21223e519524SHoward Hinnant} 21233e519524SHoward Hinnant 21243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 21253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21263e519524SHoward Hinnantvoid 2127e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 21283e519524SHoward Hinnant{ 2129e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 21303e519524SHoward Hinnant} 21313e519524SHoward Hinnant 21323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21343e519524SHoward Hinnantvoid 2135e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21363e519524SHoward Hinnant{ 2137e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21383e519524SHoward Hinnant} 21393e519524SHoward Hinnant 21403e519524SHoward Hinnant// generate 21413e519524SHoward Hinnant 21423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21443e519524SHoward Hinnantvoid 21453e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21463e519524SHoward Hinnant{ 21473e519524SHoward Hinnant for (; __first != __last; ++__first) 21483e519524SHoward Hinnant *__first = __gen(); 21493e519524SHoward Hinnant} 21503e519524SHoward Hinnant 21513e519524SHoward Hinnant// generate_n 21523e519524SHoward Hinnant 21533e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21553e519524SHoward Hinnant_OutputIterator 215651544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21573e519524SHoward Hinnant{ 215851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 215951544023SEric Fiselier _IntegralSize __n = __orig_n; 2160910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21613e519524SHoward Hinnant *__first = __gen(); 21623e519524SHoward Hinnant return __first; 21633e519524SHoward Hinnant} 21643e519524SHoward Hinnant 21653e519524SHoward Hinnant// remove 21663e519524SHoward Hinnant 21673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21683e519524SHoward Hinnant_ForwardIterator 2169e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21703e519524SHoward Hinnant{ 2171e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21723e519524SHoward Hinnant if (__first != __last) 21733e519524SHoward Hinnant { 21743e519524SHoward Hinnant _ForwardIterator __i = __first; 21753e519524SHoward Hinnant while (++__i != __last) 21763e519524SHoward Hinnant { 2177e4383379SHoward Hinnant if (!(*__i == __value_)) 21783e519524SHoward Hinnant { 2179ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21803e519524SHoward Hinnant ++__first; 21813e519524SHoward Hinnant } 21823e519524SHoward Hinnant } 21833e519524SHoward Hinnant } 21843e519524SHoward Hinnant return __first; 21853e519524SHoward Hinnant} 21863e519524SHoward Hinnant 21873e519524SHoward Hinnant// remove_if 21883e519524SHoward Hinnant 21893e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21903e519524SHoward Hinnant_ForwardIterator 21913e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21923e519524SHoward Hinnant{ 2193ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21943e519524SHoward Hinnant (__first, __last, __pred); 21953e519524SHoward Hinnant if (__first != __last) 21963e519524SHoward Hinnant { 21973e519524SHoward Hinnant _ForwardIterator __i = __first; 21983e519524SHoward Hinnant while (++__i != __last) 21993e519524SHoward Hinnant { 22003e519524SHoward Hinnant if (!__pred(*__i)) 22013e519524SHoward Hinnant { 2202ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 22033e519524SHoward Hinnant ++__first; 22043e519524SHoward Hinnant } 22053e519524SHoward Hinnant } 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant return __first; 22083e519524SHoward Hinnant} 22093e519524SHoward Hinnant 22103e519524SHoward Hinnant// remove_copy 22113e519524SHoward Hinnant 22123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 22133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22143e519524SHoward Hinnant_OutputIterator 2215e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 22163e519524SHoward Hinnant{ 22173e519524SHoward Hinnant for (; __first != __last; ++__first) 22183e519524SHoward Hinnant { 2219e4383379SHoward Hinnant if (!(*__first == __value_)) 22203e519524SHoward Hinnant { 22213e519524SHoward Hinnant *__result = *__first; 22223e519524SHoward Hinnant ++__result; 22233e519524SHoward Hinnant } 22243e519524SHoward Hinnant } 22253e519524SHoward Hinnant return __result; 22263e519524SHoward Hinnant} 22273e519524SHoward Hinnant 22283e519524SHoward Hinnant// remove_copy_if 22293e519524SHoward Hinnant 22303e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 22313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22323e519524SHoward Hinnant_OutputIterator 22333e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 22343e519524SHoward Hinnant{ 22353e519524SHoward Hinnant for (; __first != __last; ++__first) 22363e519524SHoward Hinnant { 22373e519524SHoward Hinnant if (!__pred(*__first)) 22383e519524SHoward Hinnant { 22393e519524SHoward Hinnant *__result = *__first; 22403e519524SHoward Hinnant ++__result; 22413e519524SHoward Hinnant } 22423e519524SHoward Hinnant } 22433e519524SHoward Hinnant return __result; 22443e519524SHoward Hinnant} 22453e519524SHoward Hinnant 22463e519524SHoward Hinnant// unique 22473e519524SHoward Hinnant 22483e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22493e519524SHoward Hinnant_ForwardIterator 22503e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22513e519524SHoward Hinnant{ 2252ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22533e519524SHoward Hinnant (__first, __last, __pred); 22543e519524SHoward Hinnant if (__first != __last) 22553e519524SHoward Hinnant { 22563e519524SHoward Hinnant // ... a a ? ... 22573e519524SHoward Hinnant // f i 22583e519524SHoward Hinnant _ForwardIterator __i = __first; 22593e519524SHoward Hinnant for (++__i; ++__i != __last;) 22603e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2261ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22623e519524SHoward Hinnant ++__first; 22633e519524SHoward Hinnant } 22643e519524SHoward Hinnant return __first; 22653e519524SHoward Hinnant} 22663e519524SHoward Hinnant 22673e519524SHoward Hinnanttemplate <class _ForwardIterator> 22683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22693e519524SHoward Hinnant_ForwardIterator 22703e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22713e519524SHoward Hinnant{ 22723e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2273ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22743e519524SHoward Hinnant} 22753e519524SHoward Hinnant 22763e519524SHoward Hinnant// unique_copy 22773e519524SHoward Hinnant 22783e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22793e519524SHoward Hinnant_OutputIterator 22803e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22813e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22823e519524SHoward Hinnant{ 22833e519524SHoward Hinnant if (__first != __last) 22843e519524SHoward Hinnant { 22853e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22863e519524SHoward Hinnant *__result = __t; 22873e519524SHoward Hinnant ++__result; 22883e519524SHoward Hinnant while (++__first != __last) 22893e519524SHoward Hinnant { 22903e519524SHoward Hinnant if (!__pred(__t, *__first)) 22913e519524SHoward Hinnant { 22923e519524SHoward Hinnant __t = *__first; 22933e519524SHoward Hinnant *__result = __t; 22943e519524SHoward Hinnant ++__result; 22953e519524SHoward Hinnant } 22963e519524SHoward Hinnant } 22973e519524SHoward Hinnant } 22983e519524SHoward Hinnant return __result; 22993e519524SHoward Hinnant} 23003e519524SHoward Hinnant 23013e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 23023e519524SHoward Hinnant_OutputIterator 23033e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 23043e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 23053e519524SHoward Hinnant{ 23063e519524SHoward Hinnant if (__first != __last) 23073e519524SHoward Hinnant { 23083e519524SHoward Hinnant _ForwardIterator __i = __first; 23093e519524SHoward Hinnant *__result = *__i; 23103e519524SHoward Hinnant ++__result; 23113e519524SHoward Hinnant while (++__first != __last) 23123e519524SHoward Hinnant { 23133e519524SHoward Hinnant if (!__pred(*__i, *__first)) 23143e519524SHoward Hinnant { 23153e519524SHoward Hinnant *__result = *__first; 23163e519524SHoward Hinnant ++__result; 23173e519524SHoward Hinnant __i = __first; 23183e519524SHoward Hinnant } 23193e519524SHoward Hinnant } 23203e519524SHoward Hinnant } 23213e519524SHoward Hinnant return __result; 23223e519524SHoward Hinnant} 23233e519524SHoward Hinnant 23243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 23253e519524SHoward Hinnant_ForwardIterator 23263e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 23273e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 23283e519524SHoward Hinnant{ 23293e519524SHoward Hinnant if (__first != __last) 23303e519524SHoward Hinnant { 23313e519524SHoward Hinnant *__result = *__first; 23323e519524SHoward Hinnant while (++__first != __last) 23333e519524SHoward Hinnant if (!__pred(*__result, *__first)) 23343e519524SHoward Hinnant *++__result = *__first; 23353e519524SHoward Hinnant ++__result; 23363e519524SHoward Hinnant } 23373e519524SHoward Hinnant return __result; 23383e519524SHoward Hinnant} 23393e519524SHoward Hinnant 23403e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23423e519524SHoward Hinnant_OutputIterator 23433e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23443e519524SHoward Hinnant{ 2345ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23463e519524SHoward Hinnant (__first, __last, __result, __pred, 23473e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23483e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23493e519524SHoward Hinnant} 23503e519524SHoward Hinnant 23513e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23533e519524SHoward Hinnant_OutputIterator 23543e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23553e519524SHoward Hinnant{ 23563e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2357ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23583e519524SHoward Hinnant} 23593e519524SHoward Hinnant 23603e519524SHoward Hinnant// reverse 23613e519524SHoward Hinnant 23623e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23643e519524SHoward Hinnantvoid 23653e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23663e519524SHoward Hinnant{ 23673e519524SHoward Hinnant while (__first != __last) 23683e519524SHoward Hinnant { 23693e519524SHoward Hinnant if (__first == --__last) 23703e519524SHoward Hinnant break; 2371def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23723e519524SHoward Hinnant ++__first; 23733e519524SHoward Hinnant } 23743e519524SHoward Hinnant} 23753e519524SHoward Hinnant 23763e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23783e519524SHoward Hinnantvoid 23793e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23803e519524SHoward Hinnant{ 23813e519524SHoward Hinnant if (__first != __last) 23823e519524SHoward Hinnant for (; __first < --__last; ++__first) 2383def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23843e519524SHoward Hinnant} 23853e519524SHoward Hinnant 23863e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23883e519524SHoward Hinnantvoid 23893e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23903e519524SHoward Hinnant{ 2391ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23923e519524SHoward Hinnant} 23933e519524SHoward Hinnant 23943e519524SHoward Hinnant// reverse_copy 23953e519524SHoward Hinnant 23963e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23973e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23983e519524SHoward Hinnant_OutputIterator 23993e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 24003e519524SHoward Hinnant{ 24013e519524SHoward Hinnant for (; __first != __last; ++__result) 24023e519524SHoward Hinnant *__result = *--__last; 24033e519524SHoward Hinnant return __result; 24043e519524SHoward Hinnant} 24053e519524SHoward Hinnant 24063e519524SHoward Hinnant// rotate 24073e519524SHoward Hinnant 24083e519524SHoward Hinnanttemplate <class _ForwardIterator> 24093e519524SHoward Hinnant_ForwardIterator 2410aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 24113e519524SHoward Hinnant{ 2412aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2413aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2414aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2415aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2416aca09de3SHoward Hinnant return __lm1; 2417aca09de3SHoward Hinnant} 2418aca09de3SHoward Hinnant 2419aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2420aca09de3SHoward Hinnant_BidirectionalIterator 2421aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2422aca09de3SHoward Hinnant{ 2423aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2424aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2425aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2426aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2427aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2428aca09de3SHoward Hinnant return __fp1; 2429aca09de3SHoward Hinnant} 2430aca09de3SHoward Hinnant 2431aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2432aca09de3SHoward Hinnant_ForwardIterator 2433aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2434aca09de3SHoward Hinnant{ 24353e519524SHoward Hinnant _ForwardIterator __i = __middle; 24363e519524SHoward Hinnant while (true) 24373e519524SHoward Hinnant { 24383e519524SHoward Hinnant swap(*__first, *__i); 24393e519524SHoward Hinnant ++__first; 24403e519524SHoward Hinnant if (++__i == __last) 24413e519524SHoward Hinnant break; 24423e519524SHoward Hinnant if (__first == __middle) 24433e519524SHoward Hinnant __middle = __i; 24443e519524SHoward Hinnant } 24453e519524SHoward Hinnant _ForwardIterator __r = __first; 24463e519524SHoward Hinnant if (__first != __middle) 24473e519524SHoward Hinnant { 24483e519524SHoward Hinnant __i = __middle; 24493e519524SHoward Hinnant while (true) 24503e519524SHoward Hinnant { 24513e519524SHoward Hinnant swap(*__first, *__i); 24523e519524SHoward Hinnant ++__first; 24533e519524SHoward Hinnant if (++__i == __last) 24543e519524SHoward Hinnant { 24553e519524SHoward Hinnant if (__first == __middle) 24563e519524SHoward Hinnant break; 24573e519524SHoward Hinnant __i = __middle; 24583e519524SHoward Hinnant } 24593e519524SHoward Hinnant else if (__first == __middle) 24603e519524SHoward Hinnant __middle = __i; 24613e519524SHoward Hinnant } 24623e519524SHoward Hinnant } 24633e519524SHoward Hinnant return __r; 24643e519524SHoward Hinnant} 24653e519524SHoward Hinnant 24663e519524SHoward Hinnanttemplate<typename _Integral> 24673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24683e519524SHoward Hinnant_Integral 246919b4035fSMarshall Clow__algo_gcd(_Integral __x, _Integral __y) 24703e519524SHoward Hinnant{ 24713e519524SHoward Hinnant do 24723e519524SHoward Hinnant { 24733e519524SHoward Hinnant _Integral __t = __x % __y; 24743e519524SHoward Hinnant __x = __y; 24753e519524SHoward Hinnant __y = __t; 24763e519524SHoward Hinnant } while (__y); 24773e519524SHoward Hinnant return __x; 24783e519524SHoward Hinnant} 24793e519524SHoward Hinnant 24803e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24813e519524SHoward Hinnant_RandomAccessIterator 2482aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24833e519524SHoward Hinnant{ 24843e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24853e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24863e519524SHoward Hinnant 24873e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24883e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24893e519524SHoward Hinnant if (__m1 == __m2) 24903e519524SHoward Hinnant { 2491ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24923e519524SHoward Hinnant return __middle; 24933e519524SHoward Hinnant } 249419b4035fSMarshall Clow const difference_type __g = _VSTD::__algo_gcd(__m1, __m2); 24953e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24963e519524SHoward Hinnant { 2497aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24983e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24993e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 25003e519524SHoward Hinnant do 25013e519524SHoward Hinnant { 2502aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 25033e519524SHoward Hinnant __p1 = __p2; 25043e519524SHoward Hinnant const difference_type __d = __last - __p2; 25053e519524SHoward Hinnant if (__m1 < __d) 25063e519524SHoward Hinnant __p2 += __m1; 25073e519524SHoward Hinnant else 25083e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 25093e519524SHoward Hinnant } while (__p2 != __p); 2510aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 25113e519524SHoward Hinnant } 25123e519524SHoward Hinnant return __first + __m2; 25133e519524SHoward Hinnant} 25143e519524SHoward Hinnant 25153e519524SHoward Hinnanttemplate <class _ForwardIterator> 25163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25173e519524SHoward Hinnant_ForwardIterator 2518aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2519aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2520aca09de3SHoward Hinnant{ 2521aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2522aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2523aca09de3SHoward Hinnant { 2524aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2525aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2526aca09de3SHoward Hinnant } 2527aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2528aca09de3SHoward Hinnant} 2529aca09de3SHoward Hinnant 2530aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2531aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2532aca09de3SHoward Hinnant_BidirectionalIterator 2533aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2534aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2535aca09de3SHoward Hinnant{ 2536aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2537aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2538aca09de3SHoward Hinnant { 2539aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2540aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2541aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2542aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2543aca09de3SHoward Hinnant } 2544aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2545aca09de3SHoward Hinnant} 2546aca09de3SHoward Hinnant 2547aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2548aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2549aca09de3SHoward Hinnant_RandomAccessIterator 2550aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2551aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2552aca09de3SHoward Hinnant{ 2553aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2554aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2555aca09de3SHoward Hinnant { 2556aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2557aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2558aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2559aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2560aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2561aca09de3SHoward Hinnant } 2562aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2563aca09de3SHoward Hinnant} 2564aca09de3SHoward Hinnant 2565aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2566aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2567aca09de3SHoward Hinnant_ForwardIterator 25683e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25693e519524SHoward Hinnant{ 2570aca09de3SHoward Hinnant if (__first == __middle) 2571aca09de3SHoward Hinnant return __last; 2572aca09de3SHoward Hinnant if (__middle == __last) 2573aca09de3SHoward Hinnant return __first; 2574ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2575aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25763e519524SHoward Hinnant} 25773e519524SHoward Hinnant 25783e519524SHoward Hinnant// rotate_copy 25793e519524SHoward Hinnant 25803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25823e519524SHoward Hinnant_OutputIterator 25833e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25843e519524SHoward Hinnant{ 2585ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25863e519524SHoward Hinnant} 25873e519524SHoward Hinnant 25883e519524SHoward Hinnant// min_element 25893e519524SHoward Hinnant 25903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25919d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25923e519524SHoward Hinnant_ForwardIterator 25930b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25943e519524SHoward Hinnant{ 25953e519524SHoward Hinnant if (__first != __last) 25963e519524SHoward Hinnant { 25973e519524SHoward Hinnant _ForwardIterator __i = __first; 25983e519524SHoward Hinnant while (++__i != __last) 25993e519524SHoward Hinnant if (__comp(*__i, *__first)) 26003e519524SHoward Hinnant __first = __i; 26013e519524SHoward Hinnant } 26023e519524SHoward Hinnant return __first; 26033e519524SHoward Hinnant} 26043e519524SHoward Hinnant 26053e519524SHoward Hinnanttemplate <class _ForwardIterator> 26060b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26073e519524SHoward Hinnant_ForwardIterator 26083e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 26093e519524SHoward Hinnant{ 26100b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 26114eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26124eb27b79SHoward Hinnant} 26134eb27b79SHoward Hinnant 26144eb27b79SHoward Hinnant// min 26154eb27b79SHoward Hinnant 26164eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26179d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26184eb27b79SHoward Hinnantconst _Tp& 26194eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 26204eb27b79SHoward Hinnant{ 26214eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 26224eb27b79SHoward Hinnant} 26234eb27b79SHoward Hinnant 26244eb27b79SHoward Hinnanttemplate <class _Tp> 26259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26264eb27b79SHoward Hinnantconst _Tp& 26274eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 26284eb27b79SHoward Hinnant{ 2629ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 26304eb27b79SHoward Hinnant} 26314eb27b79SHoward Hinnant 2632ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 263354976f26SHoward Hinnant 26344eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26359d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26364eb27b79SHoward Hinnant_Tp 26374eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26384eb27b79SHoward Hinnant{ 26390b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26404eb27b79SHoward Hinnant} 26414eb27b79SHoward Hinnant 26424eb27b79SHoward Hinnanttemplate<class _Tp> 26439d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26444eb27b79SHoward Hinnant_Tp 26454eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26464eb27b79SHoward Hinnant{ 26470b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26483e519524SHoward Hinnant} 26493e519524SHoward Hinnant 2650ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 265154976f26SHoward Hinnant 26523e519524SHoward Hinnant// max_element 26533e519524SHoward Hinnant 26543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26559d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26563e519524SHoward Hinnant_ForwardIterator 26570b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26583e519524SHoward Hinnant{ 26593e519524SHoward Hinnant if (__first != __last) 26603e519524SHoward Hinnant { 26613e519524SHoward Hinnant _ForwardIterator __i = __first; 26623e519524SHoward Hinnant while (++__i != __last) 26633e519524SHoward Hinnant if (__comp(*__first, *__i)) 26643e519524SHoward Hinnant __first = __i; 26653e519524SHoward Hinnant } 26663e519524SHoward Hinnant return __first; 26673e519524SHoward Hinnant} 26683e519524SHoward Hinnant 26699d67c6d5SMarshall Clow 26703e519524SHoward Hinnanttemplate <class _ForwardIterator> 26710b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26723e519524SHoward Hinnant_ForwardIterator 26733e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26743e519524SHoward Hinnant{ 26750b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26764eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26774eb27b79SHoward Hinnant} 26784eb27b79SHoward Hinnant 26794eb27b79SHoward Hinnant// max 26804eb27b79SHoward Hinnant 26814eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26829d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26834eb27b79SHoward Hinnantconst _Tp& 26844eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26854eb27b79SHoward Hinnant{ 26864eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26874eb27b79SHoward Hinnant} 26884eb27b79SHoward Hinnant 26894eb27b79SHoward Hinnanttemplate <class _Tp> 26909d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26914eb27b79SHoward Hinnantconst _Tp& 26924eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26934eb27b79SHoward Hinnant{ 2694ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26954eb27b79SHoward Hinnant} 26964eb27b79SHoward Hinnant 2697ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 269854976f26SHoward Hinnant 26994eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27009d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27014eb27b79SHoward Hinnant_Tp 27024eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 27034eb27b79SHoward Hinnant{ 27040b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 27054eb27b79SHoward Hinnant} 27064eb27b79SHoward Hinnant 27074eb27b79SHoward Hinnanttemplate<class _Tp> 27089d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27094eb27b79SHoward Hinnant_Tp 27104eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 27114eb27b79SHoward Hinnant{ 27120b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 27133e519524SHoward Hinnant} 27143e519524SHoward Hinnant 2715ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 271654976f26SHoward Hinnant 2717146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2718146c14acSMarshall Clow// clamp 2719146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2720146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2721146c14acSMarshall Clowconst _Tp& 2722146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2723146c14acSMarshall Clow{ 2724146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2725146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2726146c14acSMarshall Clow 2727146c14acSMarshall Clow} 2728146c14acSMarshall Clow 2729146c14acSMarshall Clowtemplate<class _Tp> 2730146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2731146c14acSMarshall Clowconst _Tp& 2732146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2733146c14acSMarshall Clow{ 2734146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2735146c14acSMarshall Clow} 2736146c14acSMarshall Clow#endif 2737146c14acSMarshall Clow 27383e519524SHoward Hinnant// minmax_element 27393e519524SHoward Hinnant 27403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27410b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27423e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27433e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27443e519524SHoward Hinnant{ 27453e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27463e519524SHoward Hinnant if (__first != __last) 27473e519524SHoward Hinnant { 27483e519524SHoward Hinnant if (++__first != __last) 27493e519524SHoward Hinnant { 27503e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27513e519524SHoward Hinnant __result.first = __first; 27523e519524SHoward Hinnant else 27533e519524SHoward Hinnant __result.second = __first; 27543e519524SHoward Hinnant while (++__first != __last) 27553e519524SHoward Hinnant { 27563e519524SHoward Hinnant _ForwardIterator __i = __first; 27573e519524SHoward Hinnant if (++__first == __last) 27583e519524SHoward Hinnant { 27593e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27603e519524SHoward Hinnant __result.first = __i; 27613e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27623e519524SHoward Hinnant __result.second = __i; 27633e519524SHoward Hinnant break; 27643e519524SHoward Hinnant } 27653e519524SHoward Hinnant else 27663e519524SHoward Hinnant { 27673e519524SHoward Hinnant if (__comp(*__first, *__i)) 27683e519524SHoward Hinnant { 27693e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27703e519524SHoward Hinnant __result.first = __first; 27713e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27723e519524SHoward Hinnant __result.second = __i; 27733e519524SHoward Hinnant } 27743e519524SHoward Hinnant else 27753e519524SHoward Hinnant { 27763e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27773e519524SHoward Hinnant __result.first = __i; 27783e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27793e519524SHoward Hinnant __result.second = __first; 27803e519524SHoward Hinnant } 27813e519524SHoward Hinnant } 27823e519524SHoward Hinnant } 27833e519524SHoward Hinnant } 27843e519524SHoward Hinnant } 27853e519524SHoward Hinnant return __result; 27863e519524SHoward Hinnant} 27873e519524SHoward Hinnant 27883e519524SHoward Hinnanttemplate <class _ForwardIterator> 27890b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27903e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27913e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27923e519524SHoward Hinnant{ 27939d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27949d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27953e519524SHoward Hinnant} 27963e519524SHoward Hinnant 27974eb27b79SHoward Hinnant// minmax 27984eb27b79SHoward Hinnant 27994eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28009d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28014eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28024eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 28034eb27b79SHoward Hinnant{ 28044eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 28054eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 28064eb27b79SHoward Hinnant} 28074eb27b79SHoward Hinnant 28084eb27b79SHoward Hinnanttemplate<class _Tp> 28099d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28104eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 28114eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 28124eb27b79SHoward Hinnant{ 2813ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 28144eb27b79SHoward Hinnant} 28154eb27b79SHoward Hinnant 2816ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 281754976f26SHoward Hinnant 28184eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 28199d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28204eb27b79SHoward Hinnantpair<_Tp, _Tp> 28214eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 28224eb27b79SHoward Hinnant{ 28239d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 28249d67c6d5SMarshall Clow _Iter __first = __t.begin(); 28259d67c6d5SMarshall Clow _Iter __last = __t.end(); 28269d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 28279d67c6d5SMarshall Clow 28289d67c6d5SMarshall Clow ++__first; 28299d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 28309d67c6d5SMarshall Clow { 28319d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 28329d67c6d5SMarshall Clow __result.first = *__first; 28339d67c6d5SMarshall Clow else 28349d67c6d5SMarshall Clow __result.second = *__first; 28359d67c6d5SMarshall Clow ++__first; 28369d67c6d5SMarshall Clow } 28379d67c6d5SMarshall Clow 28389d67c6d5SMarshall Clow while (__first != __last) 28399d67c6d5SMarshall Clow { 28409d67c6d5SMarshall Clow _Tp __prev = *__first++; 2841002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2842002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2843002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28449d67c6d5SMarshall Clow } 28459d67c6d5SMarshall Clow else { 2846002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2847002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28489d67c6d5SMarshall Clow } 28499d67c6d5SMarshall Clow 28509d67c6d5SMarshall Clow __first++; 28519d67c6d5SMarshall Clow } 28529d67c6d5SMarshall Clow return __result; 28539d67c6d5SMarshall Clow} 28549d67c6d5SMarshall Clow 28559d67c6d5SMarshall Clowtemplate<class _Tp> 28569d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28579d67c6d5SMarshall Clowpair<_Tp, _Tp> 28589d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28599d67c6d5SMarshall Clow{ 28609d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28614eb27b79SHoward Hinnant} 28624eb27b79SHoward Hinnant 2863ddda456aSEric Fiselier#endif // _LIBCPP_CXX03_LANG 286454976f26SHoward Hinnant 28653e519524SHoward Hinnant// random_shuffle 28663e519524SHoward Hinnant 2867f9d540b0SHoward Hinnant// __independent_bits_engine 2868f9d540b0SHoward Hinnant 2869c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2870f9d540b0SHoward Hinnantstruct __log2_imp 28713e519524SHoward Hinnant{ 2872c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2873c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28743e519524SHoward Hinnant}; 28753e519524SHoward Hinnant 2876c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2877c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28783e519524SHoward Hinnant{ 2879f9d540b0SHoward Hinnant static const size_t value = 0; 28803e519524SHoward Hinnant}; 28813e519524SHoward Hinnant 2882c003db1fSHoward Hinnanttemplate <size_t _Rp> 2883c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28843e519524SHoward Hinnant{ 2885c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28863e519524SHoward Hinnant}; 28873e519524SHoward Hinnant 2888c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2889f9d540b0SHoward Hinnantstruct __log2 28903e519524SHoward Hinnant{ 2891c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2892f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28933e519524SHoward Hinnant}; 28943e519524SHoward Hinnant 2895f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2896f9d540b0SHoward Hinnantclass __independent_bits_engine 28973e519524SHoward Hinnant{ 2898f9d540b0SHoward Hinnantpublic: 2899f9d540b0SHoward Hinnant // types 2900f9d540b0SHoward Hinnant typedef _UIntType result_type; 2901f9d540b0SHoward Hinnant 2902f9d540b0SHoward Hinnantprivate: 2903f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2904f9d540b0SHoward Hinnant typedef typename conditional 2905f9d540b0SHoward Hinnant < 2906f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2907f9d540b0SHoward Hinnant result_type, 2908f9d540b0SHoward Hinnant _Engine_result_type 2909f9d540b0SHoward Hinnant >::type _Working_result_type; 2910f9d540b0SHoward Hinnant 2911f9d540b0SHoward Hinnant _Engine& __e_; 2912f9d540b0SHoward Hinnant size_t __w_; 2913f9d540b0SHoward Hinnant size_t __w0_; 2914f9d540b0SHoward Hinnant size_t __n_; 2915f9d540b0SHoward Hinnant size_t __n0_; 2916f9d540b0SHoward Hinnant _Working_result_type __y0_; 2917f9d540b0SHoward Hinnant _Working_result_type __y1_; 2918f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2919f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2920f9d540b0SHoward Hinnant 2921ddda456aSEric Fiselier#ifdef _LIBCPP_CXX03_LANG 2922c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2923f9d540b0SHoward Hinnant + _Working_result_type(1); 2924e386b7b3SHoward Hinnant#else 2925e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2926e386b7b3SHoward Hinnant + _Working_result_type(1); 2927e386b7b3SHoward Hinnant#endif 2928e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2929e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2930e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2931f9d540b0SHoward Hinnant 2932f9d540b0SHoward Hinnantpublic: 2933f9d540b0SHoward Hinnant // constructors and seeding functions 2934f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2935f9d540b0SHoward Hinnant 2936f9d540b0SHoward Hinnant // generating functions 2937c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2938f9d540b0SHoward Hinnant 2939f9d540b0SHoward Hinnantprivate: 2940f9d540b0SHoward Hinnant result_type __eval(false_type); 2941f9d540b0SHoward Hinnant result_type __eval(true_type); 2942f9d540b0SHoward Hinnant}; 2943f9d540b0SHoward Hinnant 2944f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2945f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2946f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2947f9d540b0SHoward Hinnant : __e_(__e), 2948f9d540b0SHoward Hinnant __w_(__w) 2949f9d540b0SHoward Hinnant{ 2950f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2951f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2952c003db1fSHoward Hinnant if (_Rp == 0) 2953c003db1fSHoward Hinnant __y0_ = _Rp; 2954f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2955c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2956f9d540b0SHoward Hinnant else 2957f9d540b0SHoward Hinnant __y0_ = 0; 2958c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2959f9d540b0SHoward Hinnant { 2960f9d540b0SHoward Hinnant ++__n_; 2961f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2962f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2963c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2964f9d540b0SHoward Hinnant else 2965f9d540b0SHoward Hinnant __y0_ = 0; 2966f9d540b0SHoward Hinnant } 2967f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2968f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2969c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2970f9d540b0SHoward Hinnant else 2971f9d540b0SHoward Hinnant __y1_ = 0; 2972f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2973f9d540b0SHoward Hinnant _Engine_result_type(0); 2974f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2975f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2976f9d540b0SHoward Hinnant _Engine_result_type(~0); 29773e519524SHoward Hinnant} 29783e519524SHoward Hinnant 2979f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2980f9d540b0SHoward Hinnantinline 2981f9d540b0SHoward Hinnant_UIntType 2982f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29833e519524SHoward Hinnant{ 2984f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29853e519524SHoward Hinnant} 29863e519524SHoward Hinnant 2987f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2988f9d540b0SHoward Hinnant_UIntType 2989f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29903e519524SHoward Hinnant{ 2991c003db1fSHoward Hinnant result_type _Sp = 0; 2992f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2993f9d540b0SHoward Hinnant { 2994f9d540b0SHoward Hinnant _Engine_result_type __u; 29953e519524SHoward Hinnant do 2996f9d540b0SHoward Hinnant { 2997f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2998f9d540b0SHoward Hinnant } while (__u >= __y0_); 29990176bc6cSHoward Hinnant if (__w0_ < _WDt) 3000c003db1fSHoward Hinnant _Sp <<= __w0_; 3001f9d540b0SHoward Hinnant else 3002c003db1fSHoward Hinnant _Sp = 0; 3003c003db1fSHoward Hinnant _Sp += __u & __mask0_; 3004f9d540b0SHoward Hinnant } 3005f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 3006f9d540b0SHoward Hinnant { 3007f9d540b0SHoward Hinnant _Engine_result_type __u; 3008f9d540b0SHoward Hinnant do 3009f9d540b0SHoward Hinnant { 3010f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 3011f9d540b0SHoward Hinnant } while (__u >= __y1_); 30120176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 3013c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 3014f9d540b0SHoward Hinnant else 3015c003db1fSHoward Hinnant _Sp = 0; 3016c003db1fSHoward Hinnant _Sp += __u & __mask1_; 3017f9d540b0SHoward Hinnant } 3018c003db1fSHoward Hinnant return _Sp; 30193e519524SHoward Hinnant} 30203e519524SHoward Hinnant 3021f9d540b0SHoward Hinnant// uniform_int_distribution 30223e519524SHoward Hinnant 3023f9d540b0SHoward Hinnanttemplate<class _IntType = int> 3024f9d540b0SHoward Hinnantclass uniform_int_distribution 30253e519524SHoward Hinnant{ 3026f9d540b0SHoward Hinnantpublic: 3027f9d540b0SHoward Hinnant // types 3028f9d540b0SHoward Hinnant typedef _IntType result_type; 3029f9d540b0SHoward Hinnant 3030f9d540b0SHoward Hinnant class param_type 3031f9d540b0SHoward Hinnant { 3032f9d540b0SHoward Hinnant result_type __a_; 3033f9d540b0SHoward Hinnant result_type __b_; 3034f9d540b0SHoward Hinnant public: 3035f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3036f9d540b0SHoward Hinnant 3037f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3038f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3039f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3040f9d540b0SHoward Hinnant 3041f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3042f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3043f9d540b0SHoward Hinnant 3044f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3045f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3046f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3047f9d540b0SHoward Hinnant {return !(__x == __y);} 30483e519524SHoward Hinnant }; 30493e519524SHoward Hinnant 3050f9d540b0SHoward Hinnantprivate: 3051f9d540b0SHoward Hinnant param_type __p_; 30523e519524SHoward Hinnant 3053f9d540b0SHoward Hinnantpublic: 3054f9d540b0SHoward Hinnant // constructors and reset functions 3055f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3056f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3057f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3058f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3059f9d540b0SHoward Hinnant void reset() {} 3060f9d540b0SHoward Hinnant 3061f9d540b0SHoward Hinnant // generating functions 3062f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3063f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3064f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3065f9d540b0SHoward Hinnant 3066f9d540b0SHoward Hinnant // property functions 3067f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3068f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3069f9d540b0SHoward Hinnant 3070f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3071f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3072f9d540b0SHoward Hinnant 3073f9d540b0SHoward Hinnant result_type min() const {return a();} 3074f9d540b0SHoward Hinnant result_type max() const {return b();} 3075f9d540b0SHoward Hinnant 3076f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3077f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3078f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3079f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3080f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3081f9d540b0SHoward Hinnant {return !(__x == __y);} 30823e519524SHoward Hinnant}; 30833e519524SHoward Hinnant 3084f9d540b0SHoward Hinnanttemplate<class _IntType> 3085f9d540b0SHoward Hinnanttemplate<class _URNG> 3086f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3087f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30883e519524SHoward Hinnant{ 3089f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3090f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3091c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3092c003db1fSHoward Hinnant if (_Rp == 1) 3093f9d540b0SHoward Hinnant return __p.a(); 3094f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3095f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3096c003db1fSHoward Hinnant if (_Rp == 0) 3097f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3098c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3099a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3100f9d540b0SHoward Hinnant ++__w; 3101f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3102f9d540b0SHoward Hinnant _UIntType __u; 3103f9d540b0SHoward Hinnant do 31043e519524SHoward Hinnant { 3105f9d540b0SHoward Hinnant __u = __e(); 3106c003db1fSHoward Hinnant } while (__u >= _Rp); 3107f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 31083e519524SHoward Hinnant} 3109f9d540b0SHoward Hinnant 311066f1ec46SEric Fiselier#if _LIBCPP_STD_VER <= 14 || defined(_LIBCPP_ENABLE_CXX17_REMOVED_RANDOM_SHUFFLE) \ 311166f1ec46SEric Fiselier || defined(_LIBCPP_BUILDING_LIBRARY) 3112f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3113f9d540b0SHoward Hinnant 3114f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3115f9d540b0SHoward Hinnant 3116f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 31173e519524SHoward Hinnant{ 3118f9d540b0SHoward Hinnant static unsigned __c_; 3119f9d540b0SHoward Hinnant 3120f9d540b0SHoward Hinnant __rs_default(); 3121f9d540b0SHoward Hinnantpublic: 3122b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3123f9d540b0SHoward Hinnant 3124f9d540b0SHoward Hinnant static const result_type _Min = 0; 3125f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3126f9d540b0SHoward Hinnant 3127f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3128f9d540b0SHoward Hinnant ~__rs_default(); 3129f9d540b0SHoward Hinnant 3130f9d540b0SHoward Hinnant result_type operator()(); 3131f9d540b0SHoward Hinnant 3132788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3133788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3134f9d540b0SHoward Hinnant 3135f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3136f9d540b0SHoward Hinnant}; 3137f9d540b0SHoward Hinnant 3138f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31393e519524SHoward Hinnant 31403e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31413e519524SHoward Hinnantvoid 31423e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31433e519524SHoward Hinnant{ 31443e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3145c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3146c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31473e519524SHoward Hinnant difference_type __d = __last - __first; 31483e519524SHoward Hinnant if (__d > 1) 31493e519524SHoward Hinnant { 3150c003db1fSHoward Hinnant _Dp __uid; 3151f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3152f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3153007b26beSHoward Hinnant { 3154c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3155007b26beSHoward Hinnant if (__i != difference_type(0)) 3156007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3157007b26beSHoward Hinnant } 31583e519524SHoward Hinnant } 31593e519524SHoward Hinnant} 31603e519524SHoward Hinnant 31613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31623e519524SHoward Hinnantvoid 31633e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3164ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 31653e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31663e519524SHoward Hinnant#else 31673e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31683e519524SHoward Hinnant#endif 31693e519524SHoward Hinnant{ 31703e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31713e519524SHoward Hinnant difference_type __d = __last - __first; 31723e519524SHoward Hinnant if (__d > 1) 31733e519524SHoward Hinnant { 31743e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3175007b26beSHoward Hinnant { 3176007b26beSHoward Hinnant difference_type __i = __rand(__d); 3177007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3178007b26beSHoward Hinnant } 31793e519524SHoward Hinnant } 31803e519524SHoward Hinnant} 31810f37a410SMarshall Clow#endif 31823e519524SHoward Hinnant 3183e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3184e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3185e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3186e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 31875741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3188e7154709SEric Fiselier _Distance __n, 3189e7154709SEric Fiselier _UniformRandomNumberGenerator & __g, 3190e7154709SEric Fiselier input_iterator_tag) { 3191e7154709SEric Fiselier 3192e7154709SEric Fiselier _Distance __k = 0; 3193e7154709SEric Fiselier for (; __first != __last && __k < __n; ++__first, (void)++__k) 31945741d86dSEric Fiselier __output[__k] = *__first; 3195e7154709SEric Fiselier _Distance __sz = __k; 3196e7154709SEric Fiselier for (; __first != __last; ++__first, (void)++__k) { 3197e7154709SEric Fiselier _Distance __r = _VSTD::uniform_int_distribution<_Distance>(0, __k)(__g); 3198e7154709SEric Fiselier if (__r < __sz) 31995741d86dSEric Fiselier __output[__r] = *__first; 3200e7154709SEric Fiselier } 32015741d86dSEric Fiselier return __output + _VSTD::min(__n, __k); 3202e7154709SEric Fiselier} 3203e7154709SEric Fiselier 3204e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3205e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3206e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3207e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32085741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3209e7154709SEric Fiselier _Distance __n, 3210e7154709SEric Fiselier _UniformRandomNumberGenerator& __g, 3211e7154709SEric Fiselier forward_iterator_tag) { 3212e7154709SEric Fiselier _Distance __unsampled_sz = _VSTD::distance(__first, __last); 3213e7154709SEric Fiselier for (__n = _VSTD::min(__n, __unsampled_sz); __n != 0; ++__first) { 3214e7154709SEric Fiselier _Distance __r = 3215e7154709SEric Fiselier _VSTD::uniform_int_distribution<_Distance>(0, --__unsampled_sz)(__g); 3216e7154709SEric Fiselier if (__r < __n) { 32175741d86dSEric Fiselier *__output++ = *__first; 3218e7154709SEric Fiselier --__n; 3219e7154709SEric Fiselier } 3220e7154709SEric Fiselier } 32215741d86dSEric Fiselier return __output; 3222e7154709SEric Fiselier} 3223e7154709SEric Fiselier 3224e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3225e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3226e7154709SEric Fiselier_LIBCPP_INLINE_VISIBILITY 3227e7154709SEric Fiselier_SampleIterator __sample(_PopulationIterator __first, 32285741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3229e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator& __g) { 3230e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::iterator_category 3231e7154709SEric Fiselier _PopCategory; 3232e7154709SEric Fiselier typedef typename iterator_traits<_PopulationIterator>::difference_type 3233e7154709SEric Fiselier _Difference; 3234e7154709SEric Fiselier static_assert(__is_forward_iterator<_PopulationIterator>::value || 3235e7154709SEric Fiselier __is_random_access_iterator<_SampleIterator>::value, 3236e7154709SEric Fiselier "SampleIterator must meet the requirements of RandomAccessIterator"); 3237e7154709SEric Fiselier typedef typename common_type<_Distance, _Difference>::type _CommonType; 3238e7154709SEric Fiselier _LIBCPP_ASSERT(__n >= 0, "N must be a positive number."); 3239e7154709SEric Fiselier return _VSTD::__sample( 32405741d86dSEric Fiselier __first, __last, __output, _CommonType(__n), 3241e7154709SEric Fiselier __g, _PopCategory()); 3242e7154709SEric Fiselier} 3243e7154709SEric Fiselier 3244e7154709SEric Fiselier#if _LIBCPP_STD_VER > 14 3245e7154709SEric Fiseliertemplate <class _PopulationIterator, class _SampleIterator, class _Distance, 3246e7154709SEric Fiselier class _UniformRandomNumberGenerator> 3247e7154709SEric Fiselierinline _LIBCPP_INLINE_VISIBILITY 3248e7154709SEric Fiselier_SampleIterator sample(_PopulationIterator __first, 32495741d86dSEric Fiselier _PopulationIterator __last, _SampleIterator __output, 3250e7154709SEric Fiselier _Distance __n, _UniformRandomNumberGenerator&& __g) { 32515741d86dSEric Fiselier return _VSTD::__sample(__first, __last, __output, __n, __g); 3252e7154709SEric Fiselier} 3253e7154709SEric Fiselier#endif // _LIBCPP_STD_VER > 14 3254e7154709SEric Fiselier 3255f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3256f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3257ddda456aSEric Fiselier#ifndef _LIBCPP_CXX03_LANG 3258fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3259fb340102SHoward Hinnant#else 3260f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3261fb340102SHoward Hinnant#endif 3262f9d540b0SHoward Hinnant{ 3263f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3264c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3265c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3266f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3267f9d540b0SHoward Hinnant if (__d > 1) 3268f9d540b0SHoward Hinnant { 3269c003db1fSHoward Hinnant _Dp __uid; 3270f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3271007b26beSHoward Hinnant { 3272c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3273007b26beSHoward Hinnant if (__i != difference_type(0)) 3274007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3275007b26beSHoward Hinnant } 3276f9d540b0SHoward Hinnant } 3277f9d540b0SHoward Hinnant} 3278f9d540b0SHoward Hinnant 32793e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 32803e519524SHoward Hinnantbool 32813e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 32823e519524SHoward Hinnant{ 32833e519524SHoward Hinnant for (; __first != __last; ++__first) 32843e519524SHoward Hinnant if (!__pred(*__first)) 32853e519524SHoward Hinnant break; 3286b9595b79SMarshall Clow if ( __first == __last ) 3287b9595b79SMarshall Clow return true; 3288b9595b79SMarshall Clow ++__first; 32893e519524SHoward Hinnant for (; __first != __last; ++__first) 32903e519524SHoward Hinnant if (__pred(*__first)) 32913e519524SHoward Hinnant return false; 32923e519524SHoward Hinnant return true; 32933e519524SHoward Hinnant} 32943e519524SHoward Hinnant 32953e519524SHoward Hinnant// partition 32963e519524SHoward Hinnant 32973e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 32983e519524SHoward Hinnant_ForwardIterator 32993e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 33003e519524SHoward Hinnant{ 33013e519524SHoward Hinnant while (true) 33023e519524SHoward Hinnant { 33033e519524SHoward Hinnant if (__first == __last) 33043e519524SHoward Hinnant return __first; 33053e519524SHoward Hinnant if (!__pred(*__first)) 33063e519524SHoward Hinnant break; 33073e519524SHoward Hinnant ++__first; 33083e519524SHoward Hinnant } 33093e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 33103e519524SHoward Hinnant { 33113e519524SHoward Hinnant if (__pred(*__p)) 33123e519524SHoward Hinnant { 33133e519524SHoward Hinnant swap(*__first, *__p); 33143e519524SHoward Hinnant ++__first; 33153e519524SHoward Hinnant } 33163e519524SHoward Hinnant } 33173e519524SHoward Hinnant return __first; 33183e519524SHoward Hinnant} 33193e519524SHoward Hinnant 33203e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 33213e519524SHoward Hinnant_BidirectionalIterator 33223e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33233e519524SHoward Hinnant bidirectional_iterator_tag) 33243e519524SHoward Hinnant{ 33253e519524SHoward Hinnant while (true) 33263e519524SHoward Hinnant { 33273e519524SHoward Hinnant while (true) 33283e519524SHoward Hinnant { 33293e519524SHoward Hinnant if (__first == __last) 33303e519524SHoward Hinnant return __first; 33313e519524SHoward Hinnant if (!__pred(*__first)) 33323e519524SHoward Hinnant break; 33333e519524SHoward Hinnant ++__first; 33343e519524SHoward Hinnant } 33353e519524SHoward Hinnant do 33363e519524SHoward Hinnant { 33373e519524SHoward Hinnant if (__first == --__last) 33383e519524SHoward Hinnant return __first; 33393e519524SHoward Hinnant } while (!__pred(*__last)); 33403e519524SHoward Hinnant swap(*__first, *__last); 33413e519524SHoward Hinnant ++__first; 33423e519524SHoward Hinnant } 33433e519524SHoward Hinnant} 33443e519524SHoward Hinnant 33453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 33463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 33473e519524SHoward Hinnant_ForwardIterator 33483e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33493e519524SHoward Hinnant{ 3350ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 33513e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 33523e519524SHoward Hinnant} 33533e519524SHoward Hinnant 33543e519524SHoward Hinnant// partition_copy 33553e519524SHoward Hinnant 33563e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 33573e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 33583e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 33593e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 33603e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 33613e519524SHoward Hinnant _Predicate __pred) 33623e519524SHoward Hinnant{ 33633e519524SHoward Hinnant for (; __first != __last; ++__first) 33643e519524SHoward Hinnant { 33653e519524SHoward Hinnant if (__pred(*__first)) 33663e519524SHoward Hinnant { 33673e519524SHoward Hinnant *__out_true = *__first; 33683e519524SHoward Hinnant ++__out_true; 33693e519524SHoward Hinnant } 33703e519524SHoward Hinnant else 33713e519524SHoward Hinnant { 33723e519524SHoward Hinnant *__out_false = *__first; 33733e519524SHoward Hinnant ++__out_false; 33743e519524SHoward Hinnant } 33753e519524SHoward Hinnant } 33763e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 33773e519524SHoward Hinnant} 33783e519524SHoward Hinnant 33793e519524SHoward Hinnant// partition_point 33803e519524SHoward Hinnant 33813e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 33823e519524SHoward Hinnant_ForwardIterator 33833e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 33843e519524SHoward Hinnant{ 33853e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3386ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33873e519524SHoward Hinnant while (__len != 0) 33883e519524SHoward Hinnant { 33893e519524SHoward Hinnant difference_type __l2 = __len / 2; 33903e519524SHoward Hinnant _ForwardIterator __m = __first; 3391ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 33923e519524SHoward Hinnant if (__pred(*__m)) 33933e519524SHoward Hinnant { 33943e519524SHoward Hinnant __first = ++__m; 33953e519524SHoward Hinnant __len -= __l2 + 1; 33963e519524SHoward Hinnant } 33973e519524SHoward Hinnant else 33983e519524SHoward Hinnant __len = __l2; 33993e519524SHoward Hinnant } 34003e519524SHoward Hinnant return __first; 34013e519524SHoward Hinnant} 34023e519524SHoward Hinnant 34033e519524SHoward Hinnant// stable_partition 34043e519524SHoward Hinnant 34053e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 34063e519524SHoward Hinnant_ForwardIterator 34073e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 34083e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 34093e519524SHoward Hinnant{ 34103e519524SHoward Hinnant // *__first is known to be false 34113e519524SHoward Hinnant // __len >= 1 34123e519524SHoward Hinnant if (__len == 1) 34133e519524SHoward Hinnant return __first; 34143e519524SHoward Hinnant if (__len == 2) 34153e519524SHoward Hinnant { 34163e519524SHoward Hinnant _ForwardIterator __m = __first; 34173e519524SHoward Hinnant if (__pred(*++__m)) 34183e519524SHoward Hinnant { 34193e519524SHoward Hinnant swap(*__first, *__m); 34203e519524SHoward Hinnant return __m; 34213e519524SHoward Hinnant } 34223e519524SHoward Hinnant return __first; 34233e519524SHoward Hinnant } 34243e519524SHoward Hinnant if (__len <= __p.second) 34253e519524SHoward Hinnant { // The buffer is big enough to use 34263e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 34273e519524SHoward Hinnant __destruct_n __d(0); 34283e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34293e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34303e519524SHoward Hinnant // Update __first to always point to the end of the trues 34313e519524SHoward Hinnant value_type* __t = __p.first; 3432ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34333e519524SHoward Hinnant __d.__incr((value_type*)0); 34343e519524SHoward Hinnant ++__t; 34353e519524SHoward Hinnant _ForwardIterator __i = __first; 34363e519524SHoward Hinnant while (++__i != __last) 34373e519524SHoward Hinnant { 34383e519524SHoward Hinnant if (__pred(*__i)) 34393e519524SHoward Hinnant { 3440ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34413e519524SHoward Hinnant ++__first; 34423e519524SHoward Hinnant } 34433e519524SHoward Hinnant else 34443e519524SHoward Hinnant { 3445ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34463e519524SHoward Hinnant __d.__incr((value_type*)0); 34473e519524SHoward Hinnant ++__t; 34483e519524SHoward Hinnant } 34493e519524SHoward Hinnant } 34503e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34513e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34523e519524SHoward Hinnant __i = __first; 34533e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3454ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34553e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34563e519524SHoward Hinnant return __first; 34573e519524SHoward Hinnant } 34583e519524SHoward Hinnant // Else not enough buffer, do in place 34593e519524SHoward Hinnant // __len >= 3 34603e519524SHoward Hinnant _ForwardIterator __m = __first; 34613e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3462ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34633e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 34643e519524SHoward Hinnant // F????????????????? 34653e519524SHoward Hinnant // f m l 34663e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34673e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 34683e519524SHoward Hinnant // TTTFFFFF?????????? 34693e519524SHoward Hinnant // f ff m l 34703e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34713e519524SHoward Hinnant _ForwardIterator __m1 = __m; 34723e519524SHoward Hinnant _ForwardIterator __second_false = __last; 34733e519524SHoward Hinnant _Distance __len_half = __len - __len2; 34743e519524SHoward Hinnant while (__pred(*__m1)) 34753e519524SHoward Hinnant { 34763e519524SHoward Hinnant if (++__m1 == __last) 34773e519524SHoward Hinnant goto __second_half_done; 34783e519524SHoward Hinnant --__len_half; 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant // TTTFFFFFTTTF?????? 34813e519524SHoward Hinnant // f ff m m1 l 34823e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 34833e519524SHoward Hinnant__second_half_done: 34843e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34853e519524SHoward Hinnant // f ff m sf l 3486ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34873e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34883e519524SHoward Hinnant // | 34893e519524SHoward Hinnant} 34903e519524SHoward Hinnant 34913e519524SHoward Hinnantstruct __return_temporary_buffer 34923e519524SHoward Hinnant{ 34933e519524SHoward Hinnant template <class _Tp> 3494ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 34953e519524SHoward Hinnant}; 34963e519524SHoward Hinnant 34973e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 34983e519524SHoward Hinnant_ForwardIterator 34993e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 35003e519524SHoward Hinnant forward_iterator_tag) 35013e519524SHoward Hinnant{ 35023e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 35033e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35043e519524SHoward Hinnant while (true) 35053e519524SHoward Hinnant { 35063e519524SHoward Hinnant if (__first == __last) 35073e519524SHoward Hinnant return __first; 35083e519524SHoward Hinnant if (!__pred(*__first)) 35093e519524SHoward Hinnant break; 35103e519524SHoward Hinnant ++__first; 35113e519524SHoward Hinnant } 35123e519524SHoward Hinnant // We now have a reduced range [__first, __last) 35133e519524SHoward Hinnant // *__first is known to be false 35143e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 35153e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3516ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 35173e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35183e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35193e519524SHoward Hinnant if (__len >= __alloc_limit) 35203e519524SHoward Hinnant { 3521ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35223e519524SHoward Hinnant __h.reset(__p.first); 35233e519524SHoward Hinnant } 35243e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35253e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 35263e519524SHoward Hinnant} 35273e519524SHoward Hinnant 35283e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 35293e519524SHoward Hinnant_BidirectionalIterator 35303e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35313e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 35323e519524SHoward Hinnant{ 35333e519524SHoward Hinnant // *__first is known to be false 35343e519524SHoward Hinnant // *__last is known to be true 35353e519524SHoward Hinnant // __len >= 2 35363e519524SHoward Hinnant if (__len == 2) 35373e519524SHoward Hinnant { 35383e519524SHoward Hinnant swap(*__first, *__last); 35393e519524SHoward Hinnant return __last; 35403e519524SHoward Hinnant } 35413e519524SHoward Hinnant if (__len == 3) 35423e519524SHoward Hinnant { 35433e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35443e519524SHoward Hinnant if (__pred(*++__m)) 35453e519524SHoward Hinnant { 35463e519524SHoward Hinnant swap(*__first, *__m); 35473e519524SHoward Hinnant swap(*__m, *__last); 35483e519524SHoward Hinnant return __last; 35493e519524SHoward Hinnant } 35503e519524SHoward Hinnant swap(*__m, *__last); 35513e519524SHoward Hinnant swap(*__first, *__m); 35523e519524SHoward Hinnant return __m; 35533e519524SHoward Hinnant } 35543e519524SHoward Hinnant if (__len <= __p.second) 35553e519524SHoward Hinnant { // The buffer is big enough to use 35563e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35573e519524SHoward Hinnant __destruct_n __d(0); 35583e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 35593e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 35603e519524SHoward Hinnant // Update __first to always point to the end of the trues 35613e519524SHoward Hinnant value_type* __t = __p.first; 3562ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 35633e519524SHoward Hinnant __d.__incr((value_type*)0); 35643e519524SHoward Hinnant ++__t; 35653e519524SHoward Hinnant _BidirectionalIterator __i = __first; 35663e519524SHoward Hinnant while (++__i != __last) 35673e519524SHoward Hinnant { 35683e519524SHoward Hinnant if (__pred(*__i)) 35693e519524SHoward Hinnant { 3570ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35713e519524SHoward Hinnant ++__first; 35723e519524SHoward Hinnant } 35733e519524SHoward Hinnant else 35743e519524SHoward Hinnant { 3575ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 35763e519524SHoward Hinnant __d.__incr((value_type*)0); 35773e519524SHoward Hinnant ++__t; 35783e519524SHoward Hinnant } 35793e519524SHoward Hinnant } 35803e519524SHoward Hinnant // move *__last, known to be true 3581ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 35823e519524SHoward Hinnant __i = ++__first; 35833e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 35843e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 35853e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3586ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 35873e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 35883e519524SHoward Hinnant return __first; 35893e519524SHoward Hinnant } 35903e519524SHoward Hinnant // Else not enough buffer, do in place 35913e519524SHoward Hinnant // __len >= 4 35923e519524SHoward Hinnant _BidirectionalIterator __m = __first; 35933e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3594ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 35953e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 35963e519524SHoward Hinnant // F????????????????T 35973e519524SHoward Hinnant // f m l 35983e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 35993e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 36003e519524SHoward Hinnant _Distance __len_half = __len2; 36013e519524SHoward Hinnant while (!__pred(*--__m1)) 36023e519524SHoward Hinnant { 36033e519524SHoward Hinnant if (__m1 == __first) 36043e519524SHoward Hinnant goto __first_half_done; 36053e519524SHoward Hinnant --__len_half; 36063e519524SHoward Hinnant } 36073e519524SHoward Hinnant // F???TFFF?????????T 36083e519524SHoward Hinnant // f m1 m l 36093e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 36103e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 36113e519524SHoward Hinnant__first_half_done: 36123e519524SHoward Hinnant // TTTFFFFF?????????T 36133e519524SHoward Hinnant // f ff m l 36143e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 36153e519524SHoward Hinnant __m1 = __m; 36163e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 36173e519524SHoward Hinnant ++__second_false; 36183e519524SHoward Hinnant __len_half = __len - __len2; 36193e519524SHoward Hinnant while (__pred(*__m1)) 36203e519524SHoward Hinnant { 36213e519524SHoward Hinnant if (++__m1 == __last) 36223e519524SHoward Hinnant goto __second_half_done; 36233e519524SHoward Hinnant --__len_half; 36243e519524SHoward Hinnant } 36253e519524SHoward Hinnant // TTTFFFFFTTTF?????T 36263e519524SHoward Hinnant // f ff m m1 l 36273e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 36283e519524SHoward Hinnant__second_half_done: 36293e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 36303e519524SHoward Hinnant // f ff m sf l 3631ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 36323e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 36333e519524SHoward Hinnant // | 36343e519524SHoward Hinnant} 36353e519524SHoward Hinnant 36363e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 36373e519524SHoward Hinnant_BidirectionalIterator 36383e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 36393e519524SHoward Hinnant bidirectional_iterator_tag) 36403e519524SHoward Hinnant{ 36413e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 36423e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 36433e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 36443e519524SHoward Hinnant // Either prove all true and return __first or point to first false 36453e519524SHoward Hinnant while (true) 36463e519524SHoward Hinnant { 36473e519524SHoward Hinnant if (__first == __last) 36483e519524SHoward Hinnant return __first; 36493e519524SHoward Hinnant if (!__pred(*__first)) 36503e519524SHoward Hinnant break; 36513e519524SHoward Hinnant ++__first; 36523e519524SHoward Hinnant } 36533e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 36543e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 36553e519524SHoward Hinnant do 36563e519524SHoward Hinnant { 36573e519524SHoward Hinnant if (__first == --__last) 36583e519524SHoward Hinnant return __first; 36593e519524SHoward Hinnant } while (!__pred(*__last)); 36603e519524SHoward Hinnant // We now have a reduced range [__first, __last] 36613e519524SHoward Hinnant // *__first is known to be false 36623e519524SHoward Hinnant // *__last is known to be true 36633e519524SHoward Hinnant // __len >= 2 3664ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 36653e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 36663e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 36673e519524SHoward Hinnant if (__len >= __alloc_limit) 36683e519524SHoward Hinnant { 3669ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 36703e519524SHoward Hinnant __h.reset(__p.first); 36713e519524SHoward Hinnant } 36723e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36733e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 36743e519524SHoward Hinnant} 36753e519524SHoward Hinnant 36763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 36773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36783e519524SHoward Hinnant_ForwardIterator 36793e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 36803e519524SHoward Hinnant{ 36813e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 36823e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 36833e519524SHoward Hinnant} 36843e519524SHoward Hinnant 36853e519524SHoward Hinnant// is_sorted_until 36863e519524SHoward Hinnant 36873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36883e519524SHoward Hinnant_ForwardIterator 36893e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36903e519524SHoward Hinnant{ 36913e519524SHoward Hinnant if (__first != __last) 36923e519524SHoward Hinnant { 36933e519524SHoward Hinnant _ForwardIterator __i = __first; 36943e519524SHoward Hinnant while (++__i != __last) 36953e519524SHoward Hinnant { 36963e519524SHoward Hinnant if (__comp(*__i, *__first)) 36973e519524SHoward Hinnant return __i; 36983e519524SHoward Hinnant __first = __i; 36993e519524SHoward Hinnant } 37003e519524SHoward Hinnant } 37013e519524SHoward Hinnant return __last; 37023e519524SHoward Hinnant} 37033e519524SHoward Hinnant 37043e519524SHoward Hinnanttemplate<class _ForwardIterator> 37053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37063e519524SHoward Hinnant_ForwardIterator 37073e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 37083e519524SHoward Hinnant{ 3709ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37103e519524SHoward Hinnant} 37113e519524SHoward Hinnant 37123e519524SHoward Hinnant// is_sorted 37133e519524SHoward Hinnant 37143e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 37153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37163e519524SHoward Hinnantbool 37173e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 37183e519524SHoward Hinnant{ 3719ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 37203e519524SHoward Hinnant} 37213e519524SHoward Hinnant 37223e519524SHoward Hinnanttemplate<class _ForwardIterator> 37233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 37243e519524SHoward Hinnantbool 37253e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 37263e519524SHoward Hinnant{ 3727ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 37283e519524SHoward Hinnant} 37293e519524SHoward Hinnant 37303e519524SHoward Hinnant// sort 37313e519524SHoward Hinnant 37323e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 37333e519524SHoward Hinnant 37343e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37353e519524SHoward Hinnantunsigned 37363e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 37373e519524SHoward Hinnant{ 37383e519524SHoward Hinnant unsigned __r = 0; 37393e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 37403e519524SHoward Hinnant { 37413e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 37423e519524SHoward Hinnant return __r; // x <= y && y <= z 37433e519524SHoward Hinnant // x <= y && y > z 37443e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 37453e519524SHoward Hinnant __r = 1; 37463e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 37473e519524SHoward Hinnant { 37483e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 37493e519524SHoward Hinnant __r = 2; 37503e519524SHoward Hinnant } 37513e519524SHoward Hinnant return __r; // x <= y && y < z 37523e519524SHoward Hinnant } 37533e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 37543e519524SHoward Hinnant { 37553e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 37563e519524SHoward Hinnant __r = 1; 37573e519524SHoward Hinnant return __r; 37583e519524SHoward Hinnant } 37593e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 37603e519524SHoward Hinnant __r = 1; // x < y && x <= z 37613e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 37623e519524SHoward Hinnant { 37633e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 37643e519524SHoward Hinnant __r = 2; 37653e519524SHoward Hinnant } 37663e519524SHoward Hinnant return __r; 37673e519524SHoward Hinnant} // x <= y && y <= z 37683e519524SHoward Hinnant 37693e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 37703e519524SHoward Hinnant 37713e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37723e519524SHoward Hinnantunsigned 37733e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 37743e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 37753e519524SHoward Hinnant{ 37763e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 37773e519524SHoward Hinnant if (__c(*__x4, *__x3)) 37783e519524SHoward Hinnant { 37793e519524SHoward Hinnant swap(*__x3, *__x4); 37803e519524SHoward Hinnant ++__r; 37813e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37823e519524SHoward Hinnant { 37833e519524SHoward Hinnant swap(*__x2, *__x3); 37843e519524SHoward Hinnant ++__r; 37853e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37863e519524SHoward Hinnant { 37873e519524SHoward Hinnant swap(*__x1, *__x2); 37883e519524SHoward Hinnant ++__r; 37893e519524SHoward Hinnant } 37903e519524SHoward Hinnant } 37913e519524SHoward Hinnant } 37923e519524SHoward Hinnant return __r; 37933e519524SHoward Hinnant} 37943e519524SHoward Hinnant 37953e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 37963e519524SHoward Hinnant 37973e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 37983e519524SHoward Hinnantunsigned 37993e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 38003e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 38013e519524SHoward Hinnant{ 38023e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 38033e519524SHoward Hinnant if (__c(*__x5, *__x4)) 38043e519524SHoward Hinnant { 38053e519524SHoward Hinnant swap(*__x4, *__x5); 38063e519524SHoward Hinnant ++__r; 38073e519524SHoward Hinnant if (__c(*__x4, *__x3)) 38083e519524SHoward Hinnant { 38093e519524SHoward Hinnant swap(*__x3, *__x4); 38103e519524SHoward Hinnant ++__r; 38113e519524SHoward Hinnant if (__c(*__x3, *__x2)) 38123e519524SHoward Hinnant { 38133e519524SHoward Hinnant swap(*__x2, *__x3); 38143e519524SHoward Hinnant ++__r; 38153e519524SHoward Hinnant if (__c(*__x2, *__x1)) 38163e519524SHoward Hinnant { 38173e519524SHoward Hinnant swap(*__x1, *__x2); 38183e519524SHoward Hinnant ++__r; 38193e519524SHoward Hinnant } 38203e519524SHoward Hinnant } 38213e519524SHoward Hinnant } 38223e519524SHoward Hinnant } 38233e519524SHoward Hinnant return __r; 38243e519524SHoward Hinnant} 38253e519524SHoward Hinnant 38263e519524SHoward Hinnant// Assumes size > 0 38273e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38283e519524SHoward Hinnantvoid 38293e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38303e519524SHoward Hinnant{ 38313e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 38323e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 38333e519524SHoward Hinnant { 3834ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 38353e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 38363e519524SHoward Hinnant (__first, __last, __comp); 38373e519524SHoward Hinnant if (__i != __first) 38383e519524SHoward Hinnant swap(*__first, *__i); 38393e519524SHoward Hinnant } 38403e519524SHoward Hinnant} 38413e519524SHoward Hinnant 38423e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38433e519524SHoward Hinnantvoid 38443e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 38453e519524SHoward Hinnant{ 38463e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38473e519524SHoward Hinnant if (__first != __last) 38483e519524SHoward Hinnant { 38493e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 38503e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 38513e519524SHoward Hinnant { 38523e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3853ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 38543e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3855ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3856ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38573e519524SHoward Hinnant } 38583e519524SHoward Hinnant } 38593e519524SHoward Hinnant} 38603e519524SHoward Hinnant 38613e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38623e519524SHoward Hinnantvoid 38633e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38643e519524SHoward Hinnant{ 38653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38663e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38673e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38683e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38693e519524SHoward Hinnant { 38703e519524SHoward Hinnant if (__comp(*__i, *__j)) 38713e519524SHoward Hinnant { 3872ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38733e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38743e519524SHoward Hinnant __j = __i; 38753e519524SHoward Hinnant do 38763e519524SHoward Hinnant { 3877ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38783e519524SHoward Hinnant __j = __k; 38793e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3880ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38813e519524SHoward Hinnant } 38823e519524SHoward Hinnant __j = __i; 38833e519524SHoward Hinnant } 38843e519524SHoward Hinnant} 38853e519524SHoward Hinnant 38863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38873e519524SHoward Hinnantbool 38883e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38893e519524SHoward Hinnant{ 38903e519524SHoward Hinnant switch (__last - __first) 38913e519524SHoward Hinnant { 38923e519524SHoward Hinnant case 0: 38933e519524SHoward Hinnant case 1: 38943e519524SHoward Hinnant return true; 38953e519524SHoward Hinnant case 2: 38963e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38973e519524SHoward Hinnant swap(*__first, *__last); 38983e519524SHoward Hinnant return true; 38993e519524SHoward Hinnant case 3: 3900ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39013e519524SHoward Hinnant return true; 39023e519524SHoward Hinnant case 4: 3903ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39043e519524SHoward Hinnant return true; 39053e519524SHoward Hinnant case 5: 3906ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 39073e519524SHoward Hinnant return true; 39083e519524SHoward Hinnant } 39093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 39103e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 39113e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 39123e519524SHoward Hinnant const unsigned __limit = 8; 39133e519524SHoward Hinnant unsigned __count = 0; 39143e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 39153e519524SHoward Hinnant { 39163e519524SHoward Hinnant if (__comp(*__i, *__j)) 39173e519524SHoward Hinnant { 3918ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 39193e519524SHoward Hinnant _RandomAccessIterator __k = __j; 39203e519524SHoward Hinnant __j = __i; 39213e519524SHoward Hinnant do 39223e519524SHoward Hinnant { 3923ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 39243e519524SHoward Hinnant __j = __k; 39253e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3926ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 39273e519524SHoward Hinnant if (++__count == __limit) 39283e519524SHoward Hinnant return ++__i == __last; 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant __j = __i; 39313e519524SHoward Hinnant } 39323e519524SHoward Hinnant return true; 39333e519524SHoward Hinnant} 39343e519524SHoward Hinnant 39353e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 39363e519524SHoward Hinnantvoid 39373e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 39383e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 39393e519524SHoward Hinnant{ 39403e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 39413e519524SHoward Hinnant if (__first1 != __last1) 39423e519524SHoward Hinnant { 39433e519524SHoward Hinnant __destruct_n __d(0); 39443e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 39453e519524SHoward Hinnant value_type* __last2 = __first2; 3946ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 39473e519524SHoward Hinnant __d.__incr((value_type*)0); 39483e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 39493e519524SHoward Hinnant { 39503e519524SHoward Hinnant value_type* __j2 = __last2; 39513e519524SHoward Hinnant value_type* __i2 = __j2; 39523e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 39533e519524SHoward Hinnant { 3954ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 39553e519524SHoward Hinnant __d.__incr((value_type*)0); 39563e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3957ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3958ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 39593e519524SHoward Hinnant } 39603e519524SHoward Hinnant else 39613e519524SHoward Hinnant { 3962ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 39633e519524SHoward Hinnant __d.__incr((value_type*)0); 39643e519524SHoward Hinnant } 39653e519524SHoward Hinnant } 39663e519524SHoward Hinnant __h.release(); 39673e519524SHoward Hinnant } 39683e519524SHoward Hinnant} 39693e519524SHoward Hinnant 39703e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 39713e519524SHoward Hinnantvoid 39723e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 39733e519524SHoward Hinnant{ 39743e519524SHoward Hinnant // _Compare is known to be a reference type 39753e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 39763e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3977ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3978ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 39793e519524SHoward Hinnant while (true) 39803e519524SHoward Hinnant { 39813e519524SHoward Hinnant __restart: 39823e519524SHoward Hinnant difference_type __len = __last - __first; 39833e519524SHoward Hinnant switch (__len) 39843e519524SHoward Hinnant { 39853e519524SHoward Hinnant case 0: 39863e519524SHoward Hinnant case 1: 39873e519524SHoward Hinnant return; 39883e519524SHoward Hinnant case 2: 39893e519524SHoward Hinnant if (__comp(*--__last, *__first)) 39903e519524SHoward Hinnant swap(*__first, *__last); 39913e519524SHoward Hinnant return; 39923e519524SHoward Hinnant case 3: 3993ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 39943e519524SHoward Hinnant return; 39953e519524SHoward Hinnant case 4: 3996ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 39973e519524SHoward Hinnant return; 39983e519524SHoward Hinnant case 5: 3999ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 40003e519524SHoward Hinnant return; 40013e519524SHoward Hinnant } 40023e519524SHoward Hinnant if (__len <= __limit) 40033e519524SHoward Hinnant { 4004ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 40053e519524SHoward Hinnant return; 40063e519524SHoward Hinnant } 40073e519524SHoward Hinnant // __len > 5 40083e519524SHoward Hinnant _RandomAccessIterator __m = __first; 40093e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 40103e519524SHoward Hinnant --__lm1; 40113e519524SHoward Hinnant unsigned __n_swaps; 40123e519524SHoward Hinnant { 40133e519524SHoward Hinnant difference_type __delta; 40143e519524SHoward Hinnant if (__len >= 1000) 40153e519524SHoward Hinnant { 40163e519524SHoward Hinnant __delta = __len/2; 40173e519524SHoward Hinnant __m += __delta; 40183e519524SHoward Hinnant __delta /= 2; 4019ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 40203e519524SHoward Hinnant } 40213e519524SHoward Hinnant else 40223e519524SHoward Hinnant { 40233e519524SHoward Hinnant __delta = __len/2; 40243e519524SHoward Hinnant __m += __delta; 4025ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 40263e519524SHoward Hinnant } 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant // *__m is median 40293e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 40303e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 40313e519524SHoward Hinnant _RandomAccessIterator __i = __first; 40323e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 40333e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40343e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 40353e519524SHoward Hinnant // Prime the downward search with a guard. 40363e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 40373e519524SHoward Hinnant { 40383e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 40393e519524SHoward Hinnant // manually guard downward moving __j against __i 40403e519524SHoward Hinnant while (true) 40413e519524SHoward Hinnant { 40423e519524SHoward Hinnant if (__i == --__j) 40433e519524SHoward Hinnant { 40443e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 40453e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 40463e519524SHoward Hinnant ++__i; // __first + 1 40473e519524SHoward Hinnant __j = __last; 40483e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 40493e519524SHoward Hinnant { 40503e519524SHoward Hinnant while (true) 40513e519524SHoward Hinnant { 40523e519524SHoward Hinnant if (__i == __j) 40533e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 40543e519524SHoward Hinnant if (__comp(*__first, *__i)) 40553e519524SHoward Hinnant { 40563e519524SHoward Hinnant swap(*__i, *__j); 40573e519524SHoward Hinnant ++__n_swaps; 40583e519524SHoward Hinnant ++__i; 40593e519524SHoward Hinnant break; 40603e519524SHoward Hinnant } 40613e519524SHoward Hinnant ++__i; 40623e519524SHoward Hinnant } 40633e519524SHoward Hinnant } 40643e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 40653e519524SHoward Hinnant if (__i == __j) 40663e519524SHoward Hinnant return; 40673e519524SHoward Hinnant while (true) 40683e519524SHoward Hinnant { 40693e519524SHoward Hinnant while (!__comp(*__first, *__i)) 40703e519524SHoward Hinnant ++__i; 40713e519524SHoward Hinnant while (__comp(*__first, *--__j)) 40723e519524SHoward Hinnant ; 40733e519524SHoward Hinnant if (__i >= __j) 40743e519524SHoward Hinnant break; 40753e519524SHoward Hinnant swap(*__i, *__j); 40763e519524SHoward Hinnant ++__n_swaps; 40773e519524SHoward Hinnant ++__i; 40783e519524SHoward Hinnant } 40793e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 40803e519524SHoward Hinnant // The first part is sorted, sort the secod part 4081ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 40823e519524SHoward Hinnant __first = __i; 40833e519524SHoward Hinnant goto __restart; 40843e519524SHoward Hinnant } 40853e519524SHoward Hinnant if (__comp(*__j, *__m)) 40863e519524SHoward Hinnant { 40873e519524SHoward Hinnant swap(*__i, *__j); 40883e519524SHoward Hinnant ++__n_swaps; 40893e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 40903e519524SHoward Hinnant } 40913e519524SHoward Hinnant } 40923e519524SHoward Hinnant } 40933e519524SHoward Hinnant // It is known that *__i < *__m 40943e519524SHoward Hinnant ++__i; 40953e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 40963e519524SHoward Hinnant // if not yet partitioned... 40973e519524SHoward Hinnant if (__i < __j) 40983e519524SHoward Hinnant { 40993e519524SHoward Hinnant // known that *(__i - 1) < *__m 41003e519524SHoward Hinnant // known that __i <= __m 41013e519524SHoward Hinnant while (true) 41023e519524SHoward Hinnant { 41033e519524SHoward Hinnant // __m still guards upward moving __i 41043e519524SHoward Hinnant while (__comp(*__i, *__m)) 41053e519524SHoward Hinnant ++__i; 41063e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 41073e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 41083e519524SHoward Hinnant ; 41093e519524SHoward Hinnant if (__i > __j) 41103e519524SHoward Hinnant break; 41113e519524SHoward Hinnant swap(*__i, *__j); 41123e519524SHoward Hinnant ++__n_swaps; 41133e519524SHoward Hinnant // It is known that __m != __j 41143e519524SHoward Hinnant // If __m just moved, follow it 41153e519524SHoward Hinnant if (__m == __i) 41163e519524SHoward Hinnant __m = __j; 41173e519524SHoward Hinnant ++__i; 41183e519524SHoward Hinnant } 41193e519524SHoward Hinnant } 41203e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 41213e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 41223e519524SHoward Hinnant { 41233e519524SHoward Hinnant swap(*__i, *__m); 41243e519524SHoward Hinnant ++__n_swaps; 41253e519524SHoward Hinnant } 41263e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 41273e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 41283e519524SHoward Hinnant if (__n_swaps == 0) 41293e519524SHoward Hinnant { 4130ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4131ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 41323e519524SHoward Hinnant { 41333e519524SHoward Hinnant if (__fs) 41343e519524SHoward Hinnant return; 41353e519524SHoward Hinnant __last = __i; 41363e519524SHoward Hinnant continue; 41373e519524SHoward Hinnant } 41383e519524SHoward Hinnant else 41393e519524SHoward Hinnant { 41403e519524SHoward Hinnant if (__fs) 41413e519524SHoward Hinnant { 41423e519524SHoward Hinnant __first = ++__i; 41433e519524SHoward Hinnant continue; 41443e519524SHoward Hinnant } 41453e519524SHoward Hinnant } 41463e519524SHoward Hinnant } 41473e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 41483e519524SHoward Hinnant if (__i - __first < __last - __i) 41493e519524SHoward Hinnant { 4150ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4151ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 41523e519524SHoward Hinnant __first = ++__i; 41533e519524SHoward Hinnant } 41543e519524SHoward Hinnant else 41553e519524SHoward Hinnant { 4156ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4157ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 41583e519524SHoward Hinnant __last = __i; 41593e519524SHoward Hinnant } 41603e519524SHoward Hinnant } 41613e519524SHoward Hinnant} 41623e519524SHoward Hinnant 41633e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 41643e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 41653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41663e519524SHoward Hinnantvoid 41673e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 41683e519524SHoward Hinnant{ 4169145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 41723e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4173145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 41753e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4176145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41773e519524SHoward Hinnant} 41783e519524SHoward Hinnant 41793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 41803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41813e519524SHoward Hinnantvoid 41823e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 41833e519524SHoward Hinnant{ 4184ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 41853e519524SHoward Hinnant} 41863e519524SHoward Hinnant 41873e519524SHoward Hinnanttemplate <class _Tp> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnantvoid 41903e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 41913e519524SHoward Hinnant{ 4192ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 41933e519524SHoward Hinnant} 41943e519524SHoward Hinnant 41953e519524SHoward Hinnanttemplate <class _Tp> 41963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41973e519524SHoward Hinnantvoid 41983e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 41993e519524SHoward Hinnant{ 4200ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 42013e519524SHoward Hinnant} 42023e519524SHoward Hinnant 4203f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4204f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4205f554add5SHoward Hinnantvoid 4206f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4207f554add5SHoward Hinnant{ 4208f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4209f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4210f554add5SHoward Hinnant} 4211f554add5SHoward Hinnant 42120be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4213e4383379SHoward Hinnant#pragma warning( push ) 4214e4383379SHoward Hinnant#pragma warning( disable: 4231) 42150be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4216f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4217f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4218f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4219f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4220f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4221f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4222f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4223f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4224f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4225f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4226f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4227f0544c20SHoward 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>&)) 4228f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4229f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4230f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42313e519524SHoward Hinnant 4232f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4233f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4234f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4235f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4236f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4237f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4238f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4239f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4240f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4241f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4242f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4243f0544c20SHoward 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>&)) 4244f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4245f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4246f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 42473e519524SHoward Hinnant 4248f0544c20SHoward 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>&)) 42490be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4250e4383379SHoward Hinnant#pragma warning( pop ) 42510be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 42523e519524SHoward Hinnant 42533e519524SHoward Hinnant// lower_bound 42543e519524SHoward Hinnant 42553e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42563e519524SHoward Hinnant_ForwardIterator 4257e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42583e519524SHoward Hinnant{ 42593e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4260ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42613e519524SHoward Hinnant while (__len != 0) 42623e519524SHoward Hinnant { 42633e519524SHoward Hinnant difference_type __l2 = __len / 2; 42643e519524SHoward Hinnant _ForwardIterator __m = __first; 4265ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4266e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42673e519524SHoward Hinnant { 42683e519524SHoward Hinnant __first = ++__m; 42693e519524SHoward Hinnant __len -= __l2 + 1; 42703e519524SHoward Hinnant } 42713e519524SHoward Hinnant else 42723e519524SHoward Hinnant __len = __l2; 42733e519524SHoward Hinnant } 42743e519524SHoward Hinnant return __first; 42753e519524SHoward Hinnant} 42763e519524SHoward Hinnant 42773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42793e519524SHoward Hinnant_ForwardIterator 4280e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42813e519524SHoward Hinnant{ 4282145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4285e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4286145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4288e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4289145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42903e519524SHoward Hinnant} 42913e519524SHoward Hinnant 42923e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42943e519524SHoward Hinnant_ForwardIterator 4295e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42963e519524SHoward Hinnant{ 4297e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 42983e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42993e519524SHoward Hinnant} 43003e519524SHoward Hinnant 43013e519524SHoward Hinnant// upper_bound 43023e519524SHoward Hinnant 43033e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43043e519524SHoward Hinnant_ForwardIterator 4305e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43063e519524SHoward Hinnant{ 43073e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4308ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43093e519524SHoward Hinnant while (__len != 0) 43103e519524SHoward Hinnant { 43113e519524SHoward Hinnant difference_type __l2 = __len / 2; 43123e519524SHoward Hinnant _ForwardIterator __m = __first; 4313ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4314e4383379SHoward Hinnant if (__comp(__value_, *__m)) 43153e519524SHoward Hinnant __len = __l2; 43163e519524SHoward Hinnant else 43173e519524SHoward Hinnant { 43183e519524SHoward Hinnant __first = ++__m; 43193e519524SHoward Hinnant __len -= __l2 + 1; 43203e519524SHoward Hinnant } 43213e519524SHoward Hinnant } 43223e519524SHoward Hinnant return __first; 43233e519524SHoward Hinnant} 43243e519524SHoward Hinnant 43253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43273e519524SHoward Hinnant_ForwardIterator 4328e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43293e519524SHoward Hinnant{ 4330145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4333e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4334145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4336e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4337145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43383e519524SHoward Hinnant} 43393e519524SHoward Hinnant 43403e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43423e519524SHoward Hinnant_ForwardIterator 4343e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43443e519524SHoward Hinnant{ 4345e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 43463e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 43473e519524SHoward Hinnant} 43483e519524SHoward Hinnant 43493e519524SHoward Hinnant// equal_range 43503e519524SHoward Hinnant 43513e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43523e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4353e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43543e519524SHoward Hinnant{ 43553e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4356ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 43573e519524SHoward Hinnant while (__len != 0) 43583e519524SHoward Hinnant { 43593e519524SHoward Hinnant difference_type __l2 = __len / 2; 43603e519524SHoward Hinnant _ForwardIterator __m = __first; 4361ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4362e4383379SHoward Hinnant if (__comp(*__m, __value_)) 43633e519524SHoward Hinnant { 43643e519524SHoward Hinnant __first = ++__m; 43653e519524SHoward Hinnant __len -= __l2 + 1; 43663e519524SHoward Hinnant } 4367e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 43683e519524SHoward Hinnant { 43693e519524SHoward Hinnant __last = __m; 43703e519524SHoward Hinnant __len = __l2; 43713e519524SHoward Hinnant } 43723e519524SHoward Hinnant else 43733e519524SHoward Hinnant { 43743e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 43753e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 43763e519524SHoward Hinnant ( 4377e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4378e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 43793e519524SHoward Hinnant ); 43803e519524SHoward Hinnant } 43813e519524SHoward Hinnant } 43823e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 43833e519524SHoward Hinnant} 43843e519524SHoward Hinnant 43853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43873e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4388e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43893e519524SHoward Hinnant{ 4390145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43913e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43923e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4393e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4394145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43953e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4396e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4397145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43983e519524SHoward Hinnant} 43993e519524SHoward Hinnant 44003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44023e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4403e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44043e519524SHoward Hinnant{ 4405e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 44063e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44073e519524SHoward Hinnant} 44083e519524SHoward Hinnant 44093e519524SHoward Hinnant// binary_search 44103e519524SHoward Hinnant 44113e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 44123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44133e519524SHoward Hinnantbool 4414e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44153e519524SHoward Hinnant{ 4416e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4417e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 44183e519524SHoward Hinnant} 44193e519524SHoward Hinnant 44203e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 44213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44223e519524SHoward Hinnantbool 4423e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 44243e519524SHoward Hinnant{ 4425145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44263e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44273e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4428e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4429145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4431e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4432145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44333e519524SHoward Hinnant} 44343e519524SHoward Hinnant 44353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 44363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44373e519524SHoward Hinnantbool 4438e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 44393e519524SHoward Hinnant{ 4440e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 44413e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 44423e519524SHoward Hinnant} 44433e519524SHoward Hinnant 44443e519524SHoward Hinnant// merge 44453e519524SHoward Hinnant 44463e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 44473e519524SHoward Hinnant_OutputIterator 44483e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 44493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44503e519524SHoward Hinnant{ 44513e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 44523e519524SHoward Hinnant { 44533e519524SHoward Hinnant if (__first2 == __last2) 4454ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 44553e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 44563e519524SHoward Hinnant { 44573e519524SHoward Hinnant *__result = *__first2; 44583e519524SHoward Hinnant ++__first2; 44593e519524SHoward Hinnant } 44603e519524SHoward Hinnant else 44613e519524SHoward Hinnant { 44623e519524SHoward Hinnant *__result = *__first1; 44633e519524SHoward Hinnant ++__first1; 44643e519524SHoward Hinnant } 44653e519524SHoward Hinnant } 4466ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 44673e519524SHoward Hinnant} 44683e519524SHoward Hinnant 44693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 44703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44713e519524SHoward Hinnant_OutputIterator 44723e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44733e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 44743e519524SHoward Hinnant{ 4475145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 44763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 44773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4478ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4479145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 44803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4481ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4482145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 44833e519524SHoward Hinnant} 44843e519524SHoward Hinnant 44853e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 44863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44873e519524SHoward Hinnant_OutputIterator 44883e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 44893e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 44903e519524SHoward Hinnant{ 44913e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 44923e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 44933e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 44943e519524SHoward Hinnant} 44953e519524SHoward Hinnant 44963e519524SHoward Hinnant// inplace_merge 44973e519524SHoward Hinnant 4498adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4499adfdae18SMarshall Clow class _OutputIterator> 4500adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4501adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4502adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4503adfdae18SMarshall Clow{ 4504adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4505adfdae18SMarshall Clow { 4506adfdae18SMarshall Clow if (__first2 == __last2) 4507adfdae18SMarshall Clow { 4508adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4509adfdae18SMarshall Clow return; 4510adfdae18SMarshall Clow } 4511adfdae18SMarshall Clow 4512adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4513adfdae18SMarshall Clow { 4514adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4515adfdae18SMarshall Clow ++__first2; 4516adfdae18SMarshall Clow } 4517adfdae18SMarshall Clow else 4518adfdae18SMarshall Clow { 4519adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4520adfdae18SMarshall Clow ++__first1; 4521adfdae18SMarshall Clow } 4522adfdae18SMarshall Clow } 4523adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4524adfdae18SMarshall Clow} 4525adfdae18SMarshall Clow 45263e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45273e519524SHoward Hinnantvoid 45283e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45293e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45303e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45313e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 45323e519524SHoward Hinnant{ 45333e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45343e519524SHoward Hinnant __destruct_n __d(0); 45353e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 45363e519524SHoward Hinnant if (__len1 <= __len2) 45373e519524SHoward Hinnant { 45383e519524SHoward Hinnant value_type* __p = __buff; 4539910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4540ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4541adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 45423e519524SHoward Hinnant } 45433e519524SHoward Hinnant else 45443e519524SHoward Hinnant { 45453e519524SHoward Hinnant value_type* __p = __buff; 4546910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4547ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 45483e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 45493e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4550adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4551adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 45523e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 45533e519524SHoward Hinnant } 45543e519524SHoward Hinnant} 45553e519524SHoward Hinnant 45563e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 45573e519524SHoward Hinnantvoid 45583e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45593e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 45603e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 45613e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 45623e519524SHoward Hinnant{ 45633e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 45643e519524SHoward Hinnant while (true) 45653e519524SHoward Hinnant { 45663e519524SHoward Hinnant // if __middle == __last, we're done 45673e519524SHoward Hinnant if (__len2 == 0) 45683e519524SHoward Hinnant return; 4569526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4570526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4571526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 45723e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4573910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 45743e519524SHoward Hinnant { 45753e519524SHoward Hinnant if (__len1 == 0) 45763e519524SHoward Hinnant return; 45773e519524SHoward Hinnant if (__comp(*__middle, *__first)) 45783e519524SHoward Hinnant break; 45793e519524SHoward Hinnant } 45803e519524SHoward Hinnant // __first < __middle < __last 45813e519524SHoward Hinnant // *__first > *__middle 45823e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 45833e519524SHoward Hinnant // all elements in: 45843e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 45853e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 45863e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 45873e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 45883e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 45893e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 45903e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 45913e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 45923e519524SHoward Hinnant // binary search smaller range 45933e519524SHoward Hinnant if (__len1 < __len2) 45943e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 45953e519524SHoward Hinnant __len21 = __len2 / 2; 45963e519524SHoward Hinnant __m2 = __middle; 4597ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 45983e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4599ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant else 46023e519524SHoward Hinnant { 46033e519524SHoward Hinnant if (__len1 == 1) 46043e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 46053e519524SHoward Hinnant // It is known *__first > *__middle 46063e519524SHoward Hinnant swap(*__first, *__middle); 46073e519524SHoward Hinnant return; 46083e519524SHoward Hinnant } 46093e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 46103e519524SHoward Hinnant __len11 = __len1 / 2; 46113e519524SHoward Hinnant __m1 = __first; 4612ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 46133e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4614ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 46153e519524SHoward Hinnant } 46163e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 46173e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 46183e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 46193e519524SHoward Hinnant // swap middle two partitions 4620ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 46213e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 46223e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 46233e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 46243e519524SHoward Hinnant { 46253e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46263e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46273e519524SHoward Hinnant __first = __middle; 46283e519524SHoward Hinnant __middle = __m2; 46293e519524SHoward Hinnant __len1 = __len12; 46303e519524SHoward Hinnant __len2 = __len22; 46313e519524SHoward Hinnant } 46323e519524SHoward Hinnant else 46333e519524SHoward Hinnant { 46343e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 46353e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 46363e519524SHoward Hinnant __last = __middle; 46373e519524SHoward Hinnant __middle = __m1; 46383e519524SHoward Hinnant __len1 = __len11; 46393e519524SHoward Hinnant __len2 = __len21; 46403e519524SHoward Hinnant } 46413e519524SHoward Hinnant } 46423e519524SHoward Hinnant} 46433e519524SHoward Hinnant 46443e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 46453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46463e519524SHoward Hinnantvoid 46473e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 46483e519524SHoward Hinnant _Compare __comp) 46493e519524SHoward Hinnant{ 46503e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 46513e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4652ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4653ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4654ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 46550b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 46560b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 46570b48cf9aSMarshall Clow 4658145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 46593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 46603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4661ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 46623e519524SHoward Hinnant __buf.first, __buf.second); 4663145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 46643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4665ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 46663e519524SHoward Hinnant __buf.first, __buf.second); 4667145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 46683e519524SHoward Hinnant} 46693e519524SHoward Hinnant 46703e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 46713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 46723e519524SHoward Hinnantvoid 46733e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 46743e519524SHoward Hinnant{ 4675ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 46763e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 46773e519524SHoward Hinnant} 46783e519524SHoward Hinnant 46793e519524SHoward Hinnant// stable_sort 46803e519524SHoward Hinnant 46813e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 46823e519524SHoward Hinnantvoid 46833e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 46843e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46853e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 46863e519524SHoward Hinnant{ 46873e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 46883e519524SHoward Hinnant __destruct_n __d(0); 46893e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 46903e519524SHoward Hinnant for (; true; ++__result) 46913e519524SHoward Hinnant { 46923e519524SHoward Hinnant if (__first1 == __last1) 46933e519524SHoward Hinnant { 46943e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4695ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 46963e519524SHoward Hinnant __h.release(); 46973e519524SHoward Hinnant return; 46983e519524SHoward Hinnant } 46993e519524SHoward Hinnant if (__first2 == __last2) 47003e519524SHoward Hinnant { 47013e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4702ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47033e519524SHoward Hinnant __h.release(); 47043e519524SHoward Hinnant return; 47053e519524SHoward Hinnant } 47063e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47073e519524SHoward Hinnant { 4708ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 47093e519524SHoward Hinnant __d.__incr((value_type*)0); 47103e519524SHoward Hinnant ++__first2; 47113e519524SHoward Hinnant } 47123e519524SHoward Hinnant else 47133e519524SHoward Hinnant { 4714ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 47153e519524SHoward Hinnant __d.__incr((value_type*)0); 47163e519524SHoward Hinnant ++__first1; 47173e519524SHoward Hinnant } 47183e519524SHoward Hinnant } 47193e519524SHoward Hinnant} 47203e519524SHoward Hinnant 47213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 47223e519524SHoward Hinnantvoid 47233e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 47243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 47253e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 47263e519524SHoward Hinnant{ 47273e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 47283e519524SHoward Hinnant { 47293e519524SHoward Hinnant if (__first2 == __last2) 47303e519524SHoward Hinnant { 47313e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4732ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47333e519524SHoward Hinnant return; 47343e519524SHoward Hinnant } 47353e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 47363e519524SHoward Hinnant { 4737ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47383e519524SHoward Hinnant ++__first2; 47393e519524SHoward Hinnant } 47403e519524SHoward Hinnant else 47413e519524SHoward Hinnant { 4742ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 47433e519524SHoward Hinnant ++__first1; 47443e519524SHoward Hinnant } 47453e519524SHoward Hinnant } 47463e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4747ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 47483e519524SHoward Hinnant} 47493e519524SHoward Hinnant 47503e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47513e519524SHoward Hinnantvoid 47523e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47533e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47543e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 47553e519524SHoward Hinnant 47563e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47573e519524SHoward Hinnantvoid 47583e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 47593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47603e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 47613e519524SHoward Hinnant{ 47623e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47633e519524SHoward Hinnant switch (__len) 47643e519524SHoward Hinnant { 47653e519524SHoward Hinnant case 0: 47663e519524SHoward Hinnant return; 47673e519524SHoward Hinnant case 1: 4768ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47693e519524SHoward Hinnant return; 47703e519524SHoward Hinnant case 2: 47713e519524SHoward Hinnant __destruct_n __d(0); 47723e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 47733e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 47743e519524SHoward Hinnant { 4775ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47763e519524SHoward Hinnant __d.__incr((value_type*)0); 47773e519524SHoward Hinnant ++__first2; 4778ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47793e519524SHoward Hinnant } 47803e519524SHoward Hinnant else 47813e519524SHoward Hinnant { 4782ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 47833e519524SHoward Hinnant __d.__incr((value_type*)0); 47843e519524SHoward Hinnant ++__first2; 4785ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 47863e519524SHoward Hinnant } 47873e519524SHoward Hinnant __h2.release(); 47883e519524SHoward Hinnant return; 47893e519524SHoward Hinnant } 47903e519524SHoward Hinnant if (__len <= 8) 47913e519524SHoward Hinnant { 47923e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 47933e519524SHoward Hinnant return; 47943e519524SHoward Hinnant } 47953e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47963e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 47973e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 47983e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 47993e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 48003e519524SHoward Hinnant} 48013e519524SHoward Hinnant 48023e519524SHoward Hinnanttemplate <class _Tp> 48033e519524SHoward Hinnantstruct __stable_sort_switch 48043e519524SHoward Hinnant{ 4805ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 48063e519524SHoward Hinnant}; 48073e519524SHoward Hinnant 48083e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48093e519524SHoward Hinnantvoid 48103e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48113e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 48133e519524SHoward Hinnant{ 48143e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48163e519524SHoward Hinnant switch (__len) 48173e519524SHoward Hinnant { 48183e519524SHoward Hinnant case 0: 48193e519524SHoward Hinnant case 1: 48203e519524SHoward Hinnant return; 48213e519524SHoward Hinnant case 2: 48223e519524SHoward Hinnant if (__comp(*--__last, *__first)) 48233e519524SHoward Hinnant swap(*__first, *__last); 48243e519524SHoward Hinnant return; 48253e519524SHoward Hinnant } 48263e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48273e519524SHoward Hinnant { 48283e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 48293e519524SHoward Hinnant return; 48303e519524SHoward Hinnant } 48313e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 48323e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 48333e519524SHoward Hinnant if (__len <= __buff_size) 48343e519524SHoward Hinnant { 48353e519524SHoward Hinnant __destruct_n __d(0); 48363e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 48373e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 48383e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 48393e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 48403e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 48413e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 48423e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 48433e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 48443e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 48453e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 48463e519524SHoward Hinnant// __first, __comp); 48473e519524SHoward Hinnant return; 48483e519524SHoward Hinnant } 48493e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 48503e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 48513e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 48523e519524SHoward Hinnant} 48533e519524SHoward Hinnant 48543e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48563e519524SHoward Hinnantvoid 48573e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48583e519524SHoward Hinnant{ 48593e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48603e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48613e519524SHoward Hinnant difference_type __len = __last - __first; 48623e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 48633e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 48643e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 48653e519524SHoward Hinnant { 4866ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 48673e519524SHoward Hinnant __h.reset(__buf.first); 48683e519524SHoward Hinnant } 4869145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48723e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4873145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48753e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4876145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48773e519524SHoward Hinnant} 48783e519524SHoward Hinnant 48793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48813e519524SHoward Hinnantvoid 48823e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 48833e519524SHoward Hinnant{ 4884ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48853e519524SHoward Hinnant} 48863e519524SHoward Hinnant 48873e519524SHoward Hinnant// is_heap_until 48883e519524SHoward Hinnant 48893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48903e519524SHoward Hinnant_RandomAccessIterator 48913e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48923e519524SHoward Hinnant{ 4893ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48943e519524SHoward Hinnant difference_type __len = __last - __first; 48953e519524SHoward Hinnant difference_type __p = 0; 48963e519524SHoward Hinnant difference_type __c = 1; 48973e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 48983e519524SHoward Hinnant while (__c < __len) 48993e519524SHoward Hinnant { 49003e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 49013e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49023e519524SHoward Hinnant return __cp; 49033e519524SHoward Hinnant ++__c; 49043e519524SHoward Hinnant ++__cp; 49053e519524SHoward Hinnant if (__c == __len) 49063e519524SHoward Hinnant return __last; 49073e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 49083e519524SHoward Hinnant return __cp; 49093e519524SHoward Hinnant ++__p; 49103e519524SHoward Hinnant ++__pp; 49113e519524SHoward Hinnant __c = 2 * __p + 1; 49123e519524SHoward Hinnant } 49133e519524SHoward Hinnant return __last; 49143e519524SHoward Hinnant} 49153e519524SHoward Hinnant 49163e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49183e519524SHoward Hinnant_RandomAccessIterator 49193e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 49203e519524SHoward Hinnant{ 4921ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49223e519524SHoward Hinnant} 49233e519524SHoward Hinnant 49243e519524SHoward Hinnant// is_heap 49253e519524SHoward Hinnant 49263e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49283e519524SHoward Hinnantbool 49293e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49303e519524SHoward Hinnant{ 4931ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 49323e519524SHoward Hinnant} 49333e519524SHoward Hinnant 49343e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 49353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49363e519524SHoward Hinnantbool 49373e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49383e519524SHoward Hinnant{ 4939ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49403e519524SHoward Hinnant} 49413e519524SHoward Hinnant 49423e519524SHoward Hinnant// push_heap 49433e519524SHoward Hinnant 49443e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49453e519524SHoward Hinnantvoid 49468b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49473e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49483e519524SHoward Hinnant{ 49493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 49503e519524SHoward Hinnant if (__len > 1) 49513e519524SHoward Hinnant { 49523e519524SHoward Hinnant __len = (__len - 2) / 2; 49533e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 49543e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 49553e519524SHoward Hinnant { 4956ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 49573e519524SHoward Hinnant do 49583e519524SHoward Hinnant { 4959ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 49603e519524SHoward Hinnant __last = __ptr; 49613e519524SHoward Hinnant if (__len == 0) 49623e519524SHoward Hinnant break; 49633e519524SHoward Hinnant __len = (__len - 1) / 2; 49643e519524SHoward Hinnant __ptr = __first + __len; 49653e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4966ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 49673e519524SHoward Hinnant } 49683e519524SHoward Hinnant } 49693e519524SHoward Hinnant} 49703e519524SHoward Hinnant 49713e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49733e519524SHoward Hinnantvoid 49743e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49753e519524SHoward Hinnant{ 4976145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49773e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49783e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49798b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4980145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49813e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49828b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4983145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49843e519524SHoward Hinnant} 49853e519524SHoward Hinnant 49863e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49883e519524SHoward Hinnantvoid 49893e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49903e519524SHoward Hinnant{ 4991ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49923e519524SHoward Hinnant} 49933e519524SHoward Hinnant 49943e519524SHoward Hinnant// pop_heap 49953e519524SHoward Hinnant 49963e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49978b512602SDavid Majnemervoid 4998fd838227SEric Fiselier__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/, 4999fd838227SEric Fiselier _Compare __comp, 50008b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 50018b512602SDavid Majnemer _RandomAccessIterator __start) 50028b512602SDavid Majnemer{ 50038b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50048b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 50058b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 50068b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 50078b512602SDavid Majnemer difference_type __child = __start - __first; 50088b512602SDavid Majnemer 50098b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 50108b512602SDavid Majnemer return; 50118b512602SDavid Majnemer 50128b512602SDavid Majnemer __child = 2 * __child + 1; 50138b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 50148b512602SDavid Majnemer 50158b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50168b512602SDavid Majnemer // right-child exists and is greater than left-child 50178b512602SDavid Majnemer ++__child_i; 50188b512602SDavid Majnemer ++__child; 50198b512602SDavid Majnemer } 50208b512602SDavid Majnemer 50218b512602SDavid Majnemer // check if we are in heap-order 50228b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 50238b512602SDavid Majnemer // we are, __start is larger than it's largest child 50248b512602SDavid Majnemer return; 50258b512602SDavid Majnemer 50268b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 50278b512602SDavid Majnemer do 50288b512602SDavid Majnemer { 50298b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 50308b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 50318b512602SDavid Majnemer __start = __child_i; 50328b512602SDavid Majnemer 50338b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 50348b512602SDavid Majnemer break; 50358b512602SDavid Majnemer 50368b512602SDavid Majnemer // recompute the child based off of the updated parent 50378b512602SDavid Majnemer __child = 2 * __child + 1; 50388b512602SDavid Majnemer __child_i = __first + __child; 50398b512602SDavid Majnemer 50408b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 50418b512602SDavid Majnemer // right-child exists and is greater than left-child 50428b512602SDavid Majnemer ++__child_i; 50438b512602SDavid Majnemer ++__child; 50448b512602SDavid Majnemer } 50458b512602SDavid Majnemer 50468b512602SDavid Majnemer // check if we are in heap-order 50478b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 50488b512602SDavid Majnemer *__start = _VSTD::move(__top); 50498b512602SDavid Majnemer} 50508b512602SDavid Majnemer 50518b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 50523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50533e519524SHoward Hinnantvoid 50543e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 50553e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 50563e519524SHoward Hinnant{ 50573e519524SHoward Hinnant if (__len > 1) 50583e519524SHoward Hinnant { 50593e519524SHoward Hinnant swap(*__first, *--__last); 50608b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 50613e519524SHoward Hinnant } 50623e519524SHoward Hinnant} 50633e519524SHoward Hinnant 50643e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50653e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50663e519524SHoward Hinnantvoid 50673e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50683e519524SHoward Hinnant{ 5069145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50703e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50713e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50723e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 5073145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50743e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50753e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 5076145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50773e519524SHoward Hinnant} 50783e519524SHoward Hinnant 50793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50813e519524SHoward Hinnantvoid 50823e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50833e519524SHoward Hinnant{ 5084ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50853e519524SHoward Hinnant} 50863e519524SHoward Hinnant 50873e519524SHoward Hinnant// make_heap 50883e519524SHoward Hinnant 50893e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50903e519524SHoward Hinnantvoid 50913e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50923e519524SHoward Hinnant{ 50933e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50943e519524SHoward Hinnant difference_type __n = __last - __first; 50953e519524SHoward Hinnant if (__n > 1) 50963e519524SHoward Hinnant { 50978b512602SDavid Majnemer // start from the first parent, there is no need to consider children 50988b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 50998b512602SDavid Majnemer { 51008b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 51018b512602SDavid Majnemer } 51023e519524SHoward Hinnant } 51033e519524SHoward Hinnant} 51043e519524SHoward Hinnant 51053e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51073e519524SHoward Hinnantvoid 51083e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51093e519524SHoward Hinnant{ 5110145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51133e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5114145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51163e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5117145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51183e519524SHoward Hinnant} 51193e519524SHoward Hinnant 51203e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51223e519524SHoward Hinnantvoid 51233e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51243e519524SHoward Hinnant{ 5125ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51263e519524SHoward Hinnant} 51273e519524SHoward Hinnant 51283e519524SHoward Hinnant// sort_heap 51293e519524SHoward Hinnant 51303e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51313e519524SHoward Hinnantvoid 51323e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51333e519524SHoward Hinnant{ 51343e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51353e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 51363e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 51373e519524SHoward Hinnant} 51383e519524SHoward Hinnant 51393e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51413e519524SHoward Hinnantvoid 51423e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 51433e519524SHoward Hinnant{ 5144145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51473e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5148145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51503e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5151145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51523e519524SHoward Hinnant} 51533e519524SHoward Hinnant 51543e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51563e519524SHoward Hinnantvoid 51573e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 51583e519524SHoward Hinnant{ 5159ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51603e519524SHoward Hinnant} 51613e519524SHoward Hinnant 51623e519524SHoward Hinnant// partial_sort 51633e519524SHoward Hinnant 51643e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51653e519524SHoward Hinnantvoid 51663e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51673e519524SHoward Hinnant _Compare __comp) 51683e519524SHoward Hinnant{ 51693e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 51703e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 51713e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 51723e519524SHoward Hinnant { 51733e519524SHoward Hinnant if (__comp(*__i, *__first)) 51743e519524SHoward Hinnant { 51753e519524SHoward Hinnant swap(*__i, *__first); 51768b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 51773e519524SHoward Hinnant } 51783e519524SHoward Hinnant } 51793e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 51803e519524SHoward Hinnant} 51813e519524SHoward Hinnant 51823e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 51833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51843e519524SHoward Hinnantvoid 51853e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 51863e519524SHoward Hinnant _Compare __comp) 51873e519524SHoward Hinnant{ 5188145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51893e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51903e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51913e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5192145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51933e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51943e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5195145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51963e519524SHoward Hinnant} 51973e519524SHoward Hinnant 51983e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 51993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52003e519524SHoward Hinnantvoid 52013e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 52023e519524SHoward Hinnant{ 5203ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 52043e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52053e519524SHoward Hinnant} 52063e519524SHoward Hinnant 52073e519524SHoward Hinnant// partial_sort_copy 52083e519524SHoward Hinnant 52093e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 52103e519524SHoward Hinnant_RandomAccessIterator 52113e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 52123e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52133e519524SHoward Hinnant{ 52143e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 52153e519524SHoward Hinnant if (__r != __result_last) 52163e519524SHoward Hinnant { 5217910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 52183e519524SHoward Hinnant *__r = *__first; 52193e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 52208b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 52213e519524SHoward Hinnant for (; __first != __last; ++__first) 52223e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 52233e519524SHoward Hinnant { 52243e519524SHoward Hinnant *__result_first = *__first; 52258b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 52263e519524SHoward Hinnant } 52273e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 52283e519524SHoward Hinnant } 52293e519524SHoward Hinnant return __r; 52303e519524SHoward Hinnant} 52313e519524SHoward Hinnant 52323e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 52333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52343e519524SHoward Hinnant_RandomAccessIterator 52353e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52363e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 52373e519524SHoward Hinnant{ 5238145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 52393e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 52403e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 52413e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5242145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 52433e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 52443e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5245145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 52463e519524SHoward Hinnant} 52473e519524SHoward Hinnant 52483e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 52493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 52503e519524SHoward Hinnant_RandomAccessIterator 52513e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 52523e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 52533e519524SHoward Hinnant{ 5254ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 52553e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 52563e519524SHoward Hinnant} 52573e519524SHoward Hinnant 52583e519524SHoward Hinnant// nth_element 52593e519524SHoward Hinnant 52603e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 52613e519524SHoward Hinnantvoid 52623e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 52633e519524SHoward Hinnant{ 52643e519524SHoward Hinnant // _Compare is known to be a reference type 52653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 52663e519524SHoward Hinnant const difference_type __limit = 7; 52673e519524SHoward Hinnant while (true) 52683e519524SHoward Hinnant { 52693e519524SHoward Hinnant __restart: 5270b34b4819SHoward Hinnant if (__nth == __last) 5271b34b4819SHoward Hinnant return; 52723e519524SHoward Hinnant difference_type __len = __last - __first; 52733e519524SHoward Hinnant switch (__len) 52743e519524SHoward Hinnant { 52753e519524SHoward Hinnant case 0: 52763e519524SHoward Hinnant case 1: 52773e519524SHoward Hinnant return; 52783e519524SHoward Hinnant case 2: 52793e519524SHoward Hinnant if (__comp(*--__last, *__first)) 52803e519524SHoward Hinnant swap(*__first, *__last); 52813e519524SHoward Hinnant return; 52823e519524SHoward Hinnant case 3: 52833e519524SHoward Hinnant { 52843e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5285ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 52863e519524SHoward Hinnant return; 52873e519524SHoward Hinnant } 52883e519524SHoward Hinnant } 52893e519524SHoward Hinnant if (__len <= __limit) 52903e519524SHoward Hinnant { 52913e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 52923e519524SHoward Hinnant return; 52933e519524SHoward Hinnant } 52943e519524SHoward Hinnant // __len > __limit >= 3 52953e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 52963e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5297ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 52983e519524SHoward Hinnant // *__m is median 52993e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 53003e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 53013e519524SHoward Hinnant _RandomAccessIterator __i = __first; 53023e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 53033e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53043e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 53053e519524SHoward Hinnant // Prime the downward search with a guard. 53063e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 53073e519524SHoward Hinnant { 53083e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 53093e519524SHoward Hinnant // manually guard downward moving __j against __i 53103e519524SHoward Hinnant while (true) 53113e519524SHoward Hinnant { 53123e519524SHoward Hinnant if (__i == --__j) 53133e519524SHoward Hinnant { 53143e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 53153e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 53163e519524SHoward Hinnant ++__i; // __first + 1 53173e519524SHoward Hinnant __j = __last; 53183e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 53193e519524SHoward Hinnant { 53203e519524SHoward Hinnant while (true) 53213e519524SHoward Hinnant { 53223e519524SHoward Hinnant if (__i == __j) 53233e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 53243e519524SHoward Hinnant if (__comp(*__first, *__i)) 53253e519524SHoward Hinnant { 53263e519524SHoward Hinnant swap(*__i, *__j); 53273e519524SHoward Hinnant ++__n_swaps; 53283e519524SHoward Hinnant ++__i; 53293e519524SHoward Hinnant break; 53303e519524SHoward Hinnant } 53313e519524SHoward Hinnant ++__i; 53323e519524SHoward Hinnant } 53333e519524SHoward Hinnant } 53343e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 53353e519524SHoward Hinnant if (__i == __j) 53363e519524SHoward Hinnant return; 53373e519524SHoward Hinnant while (true) 53383e519524SHoward Hinnant { 53393e519524SHoward Hinnant while (!__comp(*__first, *__i)) 53403e519524SHoward Hinnant ++__i; 53413e519524SHoward Hinnant while (__comp(*__first, *--__j)) 53423e519524SHoward Hinnant ; 53433e519524SHoward Hinnant if (__i >= __j) 53443e519524SHoward Hinnant break; 53453e519524SHoward Hinnant swap(*__i, *__j); 53463e519524SHoward Hinnant ++__n_swaps; 53473e519524SHoward Hinnant ++__i; 53483e519524SHoward Hinnant } 53493e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 53503e519524SHoward Hinnant // The first part is sorted, 53513e519524SHoward Hinnant if (__nth < __i) 53523e519524SHoward Hinnant return; 53533e519524SHoward Hinnant // __nth_element the secod part 53543e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 53553e519524SHoward Hinnant __first = __i; 53563e519524SHoward Hinnant goto __restart; 53573e519524SHoward Hinnant } 53583e519524SHoward Hinnant if (__comp(*__j, *__m)) 53593e519524SHoward Hinnant { 53603e519524SHoward Hinnant swap(*__i, *__j); 53613e519524SHoward Hinnant ++__n_swaps; 53623e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 53633e519524SHoward Hinnant } 53643e519524SHoward Hinnant } 53653e519524SHoward Hinnant } 53663e519524SHoward Hinnant ++__i; 53673e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 53683e519524SHoward Hinnant // if not yet partitioned... 53693e519524SHoward Hinnant if (__i < __j) 53703e519524SHoward Hinnant { 53713e519524SHoward Hinnant // known that *(__i - 1) < *__m 53723e519524SHoward Hinnant while (true) 53733e519524SHoward Hinnant { 53743e519524SHoward Hinnant // __m still guards upward moving __i 53753e519524SHoward Hinnant while (__comp(*__i, *__m)) 53763e519524SHoward Hinnant ++__i; 53773e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 53783e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 53793e519524SHoward Hinnant ; 53803e519524SHoward Hinnant if (__i >= __j) 53813e519524SHoward Hinnant break; 53823e519524SHoward Hinnant swap(*__i, *__j); 53833e519524SHoward Hinnant ++__n_swaps; 53843e519524SHoward Hinnant // It is known that __m != __j 53853e519524SHoward Hinnant // If __m just moved, follow it 53863e519524SHoward Hinnant if (__m == __i) 53873e519524SHoward Hinnant __m = __j; 53883e519524SHoward Hinnant ++__i; 53893e519524SHoward Hinnant } 53903e519524SHoward Hinnant } 53913e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 53923e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 53933e519524SHoward Hinnant { 53943e519524SHoward Hinnant swap(*__i, *__m); 53953e519524SHoward Hinnant ++__n_swaps; 53963e519524SHoward Hinnant } 53973e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 53983e519524SHoward Hinnant if (__nth == __i) 53993e519524SHoward Hinnant return; 54003e519524SHoward Hinnant if (__n_swaps == 0) 54013e519524SHoward Hinnant { 54023e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 54033e519524SHoward Hinnant if (__nth < __i) 54043e519524SHoward Hinnant { 54053e519524SHoward Hinnant // Check for [__first, __i) already sorted 54063e519524SHoward Hinnant __j = __m = __first; 54073e519524SHoward Hinnant while (++__j != __i) 54083e519524SHoward Hinnant { 54093e519524SHoward Hinnant if (__comp(*__j, *__m)) 54103e519524SHoward Hinnant // not yet sorted, so sort 54113e519524SHoward Hinnant goto not_sorted; 54123e519524SHoward Hinnant __m = __j; 54133e519524SHoward Hinnant } 54143e519524SHoward Hinnant // [__first, __i) sorted 54153e519524SHoward Hinnant return; 54163e519524SHoward Hinnant } 54173e519524SHoward Hinnant else 54183e519524SHoward Hinnant { 54193e519524SHoward Hinnant // Check for [__i, __last) already sorted 54203e519524SHoward Hinnant __j = __m = __i; 54213e519524SHoward Hinnant while (++__j != __last) 54223e519524SHoward Hinnant { 54233e519524SHoward Hinnant if (__comp(*__j, *__m)) 54243e519524SHoward Hinnant // not yet sorted, so sort 54253e519524SHoward Hinnant goto not_sorted; 54263e519524SHoward Hinnant __m = __j; 54273e519524SHoward Hinnant } 54283e519524SHoward Hinnant // [__i, __last) sorted 54293e519524SHoward Hinnant return; 54303e519524SHoward Hinnant } 54313e519524SHoward Hinnant } 54323e519524SHoward Hinnantnot_sorted: 54333e519524SHoward Hinnant // __nth_element on range containing __nth 54343e519524SHoward Hinnant if (__nth < __i) 54353e519524SHoward Hinnant { 54363e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 54373e519524SHoward Hinnant __last = __i; 54383e519524SHoward Hinnant } 54393e519524SHoward Hinnant else 54403e519524SHoward Hinnant { 54413e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 54423e519524SHoward Hinnant __first = ++__i; 54433e519524SHoward Hinnant } 54443e519524SHoward Hinnant } 54453e519524SHoward Hinnant} 54463e519524SHoward Hinnant 54473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 54483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54493e519524SHoward Hinnantvoid 54503e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 54513e519524SHoward Hinnant{ 5452145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54553e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5456145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54583e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5459145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54603e519524SHoward Hinnant} 54613e519524SHoward Hinnant 54623e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 54633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54643e519524SHoward Hinnantvoid 54653e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 54663e519524SHoward Hinnant{ 5467ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 54683e519524SHoward Hinnant} 54693e519524SHoward Hinnant 54703e519524SHoward Hinnant// includes 54713e519524SHoward Hinnant 54723e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 54733e519524SHoward Hinnantbool 54743e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54753e519524SHoward Hinnant _Compare __comp) 54763e519524SHoward Hinnant{ 54773e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 54783e519524SHoward Hinnant { 54793e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 54803e519524SHoward Hinnant return false; 54813e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54823e519524SHoward Hinnant ++__first2; 54833e519524SHoward Hinnant } 54843e519524SHoward Hinnant return true; 54853e519524SHoward Hinnant} 54863e519524SHoward Hinnant 54873e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 54883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54893e519524SHoward Hinnantbool 54903e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 54913e519524SHoward Hinnant _Compare __comp) 54923e519524SHoward Hinnant{ 5493145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54943e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54953e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54963e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5497145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54983e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54993e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5500145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55013e519524SHoward Hinnant} 55023e519524SHoward Hinnant 55033e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 55043e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55053e519524SHoward Hinnantbool 55063e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 55073e519524SHoward Hinnant{ 5508ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 55093e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55103e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55113e519524SHoward Hinnant} 55123e519524SHoward Hinnant 55133e519524SHoward Hinnant// set_union 55143e519524SHoward Hinnant 55153e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55163e519524SHoward Hinnant_OutputIterator 55173e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 55183e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55193e519524SHoward Hinnant{ 55203e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 55213e519524SHoward Hinnant { 55223e519524SHoward Hinnant if (__first2 == __last2) 5523ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55243e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55253e519524SHoward Hinnant { 55263e519524SHoward Hinnant *__result = *__first2; 55273e519524SHoward Hinnant ++__first2; 55283e519524SHoward Hinnant } 55293e519524SHoward Hinnant else 55303e519524SHoward Hinnant { 55313e519524SHoward Hinnant *__result = *__first1; 55323e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 55333e519524SHoward Hinnant ++__first2; 55343e519524SHoward Hinnant ++__first1; 55353e519524SHoward Hinnant } 55363e519524SHoward Hinnant } 5537ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55383e519524SHoward Hinnant} 55393e519524SHoward Hinnant 55403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55423e519524SHoward Hinnant_OutputIterator 55433e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55443e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55453e519524SHoward Hinnant{ 5546145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55493e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5550145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55523e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5553145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55543e519524SHoward Hinnant} 55553e519524SHoward Hinnant 55563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55583e519524SHoward Hinnant_OutputIterator 55593e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 55603e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55613e519524SHoward Hinnant{ 5562ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 55633e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55643e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55653e519524SHoward Hinnant} 55663e519524SHoward Hinnant 55673e519524SHoward Hinnant// set_intersection 55683e519524SHoward Hinnant 55693e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55703e519524SHoward Hinnant_OutputIterator 55713e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55723e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55733e519524SHoward Hinnant{ 55743e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 55753e519524SHoward Hinnant { 55763e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55773e519524SHoward Hinnant ++__first1; 55783e519524SHoward Hinnant else 55793e519524SHoward Hinnant { 55803e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55813e519524SHoward Hinnant { 55823e519524SHoward Hinnant *__result = *__first1; 55833e519524SHoward Hinnant ++__result; 55843e519524SHoward Hinnant ++__first1; 55853e519524SHoward Hinnant } 55863e519524SHoward Hinnant ++__first2; 55873e519524SHoward Hinnant } 55883e519524SHoward Hinnant } 55893e519524SHoward Hinnant return __result; 55903e519524SHoward Hinnant} 55913e519524SHoward Hinnant 55923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55943e519524SHoward Hinnant_OutputIterator 55953e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55963e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55973e519524SHoward Hinnant{ 5598145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55993e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56003e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56013e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5602145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56033e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56043e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5605145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56063e519524SHoward Hinnant} 56073e519524SHoward Hinnant 56083e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56103e519524SHoward Hinnant_OutputIterator 56113e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 56123e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56133e519524SHoward Hinnant{ 5614ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 56153e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56163e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56173e519524SHoward Hinnant} 56183e519524SHoward Hinnant 56193e519524SHoward Hinnant// set_difference 56203e519524SHoward Hinnant 56213e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56223e519524SHoward Hinnant_OutputIterator 56233e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56243e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56253e519524SHoward Hinnant{ 56263e519524SHoward Hinnant while (__first1 != __last1) 56273e519524SHoward Hinnant { 56283e519524SHoward Hinnant if (__first2 == __last2) 5629ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56303e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56313e519524SHoward Hinnant { 56323e519524SHoward Hinnant *__result = *__first1; 56333e519524SHoward Hinnant ++__result; 56343e519524SHoward Hinnant ++__first1; 56353e519524SHoward Hinnant } 56363e519524SHoward Hinnant else 56373e519524SHoward Hinnant { 56383e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 56393e519524SHoward Hinnant ++__first1; 56403e519524SHoward Hinnant ++__first2; 56413e519524SHoward Hinnant } 56423e519524SHoward Hinnant } 56433e519524SHoward Hinnant return __result; 56443e519524SHoward Hinnant} 56453e519524SHoward Hinnant 56463e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 56473e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56483e519524SHoward Hinnant_OutputIterator 56493e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56513e519524SHoward Hinnant{ 5652145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56553e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5656145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56583e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5659145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56603e519524SHoward Hinnant} 56613e519524SHoward Hinnant 56623e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56643e519524SHoward Hinnant_OutputIterator 56653e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56663e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56673e519524SHoward Hinnant{ 5668ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 56693e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56703e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56713e519524SHoward Hinnant} 56723e519524SHoward Hinnant 56733e519524SHoward Hinnant// set_symmetric_difference 56743e519524SHoward Hinnant 56753e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 56763e519524SHoward Hinnant_OutputIterator 56773e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56783e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 56793e519524SHoward Hinnant{ 56803e519524SHoward Hinnant while (__first1 != __last1) 56813e519524SHoward Hinnant { 56823e519524SHoward Hinnant if (__first2 == __last2) 5683ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 56843e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 56853e519524SHoward Hinnant { 56863e519524SHoward Hinnant *__result = *__first1; 56873e519524SHoward Hinnant ++__result; 56883e519524SHoward Hinnant ++__first1; 56893e519524SHoward Hinnant } 56903e519524SHoward Hinnant else 56913e519524SHoward Hinnant { 56923e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56933e519524SHoward Hinnant { 56943e519524SHoward Hinnant *__result = *__first2; 56953e519524SHoward Hinnant ++__result; 56963e519524SHoward Hinnant } 56973e519524SHoward Hinnant else 56983e519524SHoward Hinnant ++__first1; 56993e519524SHoward Hinnant ++__first2; 57003e519524SHoward Hinnant } 57013e519524SHoward Hinnant } 5702ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 57033e519524SHoward Hinnant} 57043e519524SHoward Hinnant 57053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 57063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57073e519524SHoward Hinnant_OutputIterator 57083e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57093e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 57103e519524SHoward Hinnant{ 5711145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57143e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5715145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57173e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5718145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57193e519524SHoward Hinnant} 57203e519524SHoward Hinnant 57213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 57223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57233e519524SHoward Hinnant_OutputIterator 57243e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 57253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 57263e519524SHoward Hinnant{ 5727ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 57283e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57293e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57303e519524SHoward Hinnant} 57313e519524SHoward Hinnant 57323e519524SHoward Hinnant// lexicographical_compare 57333e519524SHoward Hinnant 57343e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 57353e519524SHoward Hinnantbool 57363e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57373e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57383e519524SHoward Hinnant{ 5739910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 57403e519524SHoward Hinnant { 57413e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 57423e519524SHoward Hinnant return true; 57433e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 57443e519524SHoward Hinnant return false; 57453e519524SHoward Hinnant } 57463e519524SHoward Hinnant return false; 57473e519524SHoward Hinnant} 57483e519524SHoward Hinnant 57493e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 57503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57513e519524SHoward Hinnantbool 57523e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57533e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 57543e519524SHoward Hinnant{ 5755145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57563e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57573e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57583e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5759145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57603e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57613e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5762145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57633e519524SHoward Hinnant} 57643e519524SHoward Hinnant 57653e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 57663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57673e519524SHoward Hinnantbool 57683e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 57693e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 57703e519524SHoward Hinnant{ 5771ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 57723e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 57733e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 57743e519524SHoward Hinnant} 57753e519524SHoward Hinnant 57763e519524SHoward Hinnant// next_permutation 57773e519524SHoward Hinnant 57783e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57793e519524SHoward Hinnantbool 57803e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57813e519524SHoward Hinnant{ 57823e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57833e519524SHoward Hinnant if (__first == __last || __first == --__i) 57843e519524SHoward Hinnant return false; 57853e519524SHoward Hinnant while (true) 57863e519524SHoward Hinnant { 57873e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57883e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 57893e519524SHoward Hinnant { 57903e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57913e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 57923e519524SHoward Hinnant ; 57933e519524SHoward Hinnant swap(*__i, *__j); 5794ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57953e519524SHoward Hinnant return true; 57963e519524SHoward Hinnant } 57973e519524SHoward Hinnant if (__i == __first) 57983e519524SHoward Hinnant { 5799ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58003e519524SHoward Hinnant return false; 58013e519524SHoward Hinnant } 58023e519524SHoward Hinnant } 58033e519524SHoward Hinnant} 58043e519524SHoward Hinnant 58053e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58073e519524SHoward Hinnantbool 58083e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58093e519524SHoward Hinnant{ 5810145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58113e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58123e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58133e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5814145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58153e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58163e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5817145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58183e519524SHoward Hinnant} 58193e519524SHoward Hinnant 58203e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58223e519524SHoward Hinnantbool 58233e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58243e519524SHoward Hinnant{ 5825ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 58263e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58273e519524SHoward Hinnant} 58283e519524SHoward Hinnant 58293e519524SHoward Hinnant// prev_permutation 58303e519524SHoward Hinnant 58313e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 58323e519524SHoward Hinnantbool 58333e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58343e519524SHoward Hinnant{ 58353e519524SHoward Hinnant _BidirectionalIterator __i = __last; 58363e519524SHoward Hinnant if (__first == __last || __first == --__i) 58373e519524SHoward Hinnant return false; 58383e519524SHoward Hinnant while (true) 58393e519524SHoward Hinnant { 58403e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 58413e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 58423e519524SHoward Hinnant { 58433e519524SHoward Hinnant _BidirectionalIterator __j = __last; 58443e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 58453e519524SHoward Hinnant ; 58463e519524SHoward Hinnant swap(*__i, *__j); 5847ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 58483e519524SHoward Hinnant return true; 58493e519524SHoward Hinnant } 58503e519524SHoward Hinnant if (__i == __first) 58513e519524SHoward Hinnant { 5852ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 58533e519524SHoward Hinnant return false; 58543e519524SHoward Hinnant } 58553e519524SHoward Hinnant } 58563e519524SHoward Hinnant} 58573e519524SHoward Hinnant 58583e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 58593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58603e519524SHoward Hinnantbool 58613e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 58623e519524SHoward Hinnant{ 5863145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 58643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 58653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 58663e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5867145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 58683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 58693e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5870145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 58713e519524SHoward Hinnant} 58723e519524SHoward Hinnant 58733e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 58743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 58753e519524SHoward Hinnantbool 58763e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 58773e519524SHoward Hinnant{ 5878ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 58793e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 58803e519524SHoward Hinnant} 58813e519524SHoward Hinnant 58823e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 58833e519524SHoward Hinnant 58843e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5885