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 5244eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last); 5254eb27b79SHoward Hinnant 5264eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5274eb27b79SHoward Hinnant ForwardIterator 5284eb27b79SHoward Hinnant min_element(ForwardIterator first, ForwardIterator last, Compare comp); 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 5463e519524SHoward Hinnanttemplate <class ForwardIterator> 5473e519524SHoward Hinnant ForwardIterator 5483e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last); 5493e519524SHoward Hinnant 5503e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5513e519524SHoward Hinnant ForwardIterator 5523e519524SHoward Hinnant max_element(ForwardIterator first, ForwardIterator last, Compare comp); 5533e519524SHoward Hinnant 5544eb27b79SHoward Hinnanttemplate <class T> 5554eb27b79SHoward Hinnant const T& 5569d67c6d5SMarshall Clow max(const T& a, const T& b); // constexpr in C++14 5574eb27b79SHoward Hinnant 5584eb27b79SHoward Hinnanttemplate <class T, class Compare> 5594eb27b79SHoward Hinnant const T& 5609d67c6d5SMarshall Clow max(const T& a, const T& b, Compare comp); // constexpr in C++14 5614eb27b79SHoward Hinnant 5624eb27b79SHoward Hinnanttemplate<class T> 5634eb27b79SHoward Hinnant T 5649d67c6d5SMarshall Clow max(initializer_list<T> t); // constexpr in C++14 5654eb27b79SHoward Hinnant 5664eb27b79SHoward Hinnanttemplate<class T, class Compare> 5674eb27b79SHoward Hinnant T 5689d67c6d5SMarshall Clow max(initializer_list<T> t, Compare comp); // constexpr in C++14 5694eb27b79SHoward Hinnant 5704eb27b79SHoward Hinnanttemplate<class ForwardIterator> 5714eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5724eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last); 5734eb27b79SHoward Hinnant 5744eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5754eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5764eb27b79SHoward Hinnant minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); 5774eb27b79SHoward Hinnant 5784eb27b79SHoward Hinnanttemplate<class T> 5794eb27b79SHoward Hinnant pair<const T&, const T&> 5809d67c6d5SMarshall Clow minmax(const T& a, const T& b); // constexpr in C++14 5814eb27b79SHoward Hinnant 5824eb27b79SHoward Hinnanttemplate<class T, class Compare> 5834eb27b79SHoward Hinnant pair<const T&, const T&> 5849d67c6d5SMarshall Clow minmax(const T& a, const T& b, Compare comp); // constexpr in C++14 5854eb27b79SHoward Hinnant 5864eb27b79SHoward Hinnanttemplate<class T> 5874eb27b79SHoward Hinnant pair<T, T> 5889d67c6d5SMarshall Clow minmax(initializer_list<T> t); // constexpr in C++14 5894eb27b79SHoward Hinnant 5904eb27b79SHoward Hinnanttemplate<class T, class Compare> 5914eb27b79SHoward Hinnant pair<T, T> 5929d67c6d5SMarshall Clow minmax(initializer_list<T> t, Compare comp); // constexpr in C++14 5934eb27b79SHoward Hinnant 5943e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 5953e519524SHoward Hinnant bool 5963e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 5973e519524SHoward Hinnant 5983e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 5993e519524SHoward Hinnant bool 6003e519524SHoward Hinnant lexicographical_compare(InputIterator1 first1, InputIterator1 last1, 6013e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, Compare comp); 6023e519524SHoward Hinnant 6033e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6043e519524SHoward Hinnant bool 6053e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last); 6063e519524SHoward Hinnant 6073e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6083e519524SHoward Hinnant bool 6093e519524SHoward Hinnant next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6103e519524SHoward Hinnant 6113e519524SHoward Hinnanttemplate <class BidirectionalIterator> 6123e519524SHoward Hinnant bool 6133e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last); 6143e519524SHoward Hinnant 6153e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 6163e519524SHoward Hinnant bool 6173e519524SHoward Hinnant prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); 6183e519524SHoward Hinnant 6193e519524SHoward Hinnant} // std 6203e519524SHoward Hinnant 6213e519524SHoward Hinnant*/ 6223e519524SHoward Hinnant 6233e519524SHoward Hinnant#include <__config> 6243e519524SHoward Hinnant#include <initializer_list> 6253e519524SHoward Hinnant#include <type_traits> 6263e519524SHoward Hinnant#include <cstring> 6273e519524SHoward Hinnant#include <utility> 6283e519524SHoward Hinnant#include <memory> 6293e519524SHoward Hinnant#include <iterator> 630a1d07d57SHoward Hinnant#include <cstddef> 6313e519524SHoward Hinnant 6325d1a701dSHoward Hinnant#if defined(__IBMCPP__) 6335d1a701dSHoward Hinnant#include "support/ibm/support.h" 6345d1a701dSHoward Hinnant#endif 6355f878d4bSHoward Hinnant#if defined(_LIBCPP_MSVCRT) || defined(__MINGW32__) 6365f878d4bSHoward Hinnant#include "support/win32/support.h" 6375f878d4bSHoward Hinnant#endif 6385d1a701dSHoward Hinnant 639ab4f4382SHoward Hinnant#include <__undef_min_max> 640ab4f4382SHoward Hinnant 641c1bd9197SEric Fiselier#include <__debug> 642c1bd9197SEric Fiselier 643073458b1SHoward Hinnant#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 6443e519524SHoward Hinnant#pragma GCC system_header 645073458b1SHoward Hinnant#endif 6463e519524SHoward Hinnant 6473e519524SHoward Hinnant_LIBCPP_BEGIN_NAMESPACE_STD 6483e519524SHoward Hinnant 6499d67c6d5SMarshall Clow// I'd like to replace these with _VSTD::equal_to<void>, but can't because: 6509d67c6d5SMarshall Clow// * That only works with C++14 and later, and 6519d67c6d5SMarshall Clow// * We haven't included <functional> here. 6523e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6533e519524SHoward Hinnantstruct __equal_to 6543e519524SHoward Hinnant{ 6553e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6563e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T1& __x, const _T2& __y) const {return __x == __y;} 6573e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T1& __y) const {return __x == __y;} 6583e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY bool operator()(const _T2& __x, const _T2& __y) const {return __x == __y;} 6593e519524SHoward Hinnant}; 6603e519524SHoward Hinnant 6613e519524SHoward Hinnanttemplate <class _T1> 6623e519524SHoward Hinnantstruct __equal_to<_T1, _T1> 6633e519524SHoward Hinnant{ 6649d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6659d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6663e519524SHoward Hinnant}; 6673e519524SHoward Hinnant 6683e519524SHoward Hinnanttemplate <class _T1> 6693e519524SHoward Hinnantstruct __equal_to<const _T1, _T1> 6703e519524SHoward Hinnant{ 6719d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6729d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6733e519524SHoward Hinnant}; 6743e519524SHoward Hinnant 6753e519524SHoward Hinnanttemplate <class _T1> 6763e519524SHoward Hinnantstruct __equal_to<_T1, const _T1> 6773e519524SHoward Hinnant{ 6789d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6799d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x == __y;} 6803e519524SHoward Hinnant}; 6813e519524SHoward Hinnant 6823e519524SHoward Hinnanttemplate <class _T1, class _T2 = _T1> 6833e519524SHoward Hinnantstruct __less 6843e519524SHoward Hinnant{ 6859d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6869d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 6879d67c6d5SMarshall Clow 6889d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6899d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T2& __y) const {return __x < __y;} 6909d67c6d5SMarshall Clow 6919d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6929d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T1& __y) const {return __x < __y;} 6939d67c6d5SMarshall Clow 6949d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 6959d67c6d5SMarshall Clow bool operator()(const _T2& __x, const _T2& __y) const {return __x < __y;} 6963e519524SHoward Hinnant}; 6973e519524SHoward Hinnant 6983e519524SHoward Hinnanttemplate <class _T1> 6993e519524SHoward Hinnantstruct __less<_T1, _T1> 7003e519524SHoward Hinnant{ 7019d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7029d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7033e519524SHoward Hinnant}; 7043e519524SHoward Hinnant 7053e519524SHoward Hinnanttemplate <class _T1> 7063e519524SHoward Hinnantstruct __less<const _T1, _T1> 7073e519524SHoward Hinnant{ 7089d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7099d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7103e519524SHoward Hinnant}; 7113e519524SHoward Hinnant 7123e519524SHoward Hinnanttemplate <class _T1> 7133e519524SHoward Hinnantstruct __less<_T1, const _T1> 7143e519524SHoward Hinnant{ 7159d67c6d5SMarshall Clow _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 7169d67c6d5SMarshall Clow bool operator()(const _T1& __x, const _T1& __y) const {return __x < __y;} 7173e519524SHoward Hinnant}; 7183e519524SHoward Hinnant 7193e519524SHoward Hinnanttemplate <class _Predicate> 7203e519524SHoward Hinnantclass __negate 7213e519524SHoward Hinnant{ 7223e519524SHoward Hinnantprivate: 7233e519524SHoward Hinnant _Predicate __p_; 7243e519524SHoward Hinnantpublic: 7253e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY __negate() {} 7263e519524SHoward Hinnant 7273e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7283e519524SHoward Hinnant explicit __negate(_Predicate __p) : __p_(__p) {} 7293e519524SHoward Hinnant 7303e519524SHoward Hinnant template <class _T1> 7313e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7323e519524SHoward Hinnant bool operator()(const _T1& __x) {return !__p_(__x);} 7333e519524SHoward Hinnant 7343e519524SHoward Hinnant template <class _T1, class _T2> 7353e519524SHoward Hinnant _LIBCPP_INLINE_VISIBILITY 7363e519524SHoward Hinnant bool operator()(const _T1& __x, const _T2& __y) {return !__p_(__x, __y);} 7373e519524SHoward Hinnant}; 7383e519524SHoward Hinnant 739145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 7403e519524SHoward Hinnant 7413e519524SHoward Hinnanttemplate <class _Compare> 7423e519524SHoward Hinnantstruct __debug_less 7433e519524SHoward Hinnant{ 7443e519524SHoward Hinnant _Compare __comp_; 7453e519524SHoward Hinnant __debug_less(_Compare& __c) : __comp_(__c) {} 7463e519524SHoward Hinnant template <class _Tp, class _Up> 7473e519524SHoward Hinnant bool operator()(const _Tp& __x, const _Up& __y) 7483e519524SHoward Hinnant { 7493e519524SHoward Hinnant bool __r = __comp_(__x, __y); 7503e519524SHoward Hinnant if (__r) 751f554add5SHoward Hinnant _LIBCPP_ASSERT(!__comp_(__y, __x), "Comparator does not induce a strict weak ordering"); 7523e519524SHoward Hinnant return __r; 7533e519524SHoward Hinnant } 7543e519524SHoward Hinnant}; 7553e519524SHoward Hinnant 756145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 7573e519524SHoward Hinnant 758c8edcb36SHoward Hinnant// Precondition: __x != 0 759c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 760c206366fSHoward Hinnantunsigned 761c206366fSHoward Hinnant__ctz(unsigned __x) 762c206366fSHoward Hinnant{ 763c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_ctz(__x)); 764c206366fSHoward Hinnant} 765c206366fSHoward Hinnant 766c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 767c206366fSHoward Hinnantunsigned long 768c206366fSHoward Hinnant__ctz(unsigned long __x) 769c206366fSHoward Hinnant{ 770c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_ctzl(__x)); 771c206366fSHoward Hinnant} 772c206366fSHoward Hinnant 773c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 774c206366fSHoward Hinnantunsigned long long 775c206366fSHoward Hinnant__ctz(unsigned long long __x) 776c206366fSHoward Hinnant{ 777c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_ctzll(__x)); 778c206366fSHoward Hinnant} 779c8edcb36SHoward Hinnant 780c8edcb36SHoward Hinnant// Precondition: __x != 0 781c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 782c206366fSHoward Hinnantunsigned 783c206366fSHoward Hinnant__clz(unsigned __x) 784c206366fSHoward Hinnant{ 785c206366fSHoward Hinnant return static_cast<unsigned>(__builtin_clz(__x)); 786c206366fSHoward Hinnant} 787c206366fSHoward Hinnant 788c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 789c206366fSHoward Hinnantunsigned long 790c206366fSHoward Hinnant__clz(unsigned long __x) 791c206366fSHoward Hinnant{ 792c206366fSHoward Hinnant return static_cast<unsigned long>(__builtin_clzl (__x)); 793c206366fSHoward Hinnant} 794c206366fSHoward Hinnant 795c206366fSHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 796c206366fSHoward Hinnantunsigned long long 797c206366fSHoward Hinnant__clz(unsigned long long __x) 798c206366fSHoward Hinnant{ 799c206366fSHoward Hinnant return static_cast<unsigned long long>(__builtin_clzll(__x)); 800c206366fSHoward Hinnant} 801c8edcb36SHoward Hinnant 802c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned __x) {return __builtin_popcount (__x);} 803c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long __x) {return __builtin_popcountl (__x);} 804c8edcb36SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY int __pop_count(unsigned long long __x) {return __builtin_popcountll(__x);} 805c8edcb36SHoward Hinnant 8063e519524SHoward Hinnant// all_of 8073e519524SHoward Hinnant 8083e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8103e519524SHoward Hinnantbool 8113e519524SHoward Hinnantall_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8123e519524SHoward Hinnant{ 8133e519524SHoward Hinnant for (; __first != __last; ++__first) 8143e519524SHoward Hinnant if (!__pred(*__first)) 8153e519524SHoward Hinnant return false; 8163e519524SHoward Hinnant return true; 8173e519524SHoward Hinnant} 8183e519524SHoward Hinnant 8193e519524SHoward Hinnant// any_of 8203e519524SHoward Hinnant 8213e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8233e519524SHoward Hinnantbool 8243e519524SHoward Hinnantany_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8253e519524SHoward Hinnant{ 8263e519524SHoward Hinnant for (; __first != __last; ++__first) 8273e519524SHoward Hinnant if (__pred(*__first)) 8283e519524SHoward Hinnant return true; 8293e519524SHoward Hinnant return false; 8303e519524SHoward Hinnant} 8313e519524SHoward Hinnant 8323e519524SHoward Hinnant// none_of 8333e519524SHoward Hinnant 8343e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8363e519524SHoward Hinnantbool 8373e519524SHoward Hinnantnone_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8383e519524SHoward Hinnant{ 8393e519524SHoward Hinnant for (; __first != __last; ++__first) 8403e519524SHoward Hinnant if (__pred(*__first)) 8413e519524SHoward Hinnant return false; 8423e519524SHoward Hinnant return true; 8433e519524SHoward Hinnant} 8443e519524SHoward Hinnant 8453e519524SHoward Hinnant// for_each 8463e519524SHoward Hinnant 8473e519524SHoward Hinnanttemplate <class _InputIterator, class _Function> 8483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8493e519524SHoward Hinnant_Function 8503e519524SHoward Hinnantfor_each(_InputIterator __first, _InputIterator __last, _Function __f) 8513e519524SHoward Hinnant{ 8523e519524SHoward Hinnant for (; __first != __last; ++__first) 8533e519524SHoward Hinnant __f(*__first); 854179b1f8cSHoward Hinnant return _VSTD::move(__f); // explicitly moved for (emulated) C++03 8553e519524SHoward Hinnant} 8563e519524SHoward Hinnant 8573e519524SHoward Hinnant// find 8583e519524SHoward Hinnant 8593e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 8603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8613e519524SHoward Hinnant_InputIterator 862e4383379SHoward Hinnantfind(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 8633e519524SHoward Hinnant{ 8643e519524SHoward Hinnant for (; __first != __last; ++__first) 865e4383379SHoward Hinnant if (*__first == __value_) 8663e519524SHoward Hinnant break; 8673e519524SHoward Hinnant return __first; 8683e519524SHoward Hinnant} 8693e519524SHoward Hinnant 8703e519524SHoward Hinnant// find_if 8713e519524SHoward Hinnant 8723e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 8733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8743e519524SHoward Hinnant_InputIterator 8753e519524SHoward Hinnantfind_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8763e519524SHoward Hinnant{ 8773e519524SHoward Hinnant for (; __first != __last; ++__first) 8783e519524SHoward Hinnant if (__pred(*__first)) 8793e519524SHoward Hinnant break; 8803e519524SHoward Hinnant return __first; 8813e519524SHoward Hinnant} 8823e519524SHoward Hinnant 8833e519524SHoward Hinnant// find_if_not 8843e519524SHoward Hinnant 8853e519524SHoward Hinnanttemplate<class _InputIterator, class _Predicate> 8863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 8873e519524SHoward Hinnant_InputIterator 8883e519524SHoward Hinnantfind_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) 8893e519524SHoward Hinnant{ 8903e519524SHoward Hinnant for (; __first != __last; ++__first) 8913e519524SHoward Hinnant if (!__pred(*__first)) 8923e519524SHoward Hinnant break; 8933e519524SHoward Hinnant return __first; 8943e519524SHoward Hinnant} 8953e519524SHoward Hinnant 8963e519524SHoward Hinnant// find_end 8973e519524SHoward Hinnant 8983e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 8993e519524SHoward Hinnant_ForwardIterator1 9003e519524SHoward Hinnant__find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 9013e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 9023e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 9033e519524SHoward Hinnant{ 9043e519524SHoward Hinnant // modeled after search algorithm 9053e519524SHoward Hinnant _ForwardIterator1 __r = __last1; // __last1 is the "default" answer 9063e519524SHoward Hinnant if (__first2 == __last2) 9073e519524SHoward Hinnant return __r; 9083e519524SHoward Hinnant while (true) 9093e519524SHoward Hinnant { 9103e519524SHoward Hinnant while (true) 9113e519524SHoward Hinnant { 9123e519524SHoward Hinnant if (__first1 == __last1) // if source exhausted return last correct answer 9133e519524SHoward Hinnant return __r; // (or __last1 if never found) 9143e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 9153e519524SHoward Hinnant break; 9163e519524SHoward Hinnant ++__first1; 9173e519524SHoward Hinnant } 9183e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 9193e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 9203e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 9213e519524SHoward Hinnant while (true) 9223e519524SHoward Hinnant { 9233e519524SHoward Hinnant if (++__m2 == __last2) 9243e519524SHoward Hinnant { // Pattern exhaused, record answer and search for another one 9253e519524SHoward Hinnant __r = __first1; 9263e519524SHoward Hinnant ++__first1; 9273e519524SHoward Hinnant break; 9283e519524SHoward Hinnant } 9293e519524SHoward Hinnant if (++__m1 == __last1) // Source exhausted, return last answer 9303e519524SHoward Hinnant return __r; 9313e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first 9323e519524SHoward Hinnant { 9333e519524SHoward Hinnant ++__first1; 9343e519524SHoward Hinnant break; 9353e519524SHoward Hinnant } // else there is a match, check next elements 9363e519524SHoward Hinnant } 9373e519524SHoward Hinnant } 9383e519524SHoward Hinnant} 9393e519524SHoward Hinnant 9403e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _BidirectionalIterator1, class _BidirectionalIterator2> 9413e519524SHoward Hinnant_BidirectionalIterator1 9423e519524SHoward Hinnant__find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, 9433e519524SHoward Hinnant _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred, 9443e519524SHoward Hinnant bidirectional_iterator_tag, bidirectional_iterator_tag) 9453e519524SHoward Hinnant{ 9463e519524SHoward Hinnant // modeled after search algorithm (in reverse) 9473e519524SHoward Hinnant if (__first2 == __last2) 9483e519524SHoward Hinnant return __last1; // Everything matches an empty sequence 9493e519524SHoward Hinnant _BidirectionalIterator1 __l1 = __last1; 9503e519524SHoward Hinnant _BidirectionalIterator2 __l2 = __last2; 9513e519524SHoward Hinnant --__l2; 9523e519524SHoward Hinnant while (true) 9533e519524SHoward Hinnant { 9543e519524SHoward Hinnant // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks 9553e519524SHoward Hinnant while (true) 9563e519524SHoward Hinnant { 9573e519524SHoward Hinnant if (__first1 == __l1) // return __last1 if no element matches *__first2 9583e519524SHoward Hinnant return __last1; 9593e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 9603e519524SHoward Hinnant break; 9613e519524SHoward Hinnant } 9623e519524SHoward Hinnant // *__l1 matches *__l2, now match elements before here 9633e519524SHoward Hinnant _BidirectionalIterator1 __m1 = __l1; 9643e519524SHoward Hinnant _BidirectionalIterator2 __m2 = __l2; 9653e519524SHoward Hinnant while (true) 9663e519524SHoward Hinnant { 9673e519524SHoward Hinnant if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) 9683e519524SHoward Hinnant return __m1; 9693e519524SHoward Hinnant if (__m1 == __first1) // Otherwise if source exhaused, pattern not found 9703e519524SHoward Hinnant return __last1; 9713e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 9723e519524SHoward Hinnant { 9733e519524SHoward Hinnant break; 9743e519524SHoward Hinnant } // else there is a match, check next elements 9753e519524SHoward Hinnant } 9763e519524SHoward Hinnant } 9773e519524SHoward Hinnant} 9783e519524SHoward Hinnant 9793e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 9809b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 9813e519524SHoward Hinnant__find_end(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 9823e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 9833e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 9843e519524SHoward Hinnant{ 9853e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 9863e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2; 9873e519524SHoward Hinnant if (__len2 == 0) 9883e519524SHoward Hinnant return __last1; 9893e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator1>::difference_type __len1 = __last1 - __first1; 9903e519524SHoward Hinnant if (__len1 < __len2) 9913e519524SHoward Hinnant return __last1; 9923e519524SHoward Hinnant const _RandomAccessIterator1 __s = __first1 + (__len2 - 1); // End of pattern match can't go before here 9933e519524SHoward Hinnant _RandomAccessIterator1 __l1 = __last1; 9943e519524SHoward Hinnant _RandomAccessIterator2 __l2 = __last2; 9953e519524SHoward Hinnant --__l2; 9963e519524SHoward Hinnant while (true) 9973e519524SHoward Hinnant { 9983e519524SHoward Hinnant while (true) 9993e519524SHoward Hinnant { 10003e519524SHoward Hinnant if (__s == __l1) 10013e519524SHoward Hinnant return __last1; 10023e519524SHoward Hinnant if (__pred(*--__l1, *__l2)) 10033e519524SHoward Hinnant break; 10043e519524SHoward Hinnant } 10053e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __l1; 10063e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __l2; 10073e519524SHoward Hinnant while (true) 10083e519524SHoward Hinnant { 10093e519524SHoward Hinnant if (__m2 == __first2) 10103e519524SHoward Hinnant return __m1; 10113e519524SHoward Hinnant // no need to check range on __m1 because __s guarantees we have enough source 10123e519524SHoward Hinnant if (!__pred(*--__m1, *--__m2)) 10133e519524SHoward Hinnant { 10143e519524SHoward Hinnant break; 10153e519524SHoward Hinnant } 10163e519524SHoward Hinnant } 10173e519524SHoward Hinnant } 10183e519524SHoward Hinnant} 10193e519524SHoward Hinnant 10203e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10223e519524SHoward Hinnant_ForwardIterator1 10233e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10243e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10253e519524SHoward Hinnant{ 1026ce48a113SHoward Hinnant return _VSTD::__find_end<typename add_lvalue_reference<_BinaryPredicate>::type> 10273e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 10283e519524SHoward Hinnant typename iterator_traits<_ForwardIterator1>::iterator_category(), 10293e519524SHoward Hinnant typename iterator_traits<_ForwardIterator2>::iterator_category()); 10303e519524SHoward Hinnant} 10313e519524SHoward Hinnant 10323e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10343e519524SHoward Hinnant_ForwardIterator1 10353e519524SHoward Hinnantfind_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10363e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10373e519524SHoward Hinnant{ 10383e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10393e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1040ce48a113SHoward Hinnant return _VSTD::find_end(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10413e519524SHoward Hinnant} 10423e519524SHoward Hinnant 10433e519524SHoward Hinnant// find_first_of 10443e519524SHoward Hinnant 10453e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10469b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 10479b0af34dSMarshall Clow__find_first_of_ce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10483e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10493e519524SHoward Hinnant{ 10503e519524SHoward Hinnant for (; __first1 != __last1; ++__first1) 10513e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 10523e519524SHoward Hinnant if (__pred(*__first1, *__j)) 10533e519524SHoward Hinnant return __first1; 10543e519524SHoward Hinnant return __last1; 10553e519524SHoward Hinnant} 10563e519524SHoward Hinnant 10579b0af34dSMarshall Clow 10589b0af34dSMarshall Clowtemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 10599b0af34dSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 10609b0af34dSMarshall Clow_ForwardIterator1 10619b0af34dSMarshall Clowfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10629b0af34dSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 10639b0af34dSMarshall Clow{ 10649b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); 10659b0af34dSMarshall Clow} 10669b0af34dSMarshall Clow 10673e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 10683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10693e519524SHoward Hinnant_ForwardIterator1 10703e519524SHoward Hinnantfind_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 10713e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 10723e519524SHoward Hinnant{ 10733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 10743e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 10759b0af34dSMarshall Clow return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 10763e519524SHoward Hinnant} 10773e519524SHoward Hinnant 10783e519524SHoward Hinnant// adjacent_find 10793e519524SHoward Hinnant 10803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 10813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 10823e519524SHoward Hinnant_ForwardIterator 10833e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 10843e519524SHoward Hinnant{ 10853e519524SHoward Hinnant if (__first != __last) 10863e519524SHoward Hinnant { 10873e519524SHoward Hinnant _ForwardIterator __i = __first; 10883e519524SHoward Hinnant while (++__i != __last) 10893e519524SHoward Hinnant { 10903e519524SHoward Hinnant if (__pred(*__first, *__i)) 10913e519524SHoward Hinnant return __first; 10923e519524SHoward Hinnant __first = __i; 10933e519524SHoward Hinnant } 10943e519524SHoward Hinnant } 10953e519524SHoward Hinnant return __last; 10963e519524SHoward Hinnant} 10973e519524SHoward Hinnant 10983e519524SHoward Hinnanttemplate <class _ForwardIterator> 10993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11003e519524SHoward Hinnant_ForwardIterator 11013e519524SHoward Hinnantadjacent_find(_ForwardIterator __first, _ForwardIterator __last) 11023e519524SHoward Hinnant{ 11033e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1104ce48a113SHoward Hinnant return _VSTD::adjacent_find(__first, __last, __equal_to<__v>()); 11053e519524SHoward Hinnant} 11063e519524SHoward Hinnant 11073e519524SHoward Hinnant// count 11083e519524SHoward Hinnant 11093e519524SHoward Hinnanttemplate <class _InputIterator, class _Tp> 11103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11113e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 1112e4383379SHoward Hinnantcount(_InputIterator __first, _InputIterator __last, const _Tp& __value_) 11133e519524SHoward Hinnant{ 11143e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11153e519524SHoward Hinnant for (; __first != __last; ++__first) 1116e4383379SHoward Hinnant if (*__first == __value_) 11173e519524SHoward Hinnant ++__r; 11183e519524SHoward Hinnant return __r; 11193e519524SHoward Hinnant} 11203e519524SHoward Hinnant 11213e519524SHoward Hinnant// count_if 11223e519524SHoward Hinnant 11233e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 11243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11253e519524SHoward Hinnanttypename iterator_traits<_InputIterator>::difference_type 11263e519524SHoward Hinnantcount_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) 11273e519524SHoward Hinnant{ 11283e519524SHoward Hinnant typename iterator_traits<_InputIterator>::difference_type __r(0); 11293e519524SHoward Hinnant for (; __first != __last; ++__first) 11303e519524SHoward Hinnant if (__pred(*__first)) 11313e519524SHoward Hinnant ++__r; 11323e519524SHoward Hinnant return __r; 11333e519524SHoward Hinnant} 11343e519524SHoward Hinnant 11353e519524SHoward Hinnant// mismatch 11363e519524SHoward Hinnant 11373e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11393e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11403e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11413e519524SHoward Hinnant _InputIterator2 __first2, _BinaryPredicate __pred) 11423e519524SHoward Hinnant{ 1143bd7c7b55SMarshall Clow for (; __first1 != __last1; ++__first1, (void) ++__first2) 11443e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11453e519524SHoward Hinnant break; 11463e519524SHoward Hinnant return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11473e519524SHoward Hinnant} 11483e519524SHoward Hinnant 11493e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11513e519524SHoward Hinnantpair<_InputIterator1, _InputIterator2> 11523e519524SHoward Hinnantmismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 11533e519524SHoward Hinnant{ 11543e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11553e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1156ce48a113SHoward Hinnant return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 11573e519524SHoward Hinnant} 11583e519524SHoward Hinnant 11590b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 11600b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11610b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11620b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11630b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11640b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 11650b0bbd2fSMarshall Clow _BinaryPredicate __pred) 11660b0bbd2fSMarshall Clow{ 1167bd7c7b55SMarshall Clow for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 11680b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 11690b0bbd2fSMarshall Clow break; 11700b0bbd2fSMarshall Clow return pair<_InputIterator1, _InputIterator2>(__first1, __first2); 11710b0bbd2fSMarshall Clow} 11720b0bbd2fSMarshall Clow 11730b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 11740b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 11750b0bbd2fSMarshall Clowpair<_InputIterator1, _InputIterator2> 11760b0bbd2fSMarshall Clowmismatch(_InputIterator1 __first1, _InputIterator1 __last1, 11770b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 11780b0bbd2fSMarshall Clow{ 11790b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 11800b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 11810b0bbd2fSMarshall Clow return _VSTD::mismatch(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 11820b0bbd2fSMarshall Clow} 11830b0bbd2fSMarshall Clow#endif 11840b0bbd2fSMarshall Clow 11853e519524SHoward Hinnant// equal 11863e519524SHoward Hinnant 11873e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 11883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 11893e519524SHoward Hinnantbool 11903e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) 11913e519524SHoward Hinnant{ 1192910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 11933e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 11943e519524SHoward Hinnant return false; 11953e519524SHoward Hinnant return true; 11963e519524SHoward Hinnant} 11973e519524SHoward Hinnant 11983e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 11993e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 12003e519524SHoward Hinnantbool 12013e519524SHoward Hinnantequal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) 12023e519524SHoward Hinnant{ 12033e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12043e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 1205ce48a113SHoward Hinnant return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 12063e519524SHoward Hinnant} 12073e519524SHoward Hinnant 12080b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 12090b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _InputIterator1, class _InputIterator2> 12100b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12110b0bbd2fSMarshall Clowbool 12120b0bbd2fSMarshall Clow__equal(_InputIterator1 __first1, _InputIterator1 __last1, 12130b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred, 12140b0bbd2fSMarshall Clow input_iterator_tag, input_iterator_tag ) 12150b0bbd2fSMarshall Clow{ 1216910285b2SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 12170b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 12180b0bbd2fSMarshall Clow return false; 12190b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 12200b0bbd2fSMarshall Clow} 12210b0bbd2fSMarshall Clow 12220b0bbd2fSMarshall Clowtemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 12230b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12240b0bbd2fSMarshall Clowbool 12250b0bbd2fSMarshall Clow__equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 12260b0bbd2fSMarshall Clow _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 12270b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 12280b0bbd2fSMarshall Clow{ 12290b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 12300b0bbd2fSMarshall Clow return false; 12310b0bbd2fSMarshall Clow return _VSTD::equal<_RandomAccessIterator1, _RandomAccessIterator2, 12320b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 12330b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 12340b0bbd2fSMarshall Clow} 12350b0bbd2fSMarshall Clow 12360b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2, class _BinaryPredicate> 12370b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12380b0bbd2fSMarshall Clowbool 12390b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12400b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, _BinaryPredicate __pred ) 12410b0bbd2fSMarshall Clow{ 12420b0bbd2fSMarshall Clow return _VSTD::__equal<typename add_lvalue_reference<_BinaryPredicate>::type> 12430b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 12440b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12450b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12460b0bbd2fSMarshall Clow} 12470b0bbd2fSMarshall Clow 12480b0bbd2fSMarshall Clowtemplate <class _InputIterator1, class _InputIterator2> 12490b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 12500b0bbd2fSMarshall Clowbool 12510b0bbd2fSMarshall Clowequal(_InputIterator1 __first1, _InputIterator1 __last1, 12520b0bbd2fSMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2) 12530b0bbd2fSMarshall Clow{ 12540b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator1>::value_type __v1; 12550b0bbd2fSMarshall Clow typedef typename iterator_traits<_InputIterator2>::value_type __v2; 12560b0bbd2fSMarshall Clow return _VSTD::__equal(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>(), 12570b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator1>::iterator_category(), 12580b0bbd2fSMarshall Clow typename iterator_traits<_InputIterator2>::iterator_category()); 12590b0bbd2fSMarshall Clow} 12600b0bbd2fSMarshall Clow#endif 12610b0bbd2fSMarshall Clow 12623e519524SHoward Hinnant// is_permutation 12633e519524SHoward Hinnant 12643e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 12653e519524SHoward Hinnantbool 12663e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 12673e519524SHoward Hinnant _ForwardIterator2 __first2, _BinaryPredicate __pred) 12683e519524SHoward Hinnant{ 12693e519524SHoward Hinnant // shorten sequences as much as possible by lopping of any equal parts 1270910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2) 12713e519524SHoward Hinnant if (!__pred(*__first1, *__first2)) 12723e519524SHoward Hinnant goto __not_done; 12733e519524SHoward Hinnant return true; 12743e519524SHoward Hinnant__not_done: 12753e519524SHoward Hinnant // __first1 != __last1 && *__first1 != *__first2 12763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 1277ce48a113SHoward Hinnant _D1 __l1 = _VSTD::distance(__first1, __last1); 12783e519524SHoward Hinnant if (__l1 == _D1(1)) 12793e519524SHoward Hinnant return false; 1280ce48a113SHoward Hinnant _ForwardIterator2 __last2 = _VSTD::next(__first2, __l1); 12813e519524SHoward Hinnant // For each element in [f1, l1) see if there are the same number of 12823e519524SHoward Hinnant // equal elements in [f2, l2) 12833e519524SHoward Hinnant for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 12843e519524SHoward Hinnant { 12853e519524SHoward Hinnant // Have we already counted the number of *__i in [f1, l1)? 12863e519524SHoward Hinnant for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 12873e519524SHoward Hinnant if (__pred(*__j, *__i)) 12883e519524SHoward Hinnant goto __next_iter; 12893e519524SHoward Hinnant { 12903e519524SHoward Hinnant // Count number of *__i in [f2, l2) 12913e519524SHoward Hinnant _D1 __c2 = 0; 12923e519524SHoward Hinnant for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 12933e519524SHoward Hinnant if (__pred(*__i, *__j)) 12943e519524SHoward Hinnant ++__c2; 12953e519524SHoward Hinnant if (__c2 == 0) 12963e519524SHoward Hinnant return false; 12973e519524SHoward Hinnant // Count number of *__i in [__i, l1) (we can start with 1) 12983e519524SHoward Hinnant _D1 __c1 = 1; 1299ce48a113SHoward Hinnant for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13003e519524SHoward Hinnant if (__pred(*__i, *__j)) 13013e519524SHoward Hinnant ++__c1; 13023e519524SHoward Hinnant if (__c1 != __c2) 13033e519524SHoward Hinnant return false; 13043e519524SHoward Hinnant } 13053e519524SHoward Hinnant__next_iter:; 13063e519524SHoward Hinnant } 13073e519524SHoward Hinnant return true; 13083e519524SHoward Hinnant} 13093e519524SHoward Hinnant 13103e519524SHoward Hinnanttemplate<class _ForwardIterator1, class _ForwardIterator2> 13113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 13123e519524SHoward Hinnantbool 13133e519524SHoward Hinnantis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13143e519524SHoward Hinnant _ForwardIterator2 __first2) 13153e519524SHoward Hinnant{ 13163e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 13173e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 1318ce48a113SHoward Hinnant return _VSTD::is_permutation(__first1, __last1, __first2, __equal_to<__v1, __v2>()); 13193e519524SHoward Hinnant} 13203e519524SHoward Hinnant 13210b0bbd2fSMarshall Clow#if _LIBCPP_STD_VER > 11 13220b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 13230b0bbd2fSMarshall Clowbool 13240b0bbd2fSMarshall Clow__is_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13250b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13260b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13270b0bbd2fSMarshall Clow forward_iterator_tag, forward_iterator_tag ) 13280b0bbd2fSMarshall Clow{ 13290b0bbd2fSMarshall Clow // shorten sequences as much as possible by lopping of any equal parts 1330*847ee131SEric Fiselier for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void) ++__first2) 13310b0bbd2fSMarshall Clow if (!__pred(*__first1, *__first2)) 13320b0bbd2fSMarshall Clow goto __not_done; 13330b0bbd2fSMarshall Clow return __first1 == __last1 && __first2 == __last2; 13340b0bbd2fSMarshall Clow__not_done: 13350b0bbd2fSMarshall Clow // __first1 != __last1 && __first2 != __last2 && *__first1 != *__first2 13360b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::difference_type _D1; 13370b0bbd2fSMarshall Clow _D1 __l1 = _VSTD::distance(__first1, __last1); 13380b0bbd2fSMarshall Clow 13390b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::difference_type _D2; 1340fce85ba4SMarshall Clow _D2 __l2 = _VSTD::distance(__first2, __last2); 13410b0bbd2fSMarshall Clow if (__l1 != __l2) 13420b0bbd2fSMarshall Clow return false; 13430b0bbd2fSMarshall Clow 13440b0bbd2fSMarshall Clow // For each element in [f1, l1) see if there are the same number of 13450b0bbd2fSMarshall Clow // equal elements in [f2, l2) 13460b0bbd2fSMarshall Clow for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) 13470b0bbd2fSMarshall Clow { 13480b0bbd2fSMarshall Clow // Have we already counted the number of *__i in [f1, l1)? 13490b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = __first1; __j != __i; ++__j) 13500b0bbd2fSMarshall Clow if (__pred(*__j, *__i)) 13510b0bbd2fSMarshall Clow goto __next_iter; 13520b0bbd2fSMarshall Clow { 13530b0bbd2fSMarshall Clow // Count number of *__i in [f2, l2) 13540b0bbd2fSMarshall Clow _D1 __c2 = 0; 13550b0bbd2fSMarshall Clow for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) 13560b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13570b0bbd2fSMarshall Clow ++__c2; 13580b0bbd2fSMarshall Clow if (__c2 == 0) 13590b0bbd2fSMarshall Clow return false; 13600b0bbd2fSMarshall Clow // Count number of *__i in [__i, l1) (we can start with 1) 13610b0bbd2fSMarshall Clow _D1 __c1 = 1; 13620b0bbd2fSMarshall Clow for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) 13630b0bbd2fSMarshall Clow if (__pred(*__i, *__j)) 13640b0bbd2fSMarshall Clow ++__c1; 13650b0bbd2fSMarshall Clow if (__c1 != __c2) 13660b0bbd2fSMarshall Clow return false; 13670b0bbd2fSMarshall Clow } 13680b0bbd2fSMarshall Clow__next_iter:; 13690b0bbd2fSMarshall Clow } 13700b0bbd2fSMarshall Clow return true; 13710b0bbd2fSMarshall Clow} 13720b0bbd2fSMarshall Clow 13730b0bbd2fSMarshall Clowtemplate<class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 13740b0bbd2fSMarshall Clowbool 13750b0bbd2fSMarshall Clow__is_permutation(_RandomAccessIterator1 __first1, _RandomAccessIterator2 __last1, 13760b0bbd2fSMarshall Clow _RandomAccessIterator1 __first2, _RandomAccessIterator2 __last2, 13770b0bbd2fSMarshall Clow _BinaryPredicate __pred, 13780b0bbd2fSMarshall Clow random_access_iterator_tag, random_access_iterator_tag ) 13790b0bbd2fSMarshall Clow{ 13800b0bbd2fSMarshall Clow if ( _VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) 13810b0bbd2fSMarshall Clow return false; 13820b0bbd2fSMarshall Clow return _VSTD::is_permutation<_RandomAccessIterator1, _RandomAccessIterator2, 13830b0bbd2fSMarshall Clow typename add_lvalue_reference<_BinaryPredicate>::type> 13840b0bbd2fSMarshall Clow (__first1, __last1, __first2, __pred ); 13850b0bbd2fSMarshall Clow} 13860b0bbd2fSMarshall Clow 13870b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 13880b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 13890b0bbd2fSMarshall Clowbool 13900b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 13910b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2, 13920b0bbd2fSMarshall Clow _BinaryPredicate __pred ) 13930b0bbd2fSMarshall Clow{ 13940b0bbd2fSMarshall Clow return _VSTD::__is_permutation<typename add_lvalue_reference<_BinaryPredicate>::type> 13950b0bbd2fSMarshall Clow (__first1, __last1, __first2, __last2, __pred, 13960b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 13970b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 13980b0bbd2fSMarshall Clow} 13990b0bbd2fSMarshall Clow 14000b0bbd2fSMarshall Clowtemplate<class _ForwardIterator1, class _ForwardIterator2> 14010b0bbd2fSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 14020b0bbd2fSMarshall Clowbool 14030b0bbd2fSMarshall Clowis_permutation(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14040b0bbd2fSMarshall Clow _ForwardIterator2 __first2, _ForwardIterator2 __last2) 14050b0bbd2fSMarshall Clow{ 14060b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator1>::value_type __v1; 14070b0bbd2fSMarshall Clow typedef typename iterator_traits<_ForwardIterator2>::value_type __v2; 14080b0bbd2fSMarshall Clow return _VSTD::__is_permutation(__first1, __last1, __first2, __last2, 14090b0bbd2fSMarshall Clow __equal_to<__v1, __v2>(), 14100b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator1>::iterator_category(), 14110b0bbd2fSMarshall Clow typename iterator_traits<_ForwardIterator2>::iterator_category()); 14120b0bbd2fSMarshall Clow} 14130b0bbd2fSMarshall Clow#endif 14140b0bbd2fSMarshall Clow 14153e519524SHoward Hinnant// search 14163e519524SHoward Hinnant 14173e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator1, class _ForwardIterator2> 14183e519524SHoward Hinnant_ForwardIterator1 14193e519524SHoward Hinnant__search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 14203e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred, 14213e519524SHoward Hinnant forward_iterator_tag, forward_iterator_tag) 14223e519524SHoward Hinnant{ 14233e519524SHoward Hinnant if (__first2 == __last2) 14243e519524SHoward Hinnant return __first1; // Everything matches an empty sequence 14253e519524SHoward Hinnant while (true) 14263e519524SHoward Hinnant { 14273e519524SHoward Hinnant // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks 14283e519524SHoward Hinnant while (true) 14293e519524SHoward Hinnant { 14303e519524SHoward Hinnant if (__first1 == __last1) // return __last1 if no element matches *__first2 14313e519524SHoward Hinnant return __last1; 14323e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14333e519524SHoward Hinnant break; 14343e519524SHoward Hinnant ++__first1; 14353e519524SHoward Hinnant } 14363e519524SHoward Hinnant // *__first1 matches *__first2, now match elements after here 14373e519524SHoward Hinnant _ForwardIterator1 __m1 = __first1; 14383e519524SHoward Hinnant _ForwardIterator2 __m2 = __first2; 14393e519524SHoward Hinnant while (true) 14403e519524SHoward Hinnant { 14413e519524SHoward Hinnant if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element pattern) 14423e519524SHoward Hinnant return __first1; 14433e519524SHoward Hinnant if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found 14443e519524SHoward Hinnant return __last1; 14453e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 14463e519524SHoward Hinnant { 14473e519524SHoward Hinnant ++__first1; 14483e519524SHoward Hinnant break; 14493e519524SHoward Hinnant } // else there is a match, check next elements 14503e519524SHoward Hinnant } 14513e519524SHoward Hinnant } 14523e519524SHoward Hinnant} 14533e519524SHoward Hinnant 14543e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator1, class _RandomAccessIterator2> 14559b0af34dSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 _RandomAccessIterator1 14563e519524SHoward Hinnant__search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, 14573e519524SHoward Hinnant _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred, 14583e519524SHoward Hinnant random_access_iterator_tag, random_access_iterator_tag) 14593e519524SHoward Hinnant{ 14603e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _D1; 14613e519524SHoward Hinnant typedef typename std::iterator_traits<_RandomAccessIterator2>::difference_type _D2; 14623e519524SHoward Hinnant // Take advantage of knowing source and pattern lengths. Stop short when source is smaller than pattern 14633e519524SHoward Hinnant _D2 __len2 = __last2 - __first2; 14643e519524SHoward Hinnant if (__len2 == 0) 14653e519524SHoward Hinnant return __first1; 14663e519524SHoward Hinnant _D1 __len1 = __last1 - __first1; 14673e519524SHoward Hinnant if (__len1 < __len2) 14683e519524SHoward Hinnant return __last1; 14693e519524SHoward Hinnant const _RandomAccessIterator1 __s = __last1 - (__len2 - 1); // Start of pattern match can't go beyond here 14703e519524SHoward Hinnant while (true) 14713e519524SHoward Hinnant { 14723e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 14733e519524SHoward Hinnant while (true) 14743e519524SHoward Hinnant { 14753e519524SHoward Hinnant if (__first1 == __s) 14763e519524SHoward Hinnant return __last1; 14773e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14783e519524SHoward Hinnant break; 14793e519524SHoward Hinnant ++__first1; 14803e519524SHoward Hinnant } 1481b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 14823e519524SHoward Hinnant for (_D1 __loop_unroll = (__s - __first1) / 4; __loop_unroll > 0; --__loop_unroll) 14833e519524SHoward Hinnant { 14843e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14853e519524SHoward Hinnant goto __phase2; 14863e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14873e519524SHoward Hinnant goto __phase2; 14883e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14893e519524SHoward Hinnant goto __phase2; 14903e519524SHoward Hinnant if (__pred(*++__first1, *__first2)) 14913e519524SHoward Hinnant goto __phase2; 14923e519524SHoward Hinnant ++__first1; 14933e519524SHoward Hinnant } 14943e519524SHoward Hinnant switch (__s - __first1) 14953e519524SHoward Hinnant { 14963e519524SHoward Hinnant case 3: 14973e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 14983e519524SHoward Hinnant break; 14993e519524SHoward Hinnant ++__first1; 15003e519524SHoward Hinnant case 2: 15013e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15023e519524SHoward Hinnant break; 15033e519524SHoward Hinnant ++__first1; 15043e519524SHoward Hinnant case 1: 15053e519524SHoward Hinnant if (__pred(*__first1, *__first2)) 15063e519524SHoward Hinnant break; 15073e519524SHoward Hinnant case 0: 15083e519524SHoward Hinnant return __last1; 15093e519524SHoward Hinnant } 15103e519524SHoward Hinnant __phase2: 1511b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15123e519524SHoward Hinnant _RandomAccessIterator1 __m1 = __first1; 15133e519524SHoward Hinnant _RandomAccessIterator2 __m2 = __first2; 15143e519524SHoward Hinnant#if !_LIBCPP_UNROLL_LOOPS 15153e519524SHoward Hinnant while (true) 15163e519524SHoward Hinnant { 15173e519524SHoward Hinnant if (++__m2 == __last2) 15183e519524SHoward Hinnant return __first1; 15193e519524SHoward Hinnant ++__m1; // no need to check range on __m1 because __s guarantees we have enough source 15203e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15213e519524SHoward Hinnant { 15223e519524SHoward Hinnant ++__first1; 15233e519524SHoward Hinnant break; 15243e519524SHoward Hinnant } 15253e519524SHoward Hinnant } 1526b3371f6fSHoward Hinnant#else // !_LIBCPP_UNROLL_LOOPS 15273e519524SHoward Hinnant ++__m2; 15283e519524SHoward Hinnant ++__m1; 15293e519524SHoward Hinnant for (_D2 __loop_unroll = (__last2 - __m2) / 4; __loop_unroll > 0; --__loop_unroll) 15303e519524SHoward Hinnant { 15313e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15323e519524SHoward Hinnant goto __continue; 15333e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15343e519524SHoward Hinnant goto __continue; 15353e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15363e519524SHoward Hinnant goto __continue; 15373e519524SHoward Hinnant if (!__pred(*++__m1, *++__m2)) 15383e519524SHoward Hinnant goto __continue; 15393e519524SHoward Hinnant ++__m1; 15403e519524SHoward Hinnant ++__m2; 15413e519524SHoward Hinnant } 15423e519524SHoward Hinnant switch (__last2 - __m2) 15433e519524SHoward Hinnant { 15443e519524SHoward Hinnant case 3: 15453e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15463e519524SHoward Hinnant break; 15473e519524SHoward Hinnant ++__m1; 15483e519524SHoward Hinnant ++__m2; 15493e519524SHoward Hinnant case 2: 15503e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15513e519524SHoward Hinnant break; 15523e519524SHoward Hinnant ++__m1; 15533e519524SHoward Hinnant ++__m2; 15543e519524SHoward Hinnant case 1: 15553e519524SHoward Hinnant if (!__pred(*__m1, *__m2)) 15563e519524SHoward Hinnant break; 15573e519524SHoward Hinnant case 0: 15583e519524SHoward Hinnant return __first1; 15593e519524SHoward Hinnant } 15603e519524SHoward Hinnant __continue: 15613e519524SHoward Hinnant ++__first1; 1562b3371f6fSHoward Hinnant#endif // !_LIBCPP_UNROLL_LOOPS 15633e519524SHoward Hinnant } 15643e519524SHoward Hinnant} 15653e519524SHoward Hinnant 15663e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate> 15673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15683e519524SHoward Hinnant_ForwardIterator1 15693e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15703e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred) 15713e519524SHoward Hinnant{ 1572ce48a113SHoward Hinnant return _VSTD::__search<typename add_lvalue_reference<_BinaryPredicate>::type> 15733e519524SHoward Hinnant (__first1, __last1, __first2, __last2, __pred, 15743e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator1>::iterator_category(), 15753e519524SHoward Hinnant typename std::iterator_traits<_ForwardIterator2>::iterator_category()); 15763e519524SHoward Hinnant} 15773e519524SHoward Hinnant 15783e519524SHoward Hinnanttemplate <class _ForwardIterator1, class _ForwardIterator2> 15793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 15803e519524SHoward Hinnant_ForwardIterator1 15813e519524SHoward Hinnantsearch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, 15823e519524SHoward Hinnant _ForwardIterator2 __first2, _ForwardIterator2 __last2) 15833e519524SHoward Hinnant{ 15843e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator1>::value_type __v1; 15853e519524SHoward Hinnant typedef typename std::iterator_traits<_ForwardIterator2>::value_type __v2; 1586ce48a113SHoward Hinnant return _VSTD::search(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); 15873e519524SHoward Hinnant} 15883e519524SHoward Hinnant 15893e519524SHoward Hinnant// search_n 15903e519524SHoward Hinnant 15913e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp> 15923e519524SHoward Hinnant_ForwardIterator 15933e519524SHoward Hinnant__search_n(_ForwardIterator __first, _ForwardIterator __last, 1594e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag) 15953e519524SHoward Hinnant{ 15963e519524SHoward Hinnant if (__count <= 0) 15973e519524SHoward Hinnant return __first; 15983e519524SHoward Hinnant while (true) 15993e519524SHoward Hinnant { 1600e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16013e519524SHoward Hinnant while (true) 16023e519524SHoward Hinnant { 1603e4383379SHoward Hinnant if (__first == __last) // return __last if no element matches __value_ 16043e519524SHoward Hinnant return __last; 1605e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16063e519524SHoward Hinnant break; 16073e519524SHoward Hinnant ++__first; 16083e519524SHoward Hinnant } 1609e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16103e519524SHoward Hinnant _ForwardIterator __m = __first; 16113e519524SHoward Hinnant _Size __c(0); 16123e519524SHoward Hinnant while (true) 16133e519524SHoward Hinnant { 16143e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16153e519524SHoward Hinnant return __first; 16163e519524SHoward Hinnant if (++__m == __last) // Otherwise if source exhaused, pattern not found 16173e519524SHoward Hinnant return __last; 1618e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16193e519524SHoward Hinnant { 16203e519524SHoward Hinnant __first = __m; 16213e519524SHoward Hinnant ++__first; 16223e519524SHoward Hinnant break; 16233e519524SHoward Hinnant } // else there is a match, check next elements 16243e519524SHoward Hinnant } 16253e519524SHoward Hinnant } 16263e519524SHoward Hinnant} 16273e519524SHoward Hinnant 16283e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp> 16293e519524SHoward Hinnant_RandomAccessIterator 16303e519524SHoward Hinnant__search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, 1631e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag) 16323e519524SHoward Hinnant{ 16333e519524SHoward Hinnant if (__count <= 0) 16343e519524SHoward Hinnant return __first; 16353e519524SHoward Hinnant _Size __len = static_cast<_Size>(__last - __first); 16363e519524SHoward Hinnant if (__len < __count) 16373e519524SHoward Hinnant return __last; 16383e519524SHoward Hinnant const _RandomAccessIterator __s = __last - (__count - 1); // Start of pattern match can't go beyond here 16393e519524SHoward Hinnant while (true) 16403e519524SHoward Hinnant { 1641e4383379SHoward Hinnant // Find first element in sequence that matchs __value_, with a mininum of loop checks 16423e519524SHoward Hinnant while (true) 16433e519524SHoward Hinnant { 1644b13fcad6SHoward Hinnant if (__first >= __s) // return __last if no element matches __value_ 16453e519524SHoward Hinnant return __last; 1646e4383379SHoward Hinnant if (__pred(*__first, __value_)) 16473e519524SHoward Hinnant break; 16483e519524SHoward Hinnant ++__first; 16493e519524SHoward Hinnant } 1650e4383379SHoward Hinnant // *__first matches __value_, now match elements after here 16513e519524SHoward Hinnant _RandomAccessIterator __m = __first; 16523e519524SHoward Hinnant _Size __c(0); 16533e519524SHoward Hinnant while (true) 16543e519524SHoward Hinnant { 16553e519524SHoward Hinnant if (++__c == __count) // If pattern exhausted, __first is the answer (works for 1 element pattern) 16563e519524SHoward Hinnant return __first; 16573e519524SHoward Hinnant ++__m; // no need to check range on __m because __s guarantees we have enough source 1658e4383379SHoward Hinnant if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first 16593e519524SHoward Hinnant { 16603e519524SHoward Hinnant __first = __m; 16613e519524SHoward Hinnant ++__first; 16623e519524SHoward Hinnant break; 16633e519524SHoward Hinnant } // else there is a match, check next elements 16643e519524SHoward Hinnant } 16653e519524SHoward Hinnant } 16663e519524SHoward Hinnant} 16673e519524SHoward Hinnant 16683e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate> 16693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16703e519524SHoward Hinnant_ForwardIterator 16713e519524SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, 1672e4383379SHoward Hinnant _Size __count, const _Tp& __value_, _BinaryPredicate __pred) 16733e519524SHoward Hinnant{ 1674ce48a113SHoward Hinnant return _VSTD::__search_n<typename add_lvalue_reference<_BinaryPredicate>::type> 1675e4383379SHoward Hinnant (__first, __last, __count, __value_, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 16763e519524SHoward Hinnant} 16773e519524SHoward Hinnant 16783e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16803e519524SHoward Hinnant_ForwardIterator 1681e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16823e519524SHoward Hinnant{ 16833e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 1684e4383379SHoward Hinnant return _VSTD::search_n(__first, __last, __count, __value_, __equal_to<__v, _Tp>()); 16853e519524SHoward Hinnant} 16863e519524SHoward Hinnant 16873e519524SHoward Hinnant// copy 16883e519524SHoward Hinnant 16893e519524SHoward Hinnanttemplate <class _Iter> 16903e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16913e519524SHoward Hinnant{ 16923e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16933e519524SHoward Hinnant}; 16943e519524SHoward Hinnant 16953e519524SHoward Hinnanttemplate <class _Iter> 16963e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16973e519524SHoward Hinnant{ 16983e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16993e519524SHoward Hinnant}; 17003e519524SHoward Hinnant 17013e519524SHoward Hinnanttemplate <class _Iter> 17023e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 17033e519524SHoward Hinnant{ 17043e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 17053e519524SHoward Hinnant}; 17063e519524SHoward Hinnant 17073e519524SHoward Hinnanttemplate <class _Iter> 17083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17093e519524SHoward Hinnant_Iter 17103e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17113e519524SHoward Hinnant{ 17123e519524SHoward Hinnant return __i; 17133e519524SHoward Hinnant} 17143e519524SHoward Hinnant 17153e519524SHoward Hinnanttemplate <class _Tp> 17163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17173e519524SHoward Hinnanttypename enable_if 17183e519524SHoward Hinnant< 1719ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17203e519524SHoward Hinnant _Tp* 17213e519524SHoward Hinnant>::type 17223e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17233e519524SHoward Hinnant{ 17243e519524SHoward Hinnant return __i.base(); 17253e519524SHoward Hinnant} 17263e519524SHoward Hinnant 1727fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1728fc88dbd2SHoward Hinnant 17293e519524SHoward Hinnanttemplate <class _Tp> 17303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17313e519524SHoward Hinnanttypename enable_if 17323e519524SHoward Hinnant< 1733ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17343e519524SHoward Hinnant _Tp* 17353e519524SHoward Hinnant>::type 17363e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17373e519524SHoward Hinnant{ 17383e519524SHoward Hinnant return __i.base(); 17393e519524SHoward Hinnant} 17403e519524SHoward Hinnant 1741fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1742fc88dbd2SHoward Hinnant 17433e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17453e519524SHoward Hinnant_OutputIterator 17463e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17473e519524SHoward Hinnant{ 1748910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17493e519524SHoward Hinnant *__result = *__first; 17503e519524SHoward Hinnant return __result; 17513e519524SHoward Hinnant} 17523e519524SHoward Hinnant 17533e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17553e519524SHoward Hinnanttypename enable_if 17563e519524SHoward Hinnant< 17573e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1758ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17593e519524SHoward Hinnant _Up* 17603e519524SHoward Hinnant>::type 17613e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17623e519524SHoward Hinnant{ 17633e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1764ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17653e519524SHoward Hinnant return __result + __n; 17663e519524SHoward Hinnant} 17673e519524SHoward Hinnant 17683e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17703e519524SHoward Hinnant_OutputIterator 17713e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17723e519524SHoward Hinnant{ 1773ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17743e519524SHoward Hinnant} 17753e519524SHoward Hinnant 17763e519524SHoward Hinnant// copy_backward 17773e519524SHoward Hinnant 1778d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17793e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17803e519524SHoward Hinnant_OutputIterator 1781d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17823e519524SHoward Hinnant{ 17833e519524SHoward Hinnant while (__first != __last) 17843e519524SHoward Hinnant *--__result = *--__last; 17853e519524SHoward Hinnant return __result; 17863e519524SHoward Hinnant} 17873e519524SHoward Hinnant 17883e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17903e519524SHoward Hinnanttypename enable_if 17913e519524SHoward Hinnant< 17923e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1793ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17943e519524SHoward Hinnant _Up* 17953e519524SHoward Hinnant>::type 17963e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 17973e519524SHoward Hinnant{ 17983e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17993e519524SHoward Hinnant __result -= __n; 1800ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18013e519524SHoward Hinnant return __result; 18023e519524SHoward Hinnant} 18033e519524SHoward Hinnant 18043e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18063e519524SHoward Hinnant_BidirectionalIterator2 18073e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18083e519524SHoward Hinnant _BidirectionalIterator2 __result) 18093e519524SHoward Hinnant{ 1810ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18113e519524SHoward Hinnant} 18123e519524SHoward Hinnant 18133e519524SHoward Hinnant// copy_if 18143e519524SHoward Hinnant 18153e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18173e519524SHoward Hinnant_OutputIterator 18183e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18193e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18203e519524SHoward Hinnant{ 18213e519524SHoward Hinnant for (; __first != __last; ++__first) 18223e519524SHoward Hinnant { 18233e519524SHoward Hinnant if (__pred(*__first)) 18243e519524SHoward Hinnant { 18253e519524SHoward Hinnant *__result = *__first; 18263e519524SHoward Hinnant ++__result; 18273e519524SHoward Hinnant } 18283e519524SHoward Hinnant } 18293e519524SHoward Hinnant return __result; 18303e519524SHoward Hinnant} 18313e519524SHoward Hinnant 18323e519524SHoward Hinnant// copy_n 18333e519524SHoward Hinnant 18343e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18353e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18363e519524SHoward Hinnanttypename enable_if 18373e519524SHoward Hinnant< 18383e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18393e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18403e519524SHoward Hinnant _OutputIterator 18413e519524SHoward Hinnant>::type 18423e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18433e519524SHoward Hinnant{ 184499847d2bSHoward Hinnant if (__n > 0) 184599847d2bSHoward Hinnant { 18463e519524SHoward Hinnant *__result = *__first; 184799847d2bSHoward Hinnant ++__result; 184899847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 184999847d2bSHoward Hinnant { 185099847d2bSHoward Hinnant ++__first; 185199847d2bSHoward Hinnant *__result = *__first; 185299847d2bSHoward Hinnant ++__result; 185399847d2bSHoward Hinnant } 185499847d2bSHoward Hinnant } 18553e519524SHoward Hinnant return __result; 18563e519524SHoward Hinnant} 18573e519524SHoward Hinnant 18583e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18603e519524SHoward Hinnanttypename enable_if 18613e519524SHoward Hinnant< 18623e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18633e519524SHoward Hinnant _OutputIterator 18643e519524SHoward Hinnant>::type 18653e519524SHoward Hinnantcopy_n(_InputIterator __first, _Size __n, _OutputIterator __result) 18663e519524SHoward Hinnant{ 1867ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18683e519524SHoward Hinnant} 18693e519524SHoward Hinnant 18703e519524SHoward Hinnant// move 18713e519524SHoward Hinnant 18723e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18743e519524SHoward Hinnant_OutputIterator 18753e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18763e519524SHoward Hinnant{ 1877910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1878ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18793e519524SHoward Hinnant return __result; 18803e519524SHoward Hinnant} 18813e519524SHoward Hinnant 18823e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18843e519524SHoward Hinnanttypename enable_if 18853e519524SHoward Hinnant< 18863e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1887ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18883e519524SHoward Hinnant _Up* 18893e519524SHoward Hinnant>::type 18903e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 18913e519524SHoward Hinnant{ 18923e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 1893ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18943e519524SHoward Hinnant return __result + __n; 18953e519524SHoward Hinnant} 18963e519524SHoward Hinnant 18973e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18993e519524SHoward Hinnant_OutputIterator 19003e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19013e519524SHoward Hinnant{ 1902ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19033e519524SHoward Hinnant} 19043e519524SHoward Hinnant 19053e519524SHoward Hinnant// move_backward 19063e519524SHoward Hinnant 19073e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19093e519524SHoward Hinnant_OutputIterator 19103e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19113e519524SHoward Hinnant{ 19123e519524SHoward Hinnant while (__first != __last) 1913ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19143e519524SHoward Hinnant return __result; 19153e519524SHoward Hinnant} 19163e519524SHoward Hinnant 19173e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19193e519524SHoward Hinnanttypename enable_if 19203e519524SHoward Hinnant< 19213e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1922ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19233e519524SHoward Hinnant _Up* 19243e519524SHoward Hinnant>::type 19253e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19263e519524SHoward Hinnant{ 19273e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19283e519524SHoward Hinnant __result -= __n; 1929ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19303e519524SHoward Hinnant return __result; 19313e519524SHoward Hinnant} 19323e519524SHoward Hinnant 19333e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19343e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19353e519524SHoward Hinnant_BidirectionalIterator2 19363e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19373e519524SHoward Hinnant _BidirectionalIterator2 __result) 19383e519524SHoward Hinnant{ 1939ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19403e519524SHoward Hinnant} 19413e519524SHoward Hinnant 19423e519524SHoward Hinnant// iter_swap 19433e519524SHoward Hinnant 1944a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19453e519524SHoward Hinnant 19463e519524SHoward Hinnant// transform 19473e519524SHoward Hinnant 19483e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19503e519524SHoward Hinnant_OutputIterator 19513e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19523e519524SHoward Hinnant{ 1953910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19543e519524SHoward Hinnant *__result = __op(*__first); 19553e519524SHoward Hinnant return __result; 19563e519524SHoward Hinnant} 19573e519524SHoward Hinnant 19583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19603e519524SHoward Hinnant_OutputIterator 19613e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19623e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19633e519524SHoward Hinnant{ 1964910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19653e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19663e519524SHoward Hinnant return __result; 19673e519524SHoward Hinnant} 19683e519524SHoward Hinnant 19693e519524SHoward Hinnant// replace 19703e519524SHoward Hinnant 19713e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19733e519524SHoward Hinnantvoid 19743e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19753e519524SHoward Hinnant{ 19763e519524SHoward Hinnant for (; __first != __last; ++__first) 19773e519524SHoward Hinnant if (*__first == __old_value) 19783e519524SHoward Hinnant *__first = __new_value; 19793e519524SHoward Hinnant} 19803e519524SHoward Hinnant 19813e519524SHoward Hinnant// replace_if 19823e519524SHoward Hinnant 19833e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19843e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19853e519524SHoward Hinnantvoid 19863e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 19873e519524SHoward Hinnant{ 19883e519524SHoward Hinnant for (; __first != __last; ++__first) 19893e519524SHoward Hinnant if (__pred(*__first)) 19903e519524SHoward Hinnant *__first = __new_value; 19913e519524SHoward Hinnant} 19923e519524SHoward Hinnant 19933e519524SHoward Hinnant// replace_copy 19943e519524SHoward Hinnant 19953e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 19963e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19973e519524SHoward Hinnant_OutputIterator 19983e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 19993e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20003e519524SHoward Hinnant{ 2001910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20023e519524SHoward Hinnant if (*__first == __old_value) 20033e519524SHoward Hinnant *__result = __new_value; 20043e519524SHoward Hinnant else 20053e519524SHoward Hinnant *__result = *__first; 20063e519524SHoward Hinnant return __result; 20073e519524SHoward Hinnant} 20083e519524SHoward Hinnant 20093e519524SHoward Hinnant// replace_copy_if 20103e519524SHoward Hinnant 20113e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20133e519524SHoward Hinnant_OutputIterator 20143e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20153e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20163e519524SHoward Hinnant{ 2017910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20183e519524SHoward Hinnant if (__pred(*__first)) 20193e519524SHoward Hinnant *__result = __new_value; 20203e519524SHoward Hinnant else 20213e519524SHoward Hinnant *__result = *__first; 20223e519524SHoward Hinnant return __result; 20233e519524SHoward Hinnant} 20243e519524SHoward Hinnant 20253e519524SHoward Hinnant// fill_n 20263e519524SHoward Hinnant 20273e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20293e519524SHoward Hinnant_OutputIterator 20300f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20313e519524SHoward Hinnant{ 2032910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2033e4383379SHoward Hinnant *__first = __value_; 20343e519524SHoward Hinnant return __first; 20353e519524SHoward Hinnant} 20363e519524SHoward Hinnant 20370f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20390f242beaSHoward Hinnanttypename enable_if 20400f242beaSHoward Hinnant< 20410f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20420f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20430f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20440f242beaSHoward Hinnant _Tp* 20450f242beaSHoward Hinnant>::type 20460f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20473e519524SHoward Hinnant{ 20483e519524SHoward Hinnant if (__n > 0) 2049e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20503e519524SHoward Hinnant return __first + __n; 20513e519524SHoward Hinnant} 20523e519524SHoward Hinnant 20533e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20553e519524SHoward Hinnant_OutputIterator 2056e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20573e519524SHoward Hinnant{ 20580f242beaSHoward Hinnant return _VSTD::__fill_n(__first, __n, __value_); 20593e519524SHoward Hinnant} 20603e519524SHoward Hinnant 20613e519524SHoward Hinnant// fill 20623e519524SHoward Hinnant 20633e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20653e519524SHoward Hinnantvoid 2066e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20673e519524SHoward Hinnant{ 20683e519524SHoward Hinnant for (; __first != __last; ++__first) 2069e4383379SHoward Hinnant *__first = __value_; 20703e519524SHoward Hinnant} 20713e519524SHoward Hinnant 20723e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20743e519524SHoward Hinnantvoid 2075e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20763e519524SHoward Hinnant{ 2077e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20783e519524SHoward Hinnant} 20793e519524SHoward Hinnant 20803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20823e519524SHoward Hinnantvoid 2083e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20843e519524SHoward Hinnant{ 2085e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 20863e519524SHoward Hinnant} 20873e519524SHoward Hinnant 20883e519524SHoward Hinnant// generate 20893e519524SHoward Hinnant 20903e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 20913e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20923e519524SHoward Hinnantvoid 20933e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 20943e519524SHoward Hinnant{ 20953e519524SHoward Hinnant for (; __first != __last; ++__first) 20963e519524SHoward Hinnant *__first = __gen(); 20973e519524SHoward Hinnant} 20983e519524SHoward Hinnant 20993e519524SHoward Hinnant// generate_n 21003e519524SHoward Hinnant 21013e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21033e519524SHoward Hinnant_OutputIterator 21043e519524SHoward Hinnantgenerate_n(_OutputIterator __first, _Size __n, _Generator __gen) 21053e519524SHoward Hinnant{ 2106910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21073e519524SHoward Hinnant *__first = __gen(); 21083e519524SHoward Hinnant return __first; 21093e519524SHoward Hinnant} 21103e519524SHoward Hinnant 21113e519524SHoward Hinnant// remove 21123e519524SHoward Hinnant 21133e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21143e519524SHoward Hinnant_ForwardIterator 2115e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21163e519524SHoward Hinnant{ 2117e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21183e519524SHoward Hinnant if (__first != __last) 21193e519524SHoward Hinnant { 21203e519524SHoward Hinnant _ForwardIterator __i = __first; 21213e519524SHoward Hinnant while (++__i != __last) 21223e519524SHoward Hinnant { 2123e4383379SHoward Hinnant if (!(*__i == __value_)) 21243e519524SHoward Hinnant { 2125ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21263e519524SHoward Hinnant ++__first; 21273e519524SHoward Hinnant } 21283e519524SHoward Hinnant } 21293e519524SHoward Hinnant } 21303e519524SHoward Hinnant return __first; 21313e519524SHoward Hinnant} 21323e519524SHoward Hinnant 21333e519524SHoward Hinnant// remove_if 21343e519524SHoward Hinnant 21353e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21363e519524SHoward Hinnant_ForwardIterator 21373e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21383e519524SHoward Hinnant{ 2139ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21403e519524SHoward Hinnant (__first, __last, __pred); 21413e519524SHoward Hinnant if (__first != __last) 21423e519524SHoward Hinnant { 21433e519524SHoward Hinnant _ForwardIterator __i = __first; 21443e519524SHoward Hinnant while (++__i != __last) 21453e519524SHoward Hinnant { 21463e519524SHoward Hinnant if (!__pred(*__i)) 21473e519524SHoward Hinnant { 2148ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21493e519524SHoward Hinnant ++__first; 21503e519524SHoward Hinnant } 21513e519524SHoward Hinnant } 21523e519524SHoward Hinnant } 21533e519524SHoward Hinnant return __first; 21543e519524SHoward Hinnant} 21553e519524SHoward Hinnant 21563e519524SHoward Hinnant// remove_copy 21573e519524SHoward Hinnant 21583e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21603e519524SHoward Hinnant_OutputIterator 2161e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21623e519524SHoward Hinnant{ 21633e519524SHoward Hinnant for (; __first != __last; ++__first) 21643e519524SHoward Hinnant { 2165e4383379SHoward Hinnant if (!(*__first == __value_)) 21663e519524SHoward Hinnant { 21673e519524SHoward Hinnant *__result = *__first; 21683e519524SHoward Hinnant ++__result; 21693e519524SHoward Hinnant } 21703e519524SHoward Hinnant } 21713e519524SHoward Hinnant return __result; 21723e519524SHoward Hinnant} 21733e519524SHoward Hinnant 21743e519524SHoward Hinnant// remove_copy_if 21753e519524SHoward Hinnant 21763e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21783e519524SHoward Hinnant_OutputIterator 21793e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21803e519524SHoward Hinnant{ 21813e519524SHoward Hinnant for (; __first != __last; ++__first) 21823e519524SHoward Hinnant { 21833e519524SHoward Hinnant if (!__pred(*__first)) 21843e519524SHoward Hinnant { 21853e519524SHoward Hinnant *__result = *__first; 21863e519524SHoward Hinnant ++__result; 21873e519524SHoward Hinnant } 21883e519524SHoward Hinnant } 21893e519524SHoward Hinnant return __result; 21903e519524SHoward Hinnant} 21913e519524SHoward Hinnant 21923e519524SHoward Hinnant// unique 21933e519524SHoward Hinnant 21943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 21953e519524SHoward Hinnant_ForwardIterator 21963e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 21973e519524SHoward Hinnant{ 2198ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 21993e519524SHoward Hinnant (__first, __last, __pred); 22003e519524SHoward Hinnant if (__first != __last) 22013e519524SHoward Hinnant { 22023e519524SHoward Hinnant // ... a a ? ... 22033e519524SHoward Hinnant // f i 22043e519524SHoward Hinnant _ForwardIterator __i = __first; 22053e519524SHoward Hinnant for (++__i; ++__i != __last;) 22063e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2207ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22083e519524SHoward Hinnant ++__first; 22093e519524SHoward Hinnant } 22103e519524SHoward Hinnant return __first; 22113e519524SHoward Hinnant} 22123e519524SHoward Hinnant 22133e519524SHoward Hinnanttemplate <class _ForwardIterator> 22143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22153e519524SHoward Hinnant_ForwardIterator 22163e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22173e519524SHoward Hinnant{ 22183e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2219ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22203e519524SHoward Hinnant} 22213e519524SHoward Hinnant 22223e519524SHoward Hinnant// unique_copy 22233e519524SHoward Hinnant 22243e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22253e519524SHoward Hinnant_OutputIterator 22263e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22273e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22283e519524SHoward Hinnant{ 22293e519524SHoward Hinnant if (__first != __last) 22303e519524SHoward Hinnant { 22313e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22323e519524SHoward Hinnant *__result = __t; 22333e519524SHoward Hinnant ++__result; 22343e519524SHoward Hinnant while (++__first != __last) 22353e519524SHoward Hinnant { 22363e519524SHoward Hinnant if (!__pred(__t, *__first)) 22373e519524SHoward Hinnant { 22383e519524SHoward Hinnant __t = *__first; 22393e519524SHoward Hinnant *__result = __t; 22403e519524SHoward Hinnant ++__result; 22413e519524SHoward Hinnant } 22423e519524SHoward Hinnant } 22433e519524SHoward Hinnant } 22443e519524SHoward Hinnant return __result; 22453e519524SHoward Hinnant} 22463e519524SHoward Hinnant 22473e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22483e519524SHoward Hinnant_OutputIterator 22493e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22503e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22513e519524SHoward Hinnant{ 22523e519524SHoward Hinnant if (__first != __last) 22533e519524SHoward Hinnant { 22543e519524SHoward Hinnant _ForwardIterator __i = __first; 22553e519524SHoward Hinnant *__result = *__i; 22563e519524SHoward Hinnant ++__result; 22573e519524SHoward Hinnant while (++__first != __last) 22583e519524SHoward Hinnant { 22593e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22603e519524SHoward Hinnant { 22613e519524SHoward Hinnant *__result = *__first; 22623e519524SHoward Hinnant ++__result; 22633e519524SHoward Hinnant __i = __first; 22643e519524SHoward Hinnant } 22653e519524SHoward Hinnant } 22663e519524SHoward Hinnant } 22673e519524SHoward Hinnant return __result; 22683e519524SHoward Hinnant} 22693e519524SHoward Hinnant 22703e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22713e519524SHoward Hinnant_ForwardIterator 22723e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22733e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22743e519524SHoward Hinnant{ 22753e519524SHoward Hinnant if (__first != __last) 22763e519524SHoward Hinnant { 22773e519524SHoward Hinnant *__result = *__first; 22783e519524SHoward Hinnant while (++__first != __last) 22793e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22803e519524SHoward Hinnant *++__result = *__first; 22813e519524SHoward Hinnant ++__result; 22823e519524SHoward Hinnant } 22833e519524SHoward Hinnant return __result; 22843e519524SHoward Hinnant} 22853e519524SHoward Hinnant 22863e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 22873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22883e519524SHoward Hinnant_OutputIterator 22893e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 22903e519524SHoward Hinnant{ 2291ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 22923e519524SHoward Hinnant (__first, __last, __result, __pred, 22933e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 22943e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 22953e519524SHoward Hinnant} 22963e519524SHoward Hinnant 22973e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 22983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22993e519524SHoward Hinnant_OutputIterator 23003e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23013e519524SHoward Hinnant{ 23023e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2303ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23043e519524SHoward Hinnant} 23053e519524SHoward Hinnant 23063e519524SHoward Hinnant// reverse 23073e519524SHoward Hinnant 23083e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23103e519524SHoward Hinnantvoid 23113e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23123e519524SHoward Hinnant{ 23133e519524SHoward Hinnant while (__first != __last) 23143e519524SHoward Hinnant { 23153e519524SHoward Hinnant if (__first == --__last) 23163e519524SHoward Hinnant break; 23173e519524SHoward Hinnant swap(*__first, *__last); 23183e519524SHoward Hinnant ++__first; 23193e519524SHoward Hinnant } 23203e519524SHoward Hinnant} 23213e519524SHoward Hinnant 23223e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23233e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23243e519524SHoward Hinnantvoid 23253e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23263e519524SHoward Hinnant{ 23273e519524SHoward Hinnant if (__first != __last) 23283e519524SHoward Hinnant for (; __first < --__last; ++__first) 23293e519524SHoward Hinnant swap(*__first, *__last); 23303e519524SHoward Hinnant} 23313e519524SHoward Hinnant 23323e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23343e519524SHoward Hinnantvoid 23353e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23363e519524SHoward Hinnant{ 2337ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23383e519524SHoward Hinnant} 23393e519524SHoward Hinnant 23403e519524SHoward Hinnant// reverse_copy 23413e519524SHoward Hinnant 23423e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23443e519524SHoward Hinnant_OutputIterator 23453e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23463e519524SHoward Hinnant{ 23473e519524SHoward Hinnant for (; __first != __last; ++__result) 23483e519524SHoward Hinnant *__result = *--__last; 23493e519524SHoward Hinnant return __result; 23503e519524SHoward Hinnant} 23513e519524SHoward Hinnant 23523e519524SHoward Hinnant// rotate 23533e519524SHoward Hinnant 23543e519524SHoward Hinnanttemplate <class _ForwardIterator> 23553e519524SHoward Hinnant_ForwardIterator 2356aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23573e519524SHoward Hinnant{ 2358aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2359aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2360aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2361aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2362aca09de3SHoward Hinnant return __lm1; 2363aca09de3SHoward Hinnant} 2364aca09de3SHoward Hinnant 2365aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2366aca09de3SHoward Hinnant_BidirectionalIterator 2367aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2368aca09de3SHoward Hinnant{ 2369aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2370aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2371aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2372aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2373aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2374aca09de3SHoward Hinnant return __fp1; 2375aca09de3SHoward Hinnant} 2376aca09de3SHoward Hinnant 2377aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2378aca09de3SHoward Hinnant_ForwardIterator 2379aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2380aca09de3SHoward Hinnant{ 23813e519524SHoward Hinnant _ForwardIterator __i = __middle; 23823e519524SHoward Hinnant while (true) 23833e519524SHoward Hinnant { 23843e519524SHoward Hinnant swap(*__first, *__i); 23853e519524SHoward Hinnant ++__first; 23863e519524SHoward Hinnant if (++__i == __last) 23873e519524SHoward Hinnant break; 23883e519524SHoward Hinnant if (__first == __middle) 23893e519524SHoward Hinnant __middle = __i; 23903e519524SHoward Hinnant } 23913e519524SHoward Hinnant _ForwardIterator __r = __first; 23923e519524SHoward Hinnant if (__first != __middle) 23933e519524SHoward Hinnant { 23943e519524SHoward Hinnant __i = __middle; 23953e519524SHoward Hinnant while (true) 23963e519524SHoward Hinnant { 23973e519524SHoward Hinnant swap(*__first, *__i); 23983e519524SHoward Hinnant ++__first; 23993e519524SHoward Hinnant if (++__i == __last) 24003e519524SHoward Hinnant { 24013e519524SHoward Hinnant if (__first == __middle) 24023e519524SHoward Hinnant break; 24033e519524SHoward Hinnant __i = __middle; 24043e519524SHoward Hinnant } 24053e519524SHoward Hinnant else if (__first == __middle) 24063e519524SHoward Hinnant __middle = __i; 24073e519524SHoward Hinnant } 24083e519524SHoward Hinnant } 24093e519524SHoward Hinnant return __r; 24103e519524SHoward Hinnant} 24113e519524SHoward Hinnant 24123e519524SHoward Hinnanttemplate<typename _Integral> 24133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24143e519524SHoward Hinnant_Integral 24153e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24163e519524SHoward Hinnant{ 24173e519524SHoward Hinnant do 24183e519524SHoward Hinnant { 24193e519524SHoward Hinnant _Integral __t = __x % __y; 24203e519524SHoward Hinnant __x = __y; 24213e519524SHoward Hinnant __y = __t; 24223e519524SHoward Hinnant } while (__y); 24233e519524SHoward Hinnant return __x; 24243e519524SHoward Hinnant} 24253e519524SHoward Hinnant 24263e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24273e519524SHoward Hinnant_RandomAccessIterator 2428aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24293e519524SHoward Hinnant{ 24303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24323e519524SHoward Hinnant 24333e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24343e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24353e519524SHoward Hinnant if (__m1 == __m2) 24363e519524SHoward Hinnant { 2437ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24383e519524SHoward Hinnant return __middle; 24393e519524SHoward Hinnant } 2440aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24413e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24423e519524SHoward Hinnant { 2443aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24443e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24453e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24463e519524SHoward Hinnant do 24473e519524SHoward Hinnant { 2448aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24493e519524SHoward Hinnant __p1 = __p2; 24503e519524SHoward Hinnant const difference_type __d = __last - __p2; 24513e519524SHoward Hinnant if (__m1 < __d) 24523e519524SHoward Hinnant __p2 += __m1; 24533e519524SHoward Hinnant else 24543e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24553e519524SHoward Hinnant } while (__p2 != __p); 2456aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24573e519524SHoward Hinnant } 24583e519524SHoward Hinnant return __first + __m2; 24593e519524SHoward Hinnant} 24603e519524SHoward Hinnant 24613e519524SHoward Hinnanttemplate <class _ForwardIterator> 24623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24633e519524SHoward Hinnant_ForwardIterator 2464aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2465aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2466aca09de3SHoward Hinnant{ 2467aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2468aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2469aca09de3SHoward Hinnant { 2470aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2471aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2472aca09de3SHoward Hinnant } 2473aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2474aca09de3SHoward Hinnant} 2475aca09de3SHoward Hinnant 2476aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2477aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2478aca09de3SHoward Hinnant_BidirectionalIterator 2479aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2480aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2481aca09de3SHoward Hinnant{ 2482aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2483aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2484aca09de3SHoward Hinnant { 2485aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2486aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2487aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2488aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2489aca09de3SHoward Hinnant } 2490aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2491aca09de3SHoward Hinnant} 2492aca09de3SHoward Hinnant 2493aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2494aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2495aca09de3SHoward Hinnant_RandomAccessIterator 2496aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2497aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2498aca09de3SHoward Hinnant{ 2499aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2500aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2501aca09de3SHoward Hinnant { 2502aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2503aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2504aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2505aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2506aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2507aca09de3SHoward Hinnant } 2508aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2509aca09de3SHoward Hinnant} 2510aca09de3SHoward Hinnant 2511aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2512aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2513aca09de3SHoward Hinnant_ForwardIterator 25143e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25153e519524SHoward Hinnant{ 2516aca09de3SHoward Hinnant if (__first == __middle) 2517aca09de3SHoward Hinnant return __last; 2518aca09de3SHoward Hinnant if (__middle == __last) 2519aca09de3SHoward Hinnant return __first; 2520ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2521aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25223e519524SHoward Hinnant} 25233e519524SHoward Hinnant 25243e519524SHoward Hinnant// rotate_copy 25253e519524SHoward Hinnant 25263e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25283e519524SHoward Hinnant_OutputIterator 25293e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25303e519524SHoward Hinnant{ 2531ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25323e519524SHoward Hinnant} 25333e519524SHoward Hinnant 25343e519524SHoward Hinnant// min_element 25353e519524SHoward Hinnant 25363e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25379d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25383e519524SHoward Hinnant_ForwardIterator 25399d67c6d5SMarshall Clow__min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25403e519524SHoward Hinnant{ 25413e519524SHoward Hinnant if (__first != __last) 25423e519524SHoward Hinnant { 25433e519524SHoward Hinnant _ForwardIterator __i = __first; 25443e519524SHoward Hinnant while (++__i != __last) 25453e519524SHoward Hinnant if (__comp(*__i, *__first)) 25463e519524SHoward Hinnant __first = __i; 25473e519524SHoward Hinnant } 25483e519524SHoward Hinnant return __first; 25493e519524SHoward Hinnant} 25503e519524SHoward Hinnant 25519d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 25529d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 25539d67c6d5SMarshall Clow_ForwardIterator 25549d67c6d5SMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25559d67c6d5SMarshall Clow{ 25569d67c6d5SMarshall Clow return __min_element(__first, __last, __comp); 25579d67c6d5SMarshall Clow} 25589d67c6d5SMarshall Clow 25593e519524SHoward Hinnanttemplate <class _ForwardIterator> 25603e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25613e519524SHoward Hinnant_ForwardIterator 25623e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25633e519524SHoward Hinnant{ 25649d67c6d5SMarshall Clow return __min_element(__first, __last, 25654eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25664eb27b79SHoward Hinnant} 25674eb27b79SHoward Hinnant 25684eb27b79SHoward Hinnant// min 25694eb27b79SHoward Hinnant 25704eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25719d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25724eb27b79SHoward Hinnantconst _Tp& 25734eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25744eb27b79SHoward Hinnant{ 25754eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25764eb27b79SHoward Hinnant} 25774eb27b79SHoward Hinnant 25784eb27b79SHoward Hinnanttemplate <class _Tp> 25799d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25804eb27b79SHoward Hinnantconst _Tp& 25814eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25824eb27b79SHoward Hinnant{ 2583ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25844eb27b79SHoward Hinnant} 25854eb27b79SHoward Hinnant 258654976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 258754976f26SHoward Hinnant 25884eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25899d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25904eb27b79SHoward Hinnant_Tp 25914eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 25924eb27b79SHoward Hinnant{ 25939d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __comp); 25944eb27b79SHoward Hinnant} 25954eb27b79SHoward Hinnant 25964eb27b79SHoward Hinnanttemplate<class _Tp> 25979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25984eb27b79SHoward Hinnant_Tp 25994eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26004eb27b79SHoward Hinnant{ 26019d67c6d5SMarshall Clow return *__min_element(__t.begin(), __t.end(), __less<_Tp>()); 26023e519524SHoward Hinnant} 26033e519524SHoward Hinnant 260454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 260554976f26SHoward Hinnant 26063e519524SHoward Hinnant// max_element 26073e519524SHoward Hinnant 26083e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26099d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26103e519524SHoward Hinnant_ForwardIterator 26119d67c6d5SMarshall Clow__max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26123e519524SHoward Hinnant{ 26133e519524SHoward Hinnant if (__first != __last) 26143e519524SHoward Hinnant { 26153e519524SHoward Hinnant _ForwardIterator __i = __first; 26163e519524SHoward Hinnant while (++__i != __last) 26173e519524SHoward Hinnant if (__comp(*__first, *__i)) 26183e519524SHoward Hinnant __first = __i; 26193e519524SHoward Hinnant } 26203e519524SHoward Hinnant return __first; 26213e519524SHoward Hinnant} 26223e519524SHoward Hinnant 26239d67c6d5SMarshall Clow 26249d67c6d5SMarshall Clowtemplate <class _ForwardIterator, class _Compare> 26259d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY 26269d67c6d5SMarshall Clow_ForwardIterator 26279d67c6d5SMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26289d67c6d5SMarshall Clow{ 26299d67c6d5SMarshall Clow return __max_element(__first, __last, __comp); 26309d67c6d5SMarshall Clow} 26319d67c6d5SMarshall Clow 26323e519524SHoward Hinnanttemplate <class _ForwardIterator> 26333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 26343e519524SHoward Hinnant_ForwardIterator 26353e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26363e519524SHoward Hinnant{ 26379d67c6d5SMarshall Clow return __max_element(__first, __last, 26384eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 26394eb27b79SHoward Hinnant} 26404eb27b79SHoward Hinnant 26414eb27b79SHoward Hinnant// max 26424eb27b79SHoward Hinnant 26434eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 26449d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26454eb27b79SHoward Hinnantconst _Tp& 26464eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 26474eb27b79SHoward Hinnant{ 26484eb27b79SHoward Hinnant return __comp(__a, __b) ? __b : __a; 26494eb27b79SHoward Hinnant} 26504eb27b79SHoward Hinnant 26514eb27b79SHoward Hinnanttemplate <class _Tp> 26529d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26534eb27b79SHoward Hinnantconst _Tp& 26544eb27b79SHoward Hinnantmax(const _Tp& __a, const _Tp& __b) 26554eb27b79SHoward Hinnant{ 2656ce48a113SHoward Hinnant return _VSTD::max(__a, __b, __less<_Tp>()); 26574eb27b79SHoward Hinnant} 26584eb27b79SHoward Hinnant 265954976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 266054976f26SHoward Hinnant 26614eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 26629d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26634eb27b79SHoward Hinnant_Tp 26644eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t, _Compare __comp) 26654eb27b79SHoward Hinnant{ 26669d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __comp); 26674eb27b79SHoward Hinnant} 26684eb27b79SHoward Hinnant 26694eb27b79SHoward Hinnanttemplate<class _Tp> 26709d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26714eb27b79SHoward Hinnant_Tp 26724eb27b79SHoward Hinnantmax(initializer_list<_Tp> __t) 26734eb27b79SHoward Hinnant{ 26749d67c6d5SMarshall Clow return *__max_element(__t.begin(), __t.end(), __less<_Tp>()); 26753e519524SHoward Hinnant} 26763e519524SHoward Hinnant 267754976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 267854976f26SHoward Hinnant 26793e519524SHoward Hinnant// minmax_element 26803e519524SHoward Hinnant 26813e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26823e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26833e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26843e519524SHoward Hinnant{ 26853e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26863e519524SHoward Hinnant if (__first != __last) 26873e519524SHoward Hinnant { 26883e519524SHoward Hinnant if (++__first != __last) 26893e519524SHoward Hinnant { 26903e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26913e519524SHoward Hinnant __result.first = __first; 26923e519524SHoward Hinnant else 26933e519524SHoward Hinnant __result.second = __first; 26943e519524SHoward Hinnant while (++__first != __last) 26953e519524SHoward Hinnant { 26963e519524SHoward Hinnant _ForwardIterator __i = __first; 26973e519524SHoward Hinnant if (++__first == __last) 26983e519524SHoward Hinnant { 26993e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27003e519524SHoward Hinnant __result.first = __i; 27013e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27023e519524SHoward Hinnant __result.second = __i; 27033e519524SHoward Hinnant break; 27043e519524SHoward Hinnant } 27053e519524SHoward Hinnant else 27063e519524SHoward Hinnant { 27073e519524SHoward Hinnant if (__comp(*__first, *__i)) 27083e519524SHoward Hinnant { 27093e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27103e519524SHoward Hinnant __result.first = __first; 27113e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27123e519524SHoward Hinnant __result.second = __i; 27133e519524SHoward Hinnant } 27143e519524SHoward Hinnant else 27153e519524SHoward Hinnant { 27163e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27173e519524SHoward Hinnant __result.first = __i; 27183e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27193e519524SHoward Hinnant __result.second = __first; 27203e519524SHoward Hinnant } 27213e519524SHoward Hinnant } 27223e519524SHoward Hinnant } 27233e519524SHoward Hinnant } 27243e519524SHoward Hinnant } 27253e519524SHoward Hinnant return __result; 27263e519524SHoward Hinnant} 27273e519524SHoward Hinnant 27283e519524SHoward Hinnanttemplate <class _ForwardIterator> 27293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 27303e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27313e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27323e519524SHoward Hinnant{ 27339d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27349d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27353e519524SHoward Hinnant} 27363e519524SHoward Hinnant 27374eb27b79SHoward Hinnant// minmax 27384eb27b79SHoward Hinnant 27394eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27409d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27414eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27424eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27434eb27b79SHoward Hinnant{ 27444eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27454eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27464eb27b79SHoward Hinnant} 27474eb27b79SHoward Hinnant 27484eb27b79SHoward Hinnanttemplate<class _Tp> 27499d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27504eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27514eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27524eb27b79SHoward Hinnant{ 2753ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27544eb27b79SHoward Hinnant} 27554eb27b79SHoward Hinnant 275654976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 275754976f26SHoward Hinnant 27584eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27599d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27604eb27b79SHoward Hinnantpair<_Tp, _Tp> 27614eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27624eb27b79SHoward Hinnant{ 27639d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27649d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27659d67c6d5SMarshall Clow _Iter __last = __t.end(); 27669d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result ( *__first, *__first ); 27679d67c6d5SMarshall Clow 27689d67c6d5SMarshall Clow ++__first; 27699d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27709d67c6d5SMarshall Clow { 27719d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27729d67c6d5SMarshall Clow __result.first = *__first; 27739d67c6d5SMarshall Clow else 27749d67c6d5SMarshall Clow __result.second = *__first; 27759d67c6d5SMarshall Clow ++__first; 27769d67c6d5SMarshall Clow } 27779d67c6d5SMarshall Clow 27789d67c6d5SMarshall Clow while (__first != __last) 27799d67c6d5SMarshall Clow { 27809d67c6d5SMarshall Clow _Tp __prev = *__first++; 27819d67c6d5SMarshall Clow if (__comp(__prev, *__first)) { 27829d67c6d5SMarshall Clow if (__comp(__prev, __result.first)) __result.first = __prev; 27839d67c6d5SMarshall Clow if (__comp(__result.second, *__first)) __result.second = *__first; 27849d67c6d5SMarshall Clow } 27859d67c6d5SMarshall Clow else { 27869d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) __result.first = *__first; 27879d67c6d5SMarshall Clow if (__comp(__result.second, __prev)) __result.second = __prev; 27889d67c6d5SMarshall Clow } 27899d67c6d5SMarshall Clow 27909d67c6d5SMarshall Clow __first++; 27919d67c6d5SMarshall Clow } 27929d67c6d5SMarshall Clow return __result; 27939d67c6d5SMarshall Clow} 27949d67c6d5SMarshall Clow 27959d67c6d5SMarshall Clowtemplate<class _Tp> 27969d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27979d67c6d5SMarshall Clowpair<_Tp, _Tp> 27989d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 27999d67c6d5SMarshall Clow{ 28009d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28014eb27b79SHoward Hinnant} 28024eb27b79SHoward Hinnant 280354976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 280454976f26SHoward Hinnant 28053e519524SHoward Hinnant// random_shuffle 28063e519524SHoward Hinnant 2807f9d540b0SHoward Hinnant// __independent_bits_engine 2808f9d540b0SHoward Hinnant 2809c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2810f9d540b0SHoward Hinnantstruct __log2_imp 28113e519524SHoward Hinnant{ 2812c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2813c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28143e519524SHoward Hinnant}; 28153e519524SHoward Hinnant 2816c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2817c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28183e519524SHoward Hinnant{ 2819f9d540b0SHoward Hinnant static const size_t value = 0; 28203e519524SHoward Hinnant}; 28213e519524SHoward Hinnant 2822c003db1fSHoward Hinnanttemplate <size_t _Rp> 2823c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28243e519524SHoward Hinnant{ 2825c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28263e519524SHoward Hinnant}; 28273e519524SHoward Hinnant 2828c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2829f9d540b0SHoward Hinnantstruct __log2 28303e519524SHoward Hinnant{ 2831c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2832f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28333e519524SHoward Hinnant}; 28343e519524SHoward Hinnant 2835f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2836f9d540b0SHoward Hinnantclass __independent_bits_engine 28373e519524SHoward Hinnant{ 2838f9d540b0SHoward Hinnantpublic: 2839f9d540b0SHoward Hinnant // types 2840f9d540b0SHoward Hinnant typedef _UIntType result_type; 2841f9d540b0SHoward Hinnant 2842f9d540b0SHoward Hinnantprivate: 2843f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2844f9d540b0SHoward Hinnant typedef typename conditional 2845f9d540b0SHoward Hinnant < 2846f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2847f9d540b0SHoward Hinnant result_type, 2848f9d540b0SHoward Hinnant _Engine_result_type 2849f9d540b0SHoward Hinnant >::type _Working_result_type; 2850f9d540b0SHoward Hinnant 2851f9d540b0SHoward Hinnant _Engine& __e_; 2852f9d540b0SHoward Hinnant size_t __w_; 2853f9d540b0SHoward Hinnant size_t __w0_; 2854f9d540b0SHoward Hinnant size_t __n_; 2855f9d540b0SHoward Hinnant size_t __n0_; 2856f9d540b0SHoward Hinnant _Working_result_type __y0_; 2857f9d540b0SHoward Hinnant _Working_result_type __y1_; 2858f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2859f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2860f9d540b0SHoward Hinnant 2861e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2862c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2863f9d540b0SHoward Hinnant + _Working_result_type(1); 2864e386b7b3SHoward Hinnant#else 2865e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2866e386b7b3SHoward Hinnant + _Working_result_type(1); 2867e386b7b3SHoward Hinnant#endif 2868e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2869e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2870e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2871f9d540b0SHoward Hinnant 2872f9d540b0SHoward Hinnantpublic: 2873f9d540b0SHoward Hinnant // constructors and seeding functions 2874f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2875f9d540b0SHoward Hinnant 2876f9d540b0SHoward Hinnant // generating functions 2877c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2878f9d540b0SHoward Hinnant 2879f9d540b0SHoward Hinnantprivate: 2880f9d540b0SHoward Hinnant result_type __eval(false_type); 2881f9d540b0SHoward Hinnant result_type __eval(true_type); 2882f9d540b0SHoward Hinnant}; 2883f9d540b0SHoward Hinnant 2884f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2885f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2886f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2887f9d540b0SHoward Hinnant : __e_(__e), 2888f9d540b0SHoward Hinnant __w_(__w) 2889f9d540b0SHoward Hinnant{ 2890f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2891f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2892c003db1fSHoward Hinnant if (_Rp == 0) 2893c003db1fSHoward Hinnant __y0_ = _Rp; 2894f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2895c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2896f9d540b0SHoward Hinnant else 2897f9d540b0SHoward Hinnant __y0_ = 0; 2898c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2899f9d540b0SHoward Hinnant { 2900f9d540b0SHoward Hinnant ++__n_; 2901f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2902f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2903c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2904f9d540b0SHoward Hinnant else 2905f9d540b0SHoward Hinnant __y0_ = 0; 2906f9d540b0SHoward Hinnant } 2907f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2908f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2909c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2910f9d540b0SHoward Hinnant else 2911f9d540b0SHoward Hinnant __y1_ = 0; 2912f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2913f9d540b0SHoward Hinnant _Engine_result_type(0); 2914f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2915f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2916f9d540b0SHoward Hinnant _Engine_result_type(~0); 29173e519524SHoward Hinnant} 29183e519524SHoward Hinnant 2919f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2920f9d540b0SHoward Hinnantinline 2921f9d540b0SHoward Hinnant_UIntType 2922f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29233e519524SHoward Hinnant{ 2924f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29253e519524SHoward Hinnant} 29263e519524SHoward Hinnant 2927f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2928f9d540b0SHoward Hinnant_UIntType 2929f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29303e519524SHoward Hinnant{ 2931c003db1fSHoward Hinnant result_type _Sp = 0; 2932f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2933f9d540b0SHoward Hinnant { 2934f9d540b0SHoward Hinnant _Engine_result_type __u; 29353e519524SHoward Hinnant do 2936f9d540b0SHoward Hinnant { 2937f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2938f9d540b0SHoward Hinnant } while (__u >= __y0_); 29390176bc6cSHoward Hinnant if (__w0_ < _WDt) 2940c003db1fSHoward Hinnant _Sp <<= __w0_; 2941f9d540b0SHoward Hinnant else 2942c003db1fSHoward Hinnant _Sp = 0; 2943c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2944f9d540b0SHoward Hinnant } 2945f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2946f9d540b0SHoward Hinnant { 2947f9d540b0SHoward Hinnant _Engine_result_type __u; 2948f9d540b0SHoward Hinnant do 2949f9d540b0SHoward Hinnant { 2950f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2951f9d540b0SHoward Hinnant } while (__u >= __y1_); 29520176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2953c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2954f9d540b0SHoward Hinnant else 2955c003db1fSHoward Hinnant _Sp = 0; 2956c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2957f9d540b0SHoward Hinnant } 2958c003db1fSHoward Hinnant return _Sp; 29593e519524SHoward Hinnant} 29603e519524SHoward Hinnant 2961f9d540b0SHoward Hinnant// uniform_int_distribution 29623e519524SHoward Hinnant 2963f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2964f9d540b0SHoward Hinnantclass uniform_int_distribution 29653e519524SHoward Hinnant{ 2966f9d540b0SHoward Hinnantpublic: 2967f9d540b0SHoward Hinnant // types 2968f9d540b0SHoward Hinnant typedef _IntType result_type; 2969f9d540b0SHoward Hinnant 2970f9d540b0SHoward Hinnant class param_type 2971f9d540b0SHoward Hinnant { 2972f9d540b0SHoward Hinnant result_type __a_; 2973f9d540b0SHoward Hinnant result_type __b_; 2974f9d540b0SHoward Hinnant public: 2975f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2976f9d540b0SHoward Hinnant 2977f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2978f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2979f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2980f9d540b0SHoward Hinnant 2981f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2982f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2983f9d540b0SHoward Hinnant 2984f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2985f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2986f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2987f9d540b0SHoward Hinnant {return !(__x == __y);} 29883e519524SHoward Hinnant }; 29893e519524SHoward Hinnant 2990f9d540b0SHoward Hinnantprivate: 2991f9d540b0SHoward Hinnant param_type __p_; 29923e519524SHoward Hinnant 2993f9d540b0SHoward Hinnantpublic: 2994f9d540b0SHoward Hinnant // constructors and reset functions 2995f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2996f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2997f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2998f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 2999f9d540b0SHoward Hinnant void reset() {} 3000f9d540b0SHoward Hinnant 3001f9d540b0SHoward Hinnant // generating functions 3002f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3003f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3004f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3005f9d540b0SHoward Hinnant 3006f9d540b0SHoward Hinnant // property functions 3007f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3008f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3009f9d540b0SHoward Hinnant 3010f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3011f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3012f9d540b0SHoward Hinnant 3013f9d540b0SHoward Hinnant result_type min() const {return a();} 3014f9d540b0SHoward Hinnant result_type max() const {return b();} 3015f9d540b0SHoward Hinnant 3016f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3017f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3018f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3019f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3020f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3021f9d540b0SHoward Hinnant {return !(__x == __y);} 30223e519524SHoward Hinnant}; 30233e519524SHoward Hinnant 3024f9d540b0SHoward Hinnanttemplate<class _IntType> 3025f9d540b0SHoward Hinnanttemplate<class _URNG> 3026f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3027f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30283e519524SHoward Hinnant{ 3029f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3030f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3031c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3032c003db1fSHoward Hinnant if (_Rp == 1) 3033f9d540b0SHoward Hinnant return __p.a(); 3034f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3035f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3036c003db1fSHoward Hinnant if (_Rp == 0) 3037f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3038c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3039c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 3040f9d540b0SHoward Hinnant ++__w; 3041f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3042f9d540b0SHoward Hinnant _UIntType __u; 3043f9d540b0SHoward Hinnant do 30443e519524SHoward Hinnant { 3045f9d540b0SHoward Hinnant __u = __e(); 3046c003db1fSHoward Hinnant } while (__u >= _Rp); 3047f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30483e519524SHoward Hinnant} 3049f9d540b0SHoward Hinnant 3050f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3051f9d540b0SHoward Hinnant 3052f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3053f9d540b0SHoward Hinnant 3054f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30553e519524SHoward Hinnant{ 3056f9d540b0SHoward Hinnant static unsigned __c_; 3057f9d540b0SHoward Hinnant 3058f9d540b0SHoward Hinnant __rs_default(); 3059f9d540b0SHoward Hinnantpublic: 3060b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3061f9d540b0SHoward Hinnant 3062f9d540b0SHoward Hinnant static const result_type _Min = 0; 3063f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3064f9d540b0SHoward Hinnant 3065f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3066f9d540b0SHoward Hinnant ~__rs_default(); 3067f9d540b0SHoward Hinnant 3068f9d540b0SHoward Hinnant result_type operator()(); 3069f9d540b0SHoward Hinnant 3070788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3071788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3072f9d540b0SHoward Hinnant 3073f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3074f9d540b0SHoward Hinnant}; 3075f9d540b0SHoward Hinnant 3076f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30773e519524SHoward Hinnant 30783e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30793e519524SHoward Hinnantvoid 30803e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30813e519524SHoward Hinnant{ 30823e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3083c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3084c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30853e519524SHoward Hinnant difference_type __d = __last - __first; 30863e519524SHoward Hinnant if (__d > 1) 30873e519524SHoward Hinnant { 3088c003db1fSHoward Hinnant _Dp __uid; 3089f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3090f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3091007b26beSHoward Hinnant { 3092c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3093007b26beSHoward Hinnant if (__i != difference_type(0)) 3094007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3095007b26beSHoward Hinnant } 30963e519524SHoward Hinnant } 30973e519524SHoward Hinnant} 30983e519524SHoward Hinnant 30993e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31003e519524SHoward Hinnantvoid 31013e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 31027609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 31033e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31043e519524SHoward Hinnant#else 31053e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31063e519524SHoward Hinnant#endif 31073e519524SHoward Hinnant{ 31083e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31093e519524SHoward Hinnant difference_type __d = __last - __first; 31103e519524SHoward Hinnant if (__d > 1) 31113e519524SHoward Hinnant { 31123e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3113007b26beSHoward Hinnant { 3114007b26beSHoward Hinnant difference_type __i = __rand(__d); 3115007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3116007b26beSHoward Hinnant } 31173e519524SHoward Hinnant } 31183e519524SHoward Hinnant} 31193e519524SHoward Hinnant 3120f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3121f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3122fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3123fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3124fb340102SHoward Hinnant#else 3125f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3126fb340102SHoward Hinnant#endif 3127f9d540b0SHoward Hinnant{ 3128f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3129c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3130c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3131f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3132f9d540b0SHoward Hinnant if (__d > 1) 3133f9d540b0SHoward Hinnant { 3134c003db1fSHoward Hinnant _Dp __uid; 3135f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3136007b26beSHoward Hinnant { 3137c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3138007b26beSHoward Hinnant if (__i != difference_type(0)) 3139007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3140007b26beSHoward Hinnant } 3141f9d540b0SHoward Hinnant } 3142f9d540b0SHoward Hinnant} 3143f9d540b0SHoward Hinnant 31443e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31453e519524SHoward Hinnantbool 31463e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31473e519524SHoward Hinnant{ 31483e519524SHoward Hinnant for (; __first != __last; ++__first) 31493e519524SHoward Hinnant if (!__pred(*__first)) 31503e519524SHoward Hinnant break; 31513e519524SHoward Hinnant for (; __first != __last; ++__first) 31523e519524SHoward Hinnant if (__pred(*__first)) 31533e519524SHoward Hinnant return false; 31543e519524SHoward Hinnant return true; 31553e519524SHoward Hinnant} 31563e519524SHoward Hinnant 31573e519524SHoward Hinnant// partition 31583e519524SHoward Hinnant 31593e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31603e519524SHoward Hinnant_ForwardIterator 31613e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31623e519524SHoward Hinnant{ 31633e519524SHoward Hinnant while (true) 31643e519524SHoward Hinnant { 31653e519524SHoward Hinnant if (__first == __last) 31663e519524SHoward Hinnant return __first; 31673e519524SHoward Hinnant if (!__pred(*__first)) 31683e519524SHoward Hinnant break; 31693e519524SHoward Hinnant ++__first; 31703e519524SHoward Hinnant } 31713e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31723e519524SHoward Hinnant { 31733e519524SHoward Hinnant if (__pred(*__p)) 31743e519524SHoward Hinnant { 31753e519524SHoward Hinnant swap(*__first, *__p); 31763e519524SHoward Hinnant ++__first; 31773e519524SHoward Hinnant } 31783e519524SHoward Hinnant } 31793e519524SHoward Hinnant return __first; 31803e519524SHoward Hinnant} 31813e519524SHoward Hinnant 31823e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31833e519524SHoward Hinnant_BidirectionalIterator 31843e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31853e519524SHoward Hinnant bidirectional_iterator_tag) 31863e519524SHoward Hinnant{ 31873e519524SHoward Hinnant while (true) 31883e519524SHoward Hinnant { 31893e519524SHoward Hinnant while (true) 31903e519524SHoward Hinnant { 31913e519524SHoward Hinnant if (__first == __last) 31923e519524SHoward Hinnant return __first; 31933e519524SHoward Hinnant if (!__pred(*__first)) 31943e519524SHoward Hinnant break; 31953e519524SHoward Hinnant ++__first; 31963e519524SHoward Hinnant } 31973e519524SHoward Hinnant do 31983e519524SHoward Hinnant { 31993e519524SHoward Hinnant if (__first == --__last) 32003e519524SHoward Hinnant return __first; 32013e519524SHoward Hinnant } while (!__pred(*__last)); 32023e519524SHoward Hinnant swap(*__first, *__last); 32033e519524SHoward Hinnant ++__first; 32043e519524SHoward Hinnant } 32053e519524SHoward Hinnant} 32063e519524SHoward Hinnant 32073e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32093e519524SHoward Hinnant_ForwardIterator 32103e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32113e519524SHoward Hinnant{ 3212ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32133e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32143e519524SHoward Hinnant} 32153e519524SHoward Hinnant 32163e519524SHoward Hinnant// partition_copy 32173e519524SHoward Hinnant 32183e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32193e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32203e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32213e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32223e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32233e519524SHoward Hinnant _Predicate __pred) 32243e519524SHoward Hinnant{ 32253e519524SHoward Hinnant for (; __first != __last; ++__first) 32263e519524SHoward Hinnant { 32273e519524SHoward Hinnant if (__pred(*__first)) 32283e519524SHoward Hinnant { 32293e519524SHoward Hinnant *__out_true = *__first; 32303e519524SHoward Hinnant ++__out_true; 32313e519524SHoward Hinnant } 32323e519524SHoward Hinnant else 32333e519524SHoward Hinnant { 32343e519524SHoward Hinnant *__out_false = *__first; 32353e519524SHoward Hinnant ++__out_false; 32363e519524SHoward Hinnant } 32373e519524SHoward Hinnant } 32383e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32393e519524SHoward Hinnant} 32403e519524SHoward Hinnant 32413e519524SHoward Hinnant// partition_point 32423e519524SHoward Hinnant 32433e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32443e519524SHoward Hinnant_ForwardIterator 32453e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32463e519524SHoward Hinnant{ 32473e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3248ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32493e519524SHoward Hinnant while (__len != 0) 32503e519524SHoward Hinnant { 32513e519524SHoward Hinnant difference_type __l2 = __len / 2; 32523e519524SHoward Hinnant _ForwardIterator __m = __first; 3253ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32543e519524SHoward Hinnant if (__pred(*__m)) 32553e519524SHoward Hinnant { 32563e519524SHoward Hinnant __first = ++__m; 32573e519524SHoward Hinnant __len -= __l2 + 1; 32583e519524SHoward Hinnant } 32593e519524SHoward Hinnant else 32603e519524SHoward Hinnant __len = __l2; 32613e519524SHoward Hinnant } 32623e519524SHoward Hinnant return __first; 32633e519524SHoward Hinnant} 32643e519524SHoward Hinnant 32653e519524SHoward Hinnant// stable_partition 32663e519524SHoward Hinnant 32673e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32683e519524SHoward Hinnant_ForwardIterator 32693e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32703e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32713e519524SHoward Hinnant{ 32723e519524SHoward Hinnant // *__first is known to be false 32733e519524SHoward Hinnant // __len >= 1 32743e519524SHoward Hinnant if (__len == 1) 32753e519524SHoward Hinnant return __first; 32763e519524SHoward Hinnant if (__len == 2) 32773e519524SHoward Hinnant { 32783e519524SHoward Hinnant _ForwardIterator __m = __first; 32793e519524SHoward Hinnant if (__pred(*++__m)) 32803e519524SHoward Hinnant { 32813e519524SHoward Hinnant swap(*__first, *__m); 32823e519524SHoward Hinnant return __m; 32833e519524SHoward Hinnant } 32843e519524SHoward Hinnant return __first; 32853e519524SHoward Hinnant } 32863e519524SHoward Hinnant if (__len <= __p.second) 32873e519524SHoward Hinnant { // The buffer is big enough to use 32883e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32893e519524SHoward Hinnant __destruct_n __d(0); 32903e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32913e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32923e519524SHoward Hinnant // Update __first to always point to the end of the trues 32933e519524SHoward Hinnant value_type* __t = __p.first; 3294ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32953e519524SHoward Hinnant __d.__incr((value_type*)0); 32963e519524SHoward Hinnant ++__t; 32973e519524SHoward Hinnant _ForwardIterator __i = __first; 32983e519524SHoward Hinnant while (++__i != __last) 32993e519524SHoward Hinnant { 33003e519524SHoward Hinnant if (__pred(*__i)) 33013e519524SHoward Hinnant { 3302ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33033e519524SHoward Hinnant ++__first; 33043e519524SHoward Hinnant } 33053e519524SHoward Hinnant else 33063e519524SHoward Hinnant { 3307ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33083e519524SHoward Hinnant __d.__incr((value_type*)0); 33093e519524SHoward Hinnant ++__t; 33103e519524SHoward Hinnant } 33113e519524SHoward Hinnant } 33123e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33133e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33143e519524SHoward Hinnant __i = __first; 33153e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3316ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33173e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33183e519524SHoward Hinnant return __first; 33193e519524SHoward Hinnant } 33203e519524SHoward Hinnant // Else not enough buffer, do in place 33213e519524SHoward Hinnant // __len >= 3 33223e519524SHoward Hinnant _ForwardIterator __m = __first; 33233e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3324ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33253e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33263e519524SHoward Hinnant // F????????????????? 33273e519524SHoward Hinnant // f m l 33283e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33293e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33303e519524SHoward Hinnant // TTTFFFFF?????????? 33313e519524SHoward Hinnant // f ff m l 33323e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33333e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33343e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33353e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33363e519524SHoward Hinnant while (__pred(*__m1)) 33373e519524SHoward Hinnant { 33383e519524SHoward Hinnant if (++__m1 == __last) 33393e519524SHoward Hinnant goto __second_half_done; 33403e519524SHoward Hinnant --__len_half; 33413e519524SHoward Hinnant } 33423e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33433e519524SHoward Hinnant // f ff m m1 l 33443e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33453e519524SHoward Hinnant__second_half_done: 33463e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33473e519524SHoward Hinnant // f ff m sf l 3348ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33493e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33503e519524SHoward Hinnant // | 33513e519524SHoward Hinnant} 33523e519524SHoward Hinnant 33533e519524SHoward Hinnantstruct __return_temporary_buffer 33543e519524SHoward Hinnant{ 33553e519524SHoward Hinnant template <class _Tp> 3356ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33573e519524SHoward Hinnant}; 33583e519524SHoward Hinnant 33593e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33603e519524SHoward Hinnant_ForwardIterator 33613e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33623e519524SHoward Hinnant forward_iterator_tag) 33633e519524SHoward Hinnant{ 33643e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33653e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33663e519524SHoward Hinnant while (true) 33673e519524SHoward Hinnant { 33683e519524SHoward Hinnant if (__first == __last) 33693e519524SHoward Hinnant return __first; 33703e519524SHoward Hinnant if (!__pred(*__first)) 33713e519524SHoward Hinnant break; 33723e519524SHoward Hinnant ++__first; 33733e519524SHoward Hinnant } 33743e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33753e519524SHoward Hinnant // *__first is known to be false 33763e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33773e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3378ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33793e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33803e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33813e519524SHoward Hinnant if (__len >= __alloc_limit) 33823e519524SHoward Hinnant { 3383ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33843e519524SHoward Hinnant __h.reset(__p.first); 33853e519524SHoward Hinnant } 33863e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33873e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33883e519524SHoward Hinnant} 33893e519524SHoward Hinnant 33903e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33913e519524SHoward Hinnant_BidirectionalIterator 33923e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33933e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33943e519524SHoward Hinnant{ 33953e519524SHoward Hinnant // *__first is known to be false 33963e519524SHoward Hinnant // *__last is known to be true 33973e519524SHoward Hinnant // __len >= 2 33983e519524SHoward Hinnant if (__len == 2) 33993e519524SHoward Hinnant { 34003e519524SHoward Hinnant swap(*__first, *__last); 34013e519524SHoward Hinnant return __last; 34023e519524SHoward Hinnant } 34033e519524SHoward Hinnant if (__len == 3) 34043e519524SHoward Hinnant { 34053e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34063e519524SHoward Hinnant if (__pred(*++__m)) 34073e519524SHoward Hinnant { 34083e519524SHoward Hinnant swap(*__first, *__m); 34093e519524SHoward Hinnant swap(*__m, *__last); 34103e519524SHoward Hinnant return __last; 34113e519524SHoward Hinnant } 34123e519524SHoward Hinnant swap(*__m, *__last); 34133e519524SHoward Hinnant swap(*__first, *__m); 34143e519524SHoward Hinnant return __m; 34153e519524SHoward Hinnant } 34163e519524SHoward Hinnant if (__len <= __p.second) 34173e519524SHoward Hinnant { // The buffer is big enough to use 34183e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34193e519524SHoward Hinnant __destruct_n __d(0); 34203e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34213e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34223e519524SHoward Hinnant // Update __first to always point to the end of the trues 34233e519524SHoward Hinnant value_type* __t = __p.first; 3424ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34253e519524SHoward Hinnant __d.__incr((value_type*)0); 34263e519524SHoward Hinnant ++__t; 34273e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34283e519524SHoward Hinnant while (++__i != __last) 34293e519524SHoward Hinnant { 34303e519524SHoward Hinnant if (__pred(*__i)) 34313e519524SHoward Hinnant { 3432ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34333e519524SHoward Hinnant ++__first; 34343e519524SHoward Hinnant } 34353e519524SHoward Hinnant else 34363e519524SHoward Hinnant { 3437ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34383e519524SHoward Hinnant __d.__incr((value_type*)0); 34393e519524SHoward Hinnant ++__t; 34403e519524SHoward Hinnant } 34413e519524SHoward Hinnant } 34423e519524SHoward Hinnant // move *__last, known to be true 3443ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34443e519524SHoward Hinnant __i = ++__first; 34453e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34463e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34473e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3448ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34493e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34503e519524SHoward Hinnant return __first; 34513e519524SHoward Hinnant } 34523e519524SHoward Hinnant // Else not enough buffer, do in place 34533e519524SHoward Hinnant // __len >= 4 34543e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34553e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3456ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34573e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34583e519524SHoward Hinnant // F????????????????T 34593e519524SHoward Hinnant // f m l 34603e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34613e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34623e519524SHoward Hinnant _Distance __len_half = __len2; 34633e519524SHoward Hinnant while (!__pred(*--__m1)) 34643e519524SHoward Hinnant { 34653e519524SHoward Hinnant if (__m1 == __first) 34663e519524SHoward Hinnant goto __first_half_done; 34673e519524SHoward Hinnant --__len_half; 34683e519524SHoward Hinnant } 34693e519524SHoward Hinnant // F???TFFF?????????T 34703e519524SHoward Hinnant // f m1 m l 34713e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34723e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34733e519524SHoward Hinnant__first_half_done: 34743e519524SHoward Hinnant // TTTFFFFF?????????T 34753e519524SHoward Hinnant // f ff m l 34763e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34773e519524SHoward Hinnant __m1 = __m; 34783e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34793e519524SHoward Hinnant ++__second_false; 34803e519524SHoward Hinnant __len_half = __len - __len2; 34813e519524SHoward Hinnant while (__pred(*__m1)) 34823e519524SHoward Hinnant { 34833e519524SHoward Hinnant if (++__m1 == __last) 34843e519524SHoward Hinnant goto __second_half_done; 34853e519524SHoward Hinnant --__len_half; 34863e519524SHoward Hinnant } 34873e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34883e519524SHoward Hinnant // f ff m m1 l 34893e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34903e519524SHoward Hinnant__second_half_done: 34913e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34923e519524SHoward Hinnant // f ff m sf l 3493ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34943e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34953e519524SHoward Hinnant // | 34963e519524SHoward Hinnant} 34973e519524SHoward Hinnant 34983e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 34993e519524SHoward Hinnant_BidirectionalIterator 35003e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35013e519524SHoward Hinnant bidirectional_iterator_tag) 35023e519524SHoward Hinnant{ 35033e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35043e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35053e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35063e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35073e519524SHoward Hinnant while (true) 35083e519524SHoward Hinnant { 35093e519524SHoward Hinnant if (__first == __last) 35103e519524SHoward Hinnant return __first; 35113e519524SHoward Hinnant if (!__pred(*__first)) 35123e519524SHoward Hinnant break; 35133e519524SHoward Hinnant ++__first; 35143e519524SHoward Hinnant } 35153e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35163e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35173e519524SHoward Hinnant do 35183e519524SHoward Hinnant { 35193e519524SHoward Hinnant if (__first == --__last) 35203e519524SHoward Hinnant return __first; 35213e519524SHoward Hinnant } while (!__pred(*__last)); 35223e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35233e519524SHoward Hinnant // *__first is known to be false 35243e519524SHoward Hinnant // *__last is known to be true 35253e519524SHoward Hinnant // __len >= 2 3526ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35273e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35283e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35293e519524SHoward Hinnant if (__len >= __alloc_limit) 35303e519524SHoward Hinnant { 3531ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35323e519524SHoward Hinnant __h.reset(__p.first); 35333e519524SHoward Hinnant } 35343e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35353e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35363e519524SHoward Hinnant} 35373e519524SHoward Hinnant 35383e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35403e519524SHoward Hinnant_ForwardIterator 35413e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35423e519524SHoward Hinnant{ 35433e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35443e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35453e519524SHoward Hinnant} 35463e519524SHoward Hinnant 35473e519524SHoward Hinnant// is_sorted_until 35483e519524SHoward Hinnant 35493e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35503e519524SHoward Hinnant_ForwardIterator 35513e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35523e519524SHoward Hinnant{ 35533e519524SHoward Hinnant if (__first != __last) 35543e519524SHoward Hinnant { 35553e519524SHoward Hinnant _ForwardIterator __i = __first; 35563e519524SHoward Hinnant while (++__i != __last) 35573e519524SHoward Hinnant { 35583e519524SHoward Hinnant if (__comp(*__i, *__first)) 35593e519524SHoward Hinnant return __i; 35603e519524SHoward Hinnant __first = __i; 35613e519524SHoward Hinnant } 35623e519524SHoward Hinnant } 35633e519524SHoward Hinnant return __last; 35643e519524SHoward Hinnant} 35653e519524SHoward Hinnant 35663e519524SHoward Hinnanttemplate<class _ForwardIterator> 35673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35683e519524SHoward Hinnant_ForwardIterator 35693e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35703e519524SHoward Hinnant{ 3571ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35723e519524SHoward Hinnant} 35733e519524SHoward Hinnant 35743e519524SHoward Hinnant// is_sorted 35753e519524SHoward Hinnant 35763e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35773e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35783e519524SHoward Hinnantbool 35793e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35803e519524SHoward Hinnant{ 3581ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35823e519524SHoward Hinnant} 35833e519524SHoward Hinnant 35843e519524SHoward Hinnanttemplate<class _ForwardIterator> 35853e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35863e519524SHoward Hinnantbool 35873e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35883e519524SHoward Hinnant{ 3589ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35903e519524SHoward Hinnant} 35913e519524SHoward Hinnant 35923e519524SHoward Hinnant// sort 35933e519524SHoward Hinnant 35943e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35953e519524SHoward Hinnant 35963e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 35973e519524SHoward Hinnantunsigned 35983e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 35993e519524SHoward Hinnant{ 36003e519524SHoward Hinnant unsigned __r = 0; 36013e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36023e519524SHoward Hinnant { 36033e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36043e519524SHoward Hinnant return __r; // x <= y && y <= z 36053e519524SHoward Hinnant // x <= y && y > z 36063e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36073e519524SHoward Hinnant __r = 1; 36083e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36093e519524SHoward Hinnant { 36103e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36113e519524SHoward Hinnant __r = 2; 36123e519524SHoward Hinnant } 36133e519524SHoward Hinnant return __r; // x <= y && y < z 36143e519524SHoward Hinnant } 36153e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36163e519524SHoward Hinnant { 36173e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36183e519524SHoward Hinnant __r = 1; 36193e519524SHoward Hinnant return __r; 36203e519524SHoward Hinnant } 36213e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36223e519524SHoward Hinnant __r = 1; // x < y && x <= z 36233e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36243e519524SHoward Hinnant { 36253e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36263e519524SHoward Hinnant __r = 2; 36273e519524SHoward Hinnant } 36283e519524SHoward Hinnant return __r; 36293e519524SHoward Hinnant} // x <= y && y <= z 36303e519524SHoward Hinnant 36313e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36323e519524SHoward Hinnant 36333e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36343e519524SHoward Hinnantunsigned 36353e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36363e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36373e519524SHoward Hinnant{ 36383e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36393e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36403e519524SHoward Hinnant { 36413e519524SHoward Hinnant swap(*__x3, *__x4); 36423e519524SHoward Hinnant ++__r; 36433e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant swap(*__x2, *__x3); 36463e519524SHoward Hinnant ++__r; 36473e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36483e519524SHoward Hinnant { 36493e519524SHoward Hinnant swap(*__x1, *__x2); 36503e519524SHoward Hinnant ++__r; 36513e519524SHoward Hinnant } 36523e519524SHoward Hinnant } 36533e519524SHoward Hinnant } 36543e519524SHoward Hinnant return __r; 36553e519524SHoward Hinnant} 36563e519524SHoward Hinnant 36573e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36583e519524SHoward Hinnant 36593e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36603e519524SHoward Hinnantunsigned 36613e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36623e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36633e519524SHoward Hinnant{ 36643e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36653e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36663e519524SHoward Hinnant { 36673e519524SHoward Hinnant swap(*__x4, *__x5); 36683e519524SHoward Hinnant ++__r; 36693e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36703e519524SHoward Hinnant { 36713e519524SHoward Hinnant swap(*__x3, *__x4); 36723e519524SHoward Hinnant ++__r; 36733e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36743e519524SHoward Hinnant { 36753e519524SHoward Hinnant swap(*__x2, *__x3); 36763e519524SHoward Hinnant ++__r; 36773e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36783e519524SHoward Hinnant { 36793e519524SHoward Hinnant swap(*__x1, *__x2); 36803e519524SHoward Hinnant ++__r; 36813e519524SHoward Hinnant } 36823e519524SHoward Hinnant } 36833e519524SHoward Hinnant } 36843e519524SHoward Hinnant } 36853e519524SHoward Hinnant return __r; 36863e519524SHoward Hinnant} 36873e519524SHoward Hinnant 36883e519524SHoward Hinnant// Assumes size > 0 36893e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36903e519524SHoward Hinnantvoid 36913e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36923e519524SHoward Hinnant{ 36933e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36943e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36953e519524SHoward Hinnant { 3696ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 36973e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 36983e519524SHoward Hinnant (__first, __last, __comp); 36993e519524SHoward Hinnant if (__i != __first) 37003e519524SHoward Hinnant swap(*__first, *__i); 37013e519524SHoward Hinnant } 37023e519524SHoward Hinnant} 37033e519524SHoward Hinnant 37043e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37053e519524SHoward Hinnantvoid 37063e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37073e519524SHoward Hinnant{ 37083e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37093e519524SHoward Hinnant if (__first != __last) 37103e519524SHoward Hinnant { 37113e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37123e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37133e519524SHoward Hinnant { 37143e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3715ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37163e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3717ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3718ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37193e519524SHoward Hinnant } 37203e519524SHoward Hinnant } 37213e519524SHoward Hinnant} 37223e519524SHoward Hinnant 37233e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37243e519524SHoward Hinnantvoid 37253e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37263e519524SHoward Hinnant{ 37273e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37283e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37293e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37303e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37313e519524SHoward Hinnant { 37323e519524SHoward Hinnant if (__comp(*__i, *__j)) 37333e519524SHoward Hinnant { 3734ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37353e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37363e519524SHoward Hinnant __j = __i; 37373e519524SHoward Hinnant do 37383e519524SHoward Hinnant { 3739ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37403e519524SHoward Hinnant __j = __k; 37413e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3742ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37433e519524SHoward Hinnant } 37443e519524SHoward Hinnant __j = __i; 37453e519524SHoward Hinnant } 37463e519524SHoward Hinnant} 37473e519524SHoward Hinnant 37483e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37493e519524SHoward Hinnantbool 37503e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37513e519524SHoward Hinnant{ 37523e519524SHoward Hinnant switch (__last - __first) 37533e519524SHoward Hinnant { 37543e519524SHoward Hinnant case 0: 37553e519524SHoward Hinnant case 1: 37563e519524SHoward Hinnant return true; 37573e519524SHoward Hinnant case 2: 37583e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37593e519524SHoward Hinnant swap(*__first, *__last); 37603e519524SHoward Hinnant return true; 37613e519524SHoward Hinnant case 3: 3762ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37633e519524SHoward Hinnant return true; 37643e519524SHoward Hinnant case 4: 3765ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37663e519524SHoward Hinnant return true; 37673e519524SHoward Hinnant case 5: 3768ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37693e519524SHoward Hinnant return true; 37703e519524SHoward Hinnant } 37713e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37723e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37733e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37743e519524SHoward Hinnant const unsigned __limit = 8; 37753e519524SHoward Hinnant unsigned __count = 0; 37763e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37773e519524SHoward Hinnant { 37783e519524SHoward Hinnant if (__comp(*__i, *__j)) 37793e519524SHoward Hinnant { 3780ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37813e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37823e519524SHoward Hinnant __j = __i; 37833e519524SHoward Hinnant do 37843e519524SHoward Hinnant { 3785ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37863e519524SHoward Hinnant __j = __k; 37873e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3788ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37893e519524SHoward Hinnant if (++__count == __limit) 37903e519524SHoward Hinnant return ++__i == __last; 37913e519524SHoward Hinnant } 37923e519524SHoward Hinnant __j = __i; 37933e519524SHoward Hinnant } 37943e519524SHoward Hinnant return true; 37953e519524SHoward Hinnant} 37963e519524SHoward Hinnant 37973e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37983e519524SHoward Hinnantvoid 37993e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38003e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38013e519524SHoward Hinnant{ 38023e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38033e519524SHoward Hinnant if (__first1 != __last1) 38043e519524SHoward Hinnant { 38053e519524SHoward Hinnant __destruct_n __d(0); 38063e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38073e519524SHoward Hinnant value_type* __last2 = __first2; 3808ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38093e519524SHoward Hinnant __d.__incr((value_type*)0); 38103e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38113e519524SHoward Hinnant { 38123e519524SHoward Hinnant value_type* __j2 = __last2; 38133e519524SHoward Hinnant value_type* __i2 = __j2; 38143e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38153e519524SHoward Hinnant { 3816ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38173e519524SHoward Hinnant __d.__incr((value_type*)0); 38183e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3819ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3820ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38213e519524SHoward Hinnant } 38223e519524SHoward Hinnant else 38233e519524SHoward Hinnant { 3824ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38253e519524SHoward Hinnant __d.__incr((value_type*)0); 38263e519524SHoward Hinnant } 38273e519524SHoward Hinnant } 38283e519524SHoward Hinnant __h.release(); 38293e519524SHoward Hinnant } 38303e519524SHoward Hinnant} 38313e519524SHoward Hinnant 38323e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38333e519524SHoward Hinnantvoid 38343e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38353e519524SHoward Hinnant{ 38363e519524SHoward Hinnant // _Compare is known to be a reference type 38373e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38383e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3839ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3840ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38413e519524SHoward Hinnant while (true) 38423e519524SHoward Hinnant { 38433e519524SHoward Hinnant __restart: 38443e519524SHoward Hinnant difference_type __len = __last - __first; 38453e519524SHoward Hinnant switch (__len) 38463e519524SHoward Hinnant { 38473e519524SHoward Hinnant case 0: 38483e519524SHoward Hinnant case 1: 38493e519524SHoward Hinnant return; 38503e519524SHoward Hinnant case 2: 38513e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38523e519524SHoward Hinnant swap(*__first, *__last); 38533e519524SHoward Hinnant return; 38543e519524SHoward Hinnant case 3: 3855ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38563e519524SHoward Hinnant return; 38573e519524SHoward Hinnant case 4: 3858ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38593e519524SHoward Hinnant return; 38603e519524SHoward Hinnant case 5: 3861ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38623e519524SHoward Hinnant return; 38633e519524SHoward Hinnant } 38643e519524SHoward Hinnant if (__len <= __limit) 38653e519524SHoward Hinnant { 3866ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38673e519524SHoward Hinnant return; 38683e519524SHoward Hinnant } 38693e519524SHoward Hinnant // __len > 5 38703e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38713e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38723e519524SHoward Hinnant --__lm1; 38733e519524SHoward Hinnant unsigned __n_swaps; 38743e519524SHoward Hinnant { 38753e519524SHoward Hinnant difference_type __delta; 38763e519524SHoward Hinnant if (__len >= 1000) 38773e519524SHoward Hinnant { 38783e519524SHoward Hinnant __delta = __len/2; 38793e519524SHoward Hinnant __m += __delta; 38803e519524SHoward Hinnant __delta /= 2; 3881ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38823e519524SHoward Hinnant } 38833e519524SHoward Hinnant else 38843e519524SHoward Hinnant { 38853e519524SHoward Hinnant __delta = __len/2; 38863e519524SHoward Hinnant __m += __delta; 3887ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38883e519524SHoward Hinnant } 38893e519524SHoward Hinnant } 38903e519524SHoward Hinnant // *__m is median 38913e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38923e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38933e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38943e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38953e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 38963e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 38973e519524SHoward Hinnant // Prime the downward search with a guard. 38983e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 38993e519524SHoward Hinnant { 39003e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39013e519524SHoward Hinnant // manually guard downward moving __j against __i 39023e519524SHoward Hinnant while (true) 39033e519524SHoward Hinnant { 39043e519524SHoward Hinnant if (__i == --__j) 39053e519524SHoward Hinnant { 39063e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39073e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39083e519524SHoward Hinnant ++__i; // __first + 1 39093e519524SHoward Hinnant __j = __last; 39103e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39113e519524SHoward Hinnant { 39123e519524SHoward Hinnant while (true) 39133e519524SHoward Hinnant { 39143e519524SHoward Hinnant if (__i == __j) 39153e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39163e519524SHoward Hinnant if (__comp(*__first, *__i)) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant swap(*__i, *__j); 39193e519524SHoward Hinnant ++__n_swaps; 39203e519524SHoward Hinnant ++__i; 39213e519524SHoward Hinnant break; 39223e519524SHoward Hinnant } 39233e519524SHoward Hinnant ++__i; 39243e519524SHoward Hinnant } 39253e519524SHoward Hinnant } 39263e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39273e519524SHoward Hinnant if (__i == __j) 39283e519524SHoward Hinnant return; 39293e519524SHoward Hinnant while (true) 39303e519524SHoward Hinnant { 39313e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39323e519524SHoward Hinnant ++__i; 39333e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39343e519524SHoward Hinnant ; 39353e519524SHoward Hinnant if (__i >= __j) 39363e519524SHoward Hinnant break; 39373e519524SHoward Hinnant swap(*__i, *__j); 39383e519524SHoward Hinnant ++__n_swaps; 39393e519524SHoward Hinnant ++__i; 39403e519524SHoward Hinnant } 39413e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39423e519524SHoward Hinnant // The first part is sorted, sort the secod part 3943ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39443e519524SHoward Hinnant __first = __i; 39453e519524SHoward Hinnant goto __restart; 39463e519524SHoward Hinnant } 39473e519524SHoward Hinnant if (__comp(*__j, *__m)) 39483e519524SHoward Hinnant { 39493e519524SHoward Hinnant swap(*__i, *__j); 39503e519524SHoward Hinnant ++__n_swaps; 39513e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39523e519524SHoward Hinnant } 39533e519524SHoward Hinnant } 39543e519524SHoward Hinnant } 39553e519524SHoward Hinnant // It is known that *__i < *__m 39563e519524SHoward Hinnant ++__i; 39573e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39583e519524SHoward Hinnant // if not yet partitioned... 39593e519524SHoward Hinnant if (__i < __j) 39603e519524SHoward Hinnant { 39613e519524SHoward Hinnant // known that *(__i - 1) < *__m 39623e519524SHoward Hinnant // known that __i <= __m 39633e519524SHoward Hinnant while (true) 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant // __m still guards upward moving __i 39663e519524SHoward Hinnant while (__comp(*__i, *__m)) 39673e519524SHoward Hinnant ++__i; 39683e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39693e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39703e519524SHoward Hinnant ; 39713e519524SHoward Hinnant if (__i > __j) 39723e519524SHoward Hinnant break; 39733e519524SHoward Hinnant swap(*__i, *__j); 39743e519524SHoward Hinnant ++__n_swaps; 39753e519524SHoward Hinnant // It is known that __m != __j 39763e519524SHoward Hinnant // If __m just moved, follow it 39773e519524SHoward Hinnant if (__m == __i) 39783e519524SHoward Hinnant __m = __j; 39793e519524SHoward Hinnant ++__i; 39803e519524SHoward Hinnant } 39813e519524SHoward Hinnant } 39823e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39833e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39843e519524SHoward Hinnant { 39853e519524SHoward Hinnant swap(*__i, *__m); 39863e519524SHoward Hinnant ++__n_swaps; 39873e519524SHoward Hinnant } 39883e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39893e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39903e519524SHoward Hinnant if (__n_swaps == 0) 39913e519524SHoward Hinnant { 3992ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3993ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39943e519524SHoward Hinnant { 39953e519524SHoward Hinnant if (__fs) 39963e519524SHoward Hinnant return; 39973e519524SHoward Hinnant __last = __i; 39983e519524SHoward Hinnant continue; 39993e519524SHoward Hinnant } 40003e519524SHoward Hinnant else 40013e519524SHoward Hinnant { 40023e519524SHoward Hinnant if (__fs) 40033e519524SHoward Hinnant { 40043e519524SHoward Hinnant __first = ++__i; 40053e519524SHoward Hinnant continue; 40063e519524SHoward Hinnant } 40073e519524SHoward Hinnant } 40083e519524SHoward Hinnant } 40093e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40103e519524SHoward Hinnant if (__i - __first < __last - __i) 40113e519524SHoward Hinnant { 4012ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4013ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40143e519524SHoward Hinnant __first = ++__i; 40153e519524SHoward Hinnant } 40163e519524SHoward Hinnant else 40173e519524SHoward Hinnant { 4018ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4019ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40203e519524SHoward Hinnant __last = __i; 40213e519524SHoward Hinnant } 40223e519524SHoward Hinnant } 40233e519524SHoward Hinnant} 40243e519524SHoward Hinnant 40253e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40263e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40283e519524SHoward Hinnantvoid 40293e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40303e519524SHoward Hinnant{ 4031145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40323e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40333e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40343e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4035145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40363e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40373e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4038145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40393e519524SHoward Hinnant} 40403e519524SHoward Hinnant 40413e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40433e519524SHoward Hinnantvoid 40443e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40453e519524SHoward Hinnant{ 4046ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40473e519524SHoward Hinnant} 40483e519524SHoward Hinnant 40493e519524SHoward Hinnanttemplate <class _Tp> 40503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40513e519524SHoward Hinnantvoid 40523e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40533e519524SHoward Hinnant{ 4054ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40553e519524SHoward Hinnant} 40563e519524SHoward Hinnant 40573e519524SHoward Hinnanttemplate <class _Tp> 40583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40593e519524SHoward Hinnantvoid 40603e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40613e519524SHoward Hinnant{ 4062ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40633e519524SHoward Hinnant} 40643e519524SHoward Hinnant 4065f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4066f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4067f554add5SHoward Hinnantvoid 4068f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4069f554add5SHoward Hinnant{ 4070f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4071f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4072f554add5SHoward Hinnant} 4073f554add5SHoward Hinnant 40740be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4075e4383379SHoward Hinnant#pragma warning( push ) 4076e4383379SHoward Hinnant#pragma warning( disable: 4231) 40770be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4078f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4079f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4080f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4081f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4087f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4088f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4089f0544c20SHoward 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>&)) 4090f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4091f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4092f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40933e519524SHoward Hinnant 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4096f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4097f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4098f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4099f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4100f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4101f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4102f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4103f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4104f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4105f0544c20SHoward 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>&)) 4106f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4107f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4108f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41093e519524SHoward Hinnant 4110f0544c20SHoward 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>&)) 41110be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4112e4383379SHoward Hinnant#pragma warning( pop ) 41130be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41143e519524SHoward Hinnant 41153e519524SHoward Hinnant// lower_bound 41163e519524SHoward Hinnant 41173e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41183e519524SHoward Hinnant_ForwardIterator 4119e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41203e519524SHoward Hinnant{ 41213e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4122ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41233e519524SHoward Hinnant while (__len != 0) 41243e519524SHoward Hinnant { 41253e519524SHoward Hinnant difference_type __l2 = __len / 2; 41263e519524SHoward Hinnant _ForwardIterator __m = __first; 4127ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4128e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41293e519524SHoward Hinnant { 41303e519524SHoward Hinnant __first = ++__m; 41313e519524SHoward Hinnant __len -= __l2 + 1; 41323e519524SHoward Hinnant } 41333e519524SHoward Hinnant else 41343e519524SHoward Hinnant __len = __l2; 41353e519524SHoward Hinnant } 41363e519524SHoward Hinnant return __first; 41373e519524SHoward Hinnant} 41383e519524SHoward Hinnant 41393e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41403e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41413e519524SHoward Hinnant_ForwardIterator 4142e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41433e519524SHoward Hinnant{ 4144145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41453e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41463e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4147e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4148145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41493e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4150e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4151145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41523e519524SHoward Hinnant} 41533e519524SHoward Hinnant 41543e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41553e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41563e519524SHoward Hinnant_ForwardIterator 4157e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41583e519524SHoward Hinnant{ 4159e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41603e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41613e519524SHoward Hinnant} 41623e519524SHoward Hinnant 41633e519524SHoward Hinnant// upper_bound 41643e519524SHoward Hinnant 41653e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41663e519524SHoward Hinnant_ForwardIterator 4167e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41683e519524SHoward Hinnant{ 41693e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4170ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41713e519524SHoward Hinnant while (__len != 0) 41723e519524SHoward Hinnant { 41733e519524SHoward Hinnant difference_type __l2 = __len / 2; 41743e519524SHoward Hinnant _ForwardIterator __m = __first; 4175ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4176e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41773e519524SHoward Hinnant __len = __l2; 41783e519524SHoward Hinnant else 41793e519524SHoward Hinnant { 41803e519524SHoward Hinnant __first = ++__m; 41813e519524SHoward Hinnant __len -= __l2 + 1; 41823e519524SHoward Hinnant } 41833e519524SHoward Hinnant } 41843e519524SHoward Hinnant return __first; 41853e519524SHoward Hinnant} 41863e519524SHoward Hinnant 41873e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41893e519524SHoward Hinnant_ForwardIterator 4190e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41913e519524SHoward Hinnant{ 4192145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41933e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41943e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4195e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4196145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41973e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4198e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4199145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42003e519524SHoward Hinnant} 42013e519524SHoward Hinnant 42023e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42043e519524SHoward Hinnant_ForwardIterator 4205e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42063e519524SHoward Hinnant{ 4207e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42083e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42093e519524SHoward Hinnant} 42103e519524SHoward Hinnant 42113e519524SHoward Hinnant// equal_range 42123e519524SHoward Hinnant 42133e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42143e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4215e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42163e519524SHoward Hinnant{ 42173e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4218ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42193e519524SHoward Hinnant while (__len != 0) 42203e519524SHoward Hinnant { 42213e519524SHoward Hinnant difference_type __l2 = __len / 2; 42223e519524SHoward Hinnant _ForwardIterator __m = __first; 4223ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4224e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42253e519524SHoward Hinnant { 42263e519524SHoward Hinnant __first = ++__m; 42273e519524SHoward Hinnant __len -= __l2 + 1; 42283e519524SHoward Hinnant } 4229e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42303e519524SHoward Hinnant { 42313e519524SHoward Hinnant __last = __m; 42323e519524SHoward Hinnant __len = __l2; 42333e519524SHoward Hinnant } 42343e519524SHoward Hinnant else 42353e519524SHoward Hinnant { 42363e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42373e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42383e519524SHoward Hinnant ( 4239e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4240e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42413e519524SHoward Hinnant ); 42423e519524SHoward Hinnant } 42433e519524SHoward Hinnant } 42443e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42453e519524SHoward Hinnant} 42463e519524SHoward Hinnant 42473e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42493e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4250e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42513e519524SHoward Hinnant{ 4252145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42533e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42543e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4255e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4256145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42573e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4258e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4259145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42603e519524SHoward Hinnant} 42613e519524SHoward Hinnant 42623e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42643e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4265e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42663e519524SHoward Hinnant{ 4267e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42683e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42693e519524SHoward Hinnant} 42703e519524SHoward Hinnant 42713e519524SHoward Hinnant// binary_search 42723e519524SHoward Hinnant 42733e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42753e519524SHoward Hinnantbool 4276e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42773e519524SHoward Hinnant{ 4278e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4279e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42803e519524SHoward Hinnant} 42813e519524SHoward Hinnant 42823e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42843e519524SHoward Hinnantbool 4285e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42863e519524SHoward Hinnant{ 4287145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42883e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42893e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4290e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4291145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42923e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4293e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4294145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42953e519524SHoward Hinnant} 42963e519524SHoward Hinnant 42973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42993e519524SHoward Hinnantbool 4300e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43013e519524SHoward Hinnant{ 4302e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43033e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43043e519524SHoward Hinnant} 43053e519524SHoward Hinnant 43063e519524SHoward Hinnant// merge 43073e519524SHoward Hinnant 43083e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43093e519524SHoward Hinnant_OutputIterator 43103e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43113e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43123e519524SHoward Hinnant{ 43133e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43143e519524SHoward Hinnant { 43153e519524SHoward Hinnant if (__first2 == __last2) 4316ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43173e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43183e519524SHoward Hinnant { 43193e519524SHoward Hinnant *__result = *__first2; 43203e519524SHoward Hinnant ++__first2; 43213e519524SHoward Hinnant } 43223e519524SHoward Hinnant else 43233e519524SHoward Hinnant { 43243e519524SHoward Hinnant *__result = *__first1; 43253e519524SHoward Hinnant ++__first1; 43263e519524SHoward Hinnant } 43273e519524SHoward Hinnant } 4328ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43293e519524SHoward Hinnant} 43303e519524SHoward Hinnant 43313e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43333e519524SHoward Hinnant_OutputIterator 43343e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43353e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43363e519524SHoward Hinnant{ 4337145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43383e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43393e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4340ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4341145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43423e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4343ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4344145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43453e519524SHoward Hinnant} 43463e519524SHoward Hinnant 43473e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43493e519524SHoward Hinnant_OutputIterator 43503e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43513e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43523e519524SHoward Hinnant{ 43533e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43543e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43553e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43563e519524SHoward Hinnant} 43573e519524SHoward Hinnant 43583e519524SHoward Hinnant// inplace_merge 43593e519524SHoward Hinnant 43603e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43613e519524SHoward Hinnantvoid 43623e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43633e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43643e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43653e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43663e519524SHoward Hinnant{ 43673e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 43683e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 43693e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::pointer pointer; 43703e519524SHoward Hinnant __destruct_n __d(0); 43713e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 43723e519524SHoward Hinnant if (__len1 <= __len2) 43733e519524SHoward Hinnant { 43743e519524SHoward Hinnant value_type* __p = __buff; 4375910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4376ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43773e519524SHoward Hinnant __merge<_Compare>(move_iterator<value_type*>(__buff), 43783e519524SHoward Hinnant move_iterator<value_type*>(__p), 43793e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__middle), 43803e519524SHoward Hinnant move_iterator<_BidirectionalIterator>(__last), 43813e519524SHoward Hinnant __first, __comp); 43823e519524SHoward Hinnant } 43833e519524SHoward Hinnant else 43843e519524SHoward Hinnant { 43853e519524SHoward Hinnant value_type* __p = __buff; 4386910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4387ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 43883e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 43893e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 43903e519524SHoward Hinnant __merge(move_iterator<_RBi>(_RBi(__middle)), move_iterator<_RBi>(_RBi(__first)), 43913e519524SHoward Hinnant move_iterator<_Rv>(_Rv(__p)), move_iterator<_Rv>(_Rv(__buff)), 43923e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 43933e519524SHoward Hinnant } 43943e519524SHoward Hinnant} 43953e519524SHoward Hinnant 43963e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43973e519524SHoward Hinnantvoid 43983e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43993e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44003e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44013e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44023e519524SHoward Hinnant{ 44033e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44043e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44053e519524SHoward Hinnant while (true) 44063e519524SHoward Hinnant { 44073e519524SHoward Hinnant // if __middle == __last, we're done 44083e519524SHoward Hinnant if (__len2 == 0) 44093e519524SHoward Hinnant return; 44103e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4411910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44123e519524SHoward Hinnant { 44133e519524SHoward Hinnant if (__len1 == 0) 44143e519524SHoward Hinnant return; 44153e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44163e519524SHoward Hinnant break; 44173e519524SHoward Hinnant } 44183e519524SHoward Hinnant if (__len1 <= __buff_size || __len2 <= __buff_size) 44193e519524SHoward Hinnant { 44203e519524SHoward Hinnant __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff); 44213e519524SHoward Hinnant return; 44223e519524SHoward Hinnant } 44233e519524SHoward Hinnant // __first < __middle < __last 44243e519524SHoward Hinnant // *__first > *__middle 44253e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44263e519524SHoward Hinnant // all elements in: 44273e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44283e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44293e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44303e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44313e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44323e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44333e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44343e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44353e519524SHoward Hinnant // binary search smaller range 44363e519524SHoward Hinnant if (__len1 < __len2) 44373e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44383e519524SHoward Hinnant __len21 = __len2 / 2; 44393e519524SHoward Hinnant __m2 = __middle; 4440ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44413e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4442ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44433e519524SHoward Hinnant } 44443e519524SHoward Hinnant else 44453e519524SHoward Hinnant { 44463e519524SHoward Hinnant if (__len1 == 1) 44473e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44483e519524SHoward Hinnant // It is known *__first > *__middle 44493e519524SHoward Hinnant swap(*__first, *__middle); 44503e519524SHoward Hinnant return; 44513e519524SHoward Hinnant } 44523e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44533e519524SHoward Hinnant __len11 = __len1 / 2; 44543e519524SHoward Hinnant __m1 = __first; 4455ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44563e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4457ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44583e519524SHoward Hinnant } 44593e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44603e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44613e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44623e519524SHoward Hinnant // swap middle two partitions 4463ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44643e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44653e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44663e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44673e519524SHoward Hinnant { 44683e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44693e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44703e519524SHoward Hinnant __first = __middle; 44713e519524SHoward Hinnant __middle = __m2; 44723e519524SHoward Hinnant __len1 = __len12; 44733e519524SHoward Hinnant __len2 = __len22; 44743e519524SHoward Hinnant } 44753e519524SHoward Hinnant else 44763e519524SHoward Hinnant { 44773e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44783e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44793e519524SHoward Hinnant __last = __middle; 44803e519524SHoward Hinnant __middle = __m1; 44813e519524SHoward Hinnant __len1 = __len11; 44823e519524SHoward Hinnant __len2 = __len21; 44833e519524SHoward Hinnant } 44843e519524SHoward Hinnant } 44853e519524SHoward Hinnant} 44863e519524SHoward Hinnant 44873e519524SHoward Hinnanttemplate <class _Tp> 44883e519524SHoward Hinnantstruct __inplace_merge_switch 44893e519524SHoward Hinnant{ 4490ca740483SHoward Hinnant static const unsigned value = is_trivially_copy_assignable<_Tp>::value; 44913e519524SHoward Hinnant}; 44923e519524SHoward Hinnant 44933e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 44943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 44953e519524SHoward Hinnantvoid 44963e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44973e519524SHoward Hinnant _Compare __comp) 44983e519524SHoward Hinnant{ 44993e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45003e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4501ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4502ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4503ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45043e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 45053e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 45063e519524SHoward Hinnant if (__inplace_merge_switch<value_type>::value && __buf_size > 8) 45073e519524SHoward Hinnant { 4508ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45093e519524SHoward Hinnant __h.reset(__buf.first); 45103e519524SHoward Hinnant } 4511145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4514ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45153e519524SHoward Hinnant __buf.first, __buf.second); 4516145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45173e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4518ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45193e519524SHoward Hinnant __buf.first, __buf.second); 4520145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45213e519524SHoward Hinnant} 45223e519524SHoward Hinnant 45233e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45253e519524SHoward Hinnantvoid 45263e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45273e519524SHoward Hinnant{ 4528ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45293e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45303e519524SHoward Hinnant} 45313e519524SHoward Hinnant 45323e519524SHoward Hinnant// stable_sort 45333e519524SHoward Hinnant 45343e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45353e519524SHoward Hinnantvoid 45363e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45373e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45383e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45393e519524SHoward Hinnant{ 45403e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45413e519524SHoward Hinnant __destruct_n __d(0); 45423e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45433e519524SHoward Hinnant for (; true; ++__result) 45443e519524SHoward Hinnant { 45453e519524SHoward Hinnant if (__first1 == __last1) 45463e519524SHoward Hinnant { 45473e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4548ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45493e519524SHoward Hinnant __h.release(); 45503e519524SHoward Hinnant return; 45513e519524SHoward Hinnant } 45523e519524SHoward Hinnant if (__first2 == __last2) 45533e519524SHoward Hinnant { 45543e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4555ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45563e519524SHoward Hinnant __h.release(); 45573e519524SHoward Hinnant return; 45583e519524SHoward Hinnant } 45593e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45603e519524SHoward Hinnant { 4561ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45623e519524SHoward Hinnant __d.__incr((value_type*)0); 45633e519524SHoward Hinnant ++__first2; 45643e519524SHoward Hinnant } 45653e519524SHoward Hinnant else 45663e519524SHoward Hinnant { 4567ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45683e519524SHoward Hinnant __d.__incr((value_type*)0); 45693e519524SHoward Hinnant ++__first1; 45703e519524SHoward Hinnant } 45713e519524SHoward Hinnant } 45723e519524SHoward Hinnant} 45733e519524SHoward Hinnant 45743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45753e519524SHoward Hinnantvoid 45763e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45783e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45793e519524SHoward Hinnant{ 45803e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45813e519524SHoward Hinnant { 45823e519524SHoward Hinnant if (__first2 == __last2) 45833e519524SHoward Hinnant { 45843e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4585ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45863e519524SHoward Hinnant return; 45873e519524SHoward Hinnant } 45883e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45893e519524SHoward Hinnant { 4590ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 45913e519524SHoward Hinnant ++__first2; 45923e519524SHoward Hinnant } 45933e519524SHoward Hinnant else 45943e519524SHoward Hinnant { 4595ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45963e519524SHoward Hinnant ++__first1; 45973e519524SHoward Hinnant } 45983e519524SHoward Hinnant } 45993e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4600ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46013e519524SHoward Hinnant} 46023e519524SHoward Hinnant 46033e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46043e519524SHoward Hinnantvoid 46053e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46063e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46073e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46083e519524SHoward Hinnant 46093e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46103e519524SHoward Hinnantvoid 46113e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46123e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46133e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46143e519524SHoward Hinnant{ 46153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46163e519524SHoward Hinnant switch (__len) 46173e519524SHoward Hinnant { 46183e519524SHoward Hinnant case 0: 46193e519524SHoward Hinnant return; 46203e519524SHoward Hinnant case 1: 4621ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46223e519524SHoward Hinnant return; 46233e519524SHoward Hinnant case 2: 46243e519524SHoward Hinnant __destruct_n __d(0); 46253e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46263e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46273e519524SHoward Hinnant { 4628ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46293e519524SHoward Hinnant __d.__incr((value_type*)0); 46303e519524SHoward Hinnant ++__first2; 4631ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46323e519524SHoward Hinnant } 46333e519524SHoward Hinnant else 46343e519524SHoward Hinnant { 4635ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46363e519524SHoward Hinnant __d.__incr((value_type*)0); 46373e519524SHoward Hinnant ++__first2; 4638ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46393e519524SHoward Hinnant } 46403e519524SHoward Hinnant __h2.release(); 46413e519524SHoward Hinnant return; 46423e519524SHoward Hinnant } 46433e519524SHoward Hinnant if (__len <= 8) 46443e519524SHoward Hinnant { 46453e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46463e519524SHoward Hinnant return; 46473e519524SHoward Hinnant } 46483e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46493e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46503e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46513e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46523e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46533e519524SHoward Hinnant} 46543e519524SHoward Hinnant 46553e519524SHoward Hinnanttemplate <class _Tp> 46563e519524SHoward Hinnantstruct __stable_sort_switch 46573e519524SHoward Hinnant{ 4658ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46593e519524SHoward Hinnant}; 46603e519524SHoward Hinnant 46613e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46623e519524SHoward Hinnantvoid 46633e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46643e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46653e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46663e519524SHoward Hinnant{ 46673e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46683e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46693e519524SHoward Hinnant switch (__len) 46703e519524SHoward Hinnant { 46713e519524SHoward Hinnant case 0: 46723e519524SHoward Hinnant case 1: 46733e519524SHoward Hinnant return; 46743e519524SHoward Hinnant case 2: 46753e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46763e519524SHoward Hinnant swap(*__first, *__last); 46773e519524SHoward Hinnant return; 46783e519524SHoward Hinnant } 46793e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46803e519524SHoward Hinnant { 46813e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46823e519524SHoward Hinnant return; 46833e519524SHoward Hinnant } 46843e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46853e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46863e519524SHoward Hinnant if (__len <= __buff_size) 46873e519524SHoward Hinnant { 46883e519524SHoward Hinnant __destruct_n __d(0); 46893e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 46903e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 46913e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 46923e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 46933e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 46943e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 46953e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 46963e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 46973e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 46983e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 46993e519524SHoward Hinnant// __first, __comp); 47003e519524SHoward Hinnant return; 47013e519524SHoward Hinnant } 47023e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47033e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47043e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47053e519524SHoward Hinnant} 47063e519524SHoward Hinnant 47073e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47093e519524SHoward Hinnantvoid 47103e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47113e519524SHoward Hinnant{ 47123e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47133e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47143e519524SHoward Hinnant difference_type __len = __last - __first; 47153e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47163e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47173e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47183e519524SHoward Hinnant { 4719ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47203e519524SHoward Hinnant __h.reset(__buf.first); 47213e519524SHoward Hinnant } 4722145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47253e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4726145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47283e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4729145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47303e519524SHoward Hinnant} 47313e519524SHoward Hinnant 47323e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47343e519524SHoward Hinnantvoid 47353e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47363e519524SHoward Hinnant{ 4737ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47383e519524SHoward Hinnant} 47393e519524SHoward Hinnant 47403e519524SHoward Hinnant// is_heap_until 47413e519524SHoward Hinnant 47423e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47433e519524SHoward Hinnant_RandomAccessIterator 47443e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47453e519524SHoward Hinnant{ 4746ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47473e519524SHoward Hinnant difference_type __len = __last - __first; 47483e519524SHoward Hinnant difference_type __p = 0; 47493e519524SHoward Hinnant difference_type __c = 1; 47503e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47513e519524SHoward Hinnant while (__c < __len) 47523e519524SHoward Hinnant { 47533e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47543e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47553e519524SHoward Hinnant return __cp; 47563e519524SHoward Hinnant ++__c; 47573e519524SHoward Hinnant ++__cp; 47583e519524SHoward Hinnant if (__c == __len) 47593e519524SHoward Hinnant return __last; 47603e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47613e519524SHoward Hinnant return __cp; 47623e519524SHoward Hinnant ++__p; 47633e519524SHoward Hinnant ++__pp; 47643e519524SHoward Hinnant __c = 2 * __p + 1; 47653e519524SHoward Hinnant } 47663e519524SHoward Hinnant return __last; 47673e519524SHoward Hinnant} 47683e519524SHoward Hinnant 47693e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47703e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47713e519524SHoward Hinnant_RandomAccessIterator 47723e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47733e519524SHoward Hinnant{ 4774ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47753e519524SHoward Hinnant} 47763e519524SHoward Hinnant 47773e519524SHoward Hinnant// is_heap 47783e519524SHoward Hinnant 47793e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47813e519524SHoward Hinnantbool 47823e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47833e519524SHoward Hinnant{ 4784ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47853e519524SHoward Hinnant} 47863e519524SHoward Hinnant 47873e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47883e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47893e519524SHoward Hinnantbool 47903e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 47913e519524SHoward Hinnant{ 4792ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47933e519524SHoward Hinnant} 47943e519524SHoward Hinnant 47953e519524SHoward Hinnant// push_heap 47963e519524SHoward Hinnant 47973e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 47983e519524SHoward Hinnantvoid 47998b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48003e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48013e519524SHoward Hinnant{ 48023e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48033e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48043e519524SHoward Hinnant if (__len > 1) 48053e519524SHoward Hinnant { 48063e519524SHoward Hinnant __len = (__len - 2) / 2; 48073e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48083e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48093e519524SHoward Hinnant { 4810ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48113e519524SHoward Hinnant do 48123e519524SHoward Hinnant { 4813ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48143e519524SHoward Hinnant __last = __ptr; 48153e519524SHoward Hinnant if (__len == 0) 48163e519524SHoward Hinnant break; 48173e519524SHoward Hinnant __len = (__len - 1) / 2; 48183e519524SHoward Hinnant __ptr = __first + __len; 48193e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4820ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48213e519524SHoward Hinnant } 48223e519524SHoward Hinnant } 48233e519524SHoward Hinnant} 48243e519524SHoward Hinnant 48253e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48273e519524SHoward Hinnantvoid 48283e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48293e519524SHoward Hinnant{ 4830145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48313e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48323e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48338b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4834145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48353e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48368b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4837145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48383e519524SHoward Hinnant} 48393e519524SHoward Hinnant 48403e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48423e519524SHoward Hinnantvoid 48433e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48443e519524SHoward Hinnant{ 4845ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48463e519524SHoward Hinnant} 48473e519524SHoward Hinnant 48483e519524SHoward Hinnant// pop_heap 48493e519524SHoward Hinnant 48503e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48518b512602SDavid Majnemervoid 48528b512602SDavid Majnemer__sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48538b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48548b512602SDavid Majnemer _RandomAccessIterator __start) 48558b512602SDavid Majnemer{ 48568b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48578b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48588b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48598b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48608b512602SDavid Majnemer difference_type __child = __start - __first; 48618b512602SDavid Majnemer 48628b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48638b512602SDavid Majnemer return; 48648b512602SDavid Majnemer 48658b512602SDavid Majnemer __child = 2 * __child + 1; 48668b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48678b512602SDavid Majnemer 48688b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48698b512602SDavid Majnemer // right-child exists and is greater than left-child 48708b512602SDavid Majnemer ++__child_i; 48718b512602SDavid Majnemer ++__child; 48728b512602SDavid Majnemer } 48738b512602SDavid Majnemer 48748b512602SDavid Majnemer // check if we are in heap-order 48758b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48768b512602SDavid Majnemer // we are, __start is larger than it's largest child 48778b512602SDavid Majnemer return; 48788b512602SDavid Majnemer 48798b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48808b512602SDavid Majnemer do 48818b512602SDavid Majnemer { 48828b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48838b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48848b512602SDavid Majnemer __start = __child_i; 48858b512602SDavid Majnemer 48868b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48878b512602SDavid Majnemer break; 48888b512602SDavid Majnemer 48898b512602SDavid Majnemer // recompute the child based off of the updated parent 48908b512602SDavid Majnemer __child = 2 * __child + 1; 48918b512602SDavid Majnemer __child_i = __first + __child; 48928b512602SDavid Majnemer 48938b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48948b512602SDavid Majnemer // right-child exists and is greater than left-child 48958b512602SDavid Majnemer ++__child_i; 48968b512602SDavid Majnemer ++__child; 48978b512602SDavid Majnemer } 48988b512602SDavid Majnemer 48998b512602SDavid Majnemer // check if we are in heap-order 49008b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49018b512602SDavid Majnemer *__start = _VSTD::move(__top); 49028b512602SDavid Majnemer} 49038b512602SDavid Majnemer 49048b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49063e519524SHoward Hinnantvoid 49073e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49083e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49093e519524SHoward Hinnant{ 49103e519524SHoward Hinnant if (__len > 1) 49113e519524SHoward Hinnant { 49123e519524SHoward Hinnant swap(*__first, *--__last); 49138b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49143e519524SHoward Hinnant } 49153e519524SHoward Hinnant} 49163e519524SHoward Hinnant 49173e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49193e519524SHoward Hinnantvoid 49203e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49213e519524SHoward Hinnant{ 4922145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49233e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49243e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49253e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4926145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49273e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49283e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4929145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49303e519524SHoward Hinnant} 49313e519524SHoward Hinnant 49323e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49333e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49343e519524SHoward Hinnantvoid 49353e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49363e519524SHoward Hinnant{ 4937ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49383e519524SHoward Hinnant} 49393e519524SHoward Hinnant 49403e519524SHoward Hinnant// make_heap 49413e519524SHoward Hinnant 49423e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49433e519524SHoward Hinnantvoid 49443e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49453e519524SHoward Hinnant{ 49463e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49473e519524SHoward Hinnant difference_type __n = __last - __first; 49483e519524SHoward Hinnant if (__n > 1) 49493e519524SHoward Hinnant { 49508b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49518b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49528b512602SDavid Majnemer { 49538b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49548b512602SDavid Majnemer } 49553e519524SHoward Hinnant } 49563e519524SHoward Hinnant} 49573e519524SHoward Hinnant 49583e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49603e519524SHoward Hinnantvoid 49613e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49623e519524SHoward Hinnant{ 4963145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49663e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4967145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49693e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4970145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49713e519524SHoward Hinnant} 49723e519524SHoward Hinnant 49733e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49753e519524SHoward Hinnantvoid 49763e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49773e519524SHoward Hinnant{ 4978ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49793e519524SHoward Hinnant} 49803e519524SHoward Hinnant 49813e519524SHoward Hinnant// sort_heap 49823e519524SHoward Hinnant 49833e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49843e519524SHoward Hinnantvoid 49853e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49863e519524SHoward Hinnant{ 49873e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49883e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 49893e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 49903e519524SHoward Hinnant} 49913e519524SHoward Hinnant 49923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49943e519524SHoward Hinnantvoid 49953e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49963e519524SHoward Hinnant{ 4997145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49983e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49993e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50003e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5001145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50023e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50033e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5004145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50053e519524SHoward Hinnant} 50063e519524SHoward Hinnant 50073e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50083e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50093e519524SHoward Hinnantvoid 50103e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50113e519524SHoward Hinnant{ 5012ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50133e519524SHoward Hinnant} 50143e519524SHoward Hinnant 50153e519524SHoward Hinnant// partial_sort 50163e519524SHoward Hinnant 50173e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50183e519524SHoward Hinnantvoid 50193e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50203e519524SHoward Hinnant _Compare __comp) 50213e519524SHoward Hinnant{ 50223e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50233e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50243e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50253e519524SHoward Hinnant { 50263e519524SHoward Hinnant if (__comp(*__i, *__first)) 50273e519524SHoward Hinnant { 50283e519524SHoward Hinnant swap(*__i, *__first); 50298b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50303e519524SHoward Hinnant } 50313e519524SHoward Hinnant } 50323e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50333e519524SHoward Hinnant} 50343e519524SHoward Hinnant 50353e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50373e519524SHoward Hinnantvoid 50383e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50393e519524SHoward Hinnant _Compare __comp) 50403e519524SHoward Hinnant{ 5041145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50443e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5045145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50473e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5048145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50493e519524SHoward Hinnant} 50503e519524SHoward Hinnant 50513e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50533e519524SHoward Hinnantvoid 50543e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50553e519524SHoward Hinnant{ 5056ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50573e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50583e519524SHoward Hinnant} 50593e519524SHoward Hinnant 50603e519524SHoward Hinnant// partial_sort_copy 50613e519524SHoward Hinnant 50623e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50633e519524SHoward Hinnant_RandomAccessIterator 50643e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50653e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50663e519524SHoward Hinnant{ 50673e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50683e519524SHoward Hinnant if (__r != __result_last) 50693e519524SHoward Hinnant { 5070910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50713e519524SHoward Hinnant *__r = *__first; 50723e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50738b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50743e519524SHoward Hinnant for (; __first != __last; ++__first) 50753e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50763e519524SHoward Hinnant { 50773e519524SHoward Hinnant *__result_first = *__first; 50788b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50793e519524SHoward Hinnant } 50803e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50813e519524SHoward Hinnant } 50823e519524SHoward Hinnant return __r; 50833e519524SHoward Hinnant} 50843e519524SHoward Hinnant 50853e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50873e519524SHoward Hinnant_RandomAccessIterator 50883e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 50893e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50903e519524SHoward Hinnant{ 5091145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50923e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50933e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50943e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5095145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50963e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50973e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5098145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50993e519524SHoward Hinnant} 51003e519524SHoward Hinnant 51013e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51033e519524SHoward Hinnant_RandomAccessIterator 51043e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51053e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51063e519524SHoward Hinnant{ 5107ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51083e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51093e519524SHoward Hinnant} 51103e519524SHoward Hinnant 51113e519524SHoward Hinnant// nth_element 51123e519524SHoward Hinnant 51133e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51143e519524SHoward Hinnantvoid 51153e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51163e519524SHoward Hinnant{ 51173e519524SHoward Hinnant // _Compare is known to be a reference type 51183e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51193e519524SHoward Hinnant const difference_type __limit = 7; 51203e519524SHoward Hinnant while (true) 51213e519524SHoward Hinnant { 51223e519524SHoward Hinnant __restart: 5123b34b4819SHoward Hinnant if (__nth == __last) 5124b34b4819SHoward Hinnant return; 51253e519524SHoward Hinnant difference_type __len = __last - __first; 51263e519524SHoward Hinnant switch (__len) 51273e519524SHoward Hinnant { 51283e519524SHoward Hinnant case 0: 51293e519524SHoward Hinnant case 1: 51303e519524SHoward Hinnant return; 51313e519524SHoward Hinnant case 2: 51323e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51333e519524SHoward Hinnant swap(*__first, *__last); 51343e519524SHoward Hinnant return; 51353e519524SHoward Hinnant case 3: 51363e519524SHoward Hinnant { 51373e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5138ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51393e519524SHoward Hinnant return; 51403e519524SHoward Hinnant } 51413e519524SHoward Hinnant } 51423e519524SHoward Hinnant if (__len <= __limit) 51433e519524SHoward Hinnant { 51443e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51453e519524SHoward Hinnant return; 51463e519524SHoward Hinnant } 51473e519524SHoward Hinnant // __len > __limit >= 3 51483e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51493e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5150ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51513e519524SHoward Hinnant // *__m is median 51523e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51533e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51543e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51553e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51563e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51573e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51583e519524SHoward Hinnant // Prime the downward search with a guard. 51593e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51603e519524SHoward Hinnant { 51613e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51623e519524SHoward Hinnant // manually guard downward moving __j against __i 51633e519524SHoward Hinnant while (true) 51643e519524SHoward Hinnant { 51653e519524SHoward Hinnant if (__i == --__j) 51663e519524SHoward Hinnant { 51673e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51683e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51693e519524SHoward Hinnant ++__i; // __first + 1 51703e519524SHoward Hinnant __j = __last; 51713e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51723e519524SHoward Hinnant { 51733e519524SHoward Hinnant while (true) 51743e519524SHoward Hinnant { 51753e519524SHoward Hinnant if (__i == __j) 51763e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51773e519524SHoward Hinnant if (__comp(*__first, *__i)) 51783e519524SHoward Hinnant { 51793e519524SHoward Hinnant swap(*__i, *__j); 51803e519524SHoward Hinnant ++__n_swaps; 51813e519524SHoward Hinnant ++__i; 51823e519524SHoward Hinnant break; 51833e519524SHoward Hinnant } 51843e519524SHoward Hinnant ++__i; 51853e519524SHoward Hinnant } 51863e519524SHoward Hinnant } 51873e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 51883e519524SHoward Hinnant if (__i == __j) 51893e519524SHoward Hinnant return; 51903e519524SHoward Hinnant while (true) 51913e519524SHoward Hinnant { 51923e519524SHoward Hinnant while (!__comp(*__first, *__i)) 51933e519524SHoward Hinnant ++__i; 51943e519524SHoward Hinnant while (__comp(*__first, *--__j)) 51953e519524SHoward Hinnant ; 51963e519524SHoward Hinnant if (__i >= __j) 51973e519524SHoward Hinnant break; 51983e519524SHoward Hinnant swap(*__i, *__j); 51993e519524SHoward Hinnant ++__n_swaps; 52003e519524SHoward Hinnant ++__i; 52013e519524SHoward Hinnant } 52023e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52033e519524SHoward Hinnant // The first part is sorted, 52043e519524SHoward Hinnant if (__nth < __i) 52053e519524SHoward Hinnant return; 52063e519524SHoward Hinnant // __nth_element the secod part 52073e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52083e519524SHoward Hinnant __first = __i; 52093e519524SHoward Hinnant goto __restart; 52103e519524SHoward Hinnant } 52113e519524SHoward Hinnant if (__comp(*__j, *__m)) 52123e519524SHoward Hinnant { 52133e519524SHoward Hinnant swap(*__i, *__j); 52143e519524SHoward Hinnant ++__n_swaps; 52153e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52163e519524SHoward Hinnant } 52173e519524SHoward Hinnant } 52183e519524SHoward Hinnant } 52193e519524SHoward Hinnant ++__i; 52203e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52213e519524SHoward Hinnant // if not yet partitioned... 52223e519524SHoward Hinnant if (__i < __j) 52233e519524SHoward Hinnant { 52243e519524SHoward Hinnant // known that *(__i - 1) < *__m 52253e519524SHoward Hinnant while (true) 52263e519524SHoward Hinnant { 52273e519524SHoward Hinnant // __m still guards upward moving __i 52283e519524SHoward Hinnant while (__comp(*__i, *__m)) 52293e519524SHoward Hinnant ++__i; 52303e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52313e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52323e519524SHoward Hinnant ; 52333e519524SHoward Hinnant if (__i >= __j) 52343e519524SHoward Hinnant break; 52353e519524SHoward Hinnant swap(*__i, *__j); 52363e519524SHoward Hinnant ++__n_swaps; 52373e519524SHoward Hinnant // It is known that __m != __j 52383e519524SHoward Hinnant // If __m just moved, follow it 52393e519524SHoward Hinnant if (__m == __i) 52403e519524SHoward Hinnant __m = __j; 52413e519524SHoward Hinnant ++__i; 52423e519524SHoward Hinnant } 52433e519524SHoward Hinnant } 52443e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52453e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52463e519524SHoward Hinnant { 52473e519524SHoward Hinnant swap(*__i, *__m); 52483e519524SHoward Hinnant ++__n_swaps; 52493e519524SHoward Hinnant } 52503e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52513e519524SHoward Hinnant if (__nth == __i) 52523e519524SHoward Hinnant return; 52533e519524SHoward Hinnant if (__n_swaps == 0) 52543e519524SHoward Hinnant { 52553e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52563e519524SHoward Hinnant if (__nth < __i) 52573e519524SHoward Hinnant { 52583e519524SHoward Hinnant // Check for [__first, __i) already sorted 52593e519524SHoward Hinnant __j = __m = __first; 52603e519524SHoward Hinnant while (++__j != __i) 52613e519524SHoward Hinnant { 52623e519524SHoward Hinnant if (__comp(*__j, *__m)) 52633e519524SHoward Hinnant // not yet sorted, so sort 52643e519524SHoward Hinnant goto not_sorted; 52653e519524SHoward Hinnant __m = __j; 52663e519524SHoward Hinnant } 52673e519524SHoward Hinnant // [__first, __i) sorted 52683e519524SHoward Hinnant return; 52693e519524SHoward Hinnant } 52703e519524SHoward Hinnant else 52713e519524SHoward Hinnant { 52723e519524SHoward Hinnant // Check for [__i, __last) already sorted 52733e519524SHoward Hinnant __j = __m = __i; 52743e519524SHoward Hinnant while (++__j != __last) 52753e519524SHoward Hinnant { 52763e519524SHoward Hinnant if (__comp(*__j, *__m)) 52773e519524SHoward Hinnant // not yet sorted, so sort 52783e519524SHoward Hinnant goto not_sorted; 52793e519524SHoward Hinnant __m = __j; 52803e519524SHoward Hinnant } 52813e519524SHoward Hinnant // [__i, __last) sorted 52823e519524SHoward Hinnant return; 52833e519524SHoward Hinnant } 52843e519524SHoward Hinnant } 52853e519524SHoward Hinnantnot_sorted: 52863e519524SHoward Hinnant // __nth_element on range containing __nth 52873e519524SHoward Hinnant if (__nth < __i) 52883e519524SHoward Hinnant { 52893e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 52903e519524SHoward Hinnant __last = __i; 52913e519524SHoward Hinnant } 52923e519524SHoward Hinnant else 52933e519524SHoward Hinnant { 52943e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 52953e519524SHoward Hinnant __first = ++__i; 52963e519524SHoward Hinnant } 52973e519524SHoward Hinnant } 52983e519524SHoward Hinnant} 52993e519524SHoward Hinnant 53003e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53023e519524SHoward Hinnantvoid 53033e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53043e519524SHoward Hinnant{ 5305145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53083e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5309145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53113e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5312145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53133e519524SHoward Hinnant} 53143e519524SHoward Hinnant 53153e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53173e519524SHoward Hinnantvoid 53183e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53193e519524SHoward Hinnant{ 5320ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53213e519524SHoward Hinnant} 53223e519524SHoward Hinnant 53233e519524SHoward Hinnant// includes 53243e519524SHoward Hinnant 53253e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53263e519524SHoward Hinnantbool 53273e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53283e519524SHoward Hinnant _Compare __comp) 53293e519524SHoward Hinnant{ 53303e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53313e519524SHoward Hinnant { 53323e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53333e519524SHoward Hinnant return false; 53343e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53353e519524SHoward Hinnant ++__first2; 53363e519524SHoward Hinnant } 53373e519524SHoward Hinnant return true; 53383e519524SHoward Hinnant} 53393e519524SHoward Hinnant 53403e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53423e519524SHoward Hinnantbool 53433e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53443e519524SHoward Hinnant _Compare __comp) 53453e519524SHoward Hinnant{ 5346145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53473e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53483e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53493e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5350145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53513e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53523e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5353145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53543e519524SHoward Hinnant} 53553e519524SHoward Hinnant 53563e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53573e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53583e519524SHoward Hinnantbool 53593e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53603e519524SHoward Hinnant{ 5361ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53623e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53633e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53643e519524SHoward Hinnant} 53653e519524SHoward Hinnant 53663e519524SHoward Hinnant// set_union 53673e519524SHoward Hinnant 53683e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53693e519524SHoward Hinnant_OutputIterator 53703e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53713e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53723e519524SHoward Hinnant{ 53733e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53743e519524SHoward Hinnant { 53753e519524SHoward Hinnant if (__first2 == __last2) 5376ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53773e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53783e519524SHoward Hinnant { 53793e519524SHoward Hinnant *__result = *__first2; 53803e519524SHoward Hinnant ++__first2; 53813e519524SHoward Hinnant } 53823e519524SHoward Hinnant else 53833e519524SHoward Hinnant { 53843e519524SHoward Hinnant *__result = *__first1; 53853e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53863e519524SHoward Hinnant ++__first2; 53873e519524SHoward Hinnant ++__first1; 53883e519524SHoward Hinnant } 53893e519524SHoward Hinnant } 5390ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 53913e519524SHoward Hinnant} 53923e519524SHoward Hinnant 53933e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 53943e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53953e519524SHoward Hinnant_OutputIterator 53963e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 53973e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53983e519524SHoward Hinnant{ 5399145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54003e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54013e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54023e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5403145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54043e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54053e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5406145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54073e519524SHoward Hinnant} 54083e519524SHoward Hinnant 54093e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54113e519524SHoward Hinnant_OutputIterator 54123e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54133e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54143e519524SHoward Hinnant{ 5415ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54163e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54173e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54183e519524SHoward Hinnant} 54193e519524SHoward Hinnant 54203e519524SHoward Hinnant// set_intersection 54213e519524SHoward Hinnant 54223e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54233e519524SHoward Hinnant_OutputIterator 54243e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54263e519524SHoward Hinnant{ 54273e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54283e519524SHoward Hinnant { 54293e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54303e519524SHoward Hinnant ++__first1; 54313e519524SHoward Hinnant else 54323e519524SHoward Hinnant { 54333e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54343e519524SHoward Hinnant { 54353e519524SHoward Hinnant *__result = *__first1; 54363e519524SHoward Hinnant ++__result; 54373e519524SHoward Hinnant ++__first1; 54383e519524SHoward Hinnant } 54393e519524SHoward Hinnant ++__first2; 54403e519524SHoward Hinnant } 54413e519524SHoward Hinnant } 54423e519524SHoward Hinnant return __result; 54433e519524SHoward Hinnant} 54443e519524SHoward Hinnant 54453e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54473e519524SHoward Hinnant_OutputIterator 54483e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54493e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54503e519524SHoward Hinnant{ 5451145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54523e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54533e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54543e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5455145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54563e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54573e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5458145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54593e519524SHoward Hinnant} 54603e519524SHoward Hinnant 54613e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54633e519524SHoward Hinnant_OutputIterator 54643e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54653e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54663e519524SHoward Hinnant{ 5467ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54683e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54693e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54703e519524SHoward Hinnant} 54713e519524SHoward Hinnant 54723e519524SHoward Hinnant// set_difference 54733e519524SHoward Hinnant 54743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54753e519524SHoward Hinnant_OutputIterator 54763e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54783e519524SHoward Hinnant{ 54793e519524SHoward Hinnant while (__first1 != __last1) 54803e519524SHoward Hinnant { 54813e519524SHoward Hinnant if (__first2 == __last2) 5482ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54833e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54843e519524SHoward Hinnant { 54853e519524SHoward Hinnant *__result = *__first1; 54863e519524SHoward Hinnant ++__result; 54873e519524SHoward Hinnant ++__first1; 54883e519524SHoward Hinnant } 54893e519524SHoward Hinnant else 54903e519524SHoward Hinnant { 54913e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54923e519524SHoward Hinnant ++__first1; 54933e519524SHoward Hinnant ++__first2; 54943e519524SHoward Hinnant } 54953e519524SHoward Hinnant } 54963e519524SHoward Hinnant return __result; 54973e519524SHoward Hinnant} 54983e519524SHoward Hinnant 54993e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55003e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55013e519524SHoward Hinnant_OutputIterator 55023e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55033e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55043e519524SHoward Hinnant{ 5505145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55063e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55073e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55083e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5509145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55103e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55113e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5512145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55133e519524SHoward Hinnant} 55143e519524SHoward Hinnant 55153e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55173e519524SHoward Hinnant_OutputIterator 55183e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55193e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55203e519524SHoward Hinnant{ 5521ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55223e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55233e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55243e519524SHoward Hinnant} 55253e519524SHoward Hinnant 55263e519524SHoward Hinnant// set_symmetric_difference 55273e519524SHoward Hinnant 55283e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55293e519524SHoward Hinnant_OutputIterator 55303e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55323e519524SHoward Hinnant{ 55333e519524SHoward Hinnant while (__first1 != __last1) 55343e519524SHoward Hinnant { 55353e519524SHoward Hinnant if (__first2 == __last2) 5536ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55373e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55383e519524SHoward Hinnant { 55393e519524SHoward Hinnant *__result = *__first1; 55403e519524SHoward Hinnant ++__result; 55413e519524SHoward Hinnant ++__first1; 55423e519524SHoward Hinnant } 55433e519524SHoward Hinnant else 55443e519524SHoward Hinnant { 55453e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55463e519524SHoward Hinnant { 55473e519524SHoward Hinnant *__result = *__first2; 55483e519524SHoward Hinnant ++__result; 55493e519524SHoward Hinnant } 55503e519524SHoward Hinnant else 55513e519524SHoward Hinnant ++__first1; 55523e519524SHoward Hinnant ++__first2; 55533e519524SHoward Hinnant } 55543e519524SHoward Hinnant } 5555ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55563e519524SHoward Hinnant} 55573e519524SHoward Hinnant 55583e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55603e519524SHoward Hinnant_OutputIterator 55613e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55623e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55633e519524SHoward Hinnant{ 5564145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55653e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55663e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55673e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5568145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55693e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55703e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5571145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55723e519524SHoward Hinnant} 55733e519524SHoward Hinnant 55743e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55763e519524SHoward Hinnant_OutputIterator 55773e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55783e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55793e519524SHoward Hinnant{ 5580ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55813e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55823e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55833e519524SHoward Hinnant} 55843e519524SHoward Hinnant 55853e519524SHoward Hinnant// lexicographical_compare 55863e519524SHoward Hinnant 55873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 55883e519524SHoward Hinnantbool 55893e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 55903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 55913e519524SHoward Hinnant{ 5592910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 55933e519524SHoward Hinnant { 55943e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 55953e519524SHoward Hinnant return true; 55963e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55973e519524SHoward Hinnant return false; 55983e519524SHoward Hinnant } 55993e519524SHoward Hinnant return false; 56003e519524SHoward Hinnant} 56013e519524SHoward Hinnant 56023e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56043e519524SHoward Hinnantbool 56053e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56063e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56073e519524SHoward Hinnant{ 5608145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56093e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56103e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56113e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5612145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56133e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56143e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5615145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56163e519524SHoward Hinnant} 56173e519524SHoward Hinnant 56183e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56203e519524SHoward Hinnantbool 56213e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56223e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56233e519524SHoward Hinnant{ 5624ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56253e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56263e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56273e519524SHoward Hinnant} 56283e519524SHoward Hinnant 56293e519524SHoward Hinnant// next_permutation 56303e519524SHoward Hinnant 56313e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56323e519524SHoward Hinnantbool 56333e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56343e519524SHoward Hinnant{ 56353e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56363e519524SHoward Hinnant if (__first == __last || __first == --__i) 56373e519524SHoward Hinnant return false; 56383e519524SHoward Hinnant while (true) 56393e519524SHoward Hinnant { 56403e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56413e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56423e519524SHoward Hinnant { 56433e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56443e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56453e519524SHoward Hinnant ; 56463e519524SHoward Hinnant swap(*__i, *__j); 5647ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56483e519524SHoward Hinnant return true; 56493e519524SHoward Hinnant } 56503e519524SHoward Hinnant if (__i == __first) 56513e519524SHoward Hinnant { 5652ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56533e519524SHoward Hinnant return false; 56543e519524SHoward Hinnant } 56553e519524SHoward Hinnant } 56563e519524SHoward Hinnant} 56573e519524SHoward Hinnant 56583e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56603e519524SHoward Hinnantbool 56613e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56623e519524SHoward Hinnant{ 5663145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56663e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5667145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56693e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5670145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56713e519524SHoward Hinnant} 56723e519524SHoward Hinnant 56733e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56753e519524SHoward Hinnantbool 56763e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56773e519524SHoward Hinnant{ 5678ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56793e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56803e519524SHoward Hinnant} 56813e519524SHoward Hinnant 56823e519524SHoward Hinnant// prev_permutation 56833e519524SHoward Hinnant 56843e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56853e519524SHoward Hinnantbool 56863e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56873e519524SHoward Hinnant{ 56883e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56893e519524SHoward Hinnant if (__first == __last || __first == --__i) 56903e519524SHoward Hinnant return false; 56913e519524SHoward Hinnant while (true) 56923e519524SHoward Hinnant { 56933e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56943e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 56953e519524SHoward Hinnant { 56963e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56973e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 56983e519524SHoward Hinnant ; 56993e519524SHoward Hinnant swap(*__i, *__j); 5700ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57013e519524SHoward Hinnant return true; 57023e519524SHoward Hinnant } 57033e519524SHoward Hinnant if (__i == __first) 57043e519524SHoward Hinnant { 5705ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57063e519524SHoward Hinnant return false; 57073e519524SHoward Hinnant } 57083e519524SHoward Hinnant } 57093e519524SHoward Hinnant} 57103e519524SHoward Hinnant 57113e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57133e519524SHoward Hinnantbool 57143e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57153e519524SHoward Hinnant{ 5716145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57173e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57183e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57193e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5720145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57213e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57223e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5723145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57243e519524SHoward Hinnant} 57253e519524SHoward Hinnant 57263e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57273e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57283e519524SHoward Hinnantbool 57293e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57303e519524SHoward Hinnant{ 5731ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57323e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57333e519524SHoward Hinnant} 57343e519524SHoward Hinnant 57353e519524SHoward Hinnanttemplate <class _Tp> 57363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57373e519524SHoward Hinnanttypename enable_if 57383e519524SHoward Hinnant< 57393e519524SHoward Hinnant is_integral<_Tp>::value, 57403e519524SHoward Hinnant _Tp 57413e519524SHoward Hinnant>::type 57423e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 57433e519524SHoward Hinnant{ 57443e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57453e519524SHoward Hinnant __n &= __bits; 57463e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 57473e519524SHoward Hinnant} 57483e519524SHoward Hinnant 57493e519524SHoward Hinnanttemplate <class _Tp> 57503e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57513e519524SHoward Hinnanttypename enable_if 57523e519524SHoward Hinnant< 57533e519524SHoward Hinnant is_integral<_Tp>::value, 57543e519524SHoward Hinnant _Tp 57553e519524SHoward Hinnant>::type 57563e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 57573e519524SHoward Hinnant{ 57583e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57593e519524SHoward Hinnant __n &= __bits; 57603e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 57613e519524SHoward Hinnant} 57623e519524SHoward Hinnant 57633e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57643e519524SHoward Hinnant 57653e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5766