13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 6412dbebeSHoward Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 7412dbebeSHoward Hinnant// Source Licenses. See LICENSE.TXT for details. 83e519524SHoward Hinnant// 93e519524SHoward Hinnant//===----------------------------------------------------------------------===// 103e519524SHoward Hinnant 113e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 123e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 133e519524SHoward Hinnant 143e519524SHoward Hinnant/* 153e519524SHoward Hinnant algorithm synopsis 163e519524SHoward Hinnant 173e519524SHoward Hinnant#include <initializer_list> 183e519524SHoward Hinnant 193e519524SHoward Hinnantnamespace std 203e519524SHoward Hinnant{ 213e519524SHoward Hinnant 223e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 233e519524SHoward Hinnant bool 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 273e519524SHoward Hinnant bool 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 313e519524SHoward Hinnant bool 323e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 333e519524SHoward Hinnant 343e519524SHoward Hinnanttemplate <class InputIterator, class Function> 353e519524SHoward Hinnant Function 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 383e519524SHoward Hinnanttemplate <class InputIterator, class T> 393e519524SHoward Hinnant InputIterator 403e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 413e519524SHoward Hinnant 423e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 433e519524SHoward Hinnant InputIterator 443e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 473e519524SHoward Hinnant InputIterator 483e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 513e519524SHoward Hinnant ForwardIterator1 523e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 543e519524SHoward Hinnant 553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 563e519524SHoward Hinnant ForwardIterator1 573e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 593e519524SHoward Hinnant 603e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 613e519524SHoward Hinnant ForwardIterator1 623e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 633e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 643e519524SHoward Hinnant 653e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 663e519524SHoward Hinnant ForwardIterator1 673e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 683e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 693e519524SHoward Hinnant 703e519524SHoward Hinnanttemplate <class ForwardIterator> 713e519524SHoward Hinnant ForwardIterator 723e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 753e519524SHoward Hinnant ForwardIterator 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class InputIterator, class T> 793e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 803e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 833e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 843e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 873e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 883e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 893e519524SHoward Hinnant 900b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 910b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 920b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 930b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 940b0bbd2fSMarshall Clow 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 963e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 973e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 983e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 993e519524SHoward Hinnant 1000b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1010b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1020b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1030b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1040b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1050b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 1100b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1110b0bbd2fSMarshall Clow bool 1120b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1130b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1140b0bbd2fSMarshall Clow 1153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1163e519524SHoward Hinnant bool 1173e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1183e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1193e519524SHoward Hinnant 1200b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1210b0bbd2fSMarshall Clow bool 1220b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1230b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1240b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1250b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 1310b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1320b0bbd2fSMarshall Clow bool 1330b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1340b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1350b0bbd2fSMarshall Clow 1363e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1373e519524SHoward Hinnant bool 1383e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1393e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1403e519524SHoward Hinnant 1410b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1420b0bbd2fSMarshall Clow bool 1430b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1440b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1450b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1460b0bbd2fSMarshall Clow 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1483e519524SHoward Hinnant ForwardIterator1 1493e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1533e519524SHoward Hinnant ForwardIterator1 1543e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1553e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1583e519524SHoward Hinnant ForwardIterator 1593e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1623e519524SHoward Hinnant ForwardIterator 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1643e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1653e519524SHoward Hinnant 1663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1673e519524SHoward Hinnant OutputIterator 1683e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1733e519524SHoward Hinnant OutputIterator result, Predicate pred); 1743e519524SHoward Hinnant 1753e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1763e519524SHoward Hinnant OutputIterator 1773e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1803e519524SHoward Hinnant BidirectionalIterator2 1813e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1823e519524SHoward Hinnant BidirectionalIterator2 result); 1833e519524SHoward Hinnant 1843e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1853e519524SHoward Hinnant ForwardIterator2 1863e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant void 1903e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1933e519524SHoward Hinnant OutputIterator 1943e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1973e519524SHoward Hinnant OutputIterator 1983e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1993e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant void 2033e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2063e519524SHoward Hinnant void 2073e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2123e519524SHoward Hinnant const T& old_value, const T& new_value); 2133e519524SHoward Hinnant 2143e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2153e519524SHoward Hinnant OutputIterator 2163e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2193e519524SHoward Hinnant void 2203e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2233e519524SHoward Hinnant OutputIterator 2243e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2273e519524SHoward Hinnant void 2283e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2313e519524SHoward Hinnant OutputIterator 2323e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2353e519524SHoward Hinnant ForwardIterator 2363e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2393e519524SHoward Hinnant ForwardIterator 2403e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2433e519524SHoward Hinnant OutputIterator 2443e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2473e519524SHoward Hinnant OutputIterator 2483e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class ForwardIterator> 2513e519524SHoward Hinnant ForwardIterator 2523e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2593e519524SHoward Hinnant OutputIterator 2603e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2673e519524SHoward Hinnant void 2683e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2713e519524SHoward Hinnant OutputIterator 2723e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class ForwardIterator> 2753e519524SHoward Hinnant ForwardIterator 2763e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2793e519524SHoward Hinnant OutputIterator 2803e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2833e519524SHoward Hinnant void 28406965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 28806965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 28906965c1fSMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14 2903e519524SHoward Hinnant 291f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 292f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 293fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 294f9d540b0SHoward Hinnant 2953e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2963e519524SHoward Hinnant bool 2973e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2983e519524SHoward Hinnant 2993e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3003e519524SHoward Hinnant ForwardIterator 3013e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3023e519524SHoward Hinnant 3033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3043e519524SHoward Hinnant class OutputIterator2, class Predicate> 3053e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3063e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3073e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3083e519524SHoward Hinnant Predicate pred); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3113e519524SHoward Hinnant ForwardIterator 3123e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3133e519524SHoward Hinnant 3143e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3153e519524SHoward Hinnant ForwardIterator 3163e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator> 3193e519524SHoward Hinnant bool 3203e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3233e519524SHoward Hinnant bool 3243e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate<class ForwardIterator> 3273e519524SHoward Hinnant ForwardIterator 3283e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3313e519524SHoward Hinnant ForwardIterator 3323e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3433e519524SHoward Hinnant void 3443e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3473e519524SHoward Hinnant void 3483e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3513e519524SHoward Hinnant void 3523e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3553e519524SHoward Hinnant void 3563e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3593e519524SHoward Hinnant RandomAccessIterator 3603e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3613e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant RandomAccessIterator 3653e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3663e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3673e519524SHoward Hinnant 3683e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3693e519524SHoward Hinnant void 3703e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant void 3743e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3753e519524SHoward Hinnant 3763e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3773e519524SHoward Hinnant ForwardIterator 3783e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3793e519524SHoward Hinnant 3803e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3813e519524SHoward Hinnant ForwardIterator 3823e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3853e519524SHoward Hinnant ForwardIterator 3863e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3893e519524SHoward Hinnant ForwardIterator 3903e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3933e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3943e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3973e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3983e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4013e519524SHoward Hinnant bool 4023e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4033e519524SHoward Hinnant 4043e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4053e519524SHoward Hinnant bool 4063e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4073e519524SHoward Hinnant 4083e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4093e519524SHoward Hinnant OutputIterator 4103e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4113e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4143e519524SHoward Hinnant OutputIterator 4153e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4193e519524SHoward Hinnant void 4203e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4233e519524SHoward Hinnant void 4243e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4273e519524SHoward Hinnant bool 4283e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4313e519524SHoward Hinnant bool 4323e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4333e519524SHoward Hinnant 4343e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4353e519524SHoward Hinnant OutputIterator 4363e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4373e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4403e519524SHoward Hinnant OutputIterator 4413e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4423e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4453e519524SHoward Hinnant OutputIterator 4463e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4473e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4503e519524SHoward Hinnant OutputIterator 4513e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4523e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4553e519524SHoward Hinnant OutputIterator 4563e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4573e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4583e519524SHoward Hinnant 4593e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4603e519524SHoward Hinnant OutputIterator 4613e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4623e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4653e519524SHoward Hinnant OutputIterator 4663e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4703e519524SHoward Hinnant OutputIterator 4713e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4723e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4733e519524SHoward Hinnant 4743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4753e519524SHoward Hinnant void 4763e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4793e519524SHoward Hinnant void 4803e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4813e519524SHoward Hinnant 4823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4833e519524SHoward Hinnant void 4843e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4853e519524SHoward Hinnant 4863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4873e519524SHoward Hinnant void 4883e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4893e519524SHoward Hinnant 4903e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4913e519524SHoward Hinnant void 4923e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4933e519524SHoward Hinnant 4943e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4953e519524SHoward Hinnant void 4963e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4973e519524SHoward Hinnant 4983e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4993e519524SHoward Hinnant void 5003e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5013e519524SHoward Hinnant 5023e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5033e519524SHoward Hinnant void 5043e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5053e519524SHoward Hinnant 5063e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5073e519524SHoward Hinnant bool 5083e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5093e519524SHoward Hinnant 5103e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5113e519524SHoward Hinnant bool 5123e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5133e519524SHoward Hinnant 5143e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5153e519524SHoward Hinnant RandomAccessIterator 5163e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5173e519524SHoward Hinnant 5183e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5193e519524SHoward Hinnant RandomAccessIterator 5203e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5213e519524SHoward Hinnant 5224eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5234eb27b79SHoward Hinnant ForwardIterator 5240b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5254eb27b79SHoward Hinnant 5264eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5274eb27b79SHoward Hinnant ForwardIterator 5280b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5294eb27b79SHoward Hinnant 5303e519524SHoward Hinnanttemplate <class T> 5313e519524SHoward Hinnant const T& 5329d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5333e519524SHoward Hinnant 5343e519524SHoward Hinnanttemplate <class T, class Compare> 5353e519524SHoward Hinnant const T& 5369d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5373e519524SHoward Hinnant 5383e519524SHoward Hinnanttemplate<class T> 5394eb27b79SHoward Hinnant T 5409d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5413e519524SHoward Hinnant 5423e519524SHoward Hinnanttemplate<class T, class Compare> 5434eb27b79SHoward Hinnant T 5449d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5453e519524SHoward Hinnant 546146c14acSMarshall Clowtemplate<class T> 547146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi ); // C++17 548146c14acSMarshall Clow 549146c14acSMarshall Clowtemplate<class T, class Compare> 550146c14acSMarshall Clow constexpr const T& clamp( const T& v, const T& lo, const T& hi, Compare comp ); // C++17 551146c14acSMarshall Clow 5523e519524SHoward Hinnanttemplate <class ForwardIterator> 5533e519524SHoward Hinnant ForwardIterator 5540b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5553e519524SHoward Hinnant 5563e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5573e519524SHoward Hinnant ForwardIterator 5580b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5593e519524SHoward Hinnant 5604eb27b79SHoward Hinnanttemplate <class T> 5614eb27b79SHoward Hinnant const T& 5629d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5634eb27b79SHoward Hinnant 5644eb27b79SHoward Hinnanttemplate <class T, class Compare> 5654eb27b79SHoward Hinnant const T& 5669d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5674eb27b79SHoward Hinnant 5684eb27b79SHoward Hinnanttemplate<class T> 5694eb27b79SHoward Hinnant T 5709d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5714eb27b79SHoward Hinnant 5724eb27b79SHoward Hinnanttemplate<class T, class Compare> 5734eb27b79SHoward Hinnant T 5749d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5754eb27b79SHoward Hinnant 5764eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5774eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5780b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5794eb27b79SHoward Hinnant 5804eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5814eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5820b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5834eb27b79SHoward Hinnant 5844eb27b79SHoward Hinnanttemplate<class T> 5854eb27b79SHoward Hinnant pair<const T&, const T&> 5869d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5874eb27b79SHoward Hinnant 5884eb27b79SHoward Hinnanttemplate<class T, class Compare> 5894eb27b79SHoward Hinnant pair<const T&, const T&> 5909d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5914eb27b79SHoward Hinnant 5924eb27b79SHoward Hinnanttemplate<class T> 5934eb27b79SHoward Hinnant pair<T, T> 5949d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 5954eb27b79SHoward Hinnant 5964eb27b79SHoward Hinnanttemplate<class T, class Compare> 5974eb27b79SHoward Hinnant pair<T, T> 5989d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 5994eb27b79SHoward Hinnant 6003e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 6013e519524SHoward Hinnant bool 6023e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 6033e519524SHoward Hinnant 6043e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 6053e519524SHoward Hinnant bool 6063e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6073e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6083e519524SHoward Hinnant 6093e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6103e519524SHoward Hinnant bool 6113e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6123e519524SHoward Hinnant 6133e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6143e519524SHoward Hinnant bool 6153e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6163e519524SHoward Hinnant 6173e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6183e519524SHoward Hinnant bool 6193e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6203e519524SHoward Hinnant 6213e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6223e519524SHoward Hinnant bool 6233e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6243e519524SHoward Hinnant 6253e519524SHoward Hinnant} // std 6263e519524SHoward Hinnant 6273e519524SHoward Hinnant*/ 6283e519524SHoward Hinnant 6293e519524SHoward Hinnant#include <__config> 6303e519524SHoward Hinnant#include <initializer_list> 6313e519524SHoward Hinnant#include <type_traits> 6323e519524SHoward Hinnant#include <cstring> 633f07dd8d0SEric Fiselier#include <utility> // needed to provide swap_ranges. 6343e519524SHoward Hinnant#include <memory> 6353e519524SHoward Hinnant#include <iterator> 636a1d07d57SHoward Hinnant#include <cstddef> 6373e519524SHoward Hinnant 6385d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6395d1a701dSHoward Hinnant#include "support/ibm/support.h" 6405d1a701dSHoward Hinnant#endif 6415f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6425f878d4bSHoward Hinnant#include "support/win32/support.h" 6435f878d4bSHoward Hinnant#endif 6445d1a701dSHoward Hinnant 645ab4f4382SHoward Hinnant#include <__undef_min_max> 646ab4f4382SHoward Hinnant 647c1bd9197SEric Fiselier#include <__debug> 648c1bd9197SEric Fiselier 649073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6503e519524SHoward Hinnant#pragma GCC system_header 651073458b1SHoward Hinnant#endif 6523e519524SHoward Hinnant 6533e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6543e519524SHoward Hinnant 6559d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6569d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6579d67c6d5SMarshall Clow// * We haven't included <functional> here. 6583e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6593e519524SHoward Hinnantstruct __equal_to 6603e519524SHoward Hinnant{ 6613e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6623e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6633e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6643e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6653e519524SHoward Hinnant}; 6663e519524SHoward Hinnant 6673e519524SHoward Hinnanttemplate <class _T1> 6683e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6693e519524SHoward Hinnant{ 6709d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6719d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6723e519524SHoward Hinnant}; 6733e519524SHoward Hinnant 6743e519524SHoward Hinnanttemplate <class _T1> 6753e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6763e519524SHoward Hinnant{ 6779d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6789d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6793e519524SHoward Hinnant}; 6803e519524SHoward Hinnant 6813e519524SHoward Hinnanttemplate <class _T1> 6823e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6833e519524SHoward Hinnant{ 6849d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6859d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6863e519524SHoward Hinnant}; 6873e519524SHoward Hinnant 6883e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6893e519524SHoward Hinnantstruct __less 6903e519524SHoward Hinnant{ 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6939d67c6d5SMarshall Clow 6949d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6959d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6969d67c6d5SMarshall Clow 6979d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6989d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6999d67c6d5SMarshall Clow 7009d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7019d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 7023e519524SHoward Hinnant}; 7033e519524SHoward Hinnant 7043e519524SHoward Hinnanttemplate <class _T1> 7053e519524SHoward Hinnantstruct __less<_T1, _T1> 7063e519524SHoward Hinnant{ 7079d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7089d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7093e519524SHoward Hinnant}; 7103e519524SHoward Hinnant 7113e519524SHoward Hinnanttemplate <class _T1> 7123e519524SHoward Hinnantstruct __less<const _T1, _T1> 7133e519524SHoward Hinnant{ 7149d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7159d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7163e519524SHoward Hinnant}; 7173e519524SHoward Hinnant 7183e519524SHoward Hinnanttemplate <class _T1> 7193e519524SHoward Hinnantstruct __less<_T1, const _T1> 7203e519524SHoward Hinnant{ 7219d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7229d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7233e519524SHoward Hinnant}; 7243e519524SHoward Hinnant 7253e519524SHoward Hinnanttemplate <class _Predicate> 7263e519524SHoward Hinnantclass __negate 7273e519524SHoward Hinnant{ 7283e519524SHoward Hinnantprivate: 7293e519524SHoward Hinnant _Predicate __p_; 7303e519524SHoward Hinnantpublic: 7313e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7323e519524SHoward Hinnant 7333e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7343e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7353e519524SHoward Hinnant 7363e519524SHoward Hinnant template <class _T1> 7373e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7383e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7393e519524SHoward Hinnant 7403e519524SHoward Hinnant template <class _T1, class _T2> 7413e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7423e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7433e519524SHoward Hinnant}; 7443e519524SHoward Hinnant 745145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7463e519524SHoward Hinnant 7473e519524SHoward Hinnanttemplate <class _Compare> 7483e519524SHoward Hinnantstruct __debug_less 7493e519524SHoward Hinnant{ 7503e519524SHoward Hinnant _Compare __comp_; 7513e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 752*331d2159SEric Fiselier 7533e519524SHoward Hinnant template <class _Tp, class _Up> 7543e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7553e519524SHoward Hinnant { 7563e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7573e519524SHoward Hinnant if (__r) 758*331d2159SEric Fiselier __do_compare_assert(0, __y, __x); 7593e519524SHoward Hinnant return __r; 7603e519524SHoward Hinnant } 761*331d2159SEric Fiselier 762*331d2159SEric Fiselier template <class _LHS, class _RHS> 763*331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 764*331d2159SEric Fiselier decltype((void)_VSTD::declval<_Compare&>()( 765*331d2159SEric Fiselier _VSTD::declval<_LHS const&>(), _VSTD::declval<_RHS const&>())) 766*331d2159SEric Fiselier __do_compare_assert(int, _LHS const& __l, _RHS const& __r) { 767*331d2159SEric Fiselier _LIBCPP_ASSERT(!__comp_(__l, __r), 768*331d2159SEric Fiselier "Comparator does not induce a strict weak ordering"); 769*331d2159SEric Fiselier } 770*331d2159SEric Fiselier 771*331d2159SEric Fiselier template <class _LHS, class _RHS> 772*331d2159SEric Fiselier inline _LIBCPP_INLINE_VISIBILITY 773*331d2159SEric Fiselier void __do_compare_assert(long, _LHS const&, _RHS const&) {} 7743e519524SHoward Hinnant}; 7753e519524SHoward Hinnant 776145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7773e519524SHoward Hinnant 778c8edcb36SHoward Hinnant// Precondition: __x != 0 779c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 780c206366fSHoward Hinnantunsigned 781c206366fSHoward Hinnant__ctz(unsigned __x) 782c206366fSHoward Hinnant{ 783c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 784c206366fSHoward Hinnant} 785c206366fSHoward Hinnant 786c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 787c206366fSHoward Hinnantunsigned long 788c206366fSHoward Hinnant__ctz(unsigned long __x) 789c206366fSHoward Hinnant{ 790c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 791c206366fSHoward Hinnant} 792c206366fSHoward Hinnant 793c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 794c206366fSHoward Hinnantunsigned long long 795c206366fSHoward Hinnant__ctz(unsigned long long __x) 796c206366fSHoward Hinnant{ 797c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 798c206366fSHoward Hinnant} 799c8edcb36SHoward Hinnant 800c8edcb36SHoward Hinnant// Precondition: __x != 0 801c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 802c206366fSHoward Hinnantunsigned 803c206366fSHoward Hinnant__clz(unsigned __x) 804c206366fSHoward Hinnant{ 805c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 806c206366fSHoward Hinnant} 807c206366fSHoward Hinnant 808c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 809c206366fSHoward Hinnantunsigned long 810c206366fSHoward Hinnant__clz(unsigned long __x) 811c206366fSHoward Hinnant{ 812c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 813c206366fSHoward Hinnant} 814c206366fSHoward Hinnant 815c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 816c206366fSHoward Hinnantunsigned long long 817c206366fSHoward Hinnant__clz(unsigned long long __x) 818c206366fSHoward Hinnant{ 819c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 820c206366fSHoward Hinnant} 821c8edcb36SHoward Hinnant 822c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 823c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 824c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 825c8edcb36SHoward Hinnant 8263e519524SHoward Hinnant// all_of 8273e519524SHoward Hinnant 8283e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8303e519524SHoward Hinnantbool 8313e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8323e519524SHoward Hinnant{ 8333e519524SHoward Hinnant for (; __first != __last; ++__first) 8343e519524SHoward Hinnant if (!__pred(*__first)) 8353e519524SHoward Hinnant return false; 8363e519524SHoward Hinnant return true; 8373e519524SHoward Hinnant} 8383e519524SHoward Hinnant 8393e519524SHoward Hinnant// any_of 8403e519524SHoward Hinnant 8413e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8433e519524SHoward Hinnantbool 8443e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8453e519524SHoward Hinnant{ 8463e519524SHoward Hinnant for (; __first != __last; ++__first) 8473e519524SHoward Hinnant if (__pred(*__first)) 8483e519524SHoward Hinnant return true; 8493e519524SHoward Hinnant return false; 8503e519524SHoward Hinnant} 8513e519524SHoward Hinnant 8523e519524SHoward Hinnant// none_of 8533e519524SHoward Hinnant 8543e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8563e519524SHoward Hinnantbool 8573e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8583e519524SHoward Hinnant{ 8593e519524SHoward Hinnant for (; __first != __last; ++__first) 8603e519524SHoward Hinnant if (__pred(*__first)) 8613e519524SHoward Hinnant return false; 8623e519524SHoward Hinnant return true; 8633e519524SHoward Hinnant} 8643e519524SHoward Hinnant 8653e519524SHoward Hinnant// for_each 8663e519524SHoward Hinnant 8673e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8693e519524SHoward Hinnant_Function 8703e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8713e519524SHoward Hinnant{ 8723e519524SHoward Hinnant for (; __first != __last; ++__first) 8733e519524SHoward Hinnant __f(*__first); 874251c6291SDimitry Andric return _LIBCPP_EXPLICIT_MOVE(__f); // explicitly moved for (emulated) C++03 8753e519524SHoward Hinnant} 8763e519524SHoward Hinnant 8773e519524SHoward Hinnant// find 8783e519524SHoward Hinnant 8793e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8813e519524SHoward Hinnant_InputIterator 882e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8833e519524SHoward Hinnant{ 8843e519524SHoward Hinnant for (; __first != __last; ++__first) 885e4383379SHoward Hinnant if (*__first == __value_) 8863e519524SHoward Hinnant break; 8873e519524SHoward Hinnant return __first; 8883e519524SHoward Hinnant} 8893e519524SHoward Hinnant 8903e519524SHoward Hinnant// find_if 8913e519524SHoward Hinnant 8923e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8943e519524SHoward Hinnant_InputIterator 8953e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8963e519524SHoward Hinnant{ 8973e519524SHoward Hinnant for (; __first != __last; ++__first) 8983e519524SHoward Hinnant if (__pred(*__first)) 8993e519524SHoward Hinnant break; 9003e519524SHoward Hinnant return __first; 9013e519524SHoward Hinnant} 9023e519524SHoward Hinnant 9033e519524SHoward Hinnant// find_if_not 9043e519524SHoward Hinnant 9053e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 9063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 9073e519524SHoward Hinnant_InputIterator 9083e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 9093e519524SHoward Hinnant{ 9103e519524SHoward Hinnant for (; __first != __last; ++__first) 9113e519524SHoward Hinnant if (!__pred(*__first)) 9123e519524SHoward Hinnant break; 9133e519524SHoward Hinnant return __first; 9143e519524SHoward Hinnant} 9153e519524SHoward Hinnant 9163e519524SHoward Hinnant// find_end 9173e519524SHoward Hinnant 9183e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 9193e519524SHoward Hinnant_ForwardIterator1 9203e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9213e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9223e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9233e519524SHoward Hinnant{ 9243e519524SHoward Hinnant // modeled after search algorithm 9253e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9263e519524SHoward Hinnant if (__first2 == __last2) 9273e519524SHoward Hinnant return __r; 9283e519524SHoward Hinnant while (true) 9293e519524SHoward Hinnant { 9303e519524SHoward Hinnant while (true) 9313e519524SHoward Hinnant { 9323e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9333e519524SHoward Hinnant return __r; // (or __last1 if never found) 9343e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9353e519524SHoward Hinnant break; 9363e519524SHoward Hinnant ++__first1; 9373e519524SHoward Hinnant } 9383e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9393e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9403e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9413e519524SHoward Hinnant while (true) 9423e519524SHoward Hinnant { 9433e519524SHoward Hinnant if (++__m2 == __last2) 9443e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9453e519524SHoward Hinnant __r = __first1; 9463e519524SHoward Hinnant ++__first1; 9473e519524SHoward Hinnant break; 9483e519524SHoward Hinnant } 9493e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9503e519524SHoward Hinnant return __r; 9513e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9523e519524SHoward Hinnant { 9533e519524SHoward Hinnant ++__first1; 9543e519524SHoward Hinnant break; 9553e519524SHoward Hinnant } // else there is a match, check next elements 9563e519524SHoward Hinnant } 9573e519524SHoward Hinnant } 9583e519524SHoward Hinnant} 9593e519524SHoward Hinnant 9603e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9613e519524SHoward Hinnant_BidirectionalIterator1 9623e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9633e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9643e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9653e519524SHoward Hinnant{ 9663e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9673e519524SHoward Hinnant if (__first2 == __last2) 9683e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9693e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9703e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9713e519524SHoward Hinnant --__l2; 9723e519524SHoward Hinnant while (true) 9733e519524SHoward Hinnant { 9743e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9753e519524SHoward Hinnant while (true) 9763e519524SHoward Hinnant { 9773e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9783e519524SHoward Hinnant return __last1; 9793e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9803e519524SHoward Hinnant break; 9813e519524SHoward Hinnant } 9823e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9833e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9843e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9853e519524SHoward Hinnant while (true) 9863e519524SHoward Hinnant { 9873e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9883e519524SHoward Hinnant return __m1; 9893e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9903e519524SHoward Hinnant return __last1; 9913e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9923e519524SHoward Hinnant { 9933e519524SHoward Hinnant break; 9943e519524SHoward Hinnant } // else there is a match, check next elements 9953e519524SHoward Hinnant } 9963e519524SHoward Hinnant } 9973e519524SHoward Hinnant} 9983e519524SHoward Hinnant 9993e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 10009b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 10013e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 10023e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 10033e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 10043e519524SHoward Hinnant{ 10053e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 10063e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 10073e519524SHoward Hinnant if (__len2 == 0) 10083e519524SHoward Hinnant return __last1; 10093e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 10103e519524SHoward Hinnant if (__len1 < __len2) 10113e519524SHoward Hinnant return __last1; 10123e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 10133e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 10143e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 10153e519524SHoward Hinnant --__l2; 10163e519524SHoward Hinnant while (true) 10173e519524SHoward Hinnant { 10183e519524SHoward Hinnant while (true) 10193e519524SHoward Hinnant { 10203e519524SHoward Hinnant if (__s == __l1) 10213e519524SHoward Hinnant return __last1; 10223e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10233e519524SHoward Hinnant break; 10243e519524SHoward Hinnant } 10253e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10263e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10273e519524SHoward Hinnant while (true) 10283e519524SHoward Hinnant { 10293e519524SHoward Hinnant if (__m2 == __first2) 10303e519524SHoward Hinnant return __m1; 10313e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10323e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10333e519524SHoward Hinnant { 10343e519524SHoward Hinnant break; 10353e519524SHoward Hinnant } 10363e519524SHoward Hinnant } 10373e519524SHoward Hinnant } 10383e519524SHoward Hinnant} 10393e519524SHoward Hinnant 10403e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10423e519524SHoward Hinnant_ForwardIterator1 10433e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10443e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10453e519524SHoward Hinnant{ 1046ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10473e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10483e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10493e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10503e519524SHoward Hinnant} 10513e519524SHoward Hinnant 10523e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10543e519524SHoward Hinnant_ForwardIterator1 10553e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10563e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10573e519524SHoward Hinnant{ 10583e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10593e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1060ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10613e519524SHoward Hinnant} 10623e519524SHoward Hinnant 10633e519524SHoward Hinnant// find_first_of 10643e519524SHoward Hinnant 10653e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10669b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10679b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10683e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10693e519524SHoward Hinnant{ 10703e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10713e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10723e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10733e519524SHoward Hinnant return __first1; 10743e519524SHoward Hinnant return __last1; 10753e519524SHoward Hinnant} 10763e519524SHoward Hinnant 10779b0af34dSMarshall Clow 10789b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10799b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 10809b0af34dSMarshall Clow_ForwardIterator1 10819b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10829b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10839b0af34dSMarshall Clow{ 10849b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10859b0af34dSMarshall Clow} 10869b0af34dSMarshall Clow 10873e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10893e519524SHoward Hinnant_ForwardIterator1 10903e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10913e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10923e519524SHoward Hinnant{ 10933e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10943e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10959b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10963e519524SHoward Hinnant} 10973e519524SHoward Hinnant 10983e519524SHoward Hinnant// adjacent_find 10993e519524SHoward Hinnant 11003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 11013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11023e519524SHoward Hinnant_ForwardIterator 11033e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 11043e519524SHoward Hinnant{ 11053e519524SHoward Hinnant if (__first != __last) 11063e519524SHoward Hinnant { 11073e519524SHoward Hinnant _ForwardIterator __i = __first; 11083e519524SHoward Hinnant while (++__i != __last) 11093e519524SHoward Hinnant { 11103e519524SHoward Hinnant if (__pred(*__first, *__i)) 11113e519524SHoward Hinnant return __first; 11123e519524SHoward Hinnant __first = __i; 11133e519524SHoward Hinnant } 11143e519524SHoward Hinnant } 11153e519524SHoward Hinnant return __last; 11163e519524SHoward Hinnant} 11173e519524SHoward Hinnant 11183e519524SHoward Hinnanttemplate <class _ForwardIterator> 11193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11203e519524SHoward Hinnant_ForwardIterator 11213e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11223e519524SHoward Hinnant{ 11233e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1124ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11253e519524SHoward Hinnant} 11263e519524SHoward Hinnant 11273e519524SHoward Hinnant// count 11283e519524SHoward Hinnant 11293e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11313e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1132e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11333e519524SHoward Hinnant{ 11343e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11353e519524SHoward Hinnant for (; __first != __last; ++__first) 1136e4383379SHoward Hinnant if (*__first == __value_) 11373e519524SHoward Hinnant ++__r; 11383e519524SHoward Hinnant return __r; 11393e519524SHoward Hinnant} 11403e519524SHoward Hinnant 11413e519524SHoward Hinnant// count_if 11423e519524SHoward Hinnant 11433e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11453e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11463e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11473e519524SHoward Hinnant{ 11483e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11493e519524SHoward Hinnant for (; __first != __last; ++__first) 11503e519524SHoward Hinnant if (__pred(*__first)) 11513e519524SHoward Hinnant ++__r; 11523e519524SHoward Hinnant return __r; 11533e519524SHoward Hinnant} 11543e519524SHoward Hinnant 11553e519524SHoward Hinnant// mismatch 11563e519524SHoward Hinnant 11573e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11593e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11603e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11613e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11623e519524SHoward Hinnant{ 1163bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11643e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11653e519524SHoward Hinnant break; 11663e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11673e519524SHoward Hinnant} 11683e519524SHoward Hinnant 11693e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11713e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11723e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11733e519524SHoward Hinnant{ 11743e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11753e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1176ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11773e519524SHoward Hinnant} 11783e519524SHoward Hinnant 11790b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11800b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11810b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11820b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11830b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11840b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11850b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11860b0bbd2fSMarshall Clow{ 1187bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11880b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11890b0bbd2fSMarshall Clow break; 11900b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11910b0bbd2fSMarshall Clow} 11920b0bbd2fSMarshall Clow 11930b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11940b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11950b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11960b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11970b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11980b0bbd2fSMarshall Clow{ 11990b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12000b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12010b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 12020b0bbd2fSMarshall Clow} 12030b0bbd2fSMarshall Clow#endif 12040b0bbd2fSMarshall Clow 12053e519524SHoward Hinnant// equal 12063e519524SHoward Hinnant 12073e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12093e519524SHoward Hinnantbool 12103e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 12113e519524SHoward Hinnant{ 1212910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12133e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12143e519524SHoward Hinnant return false; 12153e519524SHoward Hinnant return true; 12163e519524SHoward Hinnant} 12173e519524SHoward Hinnant 12183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 12193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12203e519524SHoward Hinnantbool 12213e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12223e519524SHoward Hinnant{ 12233e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12243e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1225ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12263e519524SHoward Hinnant} 12273e519524SHoward Hinnant 12280b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12290b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12300b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12310b0bbd2fSMarshall Clowbool 12320b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12330b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12340b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12350b0bbd2fSMarshall Clow{ 1236910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12370b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12380b0bbd2fSMarshall Clow return false; 12390b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12400b0bbd2fSMarshall Clow} 12410b0bbd2fSMarshall Clow 12420b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12430b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12440b0bbd2fSMarshall Clowbool 12450b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12460b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12470b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12480b0bbd2fSMarshall Clow{ 12490b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12500b0bbd2fSMarshall Clow return false; 12510b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12520b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12530b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12540b0bbd2fSMarshall Clow} 12550b0bbd2fSMarshall Clow 12560b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12570b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12580b0bbd2fSMarshall Clowbool 12590b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12600b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12610b0bbd2fSMarshall Clow{ 12620b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12630b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12640b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12650b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12660b0bbd2fSMarshall Clow} 12670b0bbd2fSMarshall Clow 12680b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12690b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12700b0bbd2fSMarshall Clowbool 12710b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12720b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12730b0bbd2fSMarshall Clow{ 12740b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12750b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12760b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12770b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12780b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12790b0bbd2fSMarshall Clow} 12800b0bbd2fSMarshall Clow#endif 12810b0bbd2fSMarshall Clow 12823e519524SHoward Hinnant// is_permutation 12833e519524SHoward Hinnant 12843e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12853e519524SHoward Hinnantbool 12863e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12873e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12883e519524SHoward Hinnant{ 12893e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1290910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12913e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12923e519524SHoward Hinnant goto __not_done; 12933e519524SHoward Hinnant return true; 12943e519524SHoward Hinnant__not_done: 12953e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12963e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1297ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12983e519524SHoward Hinnant if (__l1 == _D1(1)) 12993e519524SHoward Hinnant return false; 1300ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 13013e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 13023e519524SHoward Hinnant // equal elements in [f2, l2) 13033e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13043e519524SHoward Hinnant { 13053e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 13063e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13073e519524SHoward Hinnant if (__pred(*__j, *__i)) 13083e519524SHoward Hinnant goto __next_iter; 13093e519524SHoward Hinnant { 13103e519524SHoward Hinnant // Count number of *__i in [f2, l2) 13113e519524SHoward Hinnant _D1 __c2 = 0; 13123e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13133e519524SHoward Hinnant if (__pred(*__i, *__j)) 13143e519524SHoward Hinnant ++__c2; 13153e519524SHoward Hinnant if (__c2 == 0) 13163e519524SHoward Hinnant return false; 13173e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 13183e519524SHoward Hinnant _D1 __c1 = 1; 1319ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13203e519524SHoward Hinnant if (__pred(*__i, *__j)) 13213e519524SHoward Hinnant ++__c1; 13223e519524SHoward Hinnant if (__c1 != __c2) 13233e519524SHoward Hinnant return false; 13243e519524SHoward Hinnant } 13253e519524SHoward Hinnant__next_iter:; 13263e519524SHoward Hinnant } 13273e519524SHoward Hinnant return true; 13283e519524SHoward Hinnant} 13293e519524SHoward Hinnant 13303e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13323e519524SHoward Hinnantbool 13333e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13343e519524SHoward Hinnant _ForwardIterator2 __first2) 13353e519524SHoward Hinnant{ 13363e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1338ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13393e519524SHoward Hinnant} 13403e519524SHoward Hinnant 13410b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13420b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13430b0bbd2fSMarshall Clowbool 13440b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13450b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13460b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13470b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13480b0bbd2fSMarshall Clow{ 13490b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1350847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13510b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13520b0bbd2fSMarshall Clow goto __not_done; 13530b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13540b0bbd2fSMarshall Clow__not_done: 13550b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13560b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13570b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13580b0bbd2fSMarshall Clow 13590b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1360fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13610b0bbd2fSMarshall Clow if (__l1 != __l2) 13620b0bbd2fSMarshall Clow return false; 13630b0bbd2fSMarshall Clow 13640b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13650b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13660b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13670b0bbd2fSMarshall Clow { 13680b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13690b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13700b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13710b0bbd2fSMarshall Clow goto __next_iter; 13720b0bbd2fSMarshall Clow { 13730b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13740b0bbd2fSMarshall Clow _D1 __c2 = 0; 13750b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13760b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13770b0bbd2fSMarshall Clow ++__c2; 13780b0bbd2fSMarshall Clow if (__c2 == 0) 13790b0bbd2fSMarshall Clow return false; 13800b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13810b0bbd2fSMarshall Clow _D1 __c1 = 1; 13820b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13830b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13840b0bbd2fSMarshall Clow ++__c1; 13850b0bbd2fSMarshall Clow if (__c1 != __c2) 13860b0bbd2fSMarshall Clow return false; 13870b0bbd2fSMarshall Clow } 13880b0bbd2fSMarshall Clow__next_iter:; 13890b0bbd2fSMarshall Clow } 13900b0bbd2fSMarshall Clow return true; 13910b0bbd2fSMarshall Clow} 13920b0bbd2fSMarshall Clow 13930b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13940b0bbd2fSMarshall Clowbool 13950b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13960b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13970b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13980b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13990b0bbd2fSMarshall Clow{ 14000b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 14010b0bbd2fSMarshall Clow return false; 14020b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 14030b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 14040b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 14050b0bbd2fSMarshall Clow} 14060b0bbd2fSMarshall Clow 14070b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 14080b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14090b0bbd2fSMarshall Clowbool 14100b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14110b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 14120b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 14130b0bbd2fSMarshall Clow{ 14140b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 14150b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 14160b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14170b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14180b0bbd2fSMarshall Clow} 14190b0bbd2fSMarshall Clow 14200b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14210b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14220b0bbd2fSMarshall Clowbool 14230b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14240b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14250b0bbd2fSMarshall Clow{ 14260b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14270b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14280b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14290b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14300b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14310b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14320b0bbd2fSMarshall Clow} 14330b0bbd2fSMarshall Clow#endif 14340b0bbd2fSMarshall Clow 14353e519524SHoward Hinnant// search 14363e519524SHoward Hinnant 14373e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 143828cc4ddeSMarshall Clowpair<_ForwardIterator1, _ForwardIterator1> 14393e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14403e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14413e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14423e519524SHoward Hinnant{ 14433e519524SHoward Hinnant if (__first2 == __last2) 144428cc4ddeSMarshall Clow return make_pair(__first1, __first1); // Everything matches an empty sequence 14453e519524SHoward Hinnant while (true) 14463e519524SHoward Hinnant { 14473e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14483e519524SHoward Hinnant while (true) 14493e519524SHoward Hinnant { 14503e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 145128cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14523e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14533e519524SHoward Hinnant break; 14543e519524SHoward Hinnant ++__first1; 14553e519524SHoward Hinnant } 14563e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14573e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14583e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14593e519524SHoward Hinnant while (true) 14603e519524SHoward Hinnant { 14613e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 146228cc4ddeSMarshall Clow return make_pair(__first1, __m1); 14633e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 146428cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14653e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14663e519524SHoward Hinnant { 14673e519524SHoward Hinnant ++__first1; 14683e519524SHoward Hinnant break; 14693e519524SHoward Hinnant } // else there is a match, check next elements 14703e519524SHoward Hinnant } 14713e519524SHoward Hinnant } 14723e519524SHoward Hinnant} 14733e519524SHoward Hinnant 14743e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 147528cc4ddeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 147628cc4ddeSMarshall Clowpair<_RandomAccessIterator1, _RandomAccessIterator1> 14773e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14783e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14793e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14803e519524SHoward Hinnant{ 148128cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator1>::difference_type _D1; 148228cc4ddeSMarshall Clow typedef typename iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14833e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 148428cc4ddeSMarshall Clow const _D2 __len2 = __last2 - __first2; 14853e519524SHoward Hinnant if (__len2 == 0) 148628cc4ddeSMarshall Clow return make_pair(__first1, __first1); 148728cc4ddeSMarshall Clow const _D1 __len1 = __last1 - __first1; 14883e519524SHoward Hinnant if (__len1 < __len2) 148928cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14903e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14913e519524SHoward Hinnant while (true) 14923e519524SHoward Hinnant { 14933e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14943e519524SHoward Hinnant while (true) 14953e519524SHoward Hinnant { 14963e519524SHoward Hinnant if (__first1 == __s) 149728cc4ddeSMarshall Clow return make_pair(__last1, __last1); 14983e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14993e519524SHoward Hinnant break; 15003e519524SHoward Hinnant ++__first1; 15013e519524SHoward Hinnant } 1502b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15033e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 15043e519524SHoward Hinnant { 15053e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15063e519524SHoward Hinnant goto __phase2; 15073e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15083e519524SHoward Hinnant goto __phase2; 15093e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15103e519524SHoward Hinnant goto __phase2; 15113e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 15123e519524SHoward Hinnant goto __phase2; 15133e519524SHoward Hinnant ++__first1; 15143e519524SHoward Hinnant } 15153e519524SHoward Hinnant switch (__s - __first1) 15163e519524SHoward Hinnant { 15173e519524SHoward Hinnant case 3: 15183e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15193e519524SHoward Hinnant break; 15203e519524SHoward Hinnant ++__first1; 15213e519524SHoward Hinnant case 2: 15223e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15233e519524SHoward Hinnant break; 15243e519524SHoward Hinnant ++__first1; 15253e519524SHoward Hinnant case 1: 15263e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15273e519524SHoward Hinnant break; 15283e519524SHoward Hinnant case 0: 152928cc4ddeSMarshall Clow return make_pair(__last1, __last1); 15303e519524SHoward Hinnant } 15313e519524SHoward Hinnant __phase2: 1532b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15333e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15343e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15353e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15363e519524SHoward Hinnant while (true) 15373e519524SHoward Hinnant { 15383e519524SHoward Hinnant if (++__m2 == __last2) 153928cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15403e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15413e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15423e519524SHoward Hinnant { 15433e519524SHoward Hinnant ++__first1; 15443e519524SHoward Hinnant break; 15453e519524SHoward Hinnant } 15463e519524SHoward Hinnant } 1547b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15483e519524SHoward Hinnant ++__m2; 15493e519524SHoward Hinnant ++__m1; 15503e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15513e519524SHoward Hinnant { 15523e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15533e519524SHoward Hinnant goto __continue; 15543e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15553e519524SHoward Hinnant goto __continue; 15563e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15573e519524SHoward Hinnant goto __continue; 15583e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15593e519524SHoward Hinnant goto __continue; 15603e519524SHoward Hinnant ++__m1; 15613e519524SHoward Hinnant ++__m2; 15623e519524SHoward Hinnant } 15633e519524SHoward Hinnant switch (__last2 - __m2) 15643e519524SHoward Hinnant { 15653e519524SHoward Hinnant case 3: 15663e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15673e519524SHoward Hinnant break; 15683e519524SHoward Hinnant ++__m1; 15693e519524SHoward Hinnant ++__m2; 15703e519524SHoward Hinnant case 2: 15713e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15723e519524SHoward Hinnant break; 15733e519524SHoward Hinnant ++__m1; 15743e519524SHoward Hinnant ++__m2; 15753e519524SHoward Hinnant case 1: 15763e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15773e519524SHoward Hinnant break; 15783e519524SHoward Hinnant case 0: 157928cc4ddeSMarshall Clow return make_pair(__first1, __first1 + __len2); 15803e519524SHoward Hinnant } 15813e519524SHoward Hinnant __continue: 15823e519524SHoward Hinnant ++__first1; 1583b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15843e519524SHoward Hinnant } 15853e519524SHoward Hinnant} 15863e519524SHoward Hinnant 15873e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15893e519524SHoward Hinnant_ForwardIterator1 15903e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15913e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15923e519524SHoward Hinnant{ 1593ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15943e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 159528cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 159628cc4ddeSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()) 159728cc4ddeSMarshall Clow .first; 15983e519524SHoward Hinnant} 15993e519524SHoward Hinnant 16003e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 16013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16023e519524SHoward Hinnant_ForwardIterator1 16033e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 16043e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 16053e519524SHoward Hinnant{ 160628cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 160728cc4ddeSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1608ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 16093e519524SHoward Hinnant} 16103e519524SHoward Hinnant 16113e519524SHoward Hinnant// search_n 16123e519524SHoward Hinnant 16133e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 16143e519524SHoward Hinnant_ForwardIterator 16153e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1616e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 16173e519524SHoward Hinnant{ 16183e519524SHoward Hinnant if (__count <= 0) 16193e519524SHoward Hinnant return __first; 16203e519524SHoward Hinnant while (true) 16213e519524SHoward Hinnant { 1622e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16233e519524SHoward Hinnant while (true) 16243e519524SHoward Hinnant { 1625e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16263e519524SHoward Hinnant return __last; 1627e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16283e519524SHoward Hinnant break; 16293e519524SHoward Hinnant ++__first; 16303e519524SHoward Hinnant } 1631e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16323e519524SHoward Hinnant _ForwardIterator __m = __first; 16333e519524SHoward Hinnant _Size __c(0); 16343e519524SHoward Hinnant while (true) 16353e519524SHoward Hinnant { 16363e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16373e519524SHoward Hinnant return __first; 16383e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16393e519524SHoward Hinnant return __last; 1640e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16413e519524SHoward Hinnant { 16423e519524SHoward Hinnant __first = __m; 16433e519524SHoward Hinnant ++__first; 16443e519524SHoward Hinnant break; 16453e519524SHoward Hinnant } // else there is a match, check next elements 16463e519524SHoward Hinnant } 16473e519524SHoward Hinnant } 16483e519524SHoward Hinnant} 16493e519524SHoward Hinnant 16503e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16513e519524SHoward Hinnant_RandomAccessIterator 16523e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1653e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16543e519524SHoward Hinnant{ 16553e519524SHoward Hinnant if (__count <= 0) 16563e519524SHoward Hinnant return __first; 16573e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16583e519524SHoward Hinnant if (__len < __count) 16593e519524SHoward Hinnant return __last; 16603e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16613e519524SHoward Hinnant while (true) 16623e519524SHoward Hinnant { 1663e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16643e519524SHoward Hinnant while (true) 16653e519524SHoward Hinnant { 1666b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16673e519524SHoward Hinnant return __last; 1668e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16693e519524SHoward Hinnant break; 16703e519524SHoward Hinnant ++__first; 16713e519524SHoward Hinnant } 1672e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16733e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16743e519524SHoward Hinnant _Size __c(0); 16753e519524SHoward Hinnant while (true) 16763e519524SHoward Hinnant { 16773e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16783e519524SHoward Hinnant return __first; 16793e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1680e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16813e519524SHoward Hinnant { 16823e519524SHoward Hinnant __first = __m; 16833e519524SHoward Hinnant ++__first; 16843e519524SHoward Hinnant break; 16853e519524SHoward Hinnant } // else there is a match, check next elements 16863e519524SHoward Hinnant } 16873e519524SHoward Hinnant } 16883e519524SHoward Hinnant} 16893e519524SHoward Hinnant 16903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16923e519524SHoward Hinnant_ForwardIterator 16933e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1694e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16953e519524SHoward Hinnant{ 1696ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 169751544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 169851544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16993e519524SHoward Hinnant} 17003e519524SHoward Hinnant 17013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 17023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17033e519524SHoward Hinnant_ForwardIterator 1704e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 170751544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 170851544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 17093e519524SHoward Hinnant} 17103e519524SHoward Hinnant 17113e519524SHoward Hinnant// copy 17123e519524SHoward Hinnanttemplate <class _Iter> 17133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17143e519524SHoward Hinnant_Iter 17153e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17163e519524SHoward Hinnant{ 17173e519524SHoward Hinnant return __i; 17183e519524SHoward Hinnant} 17193e519524SHoward Hinnant 17203e519524SHoward Hinnanttemplate <class _Tp> 17213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17223e519524SHoward Hinnanttypename enable_if 17233e519524SHoward Hinnant< 1724ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17253e519524SHoward Hinnant _Tp* 17263e519524SHoward Hinnant>::type 17273e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17283e519524SHoward Hinnant{ 17293e519524SHoward Hinnant return __i.base(); 17303e519524SHoward Hinnant} 17313e519524SHoward Hinnant 1732fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1733fc88dbd2SHoward Hinnant 17343e519524SHoward Hinnanttemplate <class _Tp> 17353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17363e519524SHoward Hinnanttypename enable_if 17373e519524SHoward Hinnant< 1738ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17393e519524SHoward Hinnant _Tp* 17403e519524SHoward Hinnant>::type 17413e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17423e519524SHoward Hinnant{ 17433e519524SHoward Hinnant return __i.base(); 17443e519524SHoward Hinnant} 17453e519524SHoward Hinnant 1746fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1747fc88dbd2SHoward Hinnant 17483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17503e519524SHoward Hinnant_OutputIterator 17513e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17523e519524SHoward Hinnant{ 1753910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17543e519524SHoward Hinnant *__result = *__first; 17553e519524SHoward Hinnant return __result; 17563e519524SHoward Hinnant} 17573e519524SHoward Hinnant 17583e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17603e519524SHoward Hinnanttypename enable_if 17613e519524SHoward Hinnant< 17623e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1763ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17643e519524SHoward Hinnant _Up* 17653e519524SHoward Hinnant>::type 17663e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17673e519524SHoward Hinnant{ 17683e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17695b312052SMarshall Clow if (__n > 0) 1770ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17713e519524SHoward Hinnant return __result + __n; 17723e519524SHoward Hinnant} 17733e519524SHoward Hinnant 17743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17763e519524SHoward Hinnant_OutputIterator 17773e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17783e519524SHoward Hinnant{ 1779ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17803e519524SHoward Hinnant} 17813e519524SHoward Hinnant 17823e519524SHoward Hinnant// copy_backward 17833e519524SHoward Hinnant 1784d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17863e519524SHoward Hinnant_OutputIterator 1787d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17883e519524SHoward Hinnant{ 17893e519524SHoward Hinnant while (__first != __last) 17903e519524SHoward Hinnant *--__result = *--__last; 17913e519524SHoward Hinnant return __result; 17923e519524SHoward Hinnant} 17933e519524SHoward Hinnant 17943e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17963e519524SHoward Hinnanttypename enable_if 17973e519524SHoward Hinnant< 17983e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1799ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18003e519524SHoward Hinnant _Up* 18013e519524SHoward Hinnant>::type 18023e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18033e519524SHoward Hinnant{ 18043e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18055b312052SMarshall Clow if (__n > 0) 18065b312052SMarshall Clow { 18073e519524SHoward Hinnant __result -= __n; 1808ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18095b312052SMarshall Clow } 18103e519524SHoward Hinnant return __result; 18113e519524SHoward Hinnant} 18123e519524SHoward Hinnant 18133e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18153e519524SHoward Hinnant_BidirectionalIterator2 18163e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18173e519524SHoward Hinnant _BidirectionalIterator2 __result) 18183e519524SHoward Hinnant{ 1819ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18203e519524SHoward Hinnant} 18213e519524SHoward Hinnant 18223e519524SHoward Hinnant// copy_if 18233e519524SHoward Hinnant 18243e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18263e519524SHoward Hinnant_OutputIterator 18273e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18283e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18293e519524SHoward Hinnant{ 18303e519524SHoward Hinnant for (; __first != __last; ++__first) 18313e519524SHoward Hinnant { 18323e519524SHoward Hinnant if (__pred(*__first)) 18333e519524SHoward Hinnant { 18343e519524SHoward Hinnant *__result = *__first; 18353e519524SHoward Hinnant ++__result; 18363e519524SHoward Hinnant } 18373e519524SHoward Hinnant } 18383e519524SHoward Hinnant return __result; 18393e519524SHoward Hinnant} 18403e519524SHoward Hinnant 18413e519524SHoward Hinnant// copy_n 18423e519524SHoward Hinnant 18433e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18453e519524SHoward Hinnanttypename enable_if 18463e519524SHoward Hinnant< 18473e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18483e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18493e519524SHoward Hinnant _OutputIterator 18503e519524SHoward Hinnant>::type 185151544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18523e519524SHoward Hinnant{ 185351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 185451544023SEric Fiselier _IntegralSize __n = __orig_n; 185599847d2bSHoward Hinnant if (__n > 0) 185699847d2bSHoward Hinnant { 18573e519524SHoward Hinnant *__result = *__first; 185899847d2bSHoward Hinnant ++__result; 185999847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 186099847d2bSHoward Hinnant { 186199847d2bSHoward Hinnant ++__first; 186299847d2bSHoward Hinnant *__result = *__first; 186399847d2bSHoward Hinnant ++__result; 186499847d2bSHoward Hinnant } 186599847d2bSHoward Hinnant } 18663e519524SHoward Hinnant return __result; 18673e519524SHoward Hinnant} 18683e519524SHoward Hinnant 18693e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18713e519524SHoward Hinnanttypename enable_if 18723e519524SHoward Hinnant< 18733e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18743e519524SHoward Hinnant _OutputIterator 18753e519524SHoward Hinnant>::type 187651544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18773e519524SHoward Hinnant{ 187851544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 187951544023SEric Fiselier _IntegralSize __n = __orig_n; 1880ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18813e519524SHoward Hinnant} 18823e519524SHoward Hinnant 18833e519524SHoward Hinnant// move 18843e519524SHoward Hinnant 18853e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18873e519524SHoward Hinnant_OutputIterator 18883e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18893e519524SHoward Hinnant{ 1890910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1891ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18923e519524SHoward Hinnant return __result; 18933e519524SHoward Hinnant} 18943e519524SHoward Hinnant 18953e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18973e519524SHoward Hinnanttypename enable_if 18983e519524SHoward Hinnant< 18993e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1900ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19013e519524SHoward Hinnant _Up* 19023e519524SHoward Hinnant>::type 19033e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19043e519524SHoward Hinnant{ 19053e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19065b312052SMarshall Clow if (__n > 0) 1907ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19083e519524SHoward Hinnant return __result + __n; 19093e519524SHoward Hinnant} 19103e519524SHoward Hinnant 19113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19133e519524SHoward Hinnant_OutputIterator 19143e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19153e519524SHoward Hinnant{ 1916ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19173e519524SHoward Hinnant} 19183e519524SHoward Hinnant 19193e519524SHoward Hinnant// move_backward 19203e519524SHoward Hinnant 19213e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19233e519524SHoward Hinnant_OutputIterator 19243e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19253e519524SHoward Hinnant{ 19263e519524SHoward Hinnant while (__first != __last) 1927ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19283e519524SHoward Hinnant return __result; 19293e519524SHoward Hinnant} 19303e519524SHoward Hinnant 19313e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19333e519524SHoward Hinnanttypename enable_if 19343e519524SHoward Hinnant< 19353e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1936ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19373e519524SHoward Hinnant _Up* 19383e519524SHoward Hinnant>::type 19393e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19403e519524SHoward Hinnant{ 19413e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19425b312052SMarshall Clow if (__n > 0) 19435b312052SMarshall Clow { 19443e519524SHoward Hinnant __result -= __n; 1945ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19465b312052SMarshall Clow } 19473e519524SHoward Hinnant return __result; 19483e519524SHoward Hinnant} 19493e519524SHoward Hinnant 19503e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19513e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19523e519524SHoward Hinnant_BidirectionalIterator2 19533e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19543e519524SHoward Hinnant _BidirectionalIterator2 __result) 19553e519524SHoward Hinnant{ 1956ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19573e519524SHoward Hinnant} 19583e519524SHoward Hinnant 19593e519524SHoward Hinnant// iter_swap 19603e519524SHoward Hinnant 1961a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19623e519524SHoward Hinnant 19633e519524SHoward Hinnant// transform 19643e519524SHoward Hinnant 19653e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19663e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19673e519524SHoward Hinnant_OutputIterator 19683e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19693e519524SHoward Hinnant{ 1970910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19713e519524SHoward Hinnant *__result = __op(*__first); 19723e519524SHoward Hinnant return __result; 19733e519524SHoward Hinnant} 19743e519524SHoward Hinnant 19753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19773e519524SHoward Hinnant_OutputIterator 19783e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19793e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19803e519524SHoward Hinnant{ 1981910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19823e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19833e519524SHoward Hinnant return __result; 19843e519524SHoward Hinnant} 19853e519524SHoward Hinnant 19863e519524SHoward Hinnant// replace 19873e519524SHoward Hinnant 19883e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19903e519524SHoward Hinnantvoid 19913e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19923e519524SHoward Hinnant{ 19933e519524SHoward Hinnant for (; __first != __last; ++__first) 19943e519524SHoward Hinnant if (*__first == __old_value) 19953e519524SHoward Hinnant *__first = __new_value; 19963e519524SHoward Hinnant} 19973e519524SHoward Hinnant 19983e519524SHoward Hinnant// replace_if 19993e519524SHoward Hinnant 20003e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 20013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20023e519524SHoward Hinnantvoid 20033e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20043e519524SHoward Hinnant{ 20053e519524SHoward Hinnant for (; __first != __last; ++__first) 20063e519524SHoward Hinnant if (__pred(*__first)) 20073e519524SHoward Hinnant *__first = __new_value; 20083e519524SHoward Hinnant} 20093e519524SHoward Hinnant 20103e519524SHoward Hinnant// replace_copy 20113e519524SHoward Hinnant 20123e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20143e519524SHoward Hinnant_OutputIterator 20153e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20163e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20173e519524SHoward Hinnant{ 2018910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20193e519524SHoward Hinnant if (*__first == __old_value) 20203e519524SHoward Hinnant *__result = __new_value; 20213e519524SHoward Hinnant else 20223e519524SHoward Hinnant *__result = *__first; 20233e519524SHoward Hinnant return __result; 20243e519524SHoward Hinnant} 20253e519524SHoward Hinnant 20263e519524SHoward Hinnant// replace_copy_if 20273e519524SHoward Hinnant 20283e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20303e519524SHoward Hinnant_OutputIterator 20313e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20323e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20333e519524SHoward Hinnant{ 2034910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20353e519524SHoward Hinnant if (__pred(*__first)) 20363e519524SHoward Hinnant *__result = __new_value; 20373e519524SHoward Hinnant else 20383e519524SHoward Hinnant *__result = *__first; 20393e519524SHoward Hinnant return __result; 20403e519524SHoward Hinnant} 20413e519524SHoward Hinnant 20423e519524SHoward Hinnant// fill_n 20433e519524SHoward Hinnant 20443e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20463e519524SHoward Hinnant_OutputIterator 20470f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20483e519524SHoward Hinnant{ 2049910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2050e4383379SHoward Hinnant *__first = __value_; 20513e519524SHoward Hinnant return __first; 20523e519524SHoward Hinnant} 20533e519524SHoward Hinnant 20540f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20560f242beaSHoward Hinnanttypename enable_if 20570f242beaSHoward Hinnant< 20580f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20590f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20600f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20610f242beaSHoward Hinnant _Tp* 20620f242beaSHoward Hinnant>::type 20630f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20643e519524SHoward Hinnant{ 20653e519524SHoward Hinnant if (__n > 0) 2066e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20673e519524SHoward Hinnant return __first + __n; 20683e519524SHoward Hinnant} 20693e519524SHoward Hinnant 20703e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20723e519524SHoward Hinnant_OutputIterator 2073e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20743e519524SHoward Hinnant{ 207551544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20763e519524SHoward Hinnant} 20773e519524SHoward Hinnant 20783e519524SHoward Hinnant// fill 20793e519524SHoward Hinnant 20803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20823e519524SHoward Hinnantvoid 2083e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20843e519524SHoward Hinnant{ 20853e519524SHoward Hinnant for (; __first != __last; ++__first) 2086e4383379SHoward Hinnant *__first = __value_; 20873e519524SHoward Hinnant} 20883e519524SHoward Hinnant 20893e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20903e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20913e519524SHoward Hinnantvoid 2092e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20933e519524SHoward Hinnant{ 2094e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20953e519524SHoward Hinnant} 20963e519524SHoward Hinnant 20973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20993e519524SHoward Hinnantvoid 2100e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21013e519524SHoward Hinnant{ 2102e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21033e519524SHoward Hinnant} 21043e519524SHoward Hinnant 21053e519524SHoward Hinnant// generate 21063e519524SHoward Hinnant 21073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21093e519524SHoward Hinnantvoid 21103e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21113e519524SHoward Hinnant{ 21123e519524SHoward Hinnant for (; __first != __last; ++__first) 21133e519524SHoward Hinnant *__first = __gen(); 21143e519524SHoward Hinnant} 21153e519524SHoward Hinnant 21163e519524SHoward Hinnant// generate_n 21173e519524SHoward Hinnant 21183e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21203e519524SHoward Hinnant_OutputIterator 212151544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21223e519524SHoward Hinnant{ 212351544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 212451544023SEric Fiselier _IntegralSize __n = __orig_n; 2125910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21263e519524SHoward Hinnant *__first = __gen(); 21273e519524SHoward Hinnant return __first; 21283e519524SHoward Hinnant} 21293e519524SHoward Hinnant 21303e519524SHoward Hinnant// remove 21313e519524SHoward Hinnant 21323e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21333e519524SHoward Hinnant_ForwardIterator 2134e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21353e519524SHoward Hinnant{ 2136e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21373e519524SHoward Hinnant if (__first != __last) 21383e519524SHoward Hinnant { 21393e519524SHoward Hinnant _ForwardIterator __i = __first; 21403e519524SHoward Hinnant while (++__i != __last) 21413e519524SHoward Hinnant { 2142e4383379SHoward Hinnant if (!(*__i == __value_)) 21433e519524SHoward Hinnant { 2144ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21453e519524SHoward Hinnant ++__first; 21463e519524SHoward Hinnant } 21473e519524SHoward Hinnant } 21483e519524SHoward Hinnant } 21493e519524SHoward Hinnant return __first; 21503e519524SHoward Hinnant} 21513e519524SHoward Hinnant 21523e519524SHoward Hinnant// remove_if 21533e519524SHoward Hinnant 21543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21553e519524SHoward Hinnant_ForwardIterator 21563e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21573e519524SHoward Hinnant{ 2158ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21593e519524SHoward Hinnant (__first, __last, __pred); 21603e519524SHoward Hinnant if (__first != __last) 21613e519524SHoward Hinnant { 21623e519524SHoward Hinnant _ForwardIterator __i = __first; 21633e519524SHoward Hinnant while (++__i != __last) 21643e519524SHoward Hinnant { 21653e519524SHoward Hinnant if (!__pred(*__i)) 21663e519524SHoward Hinnant { 2167ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21683e519524SHoward Hinnant ++__first; 21693e519524SHoward Hinnant } 21703e519524SHoward Hinnant } 21713e519524SHoward Hinnant } 21723e519524SHoward Hinnant return __first; 21733e519524SHoward Hinnant} 21743e519524SHoward Hinnant 21753e519524SHoward Hinnant// remove_copy 21763e519524SHoward Hinnant 21773e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21793e519524SHoward Hinnant_OutputIterator 2180e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21813e519524SHoward Hinnant{ 21823e519524SHoward Hinnant for (; __first != __last; ++__first) 21833e519524SHoward Hinnant { 2184e4383379SHoward Hinnant if (!(*__first == __value_)) 21853e519524SHoward Hinnant { 21863e519524SHoward Hinnant *__result = *__first; 21873e519524SHoward Hinnant ++__result; 21883e519524SHoward Hinnant } 21893e519524SHoward Hinnant } 21903e519524SHoward Hinnant return __result; 21913e519524SHoward Hinnant} 21923e519524SHoward Hinnant 21933e519524SHoward Hinnant// remove_copy_if 21943e519524SHoward Hinnant 21953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21973e519524SHoward Hinnant_OutputIterator 21983e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21993e519524SHoward Hinnant{ 22003e519524SHoward Hinnant for (; __first != __last; ++__first) 22013e519524SHoward Hinnant { 22023e519524SHoward Hinnant if (!__pred(*__first)) 22033e519524SHoward Hinnant { 22043e519524SHoward Hinnant *__result = *__first; 22053e519524SHoward Hinnant ++__result; 22063e519524SHoward Hinnant } 22073e519524SHoward Hinnant } 22083e519524SHoward Hinnant return __result; 22093e519524SHoward Hinnant} 22103e519524SHoward Hinnant 22113e519524SHoward Hinnant// unique 22123e519524SHoward Hinnant 22133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22143e519524SHoward Hinnant_ForwardIterator 22153e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22163e519524SHoward Hinnant{ 2217ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22183e519524SHoward Hinnant (__first, __last, __pred); 22193e519524SHoward Hinnant if (__first != __last) 22203e519524SHoward Hinnant { 22213e519524SHoward Hinnant // ... a a ? ... 22223e519524SHoward Hinnant // f i 22233e519524SHoward Hinnant _ForwardIterator __i = __first; 22243e519524SHoward Hinnant for (++__i; ++__i != __last;) 22253e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2226ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22273e519524SHoward Hinnant ++__first; 22283e519524SHoward Hinnant } 22293e519524SHoward Hinnant return __first; 22303e519524SHoward Hinnant} 22313e519524SHoward Hinnant 22323e519524SHoward Hinnanttemplate <class _ForwardIterator> 22333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22343e519524SHoward Hinnant_ForwardIterator 22353e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22363e519524SHoward Hinnant{ 22373e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2238ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22393e519524SHoward Hinnant} 22403e519524SHoward Hinnant 22413e519524SHoward Hinnant// unique_copy 22423e519524SHoward Hinnant 22433e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22443e519524SHoward Hinnant_OutputIterator 22453e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22463e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22473e519524SHoward Hinnant{ 22483e519524SHoward Hinnant if (__first != __last) 22493e519524SHoward Hinnant { 22503e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22513e519524SHoward Hinnant *__result = __t; 22523e519524SHoward Hinnant ++__result; 22533e519524SHoward Hinnant while (++__first != __last) 22543e519524SHoward Hinnant { 22553e519524SHoward Hinnant if (!__pred(__t, *__first)) 22563e519524SHoward Hinnant { 22573e519524SHoward Hinnant __t = *__first; 22583e519524SHoward Hinnant *__result = __t; 22593e519524SHoward Hinnant ++__result; 22603e519524SHoward Hinnant } 22613e519524SHoward Hinnant } 22623e519524SHoward Hinnant } 22633e519524SHoward Hinnant return __result; 22643e519524SHoward Hinnant} 22653e519524SHoward Hinnant 22663e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22673e519524SHoward Hinnant_OutputIterator 22683e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22693e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22703e519524SHoward Hinnant{ 22713e519524SHoward Hinnant if (__first != __last) 22723e519524SHoward Hinnant { 22733e519524SHoward Hinnant _ForwardIterator __i = __first; 22743e519524SHoward Hinnant *__result = *__i; 22753e519524SHoward Hinnant ++__result; 22763e519524SHoward Hinnant while (++__first != __last) 22773e519524SHoward Hinnant { 22783e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22793e519524SHoward Hinnant { 22803e519524SHoward Hinnant *__result = *__first; 22813e519524SHoward Hinnant ++__result; 22823e519524SHoward Hinnant __i = __first; 22833e519524SHoward Hinnant } 22843e519524SHoward Hinnant } 22853e519524SHoward Hinnant } 22863e519524SHoward Hinnant return __result; 22873e519524SHoward Hinnant} 22883e519524SHoward Hinnant 22893e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22903e519524SHoward Hinnant_ForwardIterator 22913e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22923e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22933e519524SHoward Hinnant{ 22943e519524SHoward Hinnant if (__first != __last) 22953e519524SHoward Hinnant { 22963e519524SHoward Hinnant *__result = *__first; 22973e519524SHoward Hinnant while (++__first != __last) 22983e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22993e519524SHoward Hinnant *++__result = *__first; 23003e519524SHoward Hinnant ++__result; 23013e519524SHoward Hinnant } 23023e519524SHoward Hinnant return __result; 23033e519524SHoward Hinnant} 23043e519524SHoward Hinnant 23053e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23073e519524SHoward Hinnant_OutputIterator 23083e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23093e519524SHoward Hinnant{ 2310ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23113e519524SHoward Hinnant (__first, __last, __result, __pred, 23123e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23133e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23143e519524SHoward Hinnant} 23153e519524SHoward Hinnant 23163e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23183e519524SHoward Hinnant_OutputIterator 23193e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23203e519524SHoward Hinnant{ 23213e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2322ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23233e519524SHoward Hinnant} 23243e519524SHoward Hinnant 23253e519524SHoward Hinnant// reverse 23263e519524SHoward Hinnant 23273e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23293e519524SHoward Hinnantvoid 23303e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23313e519524SHoward Hinnant{ 23323e519524SHoward Hinnant while (__first != __last) 23333e519524SHoward Hinnant { 23343e519524SHoward Hinnant if (__first == --__last) 23353e519524SHoward Hinnant break; 2336def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23373e519524SHoward Hinnant ++__first; 23383e519524SHoward Hinnant } 23393e519524SHoward Hinnant} 23403e519524SHoward Hinnant 23413e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23433e519524SHoward Hinnantvoid 23443e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23453e519524SHoward Hinnant{ 23463e519524SHoward Hinnant if (__first != __last) 23473e519524SHoward Hinnant for (; __first < --__last; ++__first) 2348def501d1SMarshall Clow _VSTD::iter_swap(__first, __last); 23493e519524SHoward Hinnant} 23503e519524SHoward Hinnant 23513e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23533e519524SHoward Hinnantvoid 23543e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23553e519524SHoward Hinnant{ 2356ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23573e519524SHoward Hinnant} 23583e519524SHoward Hinnant 23593e519524SHoward Hinnant// reverse_copy 23603e519524SHoward Hinnant 23613e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23633e519524SHoward Hinnant_OutputIterator 23643e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23653e519524SHoward Hinnant{ 23663e519524SHoward Hinnant for (; __first != __last; ++__result) 23673e519524SHoward Hinnant *__result = *--__last; 23683e519524SHoward Hinnant return __result; 23693e519524SHoward Hinnant} 23703e519524SHoward Hinnant 23713e519524SHoward Hinnant// rotate 23723e519524SHoward Hinnant 23733e519524SHoward Hinnanttemplate <class _ForwardIterator> 23743e519524SHoward Hinnant_ForwardIterator 2375aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23763e519524SHoward Hinnant{ 2377aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2378aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2379aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2380aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2381aca09de3SHoward Hinnant return __lm1; 2382aca09de3SHoward Hinnant} 2383aca09de3SHoward Hinnant 2384aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2385aca09de3SHoward Hinnant_BidirectionalIterator 2386aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2387aca09de3SHoward Hinnant{ 2388aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2389aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2390aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2391aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2392aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2393aca09de3SHoward Hinnant return __fp1; 2394aca09de3SHoward Hinnant} 2395aca09de3SHoward Hinnant 2396aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2397aca09de3SHoward Hinnant_ForwardIterator 2398aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2399aca09de3SHoward Hinnant{ 24003e519524SHoward Hinnant _ForwardIterator __i = __middle; 24013e519524SHoward Hinnant while (true) 24023e519524SHoward Hinnant { 24033e519524SHoward Hinnant swap(*__first, *__i); 24043e519524SHoward Hinnant ++__first; 24053e519524SHoward Hinnant if (++__i == __last) 24063e519524SHoward Hinnant break; 24073e519524SHoward Hinnant if (__first == __middle) 24083e519524SHoward Hinnant __middle = __i; 24093e519524SHoward Hinnant } 24103e519524SHoward Hinnant _ForwardIterator __r = __first; 24113e519524SHoward Hinnant if (__first != __middle) 24123e519524SHoward Hinnant { 24133e519524SHoward Hinnant __i = __middle; 24143e519524SHoward Hinnant while (true) 24153e519524SHoward Hinnant { 24163e519524SHoward Hinnant swap(*__first, *__i); 24173e519524SHoward Hinnant ++__first; 24183e519524SHoward Hinnant if (++__i == __last) 24193e519524SHoward Hinnant { 24203e519524SHoward Hinnant if (__first == __middle) 24213e519524SHoward Hinnant break; 24223e519524SHoward Hinnant __i = __middle; 24233e519524SHoward Hinnant } 24243e519524SHoward Hinnant else if (__first == __middle) 24253e519524SHoward Hinnant __middle = __i; 24263e519524SHoward Hinnant } 24273e519524SHoward Hinnant } 24283e519524SHoward Hinnant return __r; 24293e519524SHoward Hinnant} 24303e519524SHoward Hinnant 24313e519524SHoward Hinnanttemplate<typename _Integral> 24323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24333e519524SHoward Hinnant_Integral 24343e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24353e519524SHoward Hinnant{ 24363e519524SHoward Hinnant do 24373e519524SHoward Hinnant { 24383e519524SHoward Hinnant _Integral __t = __x % __y; 24393e519524SHoward Hinnant __x = __y; 24403e519524SHoward Hinnant __y = __t; 24413e519524SHoward Hinnant } while (__y); 24423e519524SHoward Hinnant return __x; 24433e519524SHoward Hinnant} 24443e519524SHoward Hinnant 24453e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24463e519524SHoward Hinnant_RandomAccessIterator 2447aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24483e519524SHoward Hinnant{ 24493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24513e519524SHoward Hinnant 24523e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24533e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24543e519524SHoward Hinnant if (__m1 == __m2) 24553e519524SHoward Hinnant { 2456ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24573e519524SHoward Hinnant return __middle; 24583e519524SHoward Hinnant } 2459aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24603e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24613e519524SHoward Hinnant { 2462aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24633e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24643e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24653e519524SHoward Hinnant do 24663e519524SHoward Hinnant { 2467aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24683e519524SHoward Hinnant __p1 = __p2; 24693e519524SHoward Hinnant const difference_type __d = __last - __p2; 24703e519524SHoward Hinnant if (__m1 < __d) 24713e519524SHoward Hinnant __p2 += __m1; 24723e519524SHoward Hinnant else 24733e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24743e519524SHoward Hinnant } while (__p2 != __p); 2475aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24763e519524SHoward Hinnant } 24773e519524SHoward Hinnant return __first + __m2; 24783e519524SHoward Hinnant} 24793e519524SHoward Hinnant 24803e519524SHoward Hinnanttemplate <class _ForwardIterator> 24813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24823e519524SHoward Hinnant_ForwardIterator 2483aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2484aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2485aca09de3SHoward Hinnant{ 2486aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2487aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2488aca09de3SHoward Hinnant { 2489aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2490aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2491aca09de3SHoward Hinnant } 2492aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2493aca09de3SHoward Hinnant} 2494aca09de3SHoward Hinnant 2495aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2496aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2497aca09de3SHoward Hinnant_BidirectionalIterator 2498aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2499aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2500aca09de3SHoward Hinnant{ 2501aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2502aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2503aca09de3SHoward Hinnant { 2504aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2505aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2506aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2507aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2508aca09de3SHoward Hinnant } 2509aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2510aca09de3SHoward Hinnant} 2511aca09de3SHoward Hinnant 2512aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2513aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2514aca09de3SHoward Hinnant_RandomAccessIterator 2515aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2516aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2517aca09de3SHoward Hinnant{ 2518aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2519aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2520aca09de3SHoward Hinnant { 2521aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2522aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2523aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2524aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2525aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2526aca09de3SHoward Hinnant } 2527aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2528aca09de3SHoward Hinnant} 2529aca09de3SHoward Hinnant 2530aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2531aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2532aca09de3SHoward Hinnant_ForwardIterator 25333e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25343e519524SHoward Hinnant{ 2535aca09de3SHoward Hinnant if (__first == __middle) 2536aca09de3SHoward Hinnant return __last; 2537aca09de3SHoward Hinnant if (__middle == __last) 2538aca09de3SHoward Hinnant return __first; 2539ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2540aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25413e519524SHoward Hinnant} 25423e519524SHoward Hinnant 25433e519524SHoward Hinnant// rotate_copy 25443e519524SHoward Hinnant 25453e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25473e519524SHoward Hinnant_OutputIterator 25483e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25493e519524SHoward Hinnant{ 2550ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25513e519524SHoward Hinnant} 25523e519524SHoward Hinnant 25533e519524SHoward Hinnant// min_element 25543e519524SHoward Hinnant 25553e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25569d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25573e519524SHoward Hinnant_ForwardIterator 25580b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25593e519524SHoward Hinnant{ 25603e519524SHoward Hinnant if (__first != __last) 25613e519524SHoward Hinnant { 25623e519524SHoward Hinnant _ForwardIterator __i = __first; 25633e519524SHoward Hinnant while (++__i != __last) 25643e519524SHoward Hinnant if (__comp(*__i, *__first)) 25653e519524SHoward Hinnant __first = __i; 25663e519524SHoward Hinnant } 25673e519524SHoward Hinnant return __first; 25683e519524SHoward Hinnant} 25693e519524SHoward Hinnant 25703e519524SHoward Hinnanttemplate <class _ForwardIterator> 25710b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25723e519524SHoward Hinnant_ForwardIterator 25733e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25743e519524SHoward Hinnant{ 25750b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25764eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25774eb27b79SHoward Hinnant} 25784eb27b79SHoward Hinnant 25794eb27b79SHoward Hinnant// min 25804eb27b79SHoward Hinnant 25814eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25829d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25834eb27b79SHoward Hinnantconst _Tp& 25844eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25854eb27b79SHoward Hinnant{ 25864eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25874eb27b79SHoward Hinnant} 25884eb27b79SHoward Hinnant 25894eb27b79SHoward Hinnanttemplate <class _Tp> 25909d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25914eb27b79SHoward Hinnantconst _Tp& 25924eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25934eb27b79SHoward Hinnant{ 2594ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25954eb27b79SHoward Hinnant} 25964eb27b79SHoward Hinnant 259754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 259854976f26SHoward Hinnant 25994eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26009d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26014eb27b79SHoward Hinnant_Tp 26024eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26034eb27b79SHoward Hinnant{ 26040b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26054eb27b79SHoward Hinnant} 26064eb27b79SHoward Hinnant 26074eb27b79SHoward Hinnanttemplate<class _Tp> 26089d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26094eb27b79SHoward Hinnant_Tp 26104eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26114eb27b79SHoward Hinnant{ 26120b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26133e519524SHoward Hinnant} 26143e519524SHoward Hinnant 261554976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 261654976f26SHoward Hinnant 26173e519524SHoward Hinnant// max_element 26183e519524SHoward Hinnant 26193e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26209d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26213e519524SHoward Hinnant_ForwardIterator 26220b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26233e519524SHoward Hinnant{ 26243e519524SHoward Hinnant if (__first != __last) 26253e519524SHoward Hinnant { 26263e519524SHoward Hinnant _ForwardIterator __i = __first; 26273e519524SHoward Hinnant while (++__i != __last) 26283e519524SHoward Hinnant if (__comp(*__first, *__i)) 26293e519524SHoward Hinnant __first = __i; 26303e519524SHoward Hinnant } 26313e519524SHoward Hinnant return __first; 26323e519524SHoward Hinnant} 26333e519524SHoward Hinnant 26349d67c6d5SMarshall Clow 26353e519524SHoward Hinnanttemplate <class _ForwardIterator> 26360b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26373e519524SHoward Hinnant_ForwardIterator 26383e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26393e519524SHoward Hinnant{ 26400b0671aeSMarshall Clow return _VSTD::max_element(__first, __last, 26414eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26424eb27b79SHoward Hinnant} 26434eb27b79SHoward Hinnant 26444eb27b79SHoward Hinnant// max 26454eb27b79SHoward Hinnant 26464eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26479d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26484eb27b79SHoward Hinnantconst _Tp& 26494eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26504eb27b79SHoward Hinnant{ 26514eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26524eb27b79SHoward Hinnant} 26534eb27b79SHoward Hinnant 26544eb27b79SHoward Hinnanttemplate <class _Tp> 26559d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26564eb27b79SHoward Hinnantconst _Tp& 26574eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26584eb27b79SHoward Hinnant{ 2659ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26604eb27b79SHoward Hinnant} 26614eb27b79SHoward Hinnant 266254976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266354976f26SHoward Hinnant 26644eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26659d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26664eb27b79SHoward Hinnant_Tp 26674eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26684eb27b79SHoward Hinnant{ 26690b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __comp); 26704eb27b79SHoward Hinnant} 26714eb27b79SHoward Hinnant 26724eb27b79SHoward Hinnanttemplate<class _Tp> 26739d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26744eb27b79SHoward Hinnant_Tp 26754eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26764eb27b79SHoward Hinnant{ 26770b0671aeSMarshall Clow return *_VSTD::max_element(__t.begin(), __t.end(), __less<_Tp>()); 26783e519524SHoward Hinnant} 26793e519524SHoward Hinnant 268054976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 268154976f26SHoward Hinnant 2682146c14acSMarshall Clow#if _LIBCPP_STD_VER > 14 2683146c14acSMarshall Clow// clamp 2684146c14acSMarshall Clowtemplate<class _Tp, class _Compare> 2685146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2686146c14acSMarshall Clowconst _Tp& 2687146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) 2688146c14acSMarshall Clow{ 2689146c14acSMarshall Clow _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); 2690146c14acSMarshall Clow return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; 2691146c14acSMarshall Clow 2692146c14acSMarshall Clow} 2693146c14acSMarshall Clow 2694146c14acSMarshall Clowtemplate<class _Tp> 2695146c14acSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 2696146c14acSMarshall Clowconst _Tp& 2697146c14acSMarshall Clowclamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi) 2698146c14acSMarshall Clow{ 2699146c14acSMarshall Clow return _VSTD::clamp(__v, __lo, __hi, __less<_Tp>()); 2700146c14acSMarshall Clow} 2701146c14acSMarshall Clow#endif 2702146c14acSMarshall Clow 27033e519524SHoward Hinnant// minmax_element 27043e519524SHoward Hinnant 27053e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 27060b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 27073e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27083e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 27093e519524SHoward Hinnant{ 27103e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 27113e519524SHoward Hinnant if (__first != __last) 27123e519524SHoward Hinnant { 27133e519524SHoward Hinnant if (++__first != __last) 27143e519524SHoward Hinnant { 27153e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27163e519524SHoward Hinnant __result.first = __first; 27173e519524SHoward Hinnant else 27183e519524SHoward Hinnant __result.second = __first; 27193e519524SHoward Hinnant while (++__first != __last) 27203e519524SHoward Hinnant { 27213e519524SHoward Hinnant _ForwardIterator __i = __first; 27223e519524SHoward Hinnant if (++__first == __last) 27233e519524SHoward Hinnant { 27243e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27253e519524SHoward Hinnant __result.first = __i; 27263e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27273e519524SHoward Hinnant __result.second = __i; 27283e519524SHoward Hinnant break; 27293e519524SHoward Hinnant } 27303e519524SHoward Hinnant else 27313e519524SHoward Hinnant { 27323e519524SHoward Hinnant if (__comp(*__first, *__i)) 27333e519524SHoward Hinnant { 27343e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27353e519524SHoward Hinnant __result.first = __first; 27363e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27373e519524SHoward Hinnant __result.second = __i; 27383e519524SHoward Hinnant } 27393e519524SHoward Hinnant else 27403e519524SHoward Hinnant { 27413e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27423e519524SHoward Hinnant __result.first = __i; 27433e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27443e519524SHoward Hinnant __result.second = __first; 27453e519524SHoward Hinnant } 27463e519524SHoward Hinnant } 27473e519524SHoward Hinnant } 27483e519524SHoward Hinnant } 27493e519524SHoward Hinnant } 27503e519524SHoward Hinnant return __result; 27513e519524SHoward Hinnant} 27523e519524SHoward Hinnant 27533e519524SHoward Hinnanttemplate <class _ForwardIterator> 27540b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27553e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27563e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27573e519524SHoward Hinnant{ 27589d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27599d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27603e519524SHoward Hinnant} 27613e519524SHoward Hinnant 27624eb27b79SHoward Hinnant// minmax 27634eb27b79SHoward Hinnant 27644eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27659d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27664eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27674eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27684eb27b79SHoward Hinnant{ 27694eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27704eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27714eb27b79SHoward Hinnant} 27724eb27b79SHoward Hinnant 27734eb27b79SHoward Hinnanttemplate<class _Tp> 27749d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27754eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27764eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27774eb27b79SHoward Hinnant{ 2778ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27794eb27b79SHoward Hinnant} 27804eb27b79SHoward Hinnant 278154976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 278254976f26SHoward Hinnant 27834eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27849d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27854eb27b79SHoward Hinnantpair<_Tp, _Tp> 27864eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27874eb27b79SHoward Hinnant{ 27889d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27899d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27909d67c6d5SMarshall Clow _Iter __last = __t.end(); 27919d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27929d67c6d5SMarshall Clow 27939d67c6d5SMarshall Clow ++__first; 27949d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27959d67c6d5SMarshall Clow { 27969d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27979d67c6d5SMarshall Clow __result.first = *__first; 27989d67c6d5SMarshall Clow else 27999d67c6d5SMarshall Clow __result.second = *__first; 28009d67c6d5SMarshall Clow ++__first; 28019d67c6d5SMarshall Clow } 28029d67c6d5SMarshall Clow 28039d67c6d5SMarshall Clow while (__first != __last) 28049d67c6d5SMarshall Clow { 28059d67c6d5SMarshall Clow _Tp __prev = *__first++; 2806002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2807002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2808002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 28099d67c6d5SMarshall Clow } 28109d67c6d5SMarshall Clow else { 2811002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2812002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 28139d67c6d5SMarshall Clow } 28149d67c6d5SMarshall Clow 28159d67c6d5SMarshall Clow __first++; 28169d67c6d5SMarshall Clow } 28179d67c6d5SMarshall Clow return __result; 28189d67c6d5SMarshall Clow} 28199d67c6d5SMarshall Clow 28209d67c6d5SMarshall Clowtemplate<class _Tp> 28219d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 28229d67c6d5SMarshall Clowpair<_Tp, _Tp> 28239d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28249d67c6d5SMarshall Clow{ 28259d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28264eb27b79SHoward Hinnant} 28274eb27b79SHoward Hinnant 282854976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 282954976f26SHoward Hinnant 28303e519524SHoward Hinnant// random_shuffle 28313e519524SHoward Hinnant 2832f9d540b0SHoward Hinnant// __independent_bits_engine 2833f9d540b0SHoward Hinnant 2834c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2835f9d540b0SHoward Hinnantstruct __log2_imp 28363e519524SHoward Hinnant{ 2837c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2838c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28393e519524SHoward Hinnant}; 28403e519524SHoward Hinnant 2841c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2842c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28433e519524SHoward Hinnant{ 2844f9d540b0SHoward Hinnant static const size_t value = 0; 28453e519524SHoward Hinnant}; 28463e519524SHoward Hinnant 2847c003db1fSHoward Hinnanttemplate <size_t _Rp> 2848c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28493e519524SHoward Hinnant{ 2850c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28513e519524SHoward Hinnant}; 28523e519524SHoward Hinnant 2853c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2854f9d540b0SHoward Hinnantstruct __log2 28553e519524SHoward Hinnant{ 2856c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2857f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28583e519524SHoward Hinnant}; 28593e519524SHoward Hinnant 2860f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2861f9d540b0SHoward Hinnantclass __independent_bits_engine 28623e519524SHoward Hinnant{ 2863f9d540b0SHoward Hinnantpublic: 2864f9d540b0SHoward Hinnant // types 2865f9d540b0SHoward Hinnant typedef _UIntType result_type; 2866f9d540b0SHoward Hinnant 2867f9d540b0SHoward Hinnantprivate: 2868f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2869f9d540b0SHoward Hinnant typedef typename conditional 2870f9d540b0SHoward Hinnant < 2871f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2872f9d540b0SHoward Hinnant result_type, 2873f9d540b0SHoward Hinnant _Engine_result_type 2874f9d540b0SHoward Hinnant >::type _Working_result_type; 2875f9d540b0SHoward Hinnant 2876f9d540b0SHoward Hinnant _Engine& __e_; 2877f9d540b0SHoward Hinnant size_t __w_; 2878f9d540b0SHoward Hinnant size_t __w0_; 2879f9d540b0SHoward Hinnant size_t __n_; 2880f9d540b0SHoward Hinnant size_t __n0_; 2881f9d540b0SHoward Hinnant _Working_result_type __y0_; 2882f9d540b0SHoward Hinnant _Working_result_type __y1_; 2883f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2884f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2885f9d540b0SHoward Hinnant 2886e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2887c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2888f9d540b0SHoward Hinnant + _Working_result_type(1); 2889e386b7b3SHoward Hinnant#else 2890e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2891e386b7b3SHoward Hinnant + _Working_result_type(1); 2892e386b7b3SHoward Hinnant#endif 2893e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2894e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2895e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2896f9d540b0SHoward Hinnant 2897f9d540b0SHoward Hinnantpublic: 2898f9d540b0SHoward Hinnant // constructors and seeding functions 2899f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2900f9d540b0SHoward Hinnant 2901f9d540b0SHoward Hinnant // generating functions 2902c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2903f9d540b0SHoward Hinnant 2904f9d540b0SHoward Hinnantprivate: 2905f9d540b0SHoward Hinnant result_type __eval(false_type); 2906f9d540b0SHoward Hinnant result_type __eval(true_type); 2907f9d540b0SHoward Hinnant}; 2908f9d540b0SHoward Hinnant 2909f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2910f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2911f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2912f9d540b0SHoward Hinnant : __e_(__e), 2913f9d540b0SHoward Hinnant __w_(__w) 2914f9d540b0SHoward Hinnant{ 2915f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2916f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2917c003db1fSHoward Hinnant if (_Rp == 0) 2918c003db1fSHoward Hinnant __y0_ = _Rp; 2919f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2920c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2921f9d540b0SHoward Hinnant else 2922f9d540b0SHoward Hinnant __y0_ = 0; 2923c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2924f9d540b0SHoward Hinnant { 2925f9d540b0SHoward Hinnant ++__n_; 2926f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2927f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2928c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2929f9d540b0SHoward Hinnant else 2930f9d540b0SHoward Hinnant __y0_ = 0; 2931f9d540b0SHoward Hinnant } 2932f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2933f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2934c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2935f9d540b0SHoward Hinnant else 2936f9d540b0SHoward Hinnant __y1_ = 0; 2937f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2938f9d540b0SHoward Hinnant _Engine_result_type(0); 2939f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2940f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2941f9d540b0SHoward Hinnant _Engine_result_type(~0); 29423e519524SHoward Hinnant} 29433e519524SHoward Hinnant 2944f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2945f9d540b0SHoward Hinnantinline 2946f9d540b0SHoward Hinnant_UIntType 2947f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29483e519524SHoward Hinnant{ 2949f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29503e519524SHoward Hinnant} 29513e519524SHoward Hinnant 2952f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2953f9d540b0SHoward Hinnant_UIntType 2954f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29553e519524SHoward Hinnant{ 2956c003db1fSHoward Hinnant result_type _Sp = 0; 2957f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2958f9d540b0SHoward Hinnant { 2959f9d540b0SHoward Hinnant _Engine_result_type __u; 29603e519524SHoward Hinnant do 2961f9d540b0SHoward Hinnant { 2962f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2963f9d540b0SHoward Hinnant } while (__u >= __y0_); 29640176bc6cSHoward Hinnant if (__w0_ < _WDt) 2965c003db1fSHoward Hinnant _Sp <<= __w0_; 2966f9d540b0SHoward Hinnant else 2967c003db1fSHoward Hinnant _Sp = 0; 2968c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2969f9d540b0SHoward Hinnant } 2970f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2971f9d540b0SHoward Hinnant { 2972f9d540b0SHoward Hinnant _Engine_result_type __u; 2973f9d540b0SHoward Hinnant do 2974f9d540b0SHoward Hinnant { 2975f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2976f9d540b0SHoward Hinnant } while (__u >= __y1_); 29770176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2978c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2979f9d540b0SHoward Hinnant else 2980c003db1fSHoward Hinnant _Sp = 0; 2981c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2982f9d540b0SHoward Hinnant } 2983c003db1fSHoward Hinnant return _Sp; 29843e519524SHoward Hinnant} 29853e519524SHoward Hinnant 2986f9d540b0SHoward Hinnant// uniform_int_distribution 29873e519524SHoward Hinnant 2988f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2989f9d540b0SHoward Hinnantclass uniform_int_distribution 29903e519524SHoward Hinnant{ 2991f9d540b0SHoward Hinnantpublic: 2992f9d540b0SHoward Hinnant // types 2993f9d540b0SHoward Hinnant typedef _IntType result_type; 2994f9d540b0SHoward Hinnant 2995f9d540b0SHoward Hinnant class param_type 2996f9d540b0SHoward Hinnant { 2997f9d540b0SHoward Hinnant result_type __a_; 2998f9d540b0SHoward Hinnant result_type __b_; 2999f9d540b0SHoward Hinnant public: 3000f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 3001f9d540b0SHoward Hinnant 3002f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 3003f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3004f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 3005f9d540b0SHoward Hinnant 3006f9d540b0SHoward Hinnant result_type a() const {return __a_;} 3007f9d540b0SHoward Hinnant result_type b() const {return __b_;} 3008f9d540b0SHoward Hinnant 3009f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 3010f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 3011f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 3012f9d540b0SHoward Hinnant {return !(__x == __y);} 30133e519524SHoward Hinnant }; 30143e519524SHoward Hinnant 3015f9d540b0SHoward Hinnantprivate: 3016f9d540b0SHoward Hinnant param_type __p_; 30173e519524SHoward Hinnant 3018f9d540b0SHoward Hinnantpublic: 3019f9d540b0SHoward Hinnant // constructors and reset functions 3020f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 3021f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 3022f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 3023f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3024f9d540b0SHoward Hinnant void reset() {} 3025f9d540b0SHoward Hinnant 3026f9d540b0SHoward Hinnant // generating functions 3027f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3028f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3029f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3030f9d540b0SHoward Hinnant 3031f9d540b0SHoward Hinnant // property functions 3032f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3033f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3034f9d540b0SHoward Hinnant 3035f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3036f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3037f9d540b0SHoward Hinnant 3038f9d540b0SHoward Hinnant result_type min() const {return a();} 3039f9d540b0SHoward Hinnant result_type max() const {return b();} 3040f9d540b0SHoward Hinnant 3041f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3042f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3043f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3044f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3045f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3046f9d540b0SHoward Hinnant {return !(__x == __y);} 30473e519524SHoward Hinnant}; 30483e519524SHoward Hinnant 3049f9d540b0SHoward Hinnanttemplate<class _IntType> 3050f9d540b0SHoward Hinnanttemplate<class _URNG> 3051f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3052f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30533e519524SHoward Hinnant{ 3054f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3055f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3056c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3057c003db1fSHoward Hinnant if (_Rp == 1) 3058f9d540b0SHoward Hinnant return __p.a(); 3059f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3060f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3061c003db1fSHoward Hinnant if (_Rp == 0) 3062f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3063c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3064a6438ca1SMarshall Clow if ((_Rp & (std::numeric_limits<_UIntType>::max() >> (_Dt - __w))) != 0) 3065f9d540b0SHoward Hinnant ++__w; 3066f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3067f9d540b0SHoward Hinnant _UIntType __u; 3068f9d540b0SHoward Hinnant do 30693e519524SHoward Hinnant { 3070f9d540b0SHoward Hinnant __u = __e(); 3071c003db1fSHoward Hinnant } while (__u >= _Rp); 3072f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30733e519524SHoward Hinnant} 3074f9d540b0SHoward Hinnant 3075f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3076f9d540b0SHoward Hinnant 3077f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3078f9d540b0SHoward Hinnant 3079f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30803e519524SHoward Hinnant{ 3081f9d540b0SHoward Hinnant static unsigned __c_; 3082f9d540b0SHoward Hinnant 3083f9d540b0SHoward Hinnant __rs_default(); 3084f9d540b0SHoward Hinnantpublic: 3085b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3086f9d540b0SHoward Hinnant 3087f9d540b0SHoward Hinnant static const result_type _Min = 0; 3088f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3089f9d540b0SHoward Hinnant 3090f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3091f9d540b0SHoward Hinnant ~__rs_default(); 3092f9d540b0SHoward Hinnant 3093f9d540b0SHoward Hinnant result_type operator()(); 3094f9d540b0SHoward Hinnant 3095788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3096788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3097f9d540b0SHoward Hinnant 3098f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3099f9d540b0SHoward Hinnant}; 3100f9d540b0SHoward Hinnant 3101f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 31023e519524SHoward Hinnant 31033e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 31043e519524SHoward Hinnantvoid 31053e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 31063e519524SHoward Hinnant{ 31073e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3108c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3109c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 31103e519524SHoward Hinnant difference_type __d = __last - __first; 31113e519524SHoward Hinnant if (__d > 1) 31123e519524SHoward Hinnant { 3113c003db1fSHoward Hinnant _Dp __uid; 3114f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3115f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3116007b26beSHoward Hinnant { 3117c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3118007b26beSHoward Hinnant if (__i != difference_type(0)) 3119007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3120007b26beSHoward Hinnant } 31213e519524SHoward Hinnant } 31223e519524SHoward Hinnant} 31233e519524SHoward Hinnant 31243e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31253e519524SHoward Hinnantvoid 31263e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 31277609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 31283e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31293e519524SHoward Hinnant#else 31303e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31313e519524SHoward Hinnant#endif 31323e519524SHoward Hinnant{ 31333e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31343e519524SHoward Hinnant difference_type __d = __last - __first; 31353e519524SHoward Hinnant if (__d > 1) 31363e519524SHoward Hinnant { 31373e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3138007b26beSHoward Hinnant { 3139007b26beSHoward Hinnant difference_type __i = __rand(__d); 3140007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3141007b26beSHoward Hinnant } 31423e519524SHoward Hinnant } 31433e519524SHoward Hinnant} 31443e519524SHoward Hinnant 3145f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3146f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3147fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3148fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3149fb340102SHoward Hinnant#else 3150f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3151fb340102SHoward Hinnant#endif 3152f9d540b0SHoward Hinnant{ 3153f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3154c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3155c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3156f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3157f9d540b0SHoward Hinnant if (__d > 1) 3158f9d540b0SHoward Hinnant { 3159c003db1fSHoward Hinnant _Dp __uid; 3160f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3161007b26beSHoward Hinnant { 3162c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3163007b26beSHoward Hinnant if (__i != difference_type(0)) 3164007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3165007b26beSHoward Hinnant } 3166f9d540b0SHoward Hinnant } 3167f9d540b0SHoward Hinnant} 3168f9d540b0SHoward Hinnant 31693e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31703e519524SHoward Hinnantbool 31713e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31723e519524SHoward Hinnant{ 31733e519524SHoward Hinnant for (; __first != __last; ++__first) 31743e519524SHoward Hinnant if (!__pred(*__first)) 31753e519524SHoward Hinnant break; 3176b9595b79SMarshall Clow if ( __first == __last ) 3177b9595b79SMarshall Clow return true; 3178b9595b79SMarshall Clow ++__first; 31793e519524SHoward Hinnant for (; __first != __last; ++__first) 31803e519524SHoward Hinnant if (__pred(*__first)) 31813e519524SHoward Hinnant return false; 31823e519524SHoward Hinnant return true; 31833e519524SHoward Hinnant} 31843e519524SHoward Hinnant 31853e519524SHoward Hinnant// partition 31863e519524SHoward Hinnant 31873e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31883e519524SHoward Hinnant_ForwardIterator 31893e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31903e519524SHoward Hinnant{ 31913e519524SHoward Hinnant while (true) 31923e519524SHoward Hinnant { 31933e519524SHoward Hinnant if (__first == __last) 31943e519524SHoward Hinnant return __first; 31953e519524SHoward Hinnant if (!__pred(*__first)) 31963e519524SHoward Hinnant break; 31973e519524SHoward Hinnant ++__first; 31983e519524SHoward Hinnant } 31993e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 32003e519524SHoward Hinnant { 32013e519524SHoward Hinnant if (__pred(*__p)) 32023e519524SHoward Hinnant { 32033e519524SHoward Hinnant swap(*__first, *__p); 32043e519524SHoward Hinnant ++__first; 32053e519524SHoward Hinnant } 32063e519524SHoward Hinnant } 32073e519524SHoward Hinnant return __first; 32083e519524SHoward Hinnant} 32093e519524SHoward Hinnant 32103e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 32113e519524SHoward Hinnant_BidirectionalIterator 32123e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 32133e519524SHoward Hinnant bidirectional_iterator_tag) 32143e519524SHoward Hinnant{ 32153e519524SHoward Hinnant while (true) 32163e519524SHoward Hinnant { 32173e519524SHoward Hinnant while (true) 32183e519524SHoward Hinnant { 32193e519524SHoward Hinnant if (__first == __last) 32203e519524SHoward Hinnant return __first; 32213e519524SHoward Hinnant if (!__pred(*__first)) 32223e519524SHoward Hinnant break; 32233e519524SHoward Hinnant ++__first; 32243e519524SHoward Hinnant } 32253e519524SHoward Hinnant do 32263e519524SHoward Hinnant { 32273e519524SHoward Hinnant if (__first == --__last) 32283e519524SHoward Hinnant return __first; 32293e519524SHoward Hinnant } while (!__pred(*__last)); 32303e519524SHoward Hinnant swap(*__first, *__last); 32313e519524SHoward Hinnant ++__first; 32323e519524SHoward Hinnant } 32333e519524SHoward Hinnant} 32343e519524SHoward Hinnant 32353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32373e519524SHoward Hinnant_ForwardIterator 32383e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32393e519524SHoward Hinnant{ 3240ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32413e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32423e519524SHoward Hinnant} 32433e519524SHoward Hinnant 32443e519524SHoward Hinnant// partition_copy 32453e519524SHoward Hinnant 32463e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32473e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32483e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32493e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32503e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32513e519524SHoward Hinnant _Predicate __pred) 32523e519524SHoward Hinnant{ 32533e519524SHoward Hinnant for (; __first != __last; ++__first) 32543e519524SHoward Hinnant { 32553e519524SHoward Hinnant if (__pred(*__first)) 32563e519524SHoward Hinnant { 32573e519524SHoward Hinnant *__out_true = *__first; 32583e519524SHoward Hinnant ++__out_true; 32593e519524SHoward Hinnant } 32603e519524SHoward Hinnant else 32613e519524SHoward Hinnant { 32623e519524SHoward Hinnant *__out_false = *__first; 32633e519524SHoward Hinnant ++__out_false; 32643e519524SHoward Hinnant } 32653e519524SHoward Hinnant } 32663e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32673e519524SHoward Hinnant} 32683e519524SHoward Hinnant 32693e519524SHoward Hinnant// partition_point 32703e519524SHoward Hinnant 32713e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32723e519524SHoward Hinnant_ForwardIterator 32733e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32743e519524SHoward Hinnant{ 32753e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3276ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32773e519524SHoward Hinnant while (__len != 0) 32783e519524SHoward Hinnant { 32793e519524SHoward Hinnant difference_type __l2 = __len / 2; 32803e519524SHoward Hinnant _ForwardIterator __m = __first; 3281ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32823e519524SHoward Hinnant if (__pred(*__m)) 32833e519524SHoward Hinnant { 32843e519524SHoward Hinnant __first = ++__m; 32853e519524SHoward Hinnant __len -= __l2 + 1; 32863e519524SHoward Hinnant } 32873e519524SHoward Hinnant else 32883e519524SHoward Hinnant __len = __l2; 32893e519524SHoward Hinnant } 32903e519524SHoward Hinnant return __first; 32913e519524SHoward Hinnant} 32923e519524SHoward Hinnant 32933e519524SHoward Hinnant// stable_partition 32943e519524SHoward Hinnant 32953e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32963e519524SHoward Hinnant_ForwardIterator 32973e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32983e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32993e519524SHoward Hinnant{ 33003e519524SHoward Hinnant // *__first is known to be false 33013e519524SHoward Hinnant // __len >= 1 33023e519524SHoward Hinnant if (__len == 1) 33033e519524SHoward Hinnant return __first; 33043e519524SHoward Hinnant if (__len == 2) 33053e519524SHoward Hinnant { 33063e519524SHoward Hinnant _ForwardIterator __m = __first; 33073e519524SHoward Hinnant if (__pred(*++__m)) 33083e519524SHoward Hinnant { 33093e519524SHoward Hinnant swap(*__first, *__m); 33103e519524SHoward Hinnant return __m; 33113e519524SHoward Hinnant } 33123e519524SHoward Hinnant return __first; 33133e519524SHoward Hinnant } 33143e519524SHoward Hinnant if (__len <= __p.second) 33153e519524SHoward Hinnant { // The buffer is big enough to use 33163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 33173e519524SHoward Hinnant __destruct_n __d(0); 33183e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 33193e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 33203e519524SHoward Hinnant // Update __first to always point to the end of the trues 33213e519524SHoward Hinnant value_type* __t = __p.first; 3322ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 33233e519524SHoward Hinnant __d.__incr((value_type*)0); 33243e519524SHoward Hinnant ++__t; 33253e519524SHoward Hinnant _ForwardIterator __i = __first; 33263e519524SHoward Hinnant while (++__i != __last) 33273e519524SHoward Hinnant { 33283e519524SHoward Hinnant if (__pred(*__i)) 33293e519524SHoward Hinnant { 3330ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33313e519524SHoward Hinnant ++__first; 33323e519524SHoward Hinnant } 33333e519524SHoward Hinnant else 33343e519524SHoward Hinnant { 3335ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33363e519524SHoward Hinnant __d.__incr((value_type*)0); 33373e519524SHoward Hinnant ++__t; 33383e519524SHoward Hinnant } 33393e519524SHoward Hinnant } 33403e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33413e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33423e519524SHoward Hinnant __i = __first; 33433e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3344ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33453e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33463e519524SHoward Hinnant return __first; 33473e519524SHoward Hinnant } 33483e519524SHoward Hinnant // Else not enough buffer, do in place 33493e519524SHoward Hinnant // __len >= 3 33503e519524SHoward Hinnant _ForwardIterator __m = __first; 33513e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3352ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33533e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33543e519524SHoward Hinnant // F????????????????? 33553e519524SHoward Hinnant // f m l 33563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33573e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33583e519524SHoward Hinnant // TTTFFFFF?????????? 33593e519524SHoward Hinnant // f ff m l 33603e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33613e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33623e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33633e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33643e519524SHoward Hinnant while (__pred(*__m1)) 33653e519524SHoward Hinnant { 33663e519524SHoward Hinnant if (++__m1 == __last) 33673e519524SHoward Hinnant goto __second_half_done; 33683e519524SHoward Hinnant --__len_half; 33693e519524SHoward Hinnant } 33703e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33713e519524SHoward Hinnant // f ff m m1 l 33723e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33733e519524SHoward Hinnant__second_half_done: 33743e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33753e519524SHoward Hinnant // f ff m sf l 3376ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33773e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33783e519524SHoward Hinnant // | 33793e519524SHoward Hinnant} 33803e519524SHoward Hinnant 33813e519524SHoward Hinnantstruct __return_temporary_buffer 33823e519524SHoward Hinnant{ 33833e519524SHoward Hinnant template <class _Tp> 3384ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33853e519524SHoward Hinnant}; 33863e519524SHoward Hinnant 33873e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33883e519524SHoward Hinnant_ForwardIterator 33893e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33903e519524SHoward Hinnant forward_iterator_tag) 33913e519524SHoward Hinnant{ 33923e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33933e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33943e519524SHoward Hinnant while (true) 33953e519524SHoward Hinnant { 33963e519524SHoward Hinnant if (__first == __last) 33973e519524SHoward Hinnant return __first; 33983e519524SHoward Hinnant if (!__pred(*__first)) 33993e519524SHoward Hinnant break; 34003e519524SHoward Hinnant ++__first; 34013e519524SHoward Hinnant } 34023e519524SHoward Hinnant // We now have a reduced range [__first, __last) 34033e519524SHoward Hinnant // *__first is known to be false 34043e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 34053e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3406ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 34073e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 34083e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 34093e519524SHoward Hinnant if (__len >= __alloc_limit) 34103e519524SHoward Hinnant { 3411ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 34123e519524SHoward Hinnant __h.reset(__p.first); 34133e519524SHoward Hinnant } 34143e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 34153e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 34163e519524SHoward Hinnant} 34173e519524SHoward Hinnant 34183e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 34193e519524SHoward Hinnant_BidirectionalIterator 34203e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 34213e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 34223e519524SHoward Hinnant{ 34233e519524SHoward Hinnant // *__first is known to be false 34243e519524SHoward Hinnant // *__last is known to be true 34253e519524SHoward Hinnant // __len >= 2 34263e519524SHoward Hinnant if (__len == 2) 34273e519524SHoward Hinnant { 34283e519524SHoward Hinnant swap(*__first, *__last); 34293e519524SHoward Hinnant return __last; 34303e519524SHoward Hinnant } 34313e519524SHoward Hinnant if (__len == 3) 34323e519524SHoward Hinnant { 34333e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34343e519524SHoward Hinnant if (__pred(*++__m)) 34353e519524SHoward Hinnant { 34363e519524SHoward Hinnant swap(*__first, *__m); 34373e519524SHoward Hinnant swap(*__m, *__last); 34383e519524SHoward Hinnant return __last; 34393e519524SHoward Hinnant } 34403e519524SHoward Hinnant swap(*__m, *__last); 34413e519524SHoward Hinnant swap(*__first, *__m); 34423e519524SHoward Hinnant return __m; 34433e519524SHoward Hinnant } 34443e519524SHoward Hinnant if (__len <= __p.second) 34453e519524SHoward Hinnant { // The buffer is big enough to use 34463e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34473e519524SHoward Hinnant __destruct_n __d(0); 34483e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34493e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34503e519524SHoward Hinnant // Update __first to always point to the end of the trues 34513e519524SHoward Hinnant value_type* __t = __p.first; 3452ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34533e519524SHoward Hinnant __d.__incr((value_type*)0); 34543e519524SHoward Hinnant ++__t; 34553e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34563e519524SHoward Hinnant while (++__i != __last) 34573e519524SHoward Hinnant { 34583e519524SHoward Hinnant if (__pred(*__i)) 34593e519524SHoward Hinnant { 3460ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34613e519524SHoward Hinnant ++__first; 34623e519524SHoward Hinnant } 34633e519524SHoward Hinnant else 34643e519524SHoward Hinnant { 3465ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34663e519524SHoward Hinnant __d.__incr((value_type*)0); 34673e519524SHoward Hinnant ++__t; 34683e519524SHoward Hinnant } 34693e519524SHoward Hinnant } 34703e519524SHoward Hinnant // move *__last, known to be true 3471ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34723e519524SHoward Hinnant __i = ++__first; 34733e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34743e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34753e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3476ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34773e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34783e519524SHoward Hinnant return __first; 34793e519524SHoward Hinnant } 34803e519524SHoward Hinnant // Else not enough buffer, do in place 34813e519524SHoward Hinnant // __len >= 4 34823e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34833e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3484ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34853e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34863e519524SHoward Hinnant // F????????????????T 34873e519524SHoward Hinnant // f m l 34883e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34893e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34903e519524SHoward Hinnant _Distance __len_half = __len2; 34913e519524SHoward Hinnant while (!__pred(*--__m1)) 34923e519524SHoward Hinnant { 34933e519524SHoward Hinnant if (__m1 == __first) 34943e519524SHoward Hinnant goto __first_half_done; 34953e519524SHoward Hinnant --__len_half; 34963e519524SHoward Hinnant } 34973e519524SHoward Hinnant // F???TFFF?????????T 34983e519524SHoward Hinnant // f m1 m l 34993e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 35003e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 35013e519524SHoward Hinnant__first_half_done: 35023e519524SHoward Hinnant // TTTFFFFF?????????T 35033e519524SHoward Hinnant // f ff m l 35043e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 35053e519524SHoward Hinnant __m1 = __m; 35063e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 35073e519524SHoward Hinnant ++__second_false; 35083e519524SHoward Hinnant __len_half = __len - __len2; 35093e519524SHoward Hinnant while (__pred(*__m1)) 35103e519524SHoward Hinnant { 35113e519524SHoward Hinnant if (++__m1 == __last) 35123e519524SHoward Hinnant goto __second_half_done; 35133e519524SHoward Hinnant --__len_half; 35143e519524SHoward Hinnant } 35153e519524SHoward Hinnant // TTTFFFFFTTTF?????T 35163e519524SHoward Hinnant // f ff m m1 l 35173e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 35183e519524SHoward Hinnant__second_half_done: 35193e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 35203e519524SHoward Hinnant // f ff m sf l 3521ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 35223e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 35233e519524SHoward Hinnant // | 35243e519524SHoward Hinnant} 35253e519524SHoward Hinnant 35263e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35273e519524SHoward Hinnant_BidirectionalIterator 35283e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35293e519524SHoward Hinnant bidirectional_iterator_tag) 35303e519524SHoward Hinnant{ 35313e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35323e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35333e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35343e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35353e519524SHoward Hinnant while (true) 35363e519524SHoward Hinnant { 35373e519524SHoward Hinnant if (__first == __last) 35383e519524SHoward Hinnant return __first; 35393e519524SHoward Hinnant if (!__pred(*__first)) 35403e519524SHoward Hinnant break; 35413e519524SHoward Hinnant ++__first; 35423e519524SHoward Hinnant } 35433e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35443e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35453e519524SHoward Hinnant do 35463e519524SHoward Hinnant { 35473e519524SHoward Hinnant if (__first == --__last) 35483e519524SHoward Hinnant return __first; 35493e519524SHoward Hinnant } while (!__pred(*__last)); 35503e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35513e519524SHoward Hinnant // *__first is known to be false 35523e519524SHoward Hinnant // *__last is known to be true 35533e519524SHoward Hinnant // __len >= 2 3554ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35553e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35563e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35573e519524SHoward Hinnant if (__len >= __alloc_limit) 35583e519524SHoward Hinnant { 3559ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35603e519524SHoward Hinnant __h.reset(__p.first); 35613e519524SHoward Hinnant } 35623e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35633e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35643e519524SHoward Hinnant} 35653e519524SHoward Hinnant 35663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35683e519524SHoward Hinnant_ForwardIterator 35693e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35703e519524SHoward Hinnant{ 35713e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35723e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35733e519524SHoward Hinnant} 35743e519524SHoward Hinnant 35753e519524SHoward Hinnant// is_sorted_until 35763e519524SHoward Hinnant 35773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35783e519524SHoward Hinnant_ForwardIterator 35793e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35803e519524SHoward Hinnant{ 35813e519524SHoward Hinnant if (__first != __last) 35823e519524SHoward Hinnant { 35833e519524SHoward Hinnant _ForwardIterator __i = __first; 35843e519524SHoward Hinnant while (++__i != __last) 35853e519524SHoward Hinnant { 35863e519524SHoward Hinnant if (__comp(*__i, *__first)) 35873e519524SHoward Hinnant return __i; 35883e519524SHoward Hinnant __first = __i; 35893e519524SHoward Hinnant } 35903e519524SHoward Hinnant } 35913e519524SHoward Hinnant return __last; 35923e519524SHoward Hinnant} 35933e519524SHoward Hinnant 35943e519524SHoward Hinnanttemplate<class _ForwardIterator> 35953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35963e519524SHoward Hinnant_ForwardIterator 35973e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35983e519524SHoward Hinnant{ 3599ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36003e519524SHoward Hinnant} 36013e519524SHoward Hinnant 36023e519524SHoward Hinnant// is_sorted 36033e519524SHoward Hinnant 36043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 36053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36063e519524SHoward Hinnantbool 36073e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 36083e519524SHoward Hinnant{ 3609ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 36103e519524SHoward Hinnant} 36113e519524SHoward Hinnant 36123e519524SHoward Hinnanttemplate<class _ForwardIterator> 36133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 36143e519524SHoward Hinnantbool 36153e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 36163e519524SHoward Hinnant{ 3617ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 36183e519524SHoward Hinnant} 36193e519524SHoward Hinnant 36203e519524SHoward Hinnant// sort 36213e519524SHoward Hinnant 36223e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 36233e519524SHoward Hinnant 36243e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36253e519524SHoward Hinnantunsigned 36263e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36273e519524SHoward Hinnant{ 36283e519524SHoward Hinnant unsigned __r = 0; 36293e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36303e519524SHoward Hinnant { 36313e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36323e519524SHoward Hinnant return __r; // x <= y && y <= z 36333e519524SHoward Hinnant // x <= y && y > z 36343e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36353e519524SHoward Hinnant __r = 1; 36363e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36373e519524SHoward Hinnant { 36383e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36393e519524SHoward Hinnant __r = 2; 36403e519524SHoward Hinnant } 36413e519524SHoward Hinnant return __r; // x <= y && y < z 36423e519524SHoward Hinnant } 36433e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36463e519524SHoward Hinnant __r = 1; 36473e519524SHoward Hinnant return __r; 36483e519524SHoward Hinnant } 36493e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36503e519524SHoward Hinnant __r = 1; // x < y && x <= z 36513e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36523e519524SHoward Hinnant { 36533e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36543e519524SHoward Hinnant __r = 2; 36553e519524SHoward Hinnant } 36563e519524SHoward Hinnant return __r; 36573e519524SHoward Hinnant} // x <= y && y <= z 36583e519524SHoward Hinnant 36593e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36603e519524SHoward Hinnant 36613e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36623e519524SHoward Hinnantunsigned 36633e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36643e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36653e519524SHoward Hinnant{ 36663e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36673e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36683e519524SHoward Hinnant { 36693e519524SHoward Hinnant swap(*__x3, *__x4); 36703e519524SHoward Hinnant ++__r; 36713e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36723e519524SHoward Hinnant { 36733e519524SHoward Hinnant swap(*__x2, *__x3); 36743e519524SHoward Hinnant ++__r; 36753e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36763e519524SHoward Hinnant { 36773e519524SHoward Hinnant swap(*__x1, *__x2); 36783e519524SHoward Hinnant ++__r; 36793e519524SHoward Hinnant } 36803e519524SHoward Hinnant } 36813e519524SHoward Hinnant } 36823e519524SHoward Hinnant return __r; 36833e519524SHoward Hinnant} 36843e519524SHoward Hinnant 36853e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36863e519524SHoward Hinnant 36873e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36883e519524SHoward Hinnantunsigned 36893e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36903e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36913e519524SHoward Hinnant{ 36923e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36933e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36943e519524SHoward Hinnant { 36953e519524SHoward Hinnant swap(*__x4, *__x5); 36963e519524SHoward Hinnant ++__r; 36973e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36983e519524SHoward Hinnant { 36993e519524SHoward Hinnant swap(*__x3, *__x4); 37003e519524SHoward Hinnant ++__r; 37013e519524SHoward Hinnant if (__c(*__x3, *__x2)) 37023e519524SHoward Hinnant { 37033e519524SHoward Hinnant swap(*__x2, *__x3); 37043e519524SHoward Hinnant ++__r; 37053e519524SHoward Hinnant if (__c(*__x2, *__x1)) 37063e519524SHoward Hinnant { 37073e519524SHoward Hinnant swap(*__x1, *__x2); 37083e519524SHoward Hinnant ++__r; 37093e519524SHoward Hinnant } 37103e519524SHoward Hinnant } 37113e519524SHoward Hinnant } 37123e519524SHoward Hinnant } 37133e519524SHoward Hinnant return __r; 37143e519524SHoward Hinnant} 37153e519524SHoward Hinnant 37163e519524SHoward Hinnant// Assumes size > 0 37173e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37183e519524SHoward Hinnantvoid 37193e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37203e519524SHoward Hinnant{ 37213e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 37223e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 37233e519524SHoward Hinnant { 3724ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37253e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37263e519524SHoward Hinnant (__first, __last, __comp); 37273e519524SHoward Hinnant if (__i != __first) 37283e519524SHoward Hinnant swap(*__first, *__i); 37293e519524SHoward Hinnant } 37303e519524SHoward Hinnant} 37313e519524SHoward Hinnant 37323e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37333e519524SHoward Hinnantvoid 37343e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37353e519524SHoward Hinnant{ 37363e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37373e519524SHoward Hinnant if (__first != __last) 37383e519524SHoward Hinnant { 37393e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37403e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37413e519524SHoward Hinnant { 37423e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3743ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37443e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3745ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3746ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37473e519524SHoward Hinnant } 37483e519524SHoward Hinnant } 37493e519524SHoward Hinnant} 37503e519524SHoward Hinnant 37513e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37523e519524SHoward Hinnantvoid 37533e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37543e519524SHoward Hinnant{ 37553e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37563e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37573e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37583e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37593e519524SHoward Hinnant { 37603e519524SHoward Hinnant if (__comp(*__i, *__j)) 37613e519524SHoward Hinnant { 3762ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37633e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37643e519524SHoward Hinnant __j = __i; 37653e519524SHoward Hinnant do 37663e519524SHoward Hinnant { 3767ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37683e519524SHoward Hinnant __j = __k; 37693e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3770ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37713e519524SHoward Hinnant } 37723e519524SHoward Hinnant __j = __i; 37733e519524SHoward Hinnant } 37743e519524SHoward Hinnant} 37753e519524SHoward Hinnant 37763e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37773e519524SHoward Hinnantbool 37783e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37793e519524SHoward Hinnant{ 37803e519524SHoward Hinnant switch (__last - __first) 37813e519524SHoward Hinnant { 37823e519524SHoward Hinnant case 0: 37833e519524SHoward Hinnant case 1: 37843e519524SHoward Hinnant return true; 37853e519524SHoward Hinnant case 2: 37863e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37873e519524SHoward Hinnant swap(*__first, *__last); 37883e519524SHoward Hinnant return true; 37893e519524SHoward Hinnant case 3: 3790ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37913e519524SHoward Hinnant return true; 37923e519524SHoward Hinnant case 4: 3793ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37943e519524SHoward Hinnant return true; 37953e519524SHoward Hinnant case 5: 3796ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37973e519524SHoward Hinnant return true; 37983e519524SHoward Hinnant } 37993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 38003e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 38013e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 38023e519524SHoward Hinnant const unsigned __limit = 8; 38033e519524SHoward Hinnant unsigned __count = 0; 38043e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 38053e519524SHoward Hinnant { 38063e519524SHoward Hinnant if (__comp(*__i, *__j)) 38073e519524SHoward Hinnant { 3808ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 38093e519524SHoward Hinnant _RandomAccessIterator __k = __j; 38103e519524SHoward Hinnant __j = __i; 38113e519524SHoward Hinnant do 38123e519524SHoward Hinnant { 3813ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 38143e519524SHoward Hinnant __j = __k; 38153e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3816ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 38173e519524SHoward Hinnant if (++__count == __limit) 38183e519524SHoward Hinnant return ++__i == __last; 38193e519524SHoward Hinnant } 38203e519524SHoward Hinnant __j = __i; 38213e519524SHoward Hinnant } 38223e519524SHoward Hinnant return true; 38233e519524SHoward Hinnant} 38243e519524SHoward Hinnant 38253e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38263e519524SHoward Hinnantvoid 38273e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38283e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38293e519524SHoward Hinnant{ 38303e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38313e519524SHoward Hinnant if (__first1 != __last1) 38323e519524SHoward Hinnant { 38333e519524SHoward Hinnant __destruct_n __d(0); 38343e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38353e519524SHoward Hinnant value_type* __last2 = __first2; 3836ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38373e519524SHoward Hinnant __d.__incr((value_type*)0); 38383e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38393e519524SHoward Hinnant { 38403e519524SHoward Hinnant value_type* __j2 = __last2; 38413e519524SHoward Hinnant value_type* __i2 = __j2; 38423e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38433e519524SHoward Hinnant { 3844ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38453e519524SHoward Hinnant __d.__incr((value_type*)0); 38463e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3847ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3848ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38493e519524SHoward Hinnant } 38503e519524SHoward Hinnant else 38513e519524SHoward Hinnant { 3852ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38533e519524SHoward Hinnant __d.__incr((value_type*)0); 38543e519524SHoward Hinnant } 38553e519524SHoward Hinnant } 38563e519524SHoward Hinnant __h.release(); 38573e519524SHoward Hinnant } 38583e519524SHoward Hinnant} 38593e519524SHoward Hinnant 38603e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38613e519524SHoward Hinnantvoid 38623e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38633e519524SHoward Hinnant{ 38643e519524SHoward Hinnant // _Compare is known to be a reference type 38653e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38663e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3867ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3868ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38693e519524SHoward Hinnant while (true) 38703e519524SHoward Hinnant { 38713e519524SHoward Hinnant __restart: 38723e519524SHoward Hinnant difference_type __len = __last - __first; 38733e519524SHoward Hinnant switch (__len) 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant case 0: 38763e519524SHoward Hinnant case 1: 38773e519524SHoward Hinnant return; 38783e519524SHoward Hinnant case 2: 38793e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38803e519524SHoward Hinnant swap(*__first, *__last); 38813e519524SHoward Hinnant return; 38823e519524SHoward Hinnant case 3: 3883ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38843e519524SHoward Hinnant return; 38853e519524SHoward Hinnant case 4: 3886ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38873e519524SHoward Hinnant return; 38883e519524SHoward Hinnant case 5: 3889ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38903e519524SHoward Hinnant return; 38913e519524SHoward Hinnant } 38923e519524SHoward Hinnant if (__len <= __limit) 38933e519524SHoward Hinnant { 3894ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38953e519524SHoward Hinnant return; 38963e519524SHoward Hinnant } 38973e519524SHoward Hinnant // __len > 5 38983e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38993e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 39003e519524SHoward Hinnant --__lm1; 39013e519524SHoward Hinnant unsigned __n_swaps; 39023e519524SHoward Hinnant { 39033e519524SHoward Hinnant difference_type __delta; 39043e519524SHoward Hinnant if (__len >= 1000) 39053e519524SHoward Hinnant { 39063e519524SHoward Hinnant __delta = __len/2; 39073e519524SHoward Hinnant __m += __delta; 39083e519524SHoward Hinnant __delta /= 2; 3909ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 39103e519524SHoward Hinnant } 39113e519524SHoward Hinnant else 39123e519524SHoward Hinnant { 39133e519524SHoward Hinnant __delta = __len/2; 39143e519524SHoward Hinnant __m += __delta; 3915ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 39163e519524SHoward Hinnant } 39173e519524SHoward Hinnant } 39183e519524SHoward Hinnant // *__m is median 39193e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 39203e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 39213e519524SHoward Hinnant _RandomAccessIterator __i = __first; 39223e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 39233e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39243e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39253e519524SHoward Hinnant // Prime the downward search with a guard. 39263e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39273e519524SHoward Hinnant { 39283e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39293e519524SHoward Hinnant // manually guard downward moving __j against __i 39303e519524SHoward Hinnant while (true) 39313e519524SHoward Hinnant { 39323e519524SHoward Hinnant if (__i == --__j) 39333e519524SHoward Hinnant { 39343e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39353e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39363e519524SHoward Hinnant ++__i; // __first + 1 39373e519524SHoward Hinnant __j = __last; 39383e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39393e519524SHoward Hinnant { 39403e519524SHoward Hinnant while (true) 39413e519524SHoward Hinnant { 39423e519524SHoward Hinnant if (__i == __j) 39433e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39443e519524SHoward Hinnant if (__comp(*__first, *__i)) 39453e519524SHoward Hinnant { 39463e519524SHoward Hinnant swap(*__i, *__j); 39473e519524SHoward Hinnant ++__n_swaps; 39483e519524SHoward Hinnant ++__i; 39493e519524SHoward Hinnant break; 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant ++__i; 39523e519524SHoward Hinnant } 39533e519524SHoward Hinnant } 39543e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39553e519524SHoward Hinnant if (__i == __j) 39563e519524SHoward Hinnant return; 39573e519524SHoward Hinnant while (true) 39583e519524SHoward Hinnant { 39593e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39603e519524SHoward Hinnant ++__i; 39613e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39623e519524SHoward Hinnant ; 39633e519524SHoward Hinnant if (__i >= __j) 39643e519524SHoward Hinnant break; 39653e519524SHoward Hinnant swap(*__i, *__j); 39663e519524SHoward Hinnant ++__n_swaps; 39673e519524SHoward Hinnant ++__i; 39683e519524SHoward Hinnant } 39693e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39703e519524SHoward Hinnant // The first part is sorted, sort the secod part 3971ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39723e519524SHoward Hinnant __first = __i; 39733e519524SHoward Hinnant goto __restart; 39743e519524SHoward Hinnant } 39753e519524SHoward Hinnant if (__comp(*__j, *__m)) 39763e519524SHoward Hinnant { 39773e519524SHoward Hinnant swap(*__i, *__j); 39783e519524SHoward Hinnant ++__n_swaps; 39793e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant } 39823e519524SHoward Hinnant } 39833e519524SHoward Hinnant // It is known that *__i < *__m 39843e519524SHoward Hinnant ++__i; 39853e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39863e519524SHoward Hinnant // if not yet partitioned... 39873e519524SHoward Hinnant if (__i < __j) 39883e519524SHoward Hinnant { 39893e519524SHoward Hinnant // known that *(__i - 1) < *__m 39903e519524SHoward Hinnant // known that __i <= __m 39913e519524SHoward Hinnant while (true) 39923e519524SHoward Hinnant { 39933e519524SHoward Hinnant // __m still guards upward moving __i 39943e519524SHoward Hinnant while (__comp(*__i, *__m)) 39953e519524SHoward Hinnant ++__i; 39963e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39973e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39983e519524SHoward Hinnant ; 39993e519524SHoward Hinnant if (__i > __j) 40003e519524SHoward Hinnant break; 40013e519524SHoward Hinnant swap(*__i, *__j); 40023e519524SHoward Hinnant ++__n_swaps; 40033e519524SHoward Hinnant // It is known that __m != __j 40043e519524SHoward Hinnant // If __m just moved, follow it 40053e519524SHoward Hinnant if (__m == __i) 40063e519524SHoward Hinnant __m = __j; 40073e519524SHoward Hinnant ++__i; 40083e519524SHoward Hinnant } 40093e519524SHoward Hinnant } 40103e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 40113e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 40123e519524SHoward Hinnant { 40133e519524SHoward Hinnant swap(*__i, *__m); 40143e519524SHoward Hinnant ++__n_swaps; 40153e519524SHoward Hinnant } 40163e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 40173e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 40183e519524SHoward Hinnant if (__n_swaps == 0) 40193e519524SHoward Hinnant { 4020ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 4021ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 40223e519524SHoward Hinnant { 40233e519524SHoward Hinnant if (__fs) 40243e519524SHoward Hinnant return; 40253e519524SHoward Hinnant __last = __i; 40263e519524SHoward Hinnant continue; 40273e519524SHoward Hinnant } 40283e519524SHoward Hinnant else 40293e519524SHoward Hinnant { 40303e519524SHoward Hinnant if (__fs) 40313e519524SHoward Hinnant { 40323e519524SHoward Hinnant __first = ++__i; 40333e519524SHoward Hinnant continue; 40343e519524SHoward Hinnant } 40353e519524SHoward Hinnant } 40363e519524SHoward Hinnant } 40373e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40383e519524SHoward Hinnant if (__i - __first < __last - __i) 40393e519524SHoward Hinnant { 4040ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4041ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40423e519524SHoward Hinnant __first = ++__i; 40433e519524SHoward Hinnant } 40443e519524SHoward Hinnant else 40453e519524SHoward Hinnant { 4046ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4047ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40483e519524SHoward Hinnant __last = __i; 40493e519524SHoward Hinnant } 40503e519524SHoward Hinnant } 40513e519524SHoward Hinnant} 40523e519524SHoward Hinnant 40533e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40543e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40563e519524SHoward Hinnantvoid 40573e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40583e519524SHoward Hinnant{ 4059145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40623e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4063145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40653e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4066145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40673e519524SHoward Hinnant} 40683e519524SHoward Hinnant 40693e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40713e519524SHoward Hinnantvoid 40723e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40733e519524SHoward Hinnant{ 4074ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40753e519524SHoward Hinnant} 40763e519524SHoward Hinnant 40773e519524SHoward Hinnanttemplate <class _Tp> 40783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40793e519524SHoward Hinnantvoid 40803e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40813e519524SHoward Hinnant{ 4082ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40833e519524SHoward Hinnant} 40843e519524SHoward Hinnant 40853e519524SHoward Hinnanttemplate <class _Tp> 40863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40873e519524SHoward Hinnantvoid 40883e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40893e519524SHoward Hinnant{ 4090ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40913e519524SHoward Hinnant} 40923e519524SHoward Hinnant 4093f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4094f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4095f554add5SHoward Hinnantvoid 4096f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4097f554add5SHoward Hinnant{ 4098f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4099f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4100f554add5SHoward Hinnant} 4101f554add5SHoward Hinnant 41020be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4103e4383379SHoward Hinnant#pragma warning( push ) 4104e4383379SHoward Hinnant#pragma warning( disable: 4231) 41050be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4106f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4107f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4108f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4109f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4110f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4111f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4112f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4113f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4114f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4115f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4116f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4117f0544c20SHoward 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>&)) 4118f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4119f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4120f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41213e519524SHoward Hinnant 4122f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4123f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4124f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4125f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4126f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4127f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4128f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4129f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4130f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4131f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4132f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4133f0544c20SHoward 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>&)) 4134f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4135f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4136f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41373e519524SHoward Hinnant 4138f0544c20SHoward 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>&)) 41390be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4140e4383379SHoward Hinnant#pragma warning( pop ) 41410be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41423e519524SHoward Hinnant 41433e519524SHoward Hinnant// lower_bound 41443e519524SHoward Hinnant 41453e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41463e519524SHoward Hinnant_ForwardIterator 4147e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41483e519524SHoward Hinnant{ 41493e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4150ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41513e519524SHoward Hinnant while (__len != 0) 41523e519524SHoward Hinnant { 41533e519524SHoward Hinnant difference_type __l2 = __len / 2; 41543e519524SHoward Hinnant _ForwardIterator __m = __first; 4155ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4156e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41573e519524SHoward Hinnant { 41583e519524SHoward Hinnant __first = ++__m; 41593e519524SHoward Hinnant __len -= __l2 + 1; 41603e519524SHoward Hinnant } 41613e519524SHoward Hinnant else 41623e519524SHoward Hinnant __len = __l2; 41633e519524SHoward Hinnant } 41643e519524SHoward Hinnant return __first; 41653e519524SHoward Hinnant} 41663e519524SHoward Hinnant 41673e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41693e519524SHoward Hinnant_ForwardIterator 4170e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41713e519524SHoward Hinnant{ 4172145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41733e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41743e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4175e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4176145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41773e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4178e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4179145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41803e519524SHoward Hinnant} 41813e519524SHoward Hinnant 41823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41843e519524SHoward Hinnant_ForwardIterator 4185e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41863e519524SHoward Hinnant{ 4187e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41883e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41893e519524SHoward Hinnant} 41903e519524SHoward Hinnant 41913e519524SHoward Hinnant// upper_bound 41923e519524SHoward Hinnant 41933e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41943e519524SHoward Hinnant_ForwardIterator 4195e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41963e519524SHoward Hinnant{ 41973e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4198ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41993e519524SHoward Hinnant while (__len != 0) 42003e519524SHoward Hinnant { 42013e519524SHoward Hinnant difference_type __l2 = __len / 2; 42023e519524SHoward Hinnant _ForwardIterator __m = __first; 4203ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4204e4383379SHoward Hinnant if (__comp(__value_, *__m)) 42053e519524SHoward Hinnant __len = __l2; 42063e519524SHoward Hinnant else 42073e519524SHoward Hinnant { 42083e519524SHoward Hinnant __first = ++__m; 42093e519524SHoward Hinnant __len -= __l2 + 1; 42103e519524SHoward Hinnant } 42113e519524SHoward Hinnant } 42123e519524SHoward Hinnant return __first; 42133e519524SHoward Hinnant} 42143e519524SHoward Hinnant 42153e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42173e519524SHoward Hinnant_ForwardIterator 4218e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42193e519524SHoward Hinnant{ 4220145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4223e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4224145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4226e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4227145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42283e519524SHoward Hinnant} 42293e519524SHoward Hinnant 42303e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42323e519524SHoward Hinnant_ForwardIterator 4233e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42343e519524SHoward Hinnant{ 4235e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42363e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42373e519524SHoward Hinnant} 42383e519524SHoward Hinnant 42393e519524SHoward Hinnant// equal_range 42403e519524SHoward Hinnant 42413e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42423e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4243e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42443e519524SHoward Hinnant{ 42453e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4246ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42473e519524SHoward Hinnant while (__len != 0) 42483e519524SHoward Hinnant { 42493e519524SHoward Hinnant difference_type __l2 = __len / 2; 42503e519524SHoward Hinnant _ForwardIterator __m = __first; 4251ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4252e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42533e519524SHoward Hinnant { 42543e519524SHoward Hinnant __first = ++__m; 42553e519524SHoward Hinnant __len -= __l2 + 1; 42563e519524SHoward Hinnant } 4257e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42583e519524SHoward Hinnant { 42593e519524SHoward Hinnant __last = __m; 42603e519524SHoward Hinnant __len = __l2; 42613e519524SHoward Hinnant } 42623e519524SHoward Hinnant else 42633e519524SHoward Hinnant { 42643e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42653e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42663e519524SHoward Hinnant ( 4267e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4268e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42693e519524SHoward Hinnant ); 42703e519524SHoward Hinnant } 42713e519524SHoward Hinnant } 42723e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42773e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4278e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42793e519524SHoward Hinnant{ 4280145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42813e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42823e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4283e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4284145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42853e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4286e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4287145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42883e519524SHoward Hinnant} 42893e519524SHoward Hinnant 42903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42923e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4293e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42943e519524SHoward Hinnant{ 4295e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42963e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42973e519524SHoward Hinnant} 42983e519524SHoward Hinnant 42993e519524SHoward Hinnant// binary_search 43003e519524SHoward Hinnant 43013e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 43023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43033e519524SHoward Hinnantbool 4304e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43053e519524SHoward Hinnant{ 4306e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4307e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 43083e519524SHoward Hinnant} 43093e519524SHoward Hinnant 43103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 43113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43123e519524SHoward Hinnantbool 4313e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 43143e519524SHoward Hinnant{ 4315145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43163e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43173e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4318e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4319145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43203e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4321e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4322145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43233e519524SHoward Hinnant} 43243e519524SHoward Hinnant 43253e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43273e519524SHoward Hinnantbool 4328e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43293e519524SHoward Hinnant{ 4330e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43313e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43323e519524SHoward Hinnant} 43333e519524SHoward Hinnant 43343e519524SHoward Hinnant// merge 43353e519524SHoward Hinnant 43363e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43373e519524SHoward Hinnant_OutputIterator 43383e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43403e519524SHoward Hinnant{ 43413e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43423e519524SHoward Hinnant { 43433e519524SHoward Hinnant if (__first2 == __last2) 4344ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43463e519524SHoward Hinnant { 43473e519524SHoward Hinnant *__result = *__first2; 43483e519524SHoward Hinnant ++__first2; 43493e519524SHoward Hinnant } 43503e519524SHoward Hinnant else 43513e519524SHoward Hinnant { 43523e519524SHoward Hinnant *__result = *__first1; 43533e519524SHoward Hinnant ++__first1; 43543e519524SHoward Hinnant } 43553e519524SHoward Hinnant } 4356ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43573e519524SHoward Hinnant} 43583e519524SHoward Hinnant 43593e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43613e519524SHoward Hinnant_OutputIterator 43623e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43633e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43643e519524SHoward Hinnant{ 4365145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43663e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43673e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4368ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4369145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43703e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4371ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4372145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43733e519524SHoward Hinnant} 43743e519524SHoward Hinnant 43753e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43763e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43773e519524SHoward Hinnant_OutputIterator 43783e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43793e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43803e519524SHoward Hinnant{ 43813e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43823e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43833e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43843e519524SHoward Hinnant} 43853e519524SHoward Hinnant 43863e519524SHoward Hinnant// inplace_merge 43873e519524SHoward Hinnant 4388adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4389adfdae18SMarshall Clow class _OutputIterator> 4390adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4391adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4392adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4393adfdae18SMarshall Clow{ 4394adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4395adfdae18SMarshall Clow { 4396adfdae18SMarshall Clow if (__first2 == __last2) 4397adfdae18SMarshall Clow { 4398adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4399adfdae18SMarshall Clow return; 4400adfdae18SMarshall Clow } 4401adfdae18SMarshall Clow 4402adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4403adfdae18SMarshall Clow { 4404adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4405adfdae18SMarshall Clow ++__first2; 4406adfdae18SMarshall Clow } 4407adfdae18SMarshall Clow else 4408adfdae18SMarshall Clow { 4409adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4410adfdae18SMarshall Clow ++__first1; 4411adfdae18SMarshall Clow } 4412adfdae18SMarshall Clow } 4413adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4414adfdae18SMarshall Clow} 4415adfdae18SMarshall Clow 44163e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44173e519524SHoward Hinnantvoid 44183e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44193e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44203e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44213e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 44223e519524SHoward Hinnant{ 44233e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44243e519524SHoward Hinnant __destruct_n __d(0); 44253e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44263e519524SHoward Hinnant if (__len1 <= __len2) 44273e519524SHoward Hinnant { 44283e519524SHoward Hinnant value_type* __p = __buff; 4429910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4430ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4431adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44323e519524SHoward Hinnant } 44333e519524SHoward Hinnant else 44343e519524SHoward Hinnant { 44353e519524SHoward Hinnant value_type* __p = __buff; 4436910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4437ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44383e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44393e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4440adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4441adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 44423e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 44433e519524SHoward Hinnant } 44443e519524SHoward Hinnant} 44453e519524SHoward Hinnant 44463e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44473e519524SHoward Hinnantvoid 44483e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44493e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44503e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44513e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44523e519524SHoward Hinnant{ 44533e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44543e519524SHoward Hinnant while (true) 44553e519524SHoward Hinnant { 44563e519524SHoward Hinnant // if __middle == __last, we're done 44573e519524SHoward Hinnant if (__len2 == 0) 44583e519524SHoward Hinnant return; 4459526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4460526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4461526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44623e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4463910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44643e519524SHoward Hinnant { 44653e519524SHoward Hinnant if (__len1 == 0) 44663e519524SHoward Hinnant return; 44673e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44683e519524SHoward Hinnant break; 44693e519524SHoward Hinnant } 44703e519524SHoward Hinnant // __first < __middle < __last 44713e519524SHoward Hinnant // *__first > *__middle 44723e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44733e519524SHoward Hinnant // all elements in: 44743e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44753e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44763e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44773e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44783e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44793e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44803e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44813e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44823e519524SHoward Hinnant // binary search smaller range 44833e519524SHoward Hinnant if (__len1 < __len2) 44843e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44853e519524SHoward Hinnant __len21 = __len2 / 2; 44863e519524SHoward Hinnant __m2 = __middle; 4487ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44883e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4489ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44903e519524SHoward Hinnant } 44913e519524SHoward Hinnant else 44923e519524SHoward Hinnant { 44933e519524SHoward Hinnant if (__len1 == 1) 44943e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44953e519524SHoward Hinnant // It is known *__first > *__middle 44963e519524SHoward Hinnant swap(*__first, *__middle); 44973e519524SHoward Hinnant return; 44983e519524SHoward Hinnant } 44993e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 45003e519524SHoward Hinnant __len11 = __len1 / 2; 45013e519524SHoward Hinnant __m1 = __first; 4502ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 45033e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4504ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 45053e519524SHoward Hinnant } 45063e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 45073e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 45083e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 45093e519524SHoward Hinnant // swap middle two partitions 4510ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 45113e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 45123e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 45133e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 45143e519524SHoward Hinnant { 45153e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45163e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45173e519524SHoward Hinnant __first = __middle; 45183e519524SHoward Hinnant __middle = __m2; 45193e519524SHoward Hinnant __len1 = __len12; 45203e519524SHoward Hinnant __len2 = __len22; 45213e519524SHoward Hinnant } 45223e519524SHoward Hinnant else 45233e519524SHoward Hinnant { 45243e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45253e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45263e519524SHoward Hinnant __last = __middle; 45273e519524SHoward Hinnant __middle = __m1; 45283e519524SHoward Hinnant __len1 = __len11; 45293e519524SHoward Hinnant __len2 = __len21; 45303e519524SHoward Hinnant } 45313e519524SHoward Hinnant } 45323e519524SHoward Hinnant} 45333e519524SHoward Hinnant 45343e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45363e519524SHoward Hinnantvoid 45373e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45383e519524SHoward Hinnant _Compare __comp) 45393e519524SHoward Hinnant{ 45403e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45413e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4542ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4543ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4544ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45450b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45460b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45470b48cf9aSMarshall Clow 4548145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4551ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45523e519524SHoward Hinnant __buf.first, __buf.second); 4553145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45543e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4555ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45563e519524SHoward Hinnant __buf.first, __buf.second); 4557145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45583e519524SHoward Hinnant} 45593e519524SHoward Hinnant 45603e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45613e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45623e519524SHoward Hinnantvoid 45633e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45643e519524SHoward Hinnant{ 4565ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45663e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45673e519524SHoward Hinnant} 45683e519524SHoward Hinnant 45693e519524SHoward Hinnant// stable_sort 45703e519524SHoward Hinnant 45713e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45723e519524SHoward Hinnantvoid 45733e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45753e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45763e519524SHoward Hinnant{ 45773e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45783e519524SHoward Hinnant __destruct_n __d(0); 45793e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45803e519524SHoward Hinnant for (; true; ++__result) 45813e519524SHoward Hinnant { 45823e519524SHoward Hinnant if (__first1 == __last1) 45833e519524SHoward Hinnant { 45843e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4585ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45863e519524SHoward Hinnant __h.release(); 45873e519524SHoward Hinnant return; 45883e519524SHoward Hinnant } 45893e519524SHoward Hinnant if (__first2 == __last2) 45903e519524SHoward Hinnant { 45913e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4592ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45933e519524SHoward Hinnant __h.release(); 45943e519524SHoward Hinnant return; 45953e519524SHoward Hinnant } 45963e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45973e519524SHoward Hinnant { 4598ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45993e519524SHoward Hinnant __d.__incr((value_type*)0); 46003e519524SHoward Hinnant ++__first2; 46013e519524SHoward Hinnant } 46023e519524SHoward Hinnant else 46033e519524SHoward Hinnant { 4604ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 46053e519524SHoward Hinnant __d.__incr((value_type*)0); 46063e519524SHoward Hinnant ++__first1; 46073e519524SHoward Hinnant } 46083e519524SHoward Hinnant } 46093e519524SHoward Hinnant} 46103e519524SHoward Hinnant 46113e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 46123e519524SHoward Hinnantvoid 46133e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 46143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 46153e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 46163e519524SHoward Hinnant{ 46173e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 46183e519524SHoward Hinnant { 46193e519524SHoward Hinnant if (__first2 == __last2) 46203e519524SHoward Hinnant { 46213e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4622ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46233e519524SHoward Hinnant return; 46243e519524SHoward Hinnant } 46253e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46263e519524SHoward Hinnant { 4627ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46283e519524SHoward Hinnant ++__first2; 46293e519524SHoward Hinnant } 46303e519524SHoward Hinnant else 46313e519524SHoward Hinnant { 4632ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46333e519524SHoward Hinnant ++__first1; 46343e519524SHoward Hinnant } 46353e519524SHoward Hinnant } 46363e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4637ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46383e519524SHoward Hinnant} 46393e519524SHoward Hinnant 46403e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46413e519524SHoward Hinnantvoid 46423e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46433e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46443e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46453e519524SHoward Hinnant 46463e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46473e519524SHoward Hinnantvoid 46483e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46493e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46503e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46513e519524SHoward Hinnant{ 46523e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46533e519524SHoward Hinnant switch (__len) 46543e519524SHoward Hinnant { 46553e519524SHoward Hinnant case 0: 46563e519524SHoward Hinnant return; 46573e519524SHoward Hinnant case 1: 4658ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46593e519524SHoward Hinnant return; 46603e519524SHoward Hinnant case 2: 46613e519524SHoward Hinnant __destruct_n __d(0); 46623e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46633e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46643e519524SHoward Hinnant { 4665ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46663e519524SHoward Hinnant __d.__incr((value_type*)0); 46673e519524SHoward Hinnant ++__first2; 4668ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46693e519524SHoward Hinnant } 46703e519524SHoward Hinnant else 46713e519524SHoward Hinnant { 4672ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46733e519524SHoward Hinnant __d.__incr((value_type*)0); 46743e519524SHoward Hinnant ++__first2; 4675ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46763e519524SHoward Hinnant } 46773e519524SHoward Hinnant __h2.release(); 46783e519524SHoward Hinnant return; 46793e519524SHoward Hinnant } 46803e519524SHoward Hinnant if (__len <= 8) 46813e519524SHoward Hinnant { 46823e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46833e519524SHoward Hinnant return; 46843e519524SHoward Hinnant } 46853e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46863e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46873e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46883e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46893e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46903e519524SHoward Hinnant} 46913e519524SHoward Hinnant 46923e519524SHoward Hinnanttemplate <class _Tp> 46933e519524SHoward Hinnantstruct __stable_sort_switch 46943e519524SHoward Hinnant{ 4695ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46963e519524SHoward Hinnant}; 46973e519524SHoward Hinnant 46983e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46993e519524SHoward Hinnantvoid 47003e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 47013e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 47023e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 47033e519524SHoward Hinnant{ 47043e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47053e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47063e519524SHoward Hinnant switch (__len) 47073e519524SHoward Hinnant { 47083e519524SHoward Hinnant case 0: 47093e519524SHoward Hinnant case 1: 47103e519524SHoward Hinnant return; 47113e519524SHoward Hinnant case 2: 47123e519524SHoward Hinnant if (__comp(*--__last, *__first)) 47133e519524SHoward Hinnant swap(*__first, *__last); 47143e519524SHoward Hinnant return; 47153e519524SHoward Hinnant } 47163e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47173e519524SHoward Hinnant { 47183e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 47193e519524SHoward Hinnant return; 47203e519524SHoward Hinnant } 47213e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 47223e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 47233e519524SHoward Hinnant if (__len <= __buff_size) 47243e519524SHoward Hinnant { 47253e519524SHoward Hinnant __destruct_n __d(0); 47263e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47273e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47283e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47293e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47303e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47313e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47323e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47333e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47343e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47353e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47363e519524SHoward Hinnant// __first, __comp); 47373e519524SHoward Hinnant return; 47383e519524SHoward Hinnant } 47393e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47403e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47413e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47423e519524SHoward Hinnant} 47433e519524SHoward Hinnant 47443e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47463e519524SHoward Hinnantvoid 47473e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47483e519524SHoward Hinnant{ 47493e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47503e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47513e519524SHoward Hinnant difference_type __len = __last - __first; 47523e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47533e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47543e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47553e519524SHoward Hinnant { 4756ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47573e519524SHoward Hinnant __h.reset(__buf.first); 47583e519524SHoward Hinnant } 4759145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47603e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47613e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47623e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4763145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47643e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47653e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4766145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47673e519524SHoward Hinnant} 47683e519524SHoward Hinnant 47693e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47713e519524SHoward Hinnantvoid 47723e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47733e519524SHoward Hinnant{ 4774ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47753e519524SHoward Hinnant} 47763e519524SHoward Hinnant 47773e519524SHoward Hinnant// is_heap_until 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47803e519524SHoward Hinnant_RandomAccessIterator 47813e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47823e519524SHoward Hinnant{ 4783ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47843e519524SHoward Hinnant difference_type __len = __last - __first; 47853e519524SHoward Hinnant difference_type __p = 0; 47863e519524SHoward Hinnant difference_type __c = 1; 47873e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47883e519524SHoward Hinnant while (__c < __len) 47893e519524SHoward Hinnant { 47903e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47913e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47923e519524SHoward Hinnant return __cp; 47933e519524SHoward Hinnant ++__c; 47943e519524SHoward Hinnant ++__cp; 47953e519524SHoward Hinnant if (__c == __len) 47963e519524SHoward Hinnant return __last; 47973e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47983e519524SHoward Hinnant return __cp; 47993e519524SHoward Hinnant ++__p; 48003e519524SHoward Hinnant ++__pp; 48013e519524SHoward Hinnant __c = 2 * __p + 1; 48023e519524SHoward Hinnant } 48033e519524SHoward Hinnant return __last; 48043e519524SHoward Hinnant} 48053e519524SHoward Hinnant 48063e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48083e519524SHoward Hinnant_RandomAccessIterator 48093e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 48103e519524SHoward Hinnant{ 4811ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48123e519524SHoward Hinnant} 48133e519524SHoward Hinnant 48143e519524SHoward Hinnant// is_heap 48153e519524SHoward Hinnant 48163e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48183e519524SHoward Hinnantbool 48193e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48203e519524SHoward Hinnant{ 4821ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 48223e519524SHoward Hinnant} 48233e519524SHoward Hinnant 48243e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48263e519524SHoward Hinnantbool 48273e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48283e519524SHoward Hinnant{ 4829ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48303e519524SHoward Hinnant} 48313e519524SHoward Hinnant 48323e519524SHoward Hinnant// push_heap 48333e519524SHoward Hinnant 48343e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48353e519524SHoward Hinnantvoid 48368b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48373e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48383e519524SHoward Hinnant{ 48393e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48403e519524SHoward Hinnant if (__len > 1) 48413e519524SHoward Hinnant { 48423e519524SHoward Hinnant __len = (__len - 2) / 2; 48433e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48443e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48453e519524SHoward Hinnant { 4846ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48473e519524SHoward Hinnant do 48483e519524SHoward Hinnant { 4849ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48503e519524SHoward Hinnant __last = __ptr; 48513e519524SHoward Hinnant if (__len == 0) 48523e519524SHoward Hinnant break; 48533e519524SHoward Hinnant __len = (__len - 1) / 2; 48543e519524SHoward Hinnant __ptr = __first + __len; 48553e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4856ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48573e519524SHoward Hinnant } 48583e519524SHoward Hinnant } 48593e519524SHoward Hinnant} 48603e519524SHoward Hinnant 48613e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48633e519524SHoward Hinnantvoid 48643e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48653e519524SHoward Hinnant{ 4866145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48673e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48683e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48698b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4870145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48728b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4873145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48743e519524SHoward Hinnant} 48753e519524SHoward Hinnant 48763e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48783e519524SHoward Hinnantvoid 48793e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48803e519524SHoward Hinnant{ 4881ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48823e519524SHoward Hinnant} 48833e519524SHoward Hinnant 48843e519524SHoward Hinnant// pop_heap 48853e519524SHoward Hinnant 48863e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48878b512602SDavid Majnemervoid 48888b512602SDavid Majnemer__sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48898b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48908b512602SDavid Majnemer _RandomAccessIterator __start) 48918b512602SDavid Majnemer{ 48928b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48938b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48948b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48958b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48968b512602SDavid Majnemer difference_type __child = __start - __first; 48978b512602SDavid Majnemer 48988b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48998b512602SDavid Majnemer return; 49008b512602SDavid Majnemer 49018b512602SDavid Majnemer __child = 2 * __child + 1; 49028b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 49038b512602SDavid Majnemer 49048b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49058b512602SDavid Majnemer // right-child exists and is greater than left-child 49068b512602SDavid Majnemer ++__child_i; 49078b512602SDavid Majnemer ++__child; 49088b512602SDavid Majnemer } 49098b512602SDavid Majnemer 49108b512602SDavid Majnemer // check if we are in heap-order 49118b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 49128b512602SDavid Majnemer // we are, __start is larger than it's largest child 49138b512602SDavid Majnemer return; 49148b512602SDavid Majnemer 49158b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 49168b512602SDavid Majnemer do 49178b512602SDavid Majnemer { 49188b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 49198b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 49208b512602SDavid Majnemer __start = __child_i; 49218b512602SDavid Majnemer 49228b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 49238b512602SDavid Majnemer break; 49248b512602SDavid Majnemer 49258b512602SDavid Majnemer // recompute the child based off of the updated parent 49268b512602SDavid Majnemer __child = 2 * __child + 1; 49278b512602SDavid Majnemer __child_i = __first + __child; 49288b512602SDavid Majnemer 49298b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49308b512602SDavid Majnemer // right-child exists and is greater than left-child 49318b512602SDavid Majnemer ++__child_i; 49328b512602SDavid Majnemer ++__child; 49338b512602SDavid Majnemer } 49348b512602SDavid Majnemer 49358b512602SDavid Majnemer // check if we are in heap-order 49368b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49378b512602SDavid Majnemer *__start = _VSTD::move(__top); 49388b512602SDavid Majnemer} 49398b512602SDavid Majnemer 49408b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49423e519524SHoward Hinnantvoid 49433e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49443e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49453e519524SHoward Hinnant{ 49463e519524SHoward Hinnant if (__len > 1) 49473e519524SHoward Hinnant { 49483e519524SHoward Hinnant swap(*__first, *--__last); 49498b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49503e519524SHoward Hinnant } 49513e519524SHoward Hinnant} 49523e519524SHoward Hinnant 49533e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49553e519524SHoward Hinnantvoid 49563e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49573e519524SHoward Hinnant{ 4958145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49613e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4962145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49643e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4965145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49663e519524SHoward Hinnant} 49673e519524SHoward Hinnant 49683e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49703e519524SHoward Hinnantvoid 49713e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49723e519524SHoward Hinnant{ 4973ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49743e519524SHoward Hinnant} 49753e519524SHoward Hinnant 49763e519524SHoward Hinnant// make_heap 49773e519524SHoward Hinnant 49783e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49793e519524SHoward Hinnantvoid 49803e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49813e519524SHoward Hinnant{ 49823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49833e519524SHoward Hinnant difference_type __n = __last - __first; 49843e519524SHoward Hinnant if (__n > 1) 49853e519524SHoward Hinnant { 49868b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49878b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49888b512602SDavid Majnemer { 49898b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49908b512602SDavid Majnemer } 49913e519524SHoward Hinnant } 49923e519524SHoward Hinnant} 49933e519524SHoward Hinnant 49943e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49963e519524SHoward Hinnantvoid 49973e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49983e519524SHoward Hinnant{ 4999145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50023e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 5003145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50053e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 5006145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50073e519524SHoward Hinnant} 50083e519524SHoward Hinnant 50093e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50113e519524SHoward Hinnantvoid 50123e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50133e519524SHoward Hinnant{ 5014ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50153e519524SHoward Hinnant} 50163e519524SHoward Hinnant 50173e519524SHoward Hinnant// sort_heap 50183e519524SHoward Hinnant 50193e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50203e519524SHoward Hinnantvoid 50213e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50223e519524SHoward Hinnant{ 50233e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50243e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50253e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50263e519524SHoward Hinnant} 50273e519524SHoward Hinnant 50283e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50303e519524SHoward Hinnantvoid 50313e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50323e519524SHoward Hinnant{ 5033145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50343e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50353e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50363e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5037145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50383e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50393e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5040145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50413e519524SHoward Hinnant} 50423e519524SHoward Hinnant 50433e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50453e519524SHoward Hinnantvoid 50463e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50473e519524SHoward Hinnant{ 5048ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50493e519524SHoward Hinnant} 50503e519524SHoward Hinnant 50513e519524SHoward Hinnant// partial_sort 50523e519524SHoward Hinnant 50533e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50543e519524SHoward Hinnantvoid 50553e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50563e519524SHoward Hinnant _Compare __comp) 50573e519524SHoward Hinnant{ 50583e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50593e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50603e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50613e519524SHoward Hinnant { 50623e519524SHoward Hinnant if (__comp(*__i, *__first)) 50633e519524SHoward Hinnant { 50643e519524SHoward Hinnant swap(*__i, *__first); 50658b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50663e519524SHoward Hinnant } 50673e519524SHoward Hinnant } 50683e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50693e519524SHoward Hinnant} 50703e519524SHoward Hinnant 50713e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50733e519524SHoward Hinnantvoid 50743e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50753e519524SHoward Hinnant _Compare __comp) 50763e519524SHoward Hinnant{ 5077145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50783e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50793e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50803e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5081145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50823e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50833e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5084145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50853e519524SHoward Hinnant} 50863e519524SHoward Hinnant 50873e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50893e519524SHoward Hinnantvoid 50903e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50913e519524SHoward Hinnant{ 5092ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50933e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50943e519524SHoward Hinnant} 50953e519524SHoward Hinnant 50963e519524SHoward Hinnant// partial_sort_copy 50973e519524SHoward Hinnant 50983e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50993e519524SHoward Hinnant_RandomAccessIterator 51003e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 51013e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51023e519524SHoward Hinnant{ 51033e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 51043e519524SHoward Hinnant if (__r != __result_last) 51053e519524SHoward Hinnant { 5106910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 51073e519524SHoward Hinnant *__r = *__first; 51083e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 51098b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 51103e519524SHoward Hinnant for (; __first != __last; ++__first) 51113e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 51123e519524SHoward Hinnant { 51133e519524SHoward Hinnant *__result_first = *__first; 51148b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 51153e519524SHoward Hinnant } 51163e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 51173e519524SHoward Hinnant } 51183e519524SHoward Hinnant return __r; 51193e519524SHoward Hinnant} 51203e519524SHoward Hinnant 51213e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 51223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51233e519524SHoward Hinnant_RandomAccessIterator 51243e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51253e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51263e519524SHoward Hinnant{ 5127145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51283e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51293e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51303e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5131145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51333e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5134145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51353e519524SHoward Hinnant} 51363e519524SHoward Hinnant 51373e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51393e519524SHoward Hinnant_RandomAccessIterator 51403e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51413e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51423e519524SHoward Hinnant{ 5143ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51443e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51453e519524SHoward Hinnant} 51463e519524SHoward Hinnant 51473e519524SHoward Hinnant// nth_element 51483e519524SHoward Hinnant 51493e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51503e519524SHoward Hinnantvoid 51513e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51523e519524SHoward Hinnant{ 51533e519524SHoward Hinnant // _Compare is known to be a reference type 51543e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51553e519524SHoward Hinnant const difference_type __limit = 7; 51563e519524SHoward Hinnant while (true) 51573e519524SHoward Hinnant { 51583e519524SHoward Hinnant __restart: 5159b34b4819SHoward Hinnant if (__nth == __last) 5160b34b4819SHoward Hinnant return; 51613e519524SHoward Hinnant difference_type __len = __last - __first; 51623e519524SHoward Hinnant switch (__len) 51633e519524SHoward Hinnant { 51643e519524SHoward Hinnant case 0: 51653e519524SHoward Hinnant case 1: 51663e519524SHoward Hinnant return; 51673e519524SHoward Hinnant case 2: 51683e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51693e519524SHoward Hinnant swap(*__first, *__last); 51703e519524SHoward Hinnant return; 51713e519524SHoward Hinnant case 3: 51723e519524SHoward Hinnant { 51733e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5174ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51753e519524SHoward Hinnant return; 51763e519524SHoward Hinnant } 51773e519524SHoward Hinnant } 51783e519524SHoward Hinnant if (__len <= __limit) 51793e519524SHoward Hinnant { 51803e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51813e519524SHoward Hinnant return; 51823e519524SHoward Hinnant } 51833e519524SHoward Hinnant // __len > __limit >= 3 51843e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51853e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5186ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51873e519524SHoward Hinnant // *__m is median 51883e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51893e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51903e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51913e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51923e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51933e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51943e519524SHoward Hinnant // Prime the downward search with a guard. 51953e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51963e519524SHoward Hinnant { 51973e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51983e519524SHoward Hinnant // manually guard downward moving __j against __i 51993e519524SHoward Hinnant while (true) 52003e519524SHoward Hinnant { 52013e519524SHoward Hinnant if (__i == --__j) 52023e519524SHoward Hinnant { 52033e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 52043e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 52053e519524SHoward Hinnant ++__i; // __first + 1 52063e519524SHoward Hinnant __j = __last; 52073e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 52083e519524SHoward Hinnant { 52093e519524SHoward Hinnant while (true) 52103e519524SHoward Hinnant { 52113e519524SHoward Hinnant if (__i == __j) 52123e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 52133e519524SHoward Hinnant if (__comp(*__first, *__i)) 52143e519524SHoward Hinnant { 52153e519524SHoward Hinnant swap(*__i, *__j); 52163e519524SHoward Hinnant ++__n_swaps; 52173e519524SHoward Hinnant ++__i; 52183e519524SHoward Hinnant break; 52193e519524SHoward Hinnant } 52203e519524SHoward Hinnant ++__i; 52213e519524SHoward Hinnant } 52223e519524SHoward Hinnant } 52233e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52243e519524SHoward Hinnant if (__i == __j) 52253e519524SHoward Hinnant return; 52263e519524SHoward Hinnant while (true) 52273e519524SHoward Hinnant { 52283e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52293e519524SHoward Hinnant ++__i; 52303e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52313e519524SHoward Hinnant ; 52323e519524SHoward Hinnant if (__i >= __j) 52333e519524SHoward Hinnant break; 52343e519524SHoward Hinnant swap(*__i, *__j); 52353e519524SHoward Hinnant ++__n_swaps; 52363e519524SHoward Hinnant ++__i; 52373e519524SHoward Hinnant } 52383e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52393e519524SHoward Hinnant // The first part is sorted, 52403e519524SHoward Hinnant if (__nth < __i) 52413e519524SHoward Hinnant return; 52423e519524SHoward Hinnant // __nth_element the secod part 52433e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52443e519524SHoward Hinnant __first = __i; 52453e519524SHoward Hinnant goto __restart; 52463e519524SHoward Hinnant } 52473e519524SHoward Hinnant if (__comp(*__j, *__m)) 52483e519524SHoward Hinnant { 52493e519524SHoward Hinnant swap(*__i, *__j); 52503e519524SHoward Hinnant ++__n_swaps; 52513e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52523e519524SHoward Hinnant } 52533e519524SHoward Hinnant } 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnant ++__i; 52563e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52573e519524SHoward Hinnant // if not yet partitioned... 52583e519524SHoward Hinnant if (__i < __j) 52593e519524SHoward Hinnant { 52603e519524SHoward Hinnant // known that *(__i - 1) < *__m 52613e519524SHoward Hinnant while (true) 52623e519524SHoward Hinnant { 52633e519524SHoward Hinnant // __m still guards upward moving __i 52643e519524SHoward Hinnant while (__comp(*__i, *__m)) 52653e519524SHoward Hinnant ++__i; 52663e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52673e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52683e519524SHoward Hinnant ; 52693e519524SHoward Hinnant if (__i >= __j) 52703e519524SHoward Hinnant break; 52713e519524SHoward Hinnant swap(*__i, *__j); 52723e519524SHoward Hinnant ++__n_swaps; 52733e519524SHoward Hinnant // It is known that __m != __j 52743e519524SHoward Hinnant // If __m just moved, follow it 52753e519524SHoward Hinnant if (__m == __i) 52763e519524SHoward Hinnant __m = __j; 52773e519524SHoward Hinnant ++__i; 52783e519524SHoward Hinnant } 52793e519524SHoward Hinnant } 52803e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52813e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52823e519524SHoward Hinnant { 52833e519524SHoward Hinnant swap(*__i, *__m); 52843e519524SHoward Hinnant ++__n_swaps; 52853e519524SHoward Hinnant } 52863e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52873e519524SHoward Hinnant if (__nth == __i) 52883e519524SHoward Hinnant return; 52893e519524SHoward Hinnant if (__n_swaps == 0) 52903e519524SHoward Hinnant { 52913e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52923e519524SHoward Hinnant if (__nth < __i) 52933e519524SHoward Hinnant { 52943e519524SHoward Hinnant // Check for [__first, __i) already sorted 52953e519524SHoward Hinnant __j = __m = __first; 52963e519524SHoward Hinnant while (++__j != __i) 52973e519524SHoward Hinnant { 52983e519524SHoward Hinnant if (__comp(*__j, *__m)) 52993e519524SHoward Hinnant // not yet sorted, so sort 53003e519524SHoward Hinnant goto not_sorted; 53013e519524SHoward Hinnant __m = __j; 53023e519524SHoward Hinnant } 53033e519524SHoward Hinnant // [__first, __i) sorted 53043e519524SHoward Hinnant return; 53053e519524SHoward Hinnant } 53063e519524SHoward Hinnant else 53073e519524SHoward Hinnant { 53083e519524SHoward Hinnant // Check for [__i, __last) already sorted 53093e519524SHoward Hinnant __j = __m = __i; 53103e519524SHoward Hinnant while (++__j != __last) 53113e519524SHoward Hinnant { 53123e519524SHoward Hinnant if (__comp(*__j, *__m)) 53133e519524SHoward Hinnant // not yet sorted, so sort 53143e519524SHoward Hinnant goto not_sorted; 53153e519524SHoward Hinnant __m = __j; 53163e519524SHoward Hinnant } 53173e519524SHoward Hinnant // [__i, __last) sorted 53183e519524SHoward Hinnant return; 53193e519524SHoward Hinnant } 53203e519524SHoward Hinnant } 53213e519524SHoward Hinnantnot_sorted: 53223e519524SHoward Hinnant // __nth_element on range containing __nth 53233e519524SHoward Hinnant if (__nth < __i) 53243e519524SHoward Hinnant { 53253e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53263e519524SHoward Hinnant __last = __i; 53273e519524SHoward Hinnant } 53283e519524SHoward Hinnant else 53293e519524SHoward Hinnant { 53303e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53313e519524SHoward Hinnant __first = ++__i; 53323e519524SHoward Hinnant } 53333e519524SHoward Hinnant } 53343e519524SHoward Hinnant} 53353e519524SHoward Hinnant 53363e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53383e519524SHoward Hinnantvoid 53393e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53403e519524SHoward Hinnant{ 5341145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53443e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5345145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53473e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5348145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53493e519524SHoward Hinnant} 53503e519524SHoward Hinnant 53513e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53533e519524SHoward Hinnantvoid 53543e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53553e519524SHoward Hinnant{ 5356ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53573e519524SHoward Hinnant} 53583e519524SHoward Hinnant 53593e519524SHoward Hinnant// includes 53603e519524SHoward Hinnant 53613e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53623e519524SHoward Hinnantbool 53633e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53643e519524SHoward Hinnant _Compare __comp) 53653e519524SHoward Hinnant{ 53663e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53673e519524SHoward Hinnant { 53683e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53693e519524SHoward Hinnant return false; 53703e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53713e519524SHoward Hinnant ++__first2; 53723e519524SHoward Hinnant } 53733e519524SHoward Hinnant return true; 53743e519524SHoward Hinnant} 53753e519524SHoward Hinnant 53763e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53783e519524SHoward Hinnantbool 53793e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53803e519524SHoward Hinnant _Compare __comp) 53813e519524SHoward Hinnant{ 5382145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53833e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53843e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53853e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5386145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53873e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53883e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5389145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53903e519524SHoward Hinnant} 53913e519524SHoward Hinnant 53923e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53943e519524SHoward Hinnantbool 53953e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53963e519524SHoward Hinnant{ 5397ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53983e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53993e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54003e519524SHoward Hinnant} 54013e519524SHoward Hinnant 54023e519524SHoward Hinnant// set_union 54033e519524SHoward Hinnant 54043e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54053e519524SHoward Hinnant_OutputIterator 54063e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 54073e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54083e519524SHoward Hinnant{ 54093e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 54103e519524SHoward Hinnant { 54113e519524SHoward Hinnant if (__first2 == __last2) 5412ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54133e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 54143e519524SHoward Hinnant { 54153e519524SHoward Hinnant *__result = *__first2; 54163e519524SHoward Hinnant ++__first2; 54173e519524SHoward Hinnant } 54183e519524SHoward Hinnant else 54193e519524SHoward Hinnant { 54203e519524SHoward Hinnant *__result = *__first1; 54213e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 54223e519524SHoward Hinnant ++__first2; 54233e519524SHoward Hinnant ++__first1; 54243e519524SHoward Hinnant } 54253e519524SHoward Hinnant } 5426ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54273e519524SHoward Hinnant} 54283e519524SHoward Hinnant 54293e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54313e519524SHoward Hinnant_OutputIterator 54323e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54333e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54343e519524SHoward Hinnant{ 5435145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54383e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5439145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54413e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5442145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54473e519524SHoward Hinnant_OutputIterator 54483e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54503e519524SHoward Hinnant{ 5451ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54523e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54533e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54543e519524SHoward Hinnant} 54553e519524SHoward Hinnant 54563e519524SHoward Hinnant// set_intersection 54573e519524SHoward Hinnant 54583e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54593e519524SHoward Hinnant_OutputIterator 54603e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54623e519524SHoward Hinnant{ 54633e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54643e519524SHoward Hinnant { 54653e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54663e519524SHoward Hinnant ++__first1; 54673e519524SHoward Hinnant else 54683e519524SHoward Hinnant { 54693e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54703e519524SHoward Hinnant { 54713e519524SHoward Hinnant *__result = *__first1; 54723e519524SHoward Hinnant ++__result; 54733e519524SHoward Hinnant ++__first1; 54743e519524SHoward Hinnant } 54753e519524SHoward Hinnant ++__first2; 54763e519524SHoward Hinnant } 54773e519524SHoward Hinnant } 54783e519524SHoward Hinnant return __result; 54793e519524SHoward Hinnant} 54803e519524SHoward Hinnant 54813e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54833e519524SHoward Hinnant_OutputIterator 54843e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54853e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54863e519524SHoward Hinnant{ 5487145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54903e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5491145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54933e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5494145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54953e519524SHoward Hinnant} 54963e519524SHoward Hinnant 54973e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54993e519524SHoward Hinnant_OutputIterator 55003e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 55013e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55023e519524SHoward Hinnant{ 5503ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 55043e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55053e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55063e519524SHoward Hinnant} 55073e519524SHoward Hinnant 55083e519524SHoward Hinnant// set_difference 55093e519524SHoward Hinnant 55103e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55113e519524SHoward Hinnant_OutputIterator 55123e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55143e519524SHoward Hinnant{ 55153e519524SHoward Hinnant while (__first1 != __last1) 55163e519524SHoward Hinnant { 55173e519524SHoward Hinnant if (__first2 == __last2) 5518ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55193e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55203e519524SHoward Hinnant { 55213e519524SHoward Hinnant *__result = *__first1; 55223e519524SHoward Hinnant ++__result; 55233e519524SHoward Hinnant ++__first1; 55243e519524SHoward Hinnant } 55253e519524SHoward Hinnant else 55263e519524SHoward Hinnant { 55273e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55283e519524SHoward Hinnant ++__first1; 55293e519524SHoward Hinnant ++__first2; 55303e519524SHoward Hinnant } 55313e519524SHoward Hinnant } 55323e519524SHoward Hinnant return __result; 55333e519524SHoward Hinnant} 55343e519524SHoward Hinnant 55353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55373e519524SHoward Hinnant_OutputIterator 55383e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55403e519524SHoward Hinnant{ 5541145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55443e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5545145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55473e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5548145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55493e519524SHoward Hinnant} 55503e519524SHoward Hinnant 55513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55533e519524SHoward Hinnant_OutputIterator 55543e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55563e519524SHoward Hinnant{ 5557ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55583e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55593e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55603e519524SHoward Hinnant} 55613e519524SHoward Hinnant 55623e519524SHoward Hinnant// set_symmetric_difference 55633e519524SHoward Hinnant 55643e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55653e519524SHoward Hinnant_OutputIterator 55663e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55673e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55683e519524SHoward Hinnant{ 55693e519524SHoward Hinnant while (__first1 != __last1) 55703e519524SHoward Hinnant { 55713e519524SHoward Hinnant if (__first2 == __last2) 5572ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55733e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55743e519524SHoward Hinnant { 55753e519524SHoward Hinnant *__result = *__first1; 55763e519524SHoward Hinnant ++__result; 55773e519524SHoward Hinnant ++__first1; 55783e519524SHoward Hinnant } 55793e519524SHoward Hinnant else 55803e519524SHoward Hinnant { 55813e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55823e519524SHoward Hinnant { 55833e519524SHoward Hinnant *__result = *__first2; 55843e519524SHoward Hinnant ++__result; 55853e519524SHoward Hinnant } 55863e519524SHoward Hinnant else 55873e519524SHoward Hinnant ++__first1; 55883e519524SHoward Hinnant ++__first2; 55893e519524SHoward Hinnant } 55903e519524SHoward Hinnant } 5591ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55923e519524SHoward Hinnant} 55933e519524SHoward Hinnant 55943e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55963e519524SHoward Hinnant_OutputIterator 55973e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55983e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55993e519524SHoward Hinnant{ 5600145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56013e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56023e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56033e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5604145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56053e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56063e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5607145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56083e519524SHoward Hinnant} 56093e519524SHoward Hinnant 56103e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 56113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56123e519524SHoward Hinnant_OutputIterator 56133e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 56143e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 56153e519524SHoward Hinnant{ 5616ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 56173e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56183e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56193e519524SHoward Hinnant} 56203e519524SHoward Hinnant 56213e519524SHoward Hinnant// lexicographical_compare 56223e519524SHoward Hinnant 56233e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56243e519524SHoward Hinnantbool 56253e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56263e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56273e519524SHoward Hinnant{ 5628910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56293e519524SHoward Hinnant { 56303e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56313e519524SHoward Hinnant return true; 56323e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56333e519524SHoward Hinnant return false; 56343e519524SHoward Hinnant } 56353e519524SHoward Hinnant return false; 56363e519524SHoward Hinnant} 56373e519524SHoward Hinnant 56383e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56403e519524SHoward Hinnantbool 56413e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56423e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56433e519524SHoward Hinnant{ 5644145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56473e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5648145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56503e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5651145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56523e519524SHoward Hinnant} 56533e519524SHoward Hinnant 56543e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56563e519524SHoward Hinnantbool 56573e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56583e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56593e519524SHoward Hinnant{ 5660ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56613e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56623e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56633e519524SHoward Hinnant} 56643e519524SHoward Hinnant 56653e519524SHoward Hinnant// next_permutation 56663e519524SHoward Hinnant 56673e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56683e519524SHoward Hinnantbool 56693e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56703e519524SHoward Hinnant{ 56713e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56723e519524SHoward Hinnant if (__first == __last || __first == --__i) 56733e519524SHoward Hinnant return false; 56743e519524SHoward Hinnant while (true) 56753e519524SHoward Hinnant { 56763e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56773e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56783e519524SHoward Hinnant { 56793e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56803e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56813e519524SHoward Hinnant ; 56823e519524SHoward Hinnant swap(*__i, *__j); 5683ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56843e519524SHoward Hinnant return true; 56853e519524SHoward Hinnant } 56863e519524SHoward Hinnant if (__i == __first) 56873e519524SHoward Hinnant { 5688ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56893e519524SHoward Hinnant return false; 56903e519524SHoward Hinnant } 56913e519524SHoward Hinnant } 56923e519524SHoward Hinnant} 56933e519524SHoward Hinnant 56943e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56963e519524SHoward Hinnantbool 56973e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56983e519524SHoward Hinnant{ 5699145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57023e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5703145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57053e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5706145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57073e519524SHoward Hinnant} 57083e519524SHoward Hinnant 57093e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57113e519524SHoward Hinnantbool 57123e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57133e519524SHoward Hinnant{ 5714ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 57153e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57163e519524SHoward Hinnant} 57173e519524SHoward Hinnant 57183e519524SHoward Hinnant// prev_permutation 57193e519524SHoward Hinnant 57203e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 57213e519524SHoward Hinnantbool 57223e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57233e519524SHoward Hinnant{ 57243e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57253e519524SHoward Hinnant if (__first == __last || __first == --__i) 57263e519524SHoward Hinnant return false; 57273e519524SHoward Hinnant while (true) 57283e519524SHoward Hinnant { 57293e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57303e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57313e519524SHoward Hinnant { 57323e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57333e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57343e519524SHoward Hinnant ; 57353e519524SHoward Hinnant swap(*__i, *__j); 5736ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57373e519524SHoward Hinnant return true; 57383e519524SHoward Hinnant } 57393e519524SHoward Hinnant if (__i == __first) 57403e519524SHoward Hinnant { 5741ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57423e519524SHoward Hinnant return false; 57433e519524SHoward Hinnant } 57443e519524SHoward Hinnant } 57453e519524SHoward Hinnant} 57463e519524SHoward Hinnant 57473e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57493e519524SHoward Hinnantbool 57503e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57513e519524SHoward Hinnant{ 5752145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57553e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5756145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57583e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5759145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57603e519524SHoward Hinnant} 57613e519524SHoward Hinnant 57623e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57643e519524SHoward Hinnantbool 57653e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57663e519524SHoward Hinnant{ 5767ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57683e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57693e519524SHoward Hinnant} 57703e519524SHoward Hinnant 57713e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57723e519524SHoward Hinnant 57733e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5774