13e519524SHoward Hinnant// -*- C++ -*- 23e519524SHoward Hinnant//===-------------------------- algorithm ---------------------------------===// 33e519524SHoward Hinnant// 45b08a8a4SHoward Hinnant// The LLVM Compiler Infrastructure 53e519524SHoward Hinnant// 6412dbebeSHoward Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 7412dbebeSHoward Hinnant// Source Licenses. See LICENSE.TXT for details. 83e519524SHoward Hinnant// 93e519524SHoward Hinnant//===----------------------------------------------------------------------===// 103e519524SHoward Hinnant 113e519524SHoward Hinnant#ifndef _LIBCPP_ALGORITHM 123e519524SHoward Hinnant#define _LIBCPP_ALGORITHM 133e519524SHoward Hinnant 143e519524SHoward Hinnant/* 153e519524SHoward Hinnant algorithm synopsis 163e519524SHoward Hinnant 173e519524SHoward Hinnant#include <initializer_list> 183e519524SHoward Hinnant 193e519524SHoward Hinnantnamespace std 203e519524SHoward Hinnant{ 213e519524SHoward Hinnant 223e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 233e519524SHoward Hinnant bool 243e519524SHoward Hinnant all_of(InputIterator first, InputIterator last, Predicate pred); 253e519524SHoward Hinnant 263e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 273e519524SHoward Hinnant bool 283e519524SHoward Hinnant any_of(InputIterator first, InputIterator last, Predicate pred); 293e519524SHoward Hinnant 303e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 313e519524SHoward Hinnant bool 323e519524SHoward Hinnant none_of(InputIterator first, InputIterator last, Predicate pred); 333e519524SHoward Hinnant 343e519524SHoward Hinnanttemplate <class InputIterator, class Function> 353e519524SHoward Hinnant Function 363e519524SHoward Hinnant for_each(InputIterator first, InputIterator last, Function f); 373e519524SHoward Hinnant 383e519524SHoward Hinnanttemplate <class InputIterator, class T> 393e519524SHoward Hinnant InputIterator 403e519524SHoward Hinnant find(InputIterator first, InputIterator last, const T& value); 413e519524SHoward Hinnant 423e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 433e519524SHoward Hinnant InputIterator 443e519524SHoward Hinnant find_if(InputIterator first, InputIterator last, Predicate pred); 453e519524SHoward Hinnant 463e519524SHoward Hinnanttemplate<class InputIterator, class Predicate> 473e519524SHoward Hinnant InputIterator 483e519524SHoward Hinnant find_if_not(InputIterator first, InputIterator last, Predicate pred); 493e519524SHoward Hinnant 503e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 513e519524SHoward Hinnant ForwardIterator1 523e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 533e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 543e519524SHoward Hinnant 553e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 563e519524SHoward Hinnant ForwardIterator1 573e519524SHoward Hinnant find_end(ForwardIterator1 first1, ForwardIterator1 last1, 583e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 593e519524SHoward Hinnant 603e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 613e519524SHoward Hinnant ForwardIterator1 623e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 633e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 643e519524SHoward Hinnant 653e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 663e519524SHoward Hinnant ForwardIterator1 673e519524SHoward Hinnant find_first_of(ForwardIterator1 first1, ForwardIterator1 last1, 683e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 693e519524SHoward Hinnant 703e519524SHoward Hinnanttemplate <class ForwardIterator> 713e519524SHoward Hinnant ForwardIterator 723e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last); 733e519524SHoward Hinnant 743e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 753e519524SHoward Hinnant ForwardIterator 763e519524SHoward Hinnant adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 773e519524SHoward Hinnant 783e519524SHoward Hinnanttemplate <class InputIterator, class T> 793e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 803e519524SHoward Hinnant count(InputIterator first, InputIterator last, const T& value); 813e519524SHoward Hinnant 823e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 833e519524SHoward Hinnant typename iterator_traits<InputIterator>::difference_type 843e519524SHoward Hinnant count_if(InputIterator first, InputIterator last, Predicate pred); 853e519524SHoward Hinnant 863e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 873e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 883e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 893e519524SHoward Hinnant 900b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 910b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 920b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 930b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 940b0bbd2fSMarshall Clow 953e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 963e519524SHoward Hinnant pair<InputIterator1, InputIterator2> 973e519524SHoward Hinnant mismatch(InputIterator1 first1, InputIterator1 last1, 983e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 993e519524SHoward Hinnant 1000b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1010b0bbd2fSMarshall Clow pair<InputIterator1, InputIterator2> 1020b0bbd2fSMarshall Clow mismatch(InputIterator1 first1, InputIterator1 last1, 1030b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1040b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1050b0bbd2fSMarshall Clow 1063e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 1073e519524SHoward Hinnant bool 1083e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); 1093e519524SHoward Hinnant 1100b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2> 1110b0bbd2fSMarshall Clow bool 1120b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1130b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2); // **C++14** 1140b0bbd2fSMarshall Clow 1153e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1163e519524SHoward Hinnant bool 1173e519524SHoward Hinnant equal(InputIterator1 first1, InputIterator1 last1, 1183e519524SHoward Hinnant InputIterator2 first2, BinaryPredicate pred); 1193e519524SHoward Hinnant 1200b0bbd2fSMarshall Clowtemplate <class InputIterator1, class InputIterator2, class BinaryPredicate> 1210b0bbd2fSMarshall Clow bool 1220b0bbd2fSMarshall Clow equal(InputIterator1 first1, InputIterator1 last1, 1230b0bbd2fSMarshall Clow InputIterator2 first2, InputIterator2 last2, 1240b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1250b0bbd2fSMarshall Clow 1263e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2> 1273e519524SHoward Hinnant bool 1283e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1293e519524SHoward Hinnant ForwardIterator2 first2); 1303e519524SHoward Hinnant 1310b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2> 1320b0bbd2fSMarshall Clow bool 1330b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1340b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2); // **C++14** 1350b0bbd2fSMarshall Clow 1363e519524SHoward Hinnanttemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1373e519524SHoward Hinnant bool 1383e519524SHoward Hinnant is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1393e519524SHoward Hinnant ForwardIterator2 first2, BinaryPredicate pred); 1403e519524SHoward Hinnant 1410b0bbd2fSMarshall Clowtemplate<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1420b0bbd2fSMarshall Clow bool 1430b0bbd2fSMarshall Clow is_permutation(ForwardIterator1 first1, ForwardIterator1 last1, 1440b0bbd2fSMarshall Clow ForwardIterator2 first2, ForwardIterator2 last2, 1450b0bbd2fSMarshall Clow BinaryPredicate pred); // **C++14** 1460b0bbd2fSMarshall Clow 1473e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1483e519524SHoward Hinnant ForwardIterator1 1493e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1503e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2); 1513e519524SHoward Hinnant 1523e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> 1533e519524SHoward Hinnant ForwardIterator1 1543e519524SHoward Hinnant search(ForwardIterator1 first1, ForwardIterator1 last1, 1553e519524SHoward Hinnant ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); 1563e519524SHoward Hinnant 1573e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T> 1583e519524SHoward Hinnant ForwardIterator 1593e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value); 1603e519524SHoward Hinnant 1613e519524SHoward Hinnanttemplate <class ForwardIterator, class Size, class T, class BinaryPredicate> 1623e519524SHoward Hinnant ForwardIterator 1633e519524SHoward Hinnant search_n(ForwardIterator first, ForwardIterator last, 1643e519524SHoward Hinnant Size count, const T& value, BinaryPredicate pred); 1653e519524SHoward Hinnant 1663e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 1673e519524SHoward Hinnant OutputIterator 1683e519524SHoward Hinnant copy(InputIterator first, InputIterator last, OutputIterator result); 1693e519524SHoward Hinnant 1703e519524SHoward Hinnanttemplate<class InputIterator, class OutputIterator, class Predicate> 1713e519524SHoward Hinnant OutputIterator 1723e519524SHoward Hinnant copy_if(InputIterator first, InputIterator last, 1733e519524SHoward Hinnant OutputIterator result, Predicate pred); 1743e519524SHoward Hinnant 1753e519524SHoward Hinnanttemplate<class InputIterator, class Size, class OutputIterator> 1763e519524SHoward Hinnant OutputIterator 1773e519524SHoward Hinnant copy_n(InputIterator first, Size n, OutputIterator result); 1783e519524SHoward Hinnant 1793e519524SHoward Hinnanttemplate <class BidirectionalIterator1, class BidirectionalIterator2> 1803e519524SHoward Hinnant BidirectionalIterator2 1813e519524SHoward Hinnant copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last, 1823e519524SHoward Hinnant BidirectionalIterator2 result); 1833e519524SHoward Hinnant 1843e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1853e519524SHoward Hinnant ForwardIterator2 1863e519524SHoward Hinnant swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2); 1873e519524SHoward Hinnant 1883e519524SHoward Hinnanttemplate <class ForwardIterator1, class ForwardIterator2> 1893e519524SHoward Hinnant void 1903e519524SHoward Hinnant iter_swap(ForwardIterator1 a, ForwardIterator2 b); 1913e519524SHoward Hinnant 1923e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class UnaryOperation> 1933e519524SHoward Hinnant OutputIterator 1943e519524SHoward Hinnant transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op); 1953e519524SHoward Hinnant 1963e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperation> 1973e519524SHoward Hinnant OutputIterator 1983e519524SHoward Hinnant transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, 1993e519524SHoward Hinnant OutputIterator result, BinaryOperation binary_op); 2003e519524SHoward Hinnant 2013e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2023e519524SHoward Hinnant void 2033e519524SHoward Hinnant replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value); 2043e519524SHoward Hinnant 2053e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate, class T> 2063e519524SHoward Hinnant void 2073e519524SHoward Hinnant replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value); 2083e519524SHoward Hinnant 2093e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2103e519524SHoward Hinnant OutputIterator 2113e519524SHoward Hinnant replace_copy(InputIterator first, InputIterator last, OutputIterator result, 2123e519524SHoward Hinnant const T& old_value, const T& new_value); 2133e519524SHoward Hinnant 2143e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate, class T> 2153e519524SHoward Hinnant OutputIterator 2163e519524SHoward Hinnant replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value); 2173e519524SHoward Hinnant 2183e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2193e519524SHoward Hinnant void 2203e519524SHoward Hinnant fill(ForwardIterator first, ForwardIterator last, const T& value); 2213e519524SHoward Hinnant 2223e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class T> 2233e519524SHoward Hinnant OutputIterator 2243e519524SHoward Hinnant fill_n(OutputIterator first, Size n, const T& value); 2253e519524SHoward Hinnant 2263e519524SHoward Hinnanttemplate <class ForwardIterator, class Generator> 2273e519524SHoward Hinnant void 2283e519524SHoward Hinnant generate(ForwardIterator first, ForwardIterator last, Generator gen); 2293e519524SHoward Hinnant 2303e519524SHoward Hinnanttemplate <class OutputIterator, class Size, class Generator> 2313e519524SHoward Hinnant OutputIterator 2323e519524SHoward Hinnant generate_n(OutputIterator first, Size n, Generator gen); 2333e519524SHoward Hinnant 2343e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 2353e519524SHoward Hinnant ForwardIterator 2363e519524SHoward Hinnant remove(ForwardIterator first, ForwardIterator last, const T& value); 2373e519524SHoward Hinnant 2383e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 2393e519524SHoward Hinnant ForwardIterator 2403e519524SHoward Hinnant remove_if(ForwardIterator first, ForwardIterator last, Predicate pred); 2413e519524SHoward Hinnant 2423e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class T> 2433e519524SHoward Hinnant OutputIterator 2443e519524SHoward Hinnant remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value); 2453e519524SHoward Hinnant 2463e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class Predicate> 2473e519524SHoward Hinnant OutputIterator 2483e519524SHoward Hinnant remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred); 2493e519524SHoward Hinnant 2503e519524SHoward Hinnanttemplate <class ForwardIterator> 2513e519524SHoward Hinnant ForwardIterator 2523e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last); 2533e519524SHoward Hinnant 2543e519524SHoward Hinnanttemplate <class ForwardIterator, class BinaryPredicate> 2553e519524SHoward Hinnant ForwardIterator 2563e519524SHoward Hinnant unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred); 2573e519524SHoward Hinnant 2583e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator> 2593e519524SHoward Hinnant OutputIterator 2603e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result); 2613e519524SHoward Hinnant 2623e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator, class BinaryPredicate> 2633e519524SHoward Hinnant OutputIterator 2643e519524SHoward Hinnant unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred); 2653e519524SHoward Hinnant 2663e519524SHoward Hinnanttemplate <class BidirectionalIterator> 2673e519524SHoward Hinnant void 2683e519524SHoward Hinnant reverse(BidirectionalIterator first, BidirectionalIterator last); 2693e519524SHoward Hinnant 2703e519524SHoward Hinnanttemplate <class BidirectionalIterator, class OutputIterator> 2713e519524SHoward Hinnant OutputIterator 2723e519524SHoward Hinnant reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result); 2733e519524SHoward Hinnant 2743e519524SHoward Hinnanttemplate <class ForwardIterator> 2753e519524SHoward Hinnant ForwardIterator 2763e519524SHoward Hinnant rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last); 2773e519524SHoward Hinnant 2783e519524SHoward Hinnanttemplate <class ForwardIterator, class OutputIterator> 2793e519524SHoward Hinnant OutputIterator 2803e519524SHoward Hinnant rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result); 2813e519524SHoward Hinnant 2823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 2833e519524SHoward Hinnant void 28406965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14 2853e519524SHoward Hinnant 2863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class RandomNumberGenerator> 2873e519524SHoward Hinnant void 28806965c1fSMarshall Clow random_shuffle(RandomAccessIterator first, RandomAccessIterator last, 28906965c1fSMarshall Clow RandomNumberGenerator& rand); // deprecated in C++14 2903e519524SHoward Hinnant 291f9d540b0SHoward Hinnanttemplate<class RandomAccessIterator, class UniformRandomNumberGenerator> 292f9d540b0SHoward Hinnant void shuffle(RandomAccessIterator first, RandomAccessIterator last, 293fb340102SHoward Hinnant UniformRandomNumberGenerator&& g); 294f9d540b0SHoward Hinnant 2953e519524SHoward Hinnanttemplate <class InputIterator, class Predicate> 2963e519524SHoward Hinnant bool 2973e519524SHoward Hinnant is_partitioned(InputIterator first, InputIterator last, Predicate pred); 2983e519524SHoward Hinnant 2993e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3003e519524SHoward Hinnant ForwardIterator 3013e519524SHoward Hinnant partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3023e519524SHoward Hinnant 3033e519524SHoward Hinnanttemplate <class InputIterator, class OutputIterator1, 3043e519524SHoward Hinnant class OutputIterator2, class Predicate> 3053e519524SHoward Hinnant pair<OutputIterator1, OutputIterator2> 3063e519524SHoward Hinnant partition_copy(InputIterator first, InputIterator last, 3073e519524SHoward Hinnant OutputIterator1 out_true, OutputIterator2 out_false, 3083e519524SHoward Hinnant Predicate pred); 3093e519524SHoward Hinnant 3103e519524SHoward Hinnanttemplate <class ForwardIterator, class Predicate> 3113e519524SHoward Hinnant ForwardIterator 3123e519524SHoward Hinnant stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred); 3133e519524SHoward Hinnant 3143e519524SHoward Hinnanttemplate<class ForwardIterator, class Predicate> 3153e519524SHoward Hinnant ForwardIterator 3163e519524SHoward Hinnant partition_point(ForwardIterator first, ForwardIterator last, Predicate pred); 3173e519524SHoward Hinnant 3183e519524SHoward Hinnanttemplate <class ForwardIterator> 3193e519524SHoward Hinnant bool 3203e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last); 3213e519524SHoward Hinnant 3223e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3233e519524SHoward Hinnant bool 3243e519524SHoward Hinnant is_sorted(ForwardIterator first, ForwardIterator last, Compare comp); 3253e519524SHoward Hinnant 3263e519524SHoward Hinnanttemplate<class ForwardIterator> 3273e519524SHoward Hinnant ForwardIterator 3283e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last); 3293e519524SHoward Hinnant 3303e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 3313e519524SHoward Hinnant ForwardIterator 3323e519524SHoward Hinnant is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp); 3333e519524SHoward Hinnant 3343e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3353e519524SHoward Hinnant void 3363e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last); 3373e519524SHoward Hinnant 3383e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3393e519524SHoward Hinnant void 3403e519524SHoward Hinnant sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3413e519524SHoward Hinnant 3423e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3433e519524SHoward Hinnant void 3443e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last); 3453e519524SHoward Hinnant 3463e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3473e519524SHoward Hinnant void 3483e519524SHoward Hinnant stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 3493e519524SHoward Hinnant 3503e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3513e519524SHoward Hinnant void 3523e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last); 3533e519524SHoward Hinnant 3543e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3553e519524SHoward Hinnant void 3563e519524SHoward Hinnant partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp); 3573e519524SHoward Hinnant 3583e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator> 3593e519524SHoward Hinnant RandomAccessIterator 3603e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3613e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last); 3623e519524SHoward Hinnant 3633e519524SHoward Hinnanttemplate <class InputIterator, class RandomAccessIterator, class Compare> 3643e519524SHoward Hinnant RandomAccessIterator 3653e519524SHoward Hinnant partial_sort_copy(InputIterator first, InputIterator last, 3663e519524SHoward Hinnant RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp); 3673e519524SHoward Hinnant 3683e519524SHoward Hinnanttemplate <class RandomAccessIterator> 3693e519524SHoward Hinnant void 3703e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last); 3713e519524SHoward Hinnant 3723e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 3733e519524SHoward Hinnant void 3743e519524SHoward Hinnant nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp); 3753e519524SHoward Hinnant 3763e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3773e519524SHoward Hinnant ForwardIterator 3783e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value); 3793e519524SHoward Hinnant 3803e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3813e519524SHoward Hinnant ForwardIterator 3823e519524SHoward Hinnant lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3833e519524SHoward Hinnant 3843e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3853e519524SHoward Hinnant ForwardIterator 3863e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value); 3873e519524SHoward Hinnant 3883e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3893e519524SHoward Hinnant ForwardIterator 3903e519524SHoward Hinnant upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3913e519524SHoward Hinnant 3923e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 3933e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3943e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value); 3953e519524SHoward Hinnant 3963e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 3973e519524SHoward Hinnant pair<ForwardIterator, ForwardIterator> 3983e519524SHoward Hinnant equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 3993e519524SHoward Hinnant 4003e519524SHoward Hinnanttemplate <class ForwardIterator, class T> 4013e519524SHoward Hinnant bool 4023e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value); 4033e519524SHoward Hinnant 4043e519524SHoward Hinnanttemplate <class ForwardIterator, class T, class Compare> 4053e519524SHoward Hinnant bool 4063e519524SHoward Hinnant binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp); 4073e519524SHoward Hinnant 4083e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4093e519524SHoward Hinnant OutputIterator 4103e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4113e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4123e519524SHoward Hinnant 4133e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4143e519524SHoward Hinnant OutputIterator 4153e519524SHoward Hinnant merge(InputIterator1 first1, InputIterator1 last1, 4163e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4173e519524SHoward Hinnant 4183e519524SHoward Hinnanttemplate <class BidirectionalIterator> 4193e519524SHoward Hinnant void 4203e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last); 4213e519524SHoward Hinnant 4223e519524SHoward Hinnanttemplate <class BidirectionalIterator, class Compare> 4233e519524SHoward Hinnant void 4243e519524SHoward Hinnant inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp); 4253e519524SHoward Hinnant 4263e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2> 4273e519524SHoward Hinnant bool 4283e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2); 4293e519524SHoward Hinnant 4303e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class Compare> 4313e519524SHoward Hinnant bool 4323e519524SHoward Hinnant includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp); 4333e519524SHoward Hinnant 4343e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4353e519524SHoward Hinnant OutputIterator 4363e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4373e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4383e519524SHoward Hinnant 4393e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4403e519524SHoward Hinnant OutputIterator 4413e519524SHoward Hinnant set_union(InputIterator1 first1, InputIterator1 last1, 4423e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4433e519524SHoward Hinnant 4443e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4453e519524SHoward Hinnant OutputIterator 4463e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4473e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4483e519524SHoward Hinnant 4493e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4503e519524SHoward Hinnant OutputIterator 4513e519524SHoward Hinnant set_intersection(InputIterator1 first1, InputIterator1 last1, 4523e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4533e519524SHoward Hinnant 4543e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4553e519524SHoward Hinnant OutputIterator 4563e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4573e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4583e519524SHoward Hinnant 4593e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4603e519524SHoward Hinnant OutputIterator 4613e519524SHoward Hinnant set_difference(InputIterator1 first1, InputIterator1 last1, 4623e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4633e519524SHoward Hinnant 4643e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator> 4653e519524SHoward Hinnant OutputIterator 4663e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4673e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result); 4683e519524SHoward Hinnant 4693e519524SHoward Hinnanttemplate <class InputIterator1, class InputIterator2, class OutputIterator, class Compare> 4703e519524SHoward Hinnant OutputIterator 4713e519524SHoward Hinnant set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, 4723e519524SHoward Hinnant InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp); 4733e519524SHoward Hinnant 4743e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4753e519524SHoward Hinnant void 4763e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last); 4773e519524SHoward Hinnant 4783e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4793e519524SHoward Hinnant void 4803e519524SHoward Hinnant push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4813e519524SHoward Hinnant 4823e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4833e519524SHoward Hinnant void 4843e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last); 4853e519524SHoward Hinnant 4863e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4873e519524SHoward Hinnant void 4883e519524SHoward Hinnant pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4893e519524SHoward Hinnant 4903e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4913e519524SHoward Hinnant void 4923e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last); 4933e519524SHoward Hinnant 4943e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 4953e519524SHoward Hinnant void 4963e519524SHoward Hinnant make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 4973e519524SHoward Hinnant 4983e519524SHoward Hinnanttemplate <class RandomAccessIterator> 4993e519524SHoward Hinnant void 5003e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last); 5013e519524SHoward Hinnant 5023e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5033e519524SHoward Hinnant void 5043e519524SHoward Hinnant sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); 5053e519524SHoward Hinnant 5063e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5073e519524SHoward Hinnant bool 5083e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last); 5093e519524SHoward Hinnant 5103e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5113e519524SHoward Hinnant bool 5123e519524SHoward Hinnant is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5133e519524SHoward Hinnant 5143e519524SHoward Hinnanttemplate <class RandomAccessIterator> 5153e519524SHoward Hinnant RandomAccessIterator 5163e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last); 5173e519524SHoward Hinnant 5183e519524SHoward Hinnanttemplate <class RandomAccessIterator, class Compare> 5193e519524SHoward Hinnant RandomAccessIterator 5203e519524SHoward Hinnant is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp); 5213e519524SHoward Hinnant 5224eb27b79SHoward Hinnanttemplate <class ForwardIterator> 5234eb27b79SHoward Hinnant ForwardIterator 5240b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5254eb27b79SHoward Hinnant 5264eb27b79SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5274eb27b79SHoward Hinnant ForwardIterator 5280b0671aeSMarshall Clow min_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 5294eb27b79SHoward Hinnant 5303e519524SHoward Hinnanttemplate <class T> 5313e519524SHoward Hinnant const T& 5329d67c6d5SMarshall Clow min(const T& a, const T& b); // constexpr in C++14 5333e519524SHoward Hinnant 5343e519524SHoward Hinnanttemplate <class T, class Compare> 5353e519524SHoward Hinnant const T& 5369d67c6d5SMarshall Clow min(const T& a, const T& b, Compare comp); // constexpr in C++14 5373e519524SHoward Hinnant 5383e519524SHoward Hinnanttemplate<class T> 5394eb27b79SHoward Hinnant T 5409d67c6d5SMarshall Clow min(initializer_list<T> t); // constexpr in C++14 5413e519524SHoward Hinnant 5423e519524SHoward Hinnanttemplate<class T, class Compare> 5434eb27b79SHoward Hinnant T 5449d67c6d5SMarshall Clow min(initializer_list<T> t, Compare comp); // constexpr in C++14 5453e519524SHoward Hinnant 5463e519524SHoward Hinnanttemplate <class ForwardIterator> 5473e519524SHoward Hinnant ForwardIterator 5480b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5493e519524SHoward Hinnant 5503e519524SHoward Hinnanttemplate <class ForwardIterator, class Compare> 5513e519524SHoward Hinnant ForwardIterator 5520b0671aeSMarshall Clow max_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 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> 5720b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last); // constexpr in C++14 5734eb27b79SHoward Hinnant 5744eb27b79SHoward Hinnanttemplate<class ForwardIterator, class Compare> 5754eb27b79SHoward Hinnant pair<ForwardIterator, ForwardIterator> 5760b0671aeSMarshall Clow minmax_element(ForwardIterator first, ForwardIterator last, Compare comp); // constexpr in C++14 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 1330847ee131SEric 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> 167551544023SEric Fiselier (__first, __last, __convert_to_integral(__count), __value_, __pred, 167651544023SEric Fiselier typename iterator_traits<_ForwardIterator>::iterator_category()); 16773e519524SHoward Hinnant} 16783e519524SHoward Hinnant 16793e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Size, class _Tp> 16803e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 16813e519524SHoward Hinnant_ForwardIterator 1682e4383379SHoward Hinnantsearch_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value_) 16833e519524SHoward Hinnant{ 16843e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 168551544023SEric Fiselier return _VSTD::search_n(__first, __last, __convert_to_integral(__count), 168651544023SEric Fiselier __value_, __equal_to<__v, _Tp>()); 16873e519524SHoward Hinnant} 16883e519524SHoward Hinnant 16893e519524SHoward Hinnant// copy 16903e519524SHoward Hinnant 16913e519524SHoward Hinnanttemplate <class _Iter> 16923e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator 16933e519524SHoward Hinnant{ 16943e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 16953e519524SHoward Hinnant}; 16963e519524SHoward Hinnant 16973e519524SHoward Hinnanttemplate <class _Iter> 16983e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<move_iterator<_Iter> > 16993e519524SHoward Hinnant{ 17003e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 17013e519524SHoward Hinnant}; 17023e519524SHoward Hinnant 17033e519524SHoward Hinnanttemplate <class _Iter> 17043e519524SHoward Hinnantstruct __libcpp_is_trivial_iterator<__wrap_iter<_Iter> > 17053e519524SHoward Hinnant{ 17063e519524SHoward Hinnant static const bool value = is_pointer<_Iter>::value; 17073e519524SHoward Hinnant}; 17083e519524SHoward Hinnant 17093e519524SHoward Hinnanttemplate <class _Iter> 17103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17113e519524SHoward Hinnant_Iter 17123e519524SHoward Hinnant__unwrap_iter(_Iter __i) 17133e519524SHoward Hinnant{ 17143e519524SHoward Hinnant return __i; 17153e519524SHoward Hinnant} 17163e519524SHoward Hinnant 17173e519524SHoward Hinnanttemplate <class _Tp> 17183e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17193e519524SHoward Hinnanttypename enable_if 17203e519524SHoward Hinnant< 1721ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17223e519524SHoward Hinnant _Tp* 17233e519524SHoward Hinnant>::type 17243e519524SHoward Hinnant__unwrap_iter(move_iterator<_Tp*> __i) 17253e519524SHoward Hinnant{ 17263e519524SHoward Hinnant return __i.base(); 17273e519524SHoward Hinnant} 17283e519524SHoward Hinnant 1729fc88dbd2SHoward Hinnant#if _LIBCPP_DEBUG_LEVEL < 2 1730fc88dbd2SHoward Hinnant 17313e519524SHoward Hinnanttemplate <class _Tp> 17323e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17333e519524SHoward Hinnanttypename enable_if 17343e519524SHoward Hinnant< 1735ca740483SHoward Hinnant is_trivially_copy_assignable<_Tp>::value, 17363e519524SHoward Hinnant _Tp* 17373e519524SHoward Hinnant>::type 17383e519524SHoward Hinnant__unwrap_iter(__wrap_iter<_Tp*> __i) 17393e519524SHoward Hinnant{ 17403e519524SHoward Hinnant return __i.base(); 17413e519524SHoward Hinnant} 17423e519524SHoward Hinnant 1743fc88dbd2SHoward Hinnant#endif // _LIBCPP_DEBUG_LEVEL < 2 1744fc88dbd2SHoward Hinnant 17453e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17473e519524SHoward Hinnant_OutputIterator 17483e519524SHoward Hinnant__copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17493e519524SHoward Hinnant{ 1750910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 17513e519524SHoward Hinnant *__result = *__first; 17523e519524SHoward Hinnant return __result; 17533e519524SHoward Hinnant} 17543e519524SHoward Hinnant 17553e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17563e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17573e519524SHoward Hinnanttypename enable_if 17583e519524SHoward Hinnant< 17593e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1760ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17613e519524SHoward Hinnant _Up* 17623e519524SHoward Hinnant>::type 17633e519524SHoward Hinnant__copy(_Tp* __first, _Tp* __last, _Up* __result) 17643e519524SHoward Hinnant{ 17653e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 17665b312052SMarshall Clow if (__n > 0) 1767ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 17683e519524SHoward Hinnant return __result + __n; 17693e519524SHoward Hinnant} 17703e519524SHoward Hinnant 17713e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 17723e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17733e519524SHoward Hinnant_OutputIterator 17743e519524SHoward Hinnantcopy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 17753e519524SHoward Hinnant{ 1776ce48a113SHoward Hinnant return _VSTD::__copy(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 17773e519524SHoward Hinnant} 17783e519524SHoward Hinnant 17793e519524SHoward Hinnant// copy_backward 17803e519524SHoward Hinnant 1781d3d4356fSHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 17823e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17833e519524SHoward Hinnant_OutputIterator 1784d3d4356fSHoward Hinnant__copy_backward(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 17853e519524SHoward Hinnant{ 17863e519524SHoward Hinnant while (__first != __last) 17873e519524SHoward Hinnant *--__result = *--__last; 17883e519524SHoward Hinnant return __result; 17893e519524SHoward Hinnant} 17903e519524SHoward Hinnant 17913e519524SHoward Hinnanttemplate <class _Tp, class _Up> 17923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 17933e519524SHoward Hinnanttypename enable_if 17943e519524SHoward Hinnant< 17953e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1796ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 17973e519524SHoward Hinnant _Up* 17983e519524SHoward Hinnant>::type 17993e519524SHoward Hinnant__copy_backward(_Tp* __first, _Tp* __last, _Up* __result) 18003e519524SHoward Hinnant{ 18013e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 18025b312052SMarshall Clow if (__n > 0) 18035b312052SMarshall Clow { 18043e519524SHoward Hinnant __result -= __n; 1805ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 18065b312052SMarshall Clow } 18073e519524SHoward Hinnant return __result; 18083e519524SHoward Hinnant} 18093e519524SHoward Hinnant 18103e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 18113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18123e519524SHoward Hinnant_BidirectionalIterator2 18133e519524SHoward Hinnantcopy_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 18143e519524SHoward Hinnant _BidirectionalIterator2 __result) 18153e519524SHoward Hinnant{ 1816ce48a113SHoward Hinnant return _VSTD::__copy_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 18173e519524SHoward Hinnant} 18183e519524SHoward Hinnant 18193e519524SHoward Hinnant// copy_if 18203e519524SHoward Hinnant 18213e519524SHoward Hinnanttemplate<class _InputIterator, class _OutputIterator, class _Predicate> 18223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18233e519524SHoward Hinnant_OutputIterator 18243e519524SHoward Hinnantcopy_if(_InputIterator __first, _InputIterator __last, 18253e519524SHoward Hinnant _OutputIterator __result, _Predicate __pred) 18263e519524SHoward Hinnant{ 18273e519524SHoward Hinnant for (; __first != __last; ++__first) 18283e519524SHoward Hinnant { 18293e519524SHoward Hinnant if (__pred(*__first)) 18303e519524SHoward Hinnant { 18313e519524SHoward Hinnant *__result = *__first; 18323e519524SHoward Hinnant ++__result; 18333e519524SHoward Hinnant } 18343e519524SHoward Hinnant } 18353e519524SHoward Hinnant return __result; 18363e519524SHoward Hinnant} 18373e519524SHoward Hinnant 18383e519524SHoward Hinnant// copy_n 18393e519524SHoward Hinnant 18403e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18413e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18423e519524SHoward Hinnanttypename enable_if 18433e519524SHoward Hinnant< 18443e519524SHoward Hinnant __is_input_iterator<_InputIterator>::value && 18453e519524SHoward Hinnant !__is_random_access_iterator<_InputIterator>::value, 18463e519524SHoward Hinnant _OutputIterator 18473e519524SHoward Hinnant>::type 184851544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18493e519524SHoward Hinnant{ 185051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 185151544023SEric Fiselier _IntegralSize __n = __orig_n; 185299847d2bSHoward Hinnant if (__n > 0) 185399847d2bSHoward Hinnant { 18543e519524SHoward Hinnant *__result = *__first; 185599847d2bSHoward Hinnant ++__result; 185699847d2bSHoward Hinnant for (--__n; __n > 0; --__n) 185799847d2bSHoward Hinnant { 185899847d2bSHoward Hinnant ++__first; 185999847d2bSHoward Hinnant *__result = *__first; 186099847d2bSHoward Hinnant ++__result; 186199847d2bSHoward Hinnant } 186299847d2bSHoward Hinnant } 18633e519524SHoward Hinnant return __result; 18643e519524SHoward Hinnant} 18653e519524SHoward Hinnant 18663e519524SHoward Hinnanttemplate<class _InputIterator, class _Size, class _OutputIterator> 18673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18683e519524SHoward Hinnanttypename enable_if 18693e519524SHoward Hinnant< 18703e519524SHoward Hinnant __is_random_access_iterator<_InputIterator>::value, 18713e519524SHoward Hinnant _OutputIterator 18723e519524SHoward Hinnant>::type 187351544023SEric Fiseliercopy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) 18743e519524SHoward Hinnant{ 187551544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 187651544023SEric Fiselier _IntegralSize __n = __orig_n; 1877ce48a113SHoward Hinnant return _VSTD::copy(__first, __first + __n, __result); 18783e519524SHoward Hinnant} 18793e519524SHoward Hinnant 18803e519524SHoward Hinnant// move 18813e519524SHoward Hinnant 18823e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 18833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18843e519524SHoward Hinnant_OutputIterator 18853e519524SHoward Hinnant__move(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 18863e519524SHoward Hinnant{ 1887910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 1888ce48a113SHoward Hinnant *__result = _VSTD::move(*__first); 18893e519524SHoward Hinnant return __result; 18903e519524SHoward Hinnant} 18913e519524SHoward Hinnant 18923e519524SHoward Hinnanttemplate <class _Tp, class _Up> 18933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 18943e519524SHoward Hinnanttypename enable_if 18953e519524SHoward Hinnant< 18963e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1897ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 18983e519524SHoward Hinnant _Up* 18993e519524SHoward Hinnant>::type 19003e519524SHoward Hinnant__move(_Tp* __first, _Tp* __last, _Up* __result) 19013e519524SHoward Hinnant{ 19023e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19035b312052SMarshall Clow if (__n > 0) 1904ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19053e519524SHoward Hinnant return __result + __n; 19063e519524SHoward Hinnant} 19073e519524SHoward Hinnant 19083e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19093e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19103e519524SHoward Hinnant_OutputIterator 19113e519524SHoward Hinnantmove(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19123e519524SHoward Hinnant{ 1913ce48a113SHoward Hinnant return _VSTD::__move(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19143e519524SHoward Hinnant} 19153e519524SHoward Hinnant 19163e519524SHoward Hinnant// move_backward 19173e519524SHoward Hinnant 19183e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 19193e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19203e519524SHoward Hinnant_OutputIterator 19213e519524SHoward Hinnant__move_backward(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 19223e519524SHoward Hinnant{ 19233e519524SHoward Hinnant while (__first != __last) 1924ce48a113SHoward Hinnant *--__result = _VSTD::move(*--__last); 19253e519524SHoward Hinnant return __result; 19263e519524SHoward Hinnant} 19273e519524SHoward Hinnant 19283e519524SHoward Hinnanttemplate <class _Tp, class _Up> 19293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19303e519524SHoward Hinnanttypename enable_if 19313e519524SHoward Hinnant< 19323e519524SHoward Hinnant is_same<typename remove_const<_Tp>::type, _Up>::value && 1933ca740483SHoward Hinnant is_trivially_copy_assignable<_Up>::value, 19343e519524SHoward Hinnant _Up* 19353e519524SHoward Hinnant>::type 19363e519524SHoward Hinnant__move_backward(_Tp* __first, _Tp* __last, _Up* __result) 19373e519524SHoward Hinnant{ 19383e519524SHoward Hinnant const size_t __n = static_cast<size_t>(__last - __first); 19395b312052SMarshall Clow if (__n > 0) 19405b312052SMarshall Clow { 19413e519524SHoward Hinnant __result -= __n; 1942ce48a113SHoward Hinnant _VSTD::memmove(__result, __first, __n * sizeof(_Up)); 19435b312052SMarshall Clow } 19443e519524SHoward Hinnant return __result; 19453e519524SHoward Hinnant} 19463e519524SHoward Hinnant 19473e519524SHoward Hinnanttemplate <class _BidirectionalIterator1, class _BidirectionalIterator2> 19483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19493e519524SHoward Hinnant_BidirectionalIterator2 19503e519524SHoward Hinnantmove_backward(_BidirectionalIterator1 __first, _BidirectionalIterator1 __last, 19513e519524SHoward Hinnant _BidirectionalIterator2 __result) 19523e519524SHoward Hinnant{ 1953ce48a113SHoward Hinnant return _VSTD::__move_backward(__unwrap_iter(__first), __unwrap_iter(__last), __unwrap_iter(__result)); 19543e519524SHoward Hinnant} 19553e519524SHoward Hinnant 19563e519524SHoward Hinnant// iter_swap 19573e519524SHoward Hinnant 1958a676f7d3SHoward Hinnant// moved to <type_traits> for better swap / noexcept support 19593e519524SHoward Hinnant 19603e519524SHoward Hinnant// transform 19613e519524SHoward Hinnant 19623e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _UnaryOperation> 19633e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19643e519524SHoward Hinnant_OutputIterator 19653e519524SHoward Hinnanttransform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __op) 19663e519524SHoward Hinnant{ 1967910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 19683e519524SHoward Hinnant *__result = __op(*__first); 19693e519524SHoward Hinnant return __result; 19703e519524SHoward Hinnant} 19713e519524SHoward Hinnant 19723e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _BinaryOperation> 19733e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19743e519524SHoward Hinnant_OutputIterator 19753e519524SHoward Hinnanttransform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, 19763e519524SHoward Hinnant _OutputIterator __result, _BinaryOperation __binary_op) 19773e519524SHoward Hinnant{ 1978910285b2SEric Fiselier for (; __first1 != __last1; ++__first1, (void) ++__first2, ++__result) 19793e519524SHoward Hinnant *__result = __binary_op(*__first1, *__first2); 19803e519524SHoward Hinnant return __result; 19813e519524SHoward Hinnant} 19823e519524SHoward Hinnant 19833e519524SHoward Hinnant// replace 19843e519524SHoward Hinnant 19853e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 19863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19873e519524SHoward Hinnantvoid 19883e519524SHoward Hinnantreplace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) 19893e519524SHoward Hinnant{ 19903e519524SHoward Hinnant for (; __first != __last; ++__first) 19913e519524SHoward Hinnant if (*__first == __old_value) 19923e519524SHoward Hinnant *__first = __new_value; 19933e519524SHoward Hinnant} 19943e519524SHoward Hinnant 19953e519524SHoward Hinnant// replace_if 19963e519524SHoward Hinnant 19973e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate, class _Tp> 19983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 19993e519524SHoward Hinnantvoid 20003e519524SHoward Hinnantreplace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) 20013e519524SHoward Hinnant{ 20023e519524SHoward Hinnant for (; __first != __last; ++__first) 20033e519524SHoward Hinnant if (__pred(*__first)) 20043e519524SHoward Hinnant *__first = __new_value; 20053e519524SHoward Hinnant} 20063e519524SHoward Hinnant 20073e519524SHoward Hinnant// replace_copy 20083e519524SHoward Hinnant 20093e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 20103e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20113e519524SHoward Hinnant_OutputIterator 20123e519524SHoward Hinnantreplace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20133e519524SHoward Hinnant const _Tp& __old_value, const _Tp& __new_value) 20143e519524SHoward Hinnant{ 2015910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20163e519524SHoward Hinnant if (*__first == __old_value) 20173e519524SHoward Hinnant *__result = __new_value; 20183e519524SHoward Hinnant else 20193e519524SHoward Hinnant *__result = *__first; 20203e519524SHoward Hinnant return __result; 20213e519524SHoward Hinnant} 20223e519524SHoward Hinnant 20233e519524SHoward Hinnant// replace_copy_if 20243e519524SHoward Hinnant 20253e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate, class _Tp> 20263e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20273e519524SHoward Hinnant_OutputIterator 20283e519524SHoward Hinnantreplace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, 20293e519524SHoward Hinnant _Predicate __pred, const _Tp& __new_value) 20303e519524SHoward Hinnant{ 2031910285b2SEric Fiselier for (; __first != __last; ++__first, (void) ++__result) 20323e519524SHoward Hinnant if (__pred(*__first)) 20333e519524SHoward Hinnant *__result = __new_value; 20343e519524SHoward Hinnant else 20353e519524SHoward Hinnant *__result = *__first; 20363e519524SHoward Hinnant return __result; 20373e519524SHoward Hinnant} 20383e519524SHoward Hinnant 20393e519524SHoward Hinnant// fill_n 20403e519524SHoward Hinnant 20413e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20423e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20433e519524SHoward Hinnant_OutputIterator 20440f242beaSHoward Hinnant__fill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20453e519524SHoward Hinnant{ 2046910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 2047e4383379SHoward Hinnant *__first = __value_; 20483e519524SHoward Hinnant return __first; 20493e519524SHoward Hinnant} 20503e519524SHoward Hinnant 20510f242beaSHoward Hinnanttemplate <class _Tp, class _Size, class _Up> 20523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20530f242beaSHoward Hinnanttypename enable_if 20540f242beaSHoward Hinnant< 20550f242beaSHoward Hinnant is_integral<_Tp>::value && sizeof(_Tp) == 1 && 20560f242beaSHoward Hinnant !is_same<_Tp, bool>::value && 20570f242beaSHoward Hinnant is_integral<_Up>::value && sizeof(_Up) == 1, 20580f242beaSHoward Hinnant _Tp* 20590f242beaSHoward Hinnant>::type 20600f242beaSHoward Hinnant__fill_n(_Tp* __first, _Size __n,_Up __value_) 20613e519524SHoward Hinnant{ 20623e519524SHoward Hinnant if (__n > 0) 2063e4383379SHoward Hinnant _VSTD::memset(__first, (unsigned char)__value_, (size_t)(__n)); 20643e519524SHoward Hinnant return __first + __n; 20653e519524SHoward Hinnant} 20663e519524SHoward Hinnant 20673e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Tp> 20683e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20693e519524SHoward Hinnant_OutputIterator 2070e4383379SHoward Hinnantfill_n(_OutputIterator __first, _Size __n, const _Tp& __value_) 20713e519524SHoward Hinnant{ 207251544023SEric Fiselier return _VSTD::__fill_n(__first, __convert_to_integral(__n), __value_); 20733e519524SHoward Hinnant} 20743e519524SHoward Hinnant 20753e519524SHoward Hinnant// fill 20763e519524SHoward Hinnant 20773e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20793e519524SHoward Hinnantvoid 2080e4383379SHoward Hinnant__fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, forward_iterator_tag) 20813e519524SHoward Hinnant{ 20823e519524SHoward Hinnant for (; __first != __last; ++__first) 2083e4383379SHoward Hinnant *__first = __value_; 20843e519524SHoward Hinnant} 20853e519524SHoward Hinnant 20863e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Tp> 20873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20883e519524SHoward Hinnantvoid 2089e4383379SHoward Hinnant__fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value_, random_access_iterator_tag) 20903e519524SHoward Hinnant{ 2091e4383379SHoward Hinnant _VSTD::fill_n(__first, __last - __first, __value_); 20923e519524SHoward Hinnant} 20933e519524SHoward Hinnant 20943e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 20953e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 20963e519524SHoward Hinnantvoid 2097e4383379SHoward Hinnantfill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 20983e519524SHoward Hinnant{ 2099e4383379SHoward Hinnant _VSTD::__fill(__first, __last, __value_, typename iterator_traits<_ForwardIterator>::iterator_category()); 21003e519524SHoward Hinnant} 21013e519524SHoward Hinnant 21023e519524SHoward Hinnant// generate 21033e519524SHoward Hinnant 21043e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Generator> 21053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21063e519524SHoward Hinnantvoid 21073e519524SHoward Hinnantgenerate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) 21083e519524SHoward Hinnant{ 21093e519524SHoward Hinnant for (; __first != __last; ++__first) 21103e519524SHoward Hinnant *__first = __gen(); 21113e519524SHoward Hinnant} 21123e519524SHoward Hinnant 21133e519524SHoward Hinnant// generate_n 21143e519524SHoward Hinnant 21153e519524SHoward Hinnanttemplate <class _OutputIterator, class _Size, class _Generator> 21163e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21173e519524SHoward Hinnant_OutputIterator 211851544023SEric Fiseliergenerate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) 21193e519524SHoward Hinnant{ 212051544023SEric Fiselier typedef decltype(__convert_to_integral(__orig_n)) _IntegralSize; 212151544023SEric Fiselier _IntegralSize __n = __orig_n; 2122910285b2SEric Fiselier for (; __n > 0; ++__first, (void) --__n) 21233e519524SHoward Hinnant *__first = __gen(); 21243e519524SHoward Hinnant return __first; 21253e519524SHoward Hinnant} 21263e519524SHoward Hinnant 21273e519524SHoward Hinnant// remove 21283e519524SHoward Hinnant 21293e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 21303e519524SHoward Hinnant_ForwardIterator 2131e4383379SHoward Hinnantremove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 21323e519524SHoward Hinnant{ 2133e4383379SHoward Hinnant __first = _VSTD::find(__first, __last, __value_); 21343e519524SHoward Hinnant if (__first != __last) 21353e519524SHoward Hinnant { 21363e519524SHoward Hinnant _ForwardIterator __i = __first; 21373e519524SHoward Hinnant while (++__i != __last) 21383e519524SHoward Hinnant { 2139e4383379SHoward Hinnant if (!(*__i == __value_)) 21403e519524SHoward Hinnant { 2141ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21423e519524SHoward Hinnant ++__first; 21433e519524SHoward Hinnant } 21443e519524SHoward Hinnant } 21453e519524SHoward Hinnant } 21463e519524SHoward Hinnant return __first; 21473e519524SHoward Hinnant} 21483e519524SHoward Hinnant 21493e519524SHoward Hinnant// remove_if 21503e519524SHoward Hinnant 21513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 21523e519524SHoward Hinnant_ForwardIterator 21533e519524SHoward Hinnantremove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 21543e519524SHoward Hinnant{ 2155ce48a113SHoward Hinnant __first = _VSTD::find_if<_ForwardIterator, typename add_lvalue_reference<_Predicate>::type> 21563e519524SHoward Hinnant (__first, __last, __pred); 21573e519524SHoward Hinnant if (__first != __last) 21583e519524SHoward Hinnant { 21593e519524SHoward Hinnant _ForwardIterator __i = __first; 21603e519524SHoward Hinnant while (++__i != __last) 21613e519524SHoward Hinnant { 21623e519524SHoward Hinnant if (!__pred(*__i)) 21633e519524SHoward Hinnant { 2164ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 21653e519524SHoward Hinnant ++__first; 21663e519524SHoward Hinnant } 21673e519524SHoward Hinnant } 21683e519524SHoward Hinnant } 21693e519524SHoward Hinnant return __first; 21703e519524SHoward Hinnant} 21713e519524SHoward Hinnant 21723e519524SHoward Hinnant// remove_copy 21733e519524SHoward Hinnant 21743e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Tp> 21753e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21763e519524SHoward Hinnant_OutputIterator 2177e4383379SHoward Hinnantremove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value_) 21783e519524SHoward Hinnant{ 21793e519524SHoward Hinnant for (; __first != __last; ++__first) 21803e519524SHoward Hinnant { 2181e4383379SHoward Hinnant if (!(*__first == __value_)) 21823e519524SHoward Hinnant { 21833e519524SHoward Hinnant *__result = *__first; 21843e519524SHoward Hinnant ++__result; 21853e519524SHoward Hinnant } 21863e519524SHoward Hinnant } 21873e519524SHoward Hinnant return __result; 21883e519524SHoward Hinnant} 21893e519524SHoward Hinnant 21903e519524SHoward Hinnant// remove_copy_if 21913e519524SHoward Hinnant 21923e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _Predicate> 21933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 21943e519524SHoward Hinnant_OutputIterator 21953e519524SHoward Hinnantremove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) 21963e519524SHoward Hinnant{ 21973e519524SHoward Hinnant for (; __first != __last; ++__first) 21983e519524SHoward Hinnant { 21993e519524SHoward Hinnant if (!__pred(*__first)) 22003e519524SHoward Hinnant { 22013e519524SHoward Hinnant *__result = *__first; 22023e519524SHoward Hinnant ++__result; 22033e519524SHoward Hinnant } 22043e519524SHoward Hinnant } 22053e519524SHoward Hinnant return __result; 22063e519524SHoward Hinnant} 22073e519524SHoward Hinnant 22083e519524SHoward Hinnant// unique 22093e519524SHoward Hinnant 22103e519524SHoward Hinnanttemplate <class _ForwardIterator, class _BinaryPredicate> 22113e519524SHoward Hinnant_ForwardIterator 22123e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) 22133e519524SHoward Hinnant{ 2214ce48a113SHoward Hinnant __first = _VSTD::adjacent_find<_ForwardIterator, typename add_lvalue_reference<_BinaryPredicate>::type> 22153e519524SHoward Hinnant (__first, __last, __pred); 22163e519524SHoward Hinnant if (__first != __last) 22173e519524SHoward Hinnant { 22183e519524SHoward Hinnant // ... a a ? ... 22193e519524SHoward Hinnant // f i 22203e519524SHoward Hinnant _ForwardIterator __i = __first; 22213e519524SHoward Hinnant for (++__i; ++__i != __last;) 22223e519524SHoward Hinnant if (!__pred(*__first, *__i)) 2223ce48a113SHoward Hinnant *++__first = _VSTD::move(*__i); 22243e519524SHoward Hinnant ++__first; 22253e519524SHoward Hinnant } 22263e519524SHoward Hinnant return __first; 22273e519524SHoward Hinnant} 22283e519524SHoward Hinnant 22293e519524SHoward Hinnanttemplate <class _ForwardIterator> 22303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 22313e519524SHoward Hinnant_ForwardIterator 22323e519524SHoward Hinnantunique(_ForwardIterator __first, _ForwardIterator __last) 22333e519524SHoward Hinnant{ 22343e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type __v; 2235ce48a113SHoward Hinnant return _VSTD::unique(__first, __last, __equal_to<__v>()); 22363e519524SHoward Hinnant} 22373e519524SHoward Hinnant 22383e519524SHoward Hinnant// unique_copy 22393e519524SHoward Hinnant 22403e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _OutputIterator> 22413e519524SHoward Hinnant_OutputIterator 22423e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22433e519524SHoward Hinnant input_iterator_tag, output_iterator_tag) 22443e519524SHoward Hinnant{ 22453e519524SHoward Hinnant if (__first != __last) 22463e519524SHoward Hinnant { 22473e519524SHoward Hinnant typename iterator_traits<_InputIterator>::value_type __t(*__first); 22483e519524SHoward Hinnant *__result = __t; 22493e519524SHoward Hinnant ++__result; 22503e519524SHoward Hinnant while (++__first != __last) 22513e519524SHoward Hinnant { 22523e519524SHoward Hinnant if (!__pred(__t, *__first)) 22533e519524SHoward Hinnant { 22543e519524SHoward Hinnant __t = *__first; 22553e519524SHoward Hinnant *__result = __t; 22563e519524SHoward Hinnant ++__result; 22573e519524SHoward Hinnant } 22583e519524SHoward Hinnant } 22593e519524SHoward Hinnant } 22603e519524SHoward Hinnant return __result; 22613e519524SHoward Hinnant} 22623e519524SHoward Hinnant 22633e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator> 22643e519524SHoward Hinnant_OutputIterator 22653e519524SHoward Hinnant__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, 22663e519524SHoward Hinnant forward_iterator_tag, output_iterator_tag) 22673e519524SHoward Hinnant{ 22683e519524SHoward Hinnant if (__first != __last) 22693e519524SHoward Hinnant { 22703e519524SHoward Hinnant _ForwardIterator __i = __first; 22713e519524SHoward Hinnant *__result = *__i; 22723e519524SHoward Hinnant ++__result; 22733e519524SHoward Hinnant while (++__first != __last) 22743e519524SHoward Hinnant { 22753e519524SHoward Hinnant if (!__pred(*__i, *__first)) 22763e519524SHoward Hinnant { 22773e519524SHoward Hinnant *__result = *__first; 22783e519524SHoward Hinnant ++__result; 22793e519524SHoward Hinnant __i = __first; 22803e519524SHoward Hinnant } 22813e519524SHoward Hinnant } 22823e519524SHoward Hinnant } 22833e519524SHoward Hinnant return __result; 22843e519524SHoward Hinnant} 22853e519524SHoward Hinnant 22863e519524SHoward Hinnanttemplate <class _BinaryPredicate, class _InputIterator, class _ForwardIterator> 22873e519524SHoward Hinnant_ForwardIterator 22883e519524SHoward Hinnant__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, 22893e519524SHoward Hinnant input_iterator_tag, forward_iterator_tag) 22903e519524SHoward Hinnant{ 22913e519524SHoward Hinnant if (__first != __last) 22923e519524SHoward Hinnant { 22933e519524SHoward Hinnant *__result = *__first; 22943e519524SHoward Hinnant while (++__first != __last) 22953e519524SHoward Hinnant if (!__pred(*__result, *__first)) 22963e519524SHoward Hinnant *++__result = *__first; 22973e519524SHoward Hinnant ++__result; 22983e519524SHoward Hinnant } 22993e519524SHoward Hinnant return __result; 23003e519524SHoward Hinnant} 23013e519524SHoward Hinnant 23023e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator, class _BinaryPredicate> 23033e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23043e519524SHoward Hinnant_OutputIterator 23053e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) 23063e519524SHoward Hinnant{ 2307ce48a113SHoward Hinnant return _VSTD::__unique_copy<typename add_lvalue_reference<_BinaryPredicate>::type> 23083e519524SHoward Hinnant (__first, __last, __result, __pred, 23093e519524SHoward Hinnant typename iterator_traits<_InputIterator>::iterator_category(), 23103e519524SHoward Hinnant typename iterator_traits<_OutputIterator>::iterator_category()); 23113e519524SHoward Hinnant} 23123e519524SHoward Hinnant 23133e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator> 23143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23153e519524SHoward Hinnant_OutputIterator 23163e519524SHoward Hinnantunique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) 23173e519524SHoward Hinnant{ 23183e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator>::value_type __v; 2319ce48a113SHoward Hinnant return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>()); 23203e519524SHoward Hinnant} 23213e519524SHoward Hinnant 23223e519524SHoward Hinnant// reverse 23233e519524SHoward Hinnant 23243e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23253e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23263e519524SHoward Hinnantvoid 23273e519524SHoward Hinnant__reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) 23283e519524SHoward Hinnant{ 23293e519524SHoward Hinnant while (__first != __last) 23303e519524SHoward Hinnant { 23313e519524SHoward Hinnant if (__first == --__last) 23323e519524SHoward Hinnant break; 23333e519524SHoward Hinnant swap(*__first, *__last); 23343e519524SHoward Hinnant ++__first; 23353e519524SHoward Hinnant } 23363e519524SHoward Hinnant} 23373e519524SHoward Hinnant 23383e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 23393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23403e519524SHoward Hinnantvoid 23413e519524SHoward Hinnant__reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) 23423e519524SHoward Hinnant{ 23433e519524SHoward Hinnant if (__first != __last) 23443e519524SHoward Hinnant for (; __first < --__last; ++__first) 23453e519524SHoward Hinnant swap(*__first, *__last); 23463e519524SHoward Hinnant} 23473e519524SHoward Hinnant 23483e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 23493e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23503e519524SHoward Hinnantvoid 23513e519524SHoward Hinnantreverse(_BidirectionalIterator __first, _BidirectionalIterator __last) 23523e519524SHoward Hinnant{ 2353ce48a113SHoward Hinnant _VSTD::__reverse(__first, __last, typename iterator_traits<_BidirectionalIterator>::iterator_category()); 23543e519524SHoward Hinnant} 23553e519524SHoward Hinnant 23563e519524SHoward Hinnant// reverse_copy 23573e519524SHoward Hinnant 23583e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _OutputIterator> 23593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 23603e519524SHoward Hinnant_OutputIterator 23613e519524SHoward Hinnantreverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) 23623e519524SHoward Hinnant{ 23633e519524SHoward Hinnant for (; __first != __last; ++__result) 23643e519524SHoward Hinnant *__result = *--__last; 23653e519524SHoward Hinnant return __result; 23663e519524SHoward Hinnant} 23673e519524SHoward Hinnant 23683e519524SHoward Hinnant// rotate 23693e519524SHoward Hinnant 23703e519524SHoward Hinnanttemplate <class _ForwardIterator> 23713e519524SHoward Hinnant_ForwardIterator 2372aca09de3SHoward Hinnant__rotate_left(_ForwardIterator __first, _ForwardIterator __last) 23733e519524SHoward Hinnant{ 2374aca09de3SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 2375aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__first); 2376aca09de3SHoward Hinnant _ForwardIterator __lm1 = _VSTD::move(_VSTD::next(__first), __last, __first); 2377aca09de3SHoward Hinnant *__lm1 = _VSTD::move(__tmp); 2378aca09de3SHoward Hinnant return __lm1; 2379aca09de3SHoward Hinnant} 2380aca09de3SHoward Hinnant 2381aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2382aca09de3SHoward Hinnant_BidirectionalIterator 2383aca09de3SHoward Hinnant__rotate_right(_BidirectionalIterator __first, _BidirectionalIterator __last) 2384aca09de3SHoward Hinnant{ 2385aca09de3SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 2386aca09de3SHoward Hinnant _BidirectionalIterator __lm1 = _VSTD::prev(__last); 2387aca09de3SHoward Hinnant value_type __tmp = _VSTD::move(*__lm1); 2388aca09de3SHoward Hinnant _BidirectionalIterator __fp1 = _VSTD::move_backward(__first, __lm1, __last); 2389aca09de3SHoward Hinnant *__first = _VSTD::move(__tmp); 2390aca09de3SHoward Hinnant return __fp1; 2391aca09de3SHoward Hinnant} 2392aca09de3SHoward Hinnant 2393aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2394aca09de3SHoward Hinnant_ForwardIterator 2395aca09de3SHoward Hinnant__rotate_forward(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 2396aca09de3SHoward Hinnant{ 23973e519524SHoward Hinnant _ForwardIterator __i = __middle; 23983e519524SHoward Hinnant while (true) 23993e519524SHoward Hinnant { 24003e519524SHoward Hinnant swap(*__first, *__i); 24013e519524SHoward Hinnant ++__first; 24023e519524SHoward Hinnant if (++__i == __last) 24033e519524SHoward Hinnant break; 24043e519524SHoward Hinnant if (__first == __middle) 24053e519524SHoward Hinnant __middle = __i; 24063e519524SHoward Hinnant } 24073e519524SHoward Hinnant _ForwardIterator __r = __first; 24083e519524SHoward Hinnant if (__first != __middle) 24093e519524SHoward Hinnant { 24103e519524SHoward Hinnant __i = __middle; 24113e519524SHoward Hinnant while (true) 24123e519524SHoward Hinnant { 24133e519524SHoward Hinnant swap(*__first, *__i); 24143e519524SHoward Hinnant ++__first; 24153e519524SHoward Hinnant if (++__i == __last) 24163e519524SHoward Hinnant { 24173e519524SHoward Hinnant if (__first == __middle) 24183e519524SHoward Hinnant break; 24193e519524SHoward Hinnant __i = __middle; 24203e519524SHoward Hinnant } 24213e519524SHoward Hinnant else if (__first == __middle) 24223e519524SHoward Hinnant __middle = __i; 24233e519524SHoward Hinnant } 24243e519524SHoward Hinnant } 24253e519524SHoward Hinnant return __r; 24263e519524SHoward Hinnant} 24273e519524SHoward Hinnant 24283e519524SHoward Hinnanttemplate<typename _Integral> 24293e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24303e519524SHoward Hinnant_Integral 24313e519524SHoward Hinnant__gcd(_Integral __x, _Integral __y) 24323e519524SHoward Hinnant{ 24333e519524SHoward Hinnant do 24343e519524SHoward Hinnant { 24353e519524SHoward Hinnant _Integral __t = __x % __y; 24363e519524SHoward Hinnant __x = __y; 24373e519524SHoward Hinnant __y = __t; 24383e519524SHoward Hinnant } while (__y); 24393e519524SHoward Hinnant return __x; 24403e519524SHoward Hinnant} 24413e519524SHoward Hinnant 24423e519524SHoward Hinnanttemplate<typename _RandomAccessIterator> 24433e519524SHoward Hinnant_RandomAccessIterator 2444aca09de3SHoward Hinnant__rotate_gcd(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 24453e519524SHoward Hinnant{ 24463e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 24473e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 24483e519524SHoward Hinnant 24493e519524SHoward Hinnant const difference_type __m1 = __middle - __first; 24503e519524SHoward Hinnant const difference_type __m2 = __last - __middle; 24513e519524SHoward Hinnant if (__m1 == __m2) 24523e519524SHoward Hinnant { 2453ce48a113SHoward Hinnant _VSTD::swap_ranges(__first, __middle, __middle); 24543e519524SHoward Hinnant return __middle; 24553e519524SHoward Hinnant } 2456aca09de3SHoward Hinnant const difference_type __g = _VSTD::__gcd(__m1, __m2); 24573e519524SHoward Hinnant for (_RandomAccessIterator __p = __first + __g; __p != __first;) 24583e519524SHoward Hinnant { 2459aca09de3SHoward Hinnant value_type __t(_VSTD::move(*--__p)); 24603e519524SHoward Hinnant _RandomAccessIterator __p1 = __p; 24613e519524SHoward Hinnant _RandomAccessIterator __p2 = __p1 + __m1; 24623e519524SHoward Hinnant do 24633e519524SHoward Hinnant { 2464aca09de3SHoward Hinnant *__p1 = _VSTD::move(*__p2); 24653e519524SHoward Hinnant __p1 = __p2; 24663e519524SHoward Hinnant const difference_type __d = __last - __p2; 24673e519524SHoward Hinnant if (__m1 < __d) 24683e519524SHoward Hinnant __p2 += __m1; 24693e519524SHoward Hinnant else 24703e519524SHoward Hinnant __p2 = __first + (__m1 - __d); 24713e519524SHoward Hinnant } while (__p2 != __p); 2472aca09de3SHoward Hinnant *__p1 = _VSTD::move(__t); 24733e519524SHoward Hinnant } 24743e519524SHoward Hinnant return __first + __m2; 24753e519524SHoward Hinnant} 24763e519524SHoward Hinnant 24773e519524SHoward Hinnanttemplate <class _ForwardIterator> 24783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 24793e519524SHoward Hinnant_ForwardIterator 2480aca09de3SHoward Hinnant__rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, 2481aca09de3SHoward Hinnant _VSTD::forward_iterator_tag) 2482aca09de3SHoward Hinnant{ 2483aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_ForwardIterator>::value_type value_type; 2484aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2485aca09de3SHoward Hinnant { 2486aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2487aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2488aca09de3SHoward Hinnant } 2489aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2490aca09de3SHoward Hinnant} 2491aca09de3SHoward Hinnant 2492aca09de3SHoward Hinnanttemplate <class _BidirectionalIterator> 2493aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2494aca09de3SHoward Hinnant_BidirectionalIterator 2495aca09de3SHoward Hinnant__rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 2496aca09de3SHoward Hinnant _VSTD::bidirectional_iterator_tag) 2497aca09de3SHoward Hinnant{ 2498aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_BidirectionalIterator>::value_type value_type; 2499aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2500aca09de3SHoward Hinnant { 2501aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2502aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2503aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2504aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2505aca09de3SHoward Hinnant } 2506aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2507aca09de3SHoward Hinnant} 2508aca09de3SHoward Hinnant 2509aca09de3SHoward Hinnanttemplate <class _RandomAccessIterator> 2510aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2511aca09de3SHoward Hinnant_RandomAccessIterator 2512aca09de3SHoward Hinnant__rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 2513aca09de3SHoward Hinnant _VSTD::random_access_iterator_tag) 2514aca09de3SHoward Hinnant{ 2515aca09de3SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::value_type value_type; 2516aca09de3SHoward Hinnant if (_VSTD::is_trivially_move_assignable<value_type>::value) 2517aca09de3SHoward Hinnant { 2518aca09de3SHoward Hinnant if (_VSTD::next(__first) == __middle) 2519aca09de3SHoward Hinnant return _VSTD::__rotate_left(__first, __last); 2520aca09de3SHoward Hinnant if (_VSTD::next(__middle) == __last) 2521aca09de3SHoward Hinnant return _VSTD::__rotate_right(__first, __last); 2522aca09de3SHoward Hinnant return _VSTD::__rotate_gcd(__first, __middle, __last); 2523aca09de3SHoward Hinnant } 2524aca09de3SHoward Hinnant return _VSTD::__rotate_forward(__first, __middle, __last); 2525aca09de3SHoward Hinnant} 2526aca09de3SHoward Hinnant 2527aca09de3SHoward Hinnanttemplate <class _ForwardIterator> 2528aca09de3SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 2529aca09de3SHoward Hinnant_ForwardIterator 25303e519524SHoward Hinnantrotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) 25313e519524SHoward Hinnant{ 2532aca09de3SHoward Hinnant if (__first == __middle) 2533aca09de3SHoward Hinnant return __last; 2534aca09de3SHoward Hinnant if (__middle == __last) 2535aca09de3SHoward Hinnant return __first; 2536ce48a113SHoward Hinnant return _VSTD::__rotate(__first, __middle, __last, 2537aca09de3SHoward Hinnant typename _VSTD::iterator_traits<_ForwardIterator>::iterator_category()); 25383e519524SHoward Hinnant} 25393e519524SHoward Hinnant 25403e519524SHoward Hinnant// rotate_copy 25413e519524SHoward Hinnant 25423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _OutputIterator> 25433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 25443e519524SHoward Hinnant_OutputIterator 25453e519524SHoward Hinnantrotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) 25463e519524SHoward Hinnant{ 2547ce48a113SHoward Hinnant return _VSTD::copy(__first, __middle, _VSTD::copy(__middle, __last, __result)); 25483e519524SHoward Hinnant} 25493e519524SHoward Hinnant 25503e519524SHoward Hinnant// min_element 25513e519524SHoward Hinnant 25523e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 25539d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25543e519524SHoward Hinnant_ForwardIterator 25550b0671aeSMarshall Clowmin_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 25563e519524SHoward Hinnant{ 25573e519524SHoward Hinnant if (__first != __last) 25583e519524SHoward Hinnant { 25593e519524SHoward Hinnant _ForwardIterator __i = __first; 25603e519524SHoward Hinnant while (++__i != __last) 25613e519524SHoward Hinnant if (__comp(*__i, *__first)) 25623e519524SHoward Hinnant __first = __i; 25633e519524SHoward Hinnant } 25643e519524SHoward Hinnant return __first; 25653e519524SHoward Hinnant} 25663e519524SHoward Hinnant 25673e519524SHoward Hinnanttemplate <class _ForwardIterator> 25680b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25693e519524SHoward Hinnant_ForwardIterator 25703e519524SHoward Hinnantmin_element(_ForwardIterator __first, _ForwardIterator __last) 25713e519524SHoward Hinnant{ 25720b0671aeSMarshall Clow return _VSTD::min_element(__first, __last, 25734eb27b79SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type>()); 25744eb27b79SHoward Hinnant} 25754eb27b79SHoward Hinnant 25764eb27b79SHoward Hinnant// min 25774eb27b79SHoward Hinnant 25784eb27b79SHoward Hinnanttemplate <class _Tp, class _Compare> 25799d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25804eb27b79SHoward Hinnantconst _Tp& 25814eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b, _Compare __comp) 25824eb27b79SHoward Hinnant{ 25834eb27b79SHoward Hinnant return __comp(__b, __a) ? __b : __a; 25844eb27b79SHoward Hinnant} 25854eb27b79SHoward Hinnant 25864eb27b79SHoward Hinnanttemplate <class _Tp> 25879d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25884eb27b79SHoward Hinnantconst _Tp& 25894eb27b79SHoward Hinnantmin(const _Tp& __a, const _Tp& __b) 25904eb27b79SHoward Hinnant{ 2591ce48a113SHoward Hinnant return _VSTD::min(__a, __b, __less<_Tp>()); 25924eb27b79SHoward Hinnant} 25934eb27b79SHoward Hinnant 259454976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 259554976f26SHoward Hinnant 25964eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 25979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 25984eb27b79SHoward Hinnant_Tp 25994eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t, _Compare __comp) 26004eb27b79SHoward Hinnant{ 26010b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __comp); 26024eb27b79SHoward Hinnant} 26034eb27b79SHoward Hinnant 26044eb27b79SHoward Hinnanttemplate<class _Tp> 26059d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26064eb27b79SHoward Hinnant_Tp 26074eb27b79SHoward Hinnantmin(initializer_list<_Tp> __t) 26084eb27b79SHoward Hinnant{ 26090b0671aeSMarshall Clow return *_VSTD::min_element(__t.begin(), __t.end(), __less<_Tp>()); 26103e519524SHoward Hinnant} 26113e519524SHoward Hinnant 261254976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 261354976f26SHoward Hinnant 26143e519524SHoward Hinnant// max_element 26153e519524SHoward Hinnant 26163e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 26179d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26183e519524SHoward Hinnant_ForwardIterator 26190b0671aeSMarshall Clowmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26203e519524SHoward Hinnant{ 26213e519524SHoward Hinnant if (__first != __last) 26223e519524SHoward Hinnant { 26233e519524SHoward Hinnant _ForwardIterator __i = __first; 26243e519524SHoward Hinnant while (++__i != __last) 26253e519524SHoward Hinnant if (__comp(*__first, *__i)) 26263e519524SHoward Hinnant __first = __i; 26273e519524SHoward Hinnant } 26283e519524SHoward Hinnant return __first; 26293e519524SHoward Hinnant} 26303e519524SHoward Hinnant 26319d67c6d5SMarshall Clow 26323e519524SHoward Hinnanttemplate <class _ForwardIterator> 26330b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 26343e519524SHoward Hinnant_ForwardIterator 26353e519524SHoward Hinnantmax_element(_ForwardIterator __first, _ForwardIterator __last) 26363e519524SHoward Hinnant{ 26370b0671aeSMarshall Clow return _VSTD::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{ 26660b0671aeSMarshall Clow return *_VSTD::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{ 26740b0671aeSMarshall Clow return *_VSTD::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> 26820b0671aeSMarshall Clow_LIBCPP_CONSTEXPR_AFTER_CXX11 26833e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 26843e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 26853e519524SHoward Hinnant{ 26863e519524SHoward Hinnant std::pair<_ForwardIterator, _ForwardIterator> __result(__first, __first); 26873e519524SHoward Hinnant if (__first != __last) 26883e519524SHoward Hinnant { 26893e519524SHoward Hinnant if (++__first != __last) 26903e519524SHoward Hinnant { 26913e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 26923e519524SHoward Hinnant __result.first = __first; 26933e519524SHoward Hinnant else 26943e519524SHoward Hinnant __result.second = __first; 26953e519524SHoward Hinnant while (++__first != __last) 26963e519524SHoward Hinnant { 26973e519524SHoward Hinnant _ForwardIterator __i = __first; 26983e519524SHoward Hinnant if (++__first == __last) 26993e519524SHoward Hinnant { 27003e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27013e519524SHoward Hinnant __result.first = __i; 27023e519524SHoward Hinnant else if (!__comp(*__i, *__result.second)) 27033e519524SHoward Hinnant __result.second = __i; 27043e519524SHoward Hinnant break; 27053e519524SHoward Hinnant } 27063e519524SHoward Hinnant else 27073e519524SHoward Hinnant { 27083e519524SHoward Hinnant if (__comp(*__first, *__i)) 27093e519524SHoward Hinnant { 27103e519524SHoward Hinnant if (__comp(*__first, *__result.first)) 27113e519524SHoward Hinnant __result.first = __first; 27123e519524SHoward Hinnant if (!__comp(*__i, *__result.second)) 27133e519524SHoward Hinnant __result.second = __i; 27143e519524SHoward Hinnant } 27153e519524SHoward Hinnant else 27163e519524SHoward Hinnant { 27173e519524SHoward Hinnant if (__comp(*__i, *__result.first)) 27183e519524SHoward Hinnant __result.first = __i; 27193e519524SHoward Hinnant if (!__comp(*__first, *__result.second)) 27203e519524SHoward Hinnant __result.second = __first; 27213e519524SHoward Hinnant } 27223e519524SHoward Hinnant } 27233e519524SHoward Hinnant } 27243e519524SHoward Hinnant } 27253e519524SHoward Hinnant } 27263e519524SHoward Hinnant return __result; 27273e519524SHoward Hinnant} 27283e519524SHoward Hinnant 27293e519524SHoward Hinnanttemplate <class _ForwardIterator> 27300b0671aeSMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27313e519524SHoward Hinnantstd::pair<_ForwardIterator, _ForwardIterator> 27323e519524SHoward Hinnantminmax_element(_ForwardIterator __first, _ForwardIterator __last) 27333e519524SHoward Hinnant{ 27349d67c6d5SMarshall Clow return _VSTD::minmax_element(__first, __last, 27359d67c6d5SMarshall Clow __less<typename iterator_traits<_ForwardIterator>::value_type>()); 27363e519524SHoward Hinnant} 27373e519524SHoward Hinnant 27384eb27b79SHoward Hinnant// minmax 27394eb27b79SHoward Hinnant 27404eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27419d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27424eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27434eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b, _Compare __comp) 27444eb27b79SHoward Hinnant{ 27454eb27b79SHoward Hinnant return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : 27464eb27b79SHoward Hinnant pair<const _Tp&, const _Tp&>(__a, __b); 27474eb27b79SHoward Hinnant} 27484eb27b79SHoward Hinnant 27494eb27b79SHoward Hinnanttemplate<class _Tp> 27509d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27514eb27b79SHoward Hinnantpair<const _Tp&, const _Tp&> 27524eb27b79SHoward Hinnantminmax(const _Tp& __a, const _Tp& __b) 27534eb27b79SHoward Hinnant{ 2754ce48a113SHoward Hinnant return _VSTD::minmax(__a, __b, __less<_Tp>()); 27554eb27b79SHoward Hinnant} 27564eb27b79SHoward Hinnant 275754976f26SHoward Hinnant#ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 275854976f26SHoward Hinnant 27594eb27b79SHoward Hinnanttemplate<class _Tp, class _Compare> 27609d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27614eb27b79SHoward Hinnantpair<_Tp, _Tp> 27624eb27b79SHoward Hinnantminmax(initializer_list<_Tp> __t, _Compare __comp) 27634eb27b79SHoward Hinnant{ 27649d67c6d5SMarshall Clow typedef typename initializer_list<_Tp>::const_iterator _Iter; 27659d67c6d5SMarshall Clow _Iter __first = __t.begin(); 27669d67c6d5SMarshall Clow _Iter __last = __t.end(); 27679d67c6d5SMarshall Clow std::pair<_Tp, _Tp> __result(*__first, *__first); 27689d67c6d5SMarshall Clow 27699d67c6d5SMarshall Clow ++__first; 27709d67c6d5SMarshall Clow if (__t.size() % 2 == 0) 27719d67c6d5SMarshall Clow { 27729d67c6d5SMarshall Clow if (__comp(*__first, __result.first)) 27739d67c6d5SMarshall Clow __result.first = *__first; 27749d67c6d5SMarshall Clow else 27759d67c6d5SMarshall Clow __result.second = *__first; 27769d67c6d5SMarshall Clow ++__first; 27779d67c6d5SMarshall Clow } 27789d67c6d5SMarshall Clow 27799d67c6d5SMarshall Clow while (__first != __last) 27809d67c6d5SMarshall Clow { 27819d67c6d5SMarshall Clow _Tp __prev = *__first++; 2782002144f6SMarshall Clow if (__comp(*__first, __prev)) { 2783002144f6SMarshall Clow if ( __comp(*__first, __result.first)) __result.first = *__first; 2784002144f6SMarshall Clow if (!__comp(__prev, __result.second)) __result.second = __prev; 27859d67c6d5SMarshall Clow } 27869d67c6d5SMarshall Clow else { 2787002144f6SMarshall Clow if ( __comp(__prev, __result.first)) __result.first = __prev; 2788002144f6SMarshall Clow if (!__comp(*__first, __result.second)) __result.second = *__first; 27899d67c6d5SMarshall Clow } 27909d67c6d5SMarshall Clow 27919d67c6d5SMarshall Clow __first++; 27929d67c6d5SMarshall Clow } 27939d67c6d5SMarshall Clow return __result; 27949d67c6d5SMarshall Clow} 27959d67c6d5SMarshall Clow 27969d67c6d5SMarshall Clowtemplate<class _Tp> 27979d67c6d5SMarshall Clowinline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 27989d67c6d5SMarshall Clowpair<_Tp, _Tp> 27999d67c6d5SMarshall Clowminmax(initializer_list<_Tp> __t) 28009d67c6d5SMarshall Clow{ 28019d67c6d5SMarshall Clow return _VSTD::minmax(__t, __less<_Tp>()); 28024eb27b79SHoward Hinnant} 28034eb27b79SHoward Hinnant 280454976f26SHoward Hinnant#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS 280554976f26SHoward Hinnant 28063e519524SHoward Hinnant// random_shuffle 28073e519524SHoward Hinnant 2808f9d540b0SHoward Hinnant// __independent_bits_engine 2809f9d540b0SHoward Hinnant 2810c003db1fSHoward Hinnanttemplate <unsigned long long _Xp, size_t _Rp> 2811f9d540b0SHoward Hinnantstruct __log2_imp 28123e519524SHoward Hinnant{ 2813c003db1fSHoward Hinnant static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 2814c003db1fSHoward Hinnant : __log2_imp<_Xp, _Rp - 1>::value; 28153e519524SHoward Hinnant}; 28163e519524SHoward Hinnant 2817c003db1fSHoward Hinnanttemplate <unsigned long long _Xp> 2818c003db1fSHoward Hinnantstruct __log2_imp<_Xp, 0> 28193e519524SHoward Hinnant{ 2820f9d540b0SHoward Hinnant static const size_t value = 0; 28213e519524SHoward Hinnant}; 28223e519524SHoward Hinnant 2823c003db1fSHoward Hinnanttemplate <size_t _Rp> 2824c003db1fSHoward Hinnantstruct __log2_imp<0, _Rp> 28253e519524SHoward Hinnant{ 2826c003db1fSHoward Hinnant static const size_t value = _Rp + 1; 28273e519524SHoward Hinnant}; 28283e519524SHoward Hinnant 2829c003db1fSHoward Hinnanttemplate <class _UI, _UI _Xp> 2830f9d540b0SHoward Hinnantstruct __log2 28313e519524SHoward Hinnant{ 2832c003db1fSHoward Hinnant static const size_t value = __log2_imp<_Xp, 2833f9d540b0SHoward Hinnant sizeof(_UI) * __CHAR_BIT__ - 1>::value; 28343e519524SHoward Hinnant}; 28353e519524SHoward Hinnant 2836f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2837f9d540b0SHoward Hinnantclass __independent_bits_engine 28383e519524SHoward Hinnant{ 2839f9d540b0SHoward Hinnantpublic: 2840f9d540b0SHoward Hinnant // types 2841f9d540b0SHoward Hinnant typedef _UIntType result_type; 2842f9d540b0SHoward Hinnant 2843f9d540b0SHoward Hinnantprivate: 2844f9d540b0SHoward Hinnant typedef typename _Engine::result_type _Engine_result_type; 2845f9d540b0SHoward Hinnant typedef typename conditional 2846f9d540b0SHoward Hinnant < 2847f9d540b0SHoward Hinnant sizeof(_Engine_result_type) <= sizeof(result_type), 2848f9d540b0SHoward Hinnant result_type, 2849f9d540b0SHoward Hinnant _Engine_result_type 2850f9d540b0SHoward Hinnant >::type _Working_result_type; 2851f9d540b0SHoward Hinnant 2852f9d540b0SHoward Hinnant _Engine& __e_; 2853f9d540b0SHoward Hinnant size_t __w_; 2854f9d540b0SHoward Hinnant size_t __w0_; 2855f9d540b0SHoward Hinnant size_t __n_; 2856f9d540b0SHoward Hinnant size_t __n0_; 2857f9d540b0SHoward Hinnant _Working_result_type __y0_; 2858f9d540b0SHoward Hinnant _Working_result_type __y1_; 2859f9d540b0SHoward Hinnant _Engine_result_type __mask0_; 2860f9d540b0SHoward Hinnant _Engine_result_type __mask1_; 2861f9d540b0SHoward Hinnant 2862e386b7b3SHoward Hinnant#ifdef _LIBCPP_HAS_NO_CONSTEXPR 2863c003db1fSHoward Hinnant static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min 2864f9d540b0SHoward Hinnant + _Working_result_type(1); 2865e386b7b3SHoward Hinnant#else 2866e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const _Working_result_type _Rp = _Engine::max() - _Engine::min() 2867e386b7b3SHoward Hinnant + _Working_result_type(1); 2868e386b7b3SHoward Hinnant#endif 2869e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t __m = __log2<_Working_result_type, _Rp>::value; 2870e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _WDt = numeric_limits<_Working_result_type>::digits; 2871e386b7b3SHoward Hinnant static _LIBCPP_CONSTEXPR const size_t _EDt = numeric_limits<_Engine_result_type>::digits; 2872f9d540b0SHoward Hinnant 2873f9d540b0SHoward Hinnantpublic: 2874f9d540b0SHoward Hinnant // constructors and seeding functions 2875f9d540b0SHoward Hinnant __independent_bits_engine(_Engine& __e, size_t __w); 2876f9d540b0SHoward Hinnant 2877f9d540b0SHoward Hinnant // generating functions 2878c003db1fSHoward Hinnant result_type operator()() {return __eval(integral_constant<bool, _Rp != 0>());} 2879f9d540b0SHoward Hinnant 2880f9d540b0SHoward Hinnantprivate: 2881f9d540b0SHoward Hinnant result_type __eval(false_type); 2882f9d540b0SHoward Hinnant result_type __eval(true_type); 2883f9d540b0SHoward Hinnant}; 2884f9d540b0SHoward Hinnant 2885f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2886f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType> 2887f9d540b0SHoward Hinnant ::__independent_bits_engine(_Engine& __e, size_t __w) 2888f9d540b0SHoward Hinnant : __e_(__e), 2889f9d540b0SHoward Hinnant __w_(__w) 2890f9d540b0SHoward Hinnant{ 2891f9d540b0SHoward Hinnant __n_ = __w_ / __m + (__w_ % __m != 0); 2892f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2893c003db1fSHoward Hinnant if (_Rp == 0) 2894c003db1fSHoward Hinnant __y0_ = _Rp; 2895f9d540b0SHoward Hinnant else if (__w0_ < _WDt) 2896c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2897f9d540b0SHoward Hinnant else 2898f9d540b0SHoward Hinnant __y0_ = 0; 2899c003db1fSHoward Hinnant if (_Rp - __y0_ > __y0_ / __n_) 2900f9d540b0SHoward Hinnant { 2901f9d540b0SHoward Hinnant ++__n_; 2902f9d540b0SHoward Hinnant __w0_ = __w_ / __n_; 2903f9d540b0SHoward Hinnant if (__w0_ < _WDt) 2904c003db1fSHoward Hinnant __y0_ = (_Rp >> __w0_) << __w0_; 2905f9d540b0SHoward Hinnant else 2906f9d540b0SHoward Hinnant __y0_ = 0; 2907f9d540b0SHoward Hinnant } 2908f9d540b0SHoward Hinnant __n0_ = __n_ - __w_ % __n_; 2909f9d540b0SHoward Hinnant if (__w0_ < _WDt - 1) 2910c003db1fSHoward Hinnant __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); 2911f9d540b0SHoward Hinnant else 2912f9d540b0SHoward Hinnant __y1_ = 0; 2913f9d540b0SHoward Hinnant __mask0_ = __w0_ > 0 ? _Engine_result_type(~0) >> (_EDt - __w0_) : 2914f9d540b0SHoward Hinnant _Engine_result_type(0); 2915f9d540b0SHoward Hinnant __mask1_ = __w0_ < _EDt - 1 ? 2916f9d540b0SHoward Hinnant _Engine_result_type(~0) >> (_EDt - (__w0_ + 1)) : 2917f9d540b0SHoward Hinnant _Engine_result_type(~0); 29183e519524SHoward Hinnant} 29193e519524SHoward Hinnant 2920f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2921f9d540b0SHoward Hinnantinline 2922f9d540b0SHoward Hinnant_UIntType 2923f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(false_type) 29243e519524SHoward Hinnant{ 2925f9d540b0SHoward Hinnant return static_cast<result_type>(__e_() & __mask0_); 29263e519524SHoward Hinnant} 29273e519524SHoward Hinnant 2928f9d540b0SHoward Hinnanttemplate<class _Engine, class _UIntType> 2929f9d540b0SHoward Hinnant_UIntType 2930f9d540b0SHoward Hinnant__independent_bits_engine<_Engine, _UIntType>::__eval(true_type) 29313e519524SHoward Hinnant{ 2932c003db1fSHoward Hinnant result_type _Sp = 0; 2933f9d540b0SHoward Hinnant for (size_t __k = 0; __k < __n0_; ++__k) 2934f9d540b0SHoward Hinnant { 2935f9d540b0SHoward Hinnant _Engine_result_type __u; 29363e519524SHoward Hinnant do 2937f9d540b0SHoward Hinnant { 2938f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2939f9d540b0SHoward Hinnant } while (__u >= __y0_); 29400176bc6cSHoward Hinnant if (__w0_ < _WDt) 2941c003db1fSHoward Hinnant _Sp <<= __w0_; 2942f9d540b0SHoward Hinnant else 2943c003db1fSHoward Hinnant _Sp = 0; 2944c003db1fSHoward Hinnant _Sp += __u & __mask0_; 2945f9d540b0SHoward Hinnant } 2946f9d540b0SHoward Hinnant for (size_t __k = __n0_; __k < __n_; ++__k) 2947f9d540b0SHoward Hinnant { 2948f9d540b0SHoward Hinnant _Engine_result_type __u; 2949f9d540b0SHoward Hinnant do 2950f9d540b0SHoward Hinnant { 2951f9d540b0SHoward Hinnant __u = __e_() - _Engine::min(); 2952f9d540b0SHoward Hinnant } while (__u >= __y1_); 29530176bc6cSHoward Hinnant if (__w0_ < _WDt - 1) 2954c003db1fSHoward Hinnant _Sp <<= __w0_ + 1; 2955f9d540b0SHoward Hinnant else 2956c003db1fSHoward Hinnant _Sp = 0; 2957c003db1fSHoward Hinnant _Sp += __u & __mask1_; 2958f9d540b0SHoward Hinnant } 2959c003db1fSHoward Hinnant return _Sp; 29603e519524SHoward Hinnant} 29613e519524SHoward Hinnant 2962f9d540b0SHoward Hinnant// uniform_int_distribution 29633e519524SHoward Hinnant 2964f9d540b0SHoward Hinnanttemplate<class _IntType = int> 2965f9d540b0SHoward Hinnantclass uniform_int_distribution 29663e519524SHoward Hinnant{ 2967f9d540b0SHoward Hinnantpublic: 2968f9d540b0SHoward Hinnant // types 2969f9d540b0SHoward Hinnant typedef _IntType result_type; 2970f9d540b0SHoward Hinnant 2971f9d540b0SHoward Hinnant class param_type 2972f9d540b0SHoward Hinnant { 2973f9d540b0SHoward Hinnant result_type __a_; 2974f9d540b0SHoward Hinnant result_type __b_; 2975f9d540b0SHoward Hinnant public: 2976f9d540b0SHoward Hinnant typedef uniform_int_distribution distribution_type; 2977f9d540b0SHoward Hinnant 2978f9d540b0SHoward Hinnant explicit param_type(result_type __a = 0, 2979f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2980f9d540b0SHoward Hinnant : __a_(__a), __b_(__b) {} 2981f9d540b0SHoward Hinnant 2982f9d540b0SHoward Hinnant result_type a() const {return __a_;} 2983f9d540b0SHoward Hinnant result_type b() const {return __b_;} 2984f9d540b0SHoward Hinnant 2985f9d540b0SHoward Hinnant friend bool operator==(const param_type& __x, const param_type& __y) 2986f9d540b0SHoward Hinnant {return __x.__a_ == __y.__a_ && __x.__b_ == __y.__b_;} 2987f9d540b0SHoward Hinnant friend bool operator!=(const param_type& __x, const param_type& __y) 2988f9d540b0SHoward Hinnant {return !(__x == __y);} 29893e519524SHoward Hinnant }; 29903e519524SHoward Hinnant 2991f9d540b0SHoward Hinnantprivate: 2992f9d540b0SHoward Hinnant param_type __p_; 29933e519524SHoward Hinnant 2994f9d540b0SHoward Hinnantpublic: 2995f9d540b0SHoward Hinnant // constructors and reset functions 2996f9d540b0SHoward Hinnant explicit uniform_int_distribution(result_type __a = 0, 2997f9d540b0SHoward Hinnant result_type __b = numeric_limits<result_type>::max()) 2998f9d540b0SHoward Hinnant : __p_(param_type(__a, __b)) {} 2999f9d540b0SHoward Hinnant explicit uniform_int_distribution(const param_type& __p) : __p_(__p) {} 3000f9d540b0SHoward Hinnant void reset() {} 3001f9d540b0SHoward Hinnant 3002f9d540b0SHoward Hinnant // generating functions 3003f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g) 3004f9d540b0SHoward Hinnant {return (*this)(__g, __p_);} 3005f9d540b0SHoward Hinnant template<class _URNG> result_type operator()(_URNG& __g, const param_type& __p); 3006f9d540b0SHoward Hinnant 3007f9d540b0SHoward Hinnant // property functions 3008f9d540b0SHoward Hinnant result_type a() const {return __p_.a();} 3009f9d540b0SHoward Hinnant result_type b() const {return __p_.b();} 3010f9d540b0SHoward Hinnant 3011f9d540b0SHoward Hinnant param_type param() const {return __p_;} 3012f9d540b0SHoward Hinnant void param(const param_type& __p) {__p_ = __p;} 3013f9d540b0SHoward Hinnant 3014f9d540b0SHoward Hinnant result_type min() const {return a();} 3015f9d540b0SHoward Hinnant result_type max() const {return b();} 3016f9d540b0SHoward Hinnant 3017f9d540b0SHoward Hinnant friend bool operator==(const uniform_int_distribution& __x, 3018f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3019f9d540b0SHoward Hinnant {return __x.__p_ == __y.__p_;} 3020f9d540b0SHoward Hinnant friend bool operator!=(const uniform_int_distribution& __x, 3021f9d540b0SHoward Hinnant const uniform_int_distribution& __y) 3022f9d540b0SHoward Hinnant {return !(__x == __y);} 30233e519524SHoward Hinnant}; 30243e519524SHoward Hinnant 3025f9d540b0SHoward Hinnanttemplate<class _IntType> 3026f9d540b0SHoward Hinnanttemplate<class _URNG> 3027f9d540b0SHoward Hinnanttypename uniform_int_distribution<_IntType>::result_type 3028f9d540b0SHoward Hinnantuniform_int_distribution<_IntType>::operator()(_URNG& __g, const param_type& __p) 30293e519524SHoward Hinnant{ 3030f9d540b0SHoward Hinnant typedef typename conditional<sizeof(result_type) <= sizeof(uint32_t), 3031f9d540b0SHoward Hinnant uint32_t, uint64_t>::type _UIntType; 3032c003db1fSHoward Hinnant const _UIntType _Rp = __p.b() - __p.a() + _UIntType(1); 3033c003db1fSHoward Hinnant if (_Rp == 1) 3034f9d540b0SHoward Hinnant return __p.a(); 3035f9d540b0SHoward Hinnant const size_t _Dt = numeric_limits<_UIntType>::digits; 3036f9d540b0SHoward Hinnant typedef __independent_bits_engine<_URNG, _UIntType> _Eng; 3037c003db1fSHoward Hinnant if (_Rp == 0) 3038f9d540b0SHoward Hinnant return static_cast<result_type>(_Eng(__g, _Dt)()); 3039c003db1fSHoward Hinnant size_t __w = _Dt - __clz(_Rp) - 1; 3040c003db1fSHoward Hinnant if ((_Rp & (_UIntType(~0) >> (_Dt - __w))) != 0) 3041f9d540b0SHoward Hinnant ++__w; 3042f9d540b0SHoward Hinnant _Eng __e(__g, __w); 3043f9d540b0SHoward Hinnant _UIntType __u; 3044f9d540b0SHoward Hinnant do 30453e519524SHoward Hinnant { 3046f9d540b0SHoward Hinnant __u = __e(); 3047c003db1fSHoward Hinnant } while (__u >= _Rp); 3048f9d540b0SHoward Hinnant return static_cast<result_type>(__u + __p.a()); 30493e519524SHoward Hinnant} 3050f9d540b0SHoward Hinnant 3051f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default; 3052f9d540b0SHoward Hinnant 3053f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 3054f9d540b0SHoward Hinnant 3055f0544c20SHoward Hinnantclass _LIBCPP_TYPE_VIS __rs_default 30563e519524SHoward Hinnant{ 3057f9d540b0SHoward Hinnant static unsigned __c_; 3058f9d540b0SHoward Hinnant 3059f9d540b0SHoward Hinnant __rs_default(); 3060f9d540b0SHoward Hinnantpublic: 3061b6e5f854SMarshall Clow typedef uint_fast32_t result_type; 3062f9d540b0SHoward Hinnant 3063f9d540b0SHoward Hinnant static const result_type _Min = 0; 3064f9d540b0SHoward Hinnant static const result_type _Max = 0xFFFFFFFF; 3065f9d540b0SHoward Hinnant 3066f9d540b0SHoward Hinnant __rs_default(const __rs_default&); 3067f9d540b0SHoward Hinnant ~__rs_default(); 3068f9d540b0SHoward Hinnant 3069f9d540b0SHoward Hinnant result_type operator()(); 3070f9d540b0SHoward Hinnant 3071788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type min() {return _Min;} 3072788c9979SHoward Hinnant static _LIBCPP_CONSTEXPR result_type max() {return _Max;} 3073f9d540b0SHoward Hinnant 3074f0544c20SHoward Hinnant friend _LIBCPP_FUNC_VIS __rs_default __rs_get(); 3075f9d540b0SHoward Hinnant}; 3076f9d540b0SHoward Hinnant 3077f0544c20SHoward Hinnant_LIBCPP_FUNC_VIS __rs_default __rs_get(); 30783e519524SHoward Hinnant 30793e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 30803e519524SHoward Hinnantvoid 30813e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) 30823e519524SHoward Hinnant{ 30833e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3084c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3085c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 30863e519524SHoward Hinnant difference_type __d = __last - __first; 30873e519524SHoward Hinnant if (__d > 1) 30883e519524SHoward Hinnant { 3089c003db1fSHoward Hinnant _Dp __uid; 3090f9d540b0SHoward Hinnant __rs_default __g = __rs_get(); 3091f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3092007b26beSHoward Hinnant { 3093c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3094007b26beSHoward Hinnant if (__i != difference_type(0)) 3095007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3096007b26beSHoward Hinnant } 30973e519524SHoward Hinnant } 30983e519524SHoward Hinnant} 30993e519524SHoward Hinnant 31003e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _RandomNumberGenerator> 31013e519524SHoward Hinnantvoid 31023e519524SHoward Hinnantrandom_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 31037609c9b6SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 31043e519524SHoward Hinnant _RandomNumberGenerator&& __rand) 31053e519524SHoward Hinnant#else 31063e519524SHoward Hinnant _RandomNumberGenerator& __rand) 31073e519524SHoward Hinnant#endif 31083e519524SHoward Hinnant{ 31093e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 31103e519524SHoward Hinnant difference_type __d = __last - __first; 31113e519524SHoward Hinnant if (__d > 1) 31123e519524SHoward Hinnant { 31133e519524SHoward Hinnant for (--__last; __first < __last; ++__first, --__d) 3114007b26beSHoward Hinnant { 3115007b26beSHoward Hinnant difference_type __i = __rand(__d); 3116007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3117007b26beSHoward Hinnant } 31183e519524SHoward Hinnant } 31193e519524SHoward Hinnant} 31203e519524SHoward Hinnant 3121f9d540b0SHoward Hinnanttemplate<class _RandomAccessIterator, class _UniformRandomNumberGenerator> 3122f9d540b0SHoward Hinnant void shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, 3123fb340102SHoward Hinnant#ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES 3124fb340102SHoward Hinnant _UniformRandomNumberGenerator&& __g) 3125fb340102SHoward Hinnant#else 3126f9d540b0SHoward Hinnant _UniformRandomNumberGenerator& __g) 3127fb340102SHoward Hinnant#endif 3128f9d540b0SHoward Hinnant{ 3129f9d540b0SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 3130c003db1fSHoward Hinnant typedef uniform_int_distribution<ptrdiff_t> _Dp; 3131c003db1fSHoward Hinnant typedef typename _Dp::param_type _Pp; 3132f9d540b0SHoward Hinnant difference_type __d = __last - __first; 3133f9d540b0SHoward Hinnant if (__d > 1) 3134f9d540b0SHoward Hinnant { 3135c003db1fSHoward Hinnant _Dp __uid; 3136f9d540b0SHoward Hinnant for (--__last, --__d; __first < __last; ++__first, --__d) 3137007b26beSHoward Hinnant { 3138c003db1fSHoward Hinnant difference_type __i = __uid(__g, _Pp(0, __d)); 3139007b26beSHoward Hinnant if (__i != difference_type(0)) 3140007b26beSHoward Hinnant swap(*__first, *(__first + __i)); 3141007b26beSHoward Hinnant } 3142f9d540b0SHoward Hinnant } 3143f9d540b0SHoward Hinnant} 3144f9d540b0SHoward Hinnant 31453e519524SHoward Hinnanttemplate <class _InputIterator, class _Predicate> 31463e519524SHoward Hinnantbool 31473e519524SHoward Hinnantis_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) 31483e519524SHoward Hinnant{ 31493e519524SHoward Hinnant for (; __first != __last; ++__first) 31503e519524SHoward Hinnant if (!__pred(*__first)) 31513e519524SHoward Hinnant break; 3152b9595b79SMarshall Clow if ( __first == __last ) 3153b9595b79SMarshall Clow return true; 3154b9595b79SMarshall Clow ++__first; 31553e519524SHoward Hinnant for (; __first != __last; ++__first) 31563e519524SHoward Hinnant if (__pred(*__first)) 31573e519524SHoward Hinnant return false; 31583e519524SHoward Hinnant return true; 31593e519524SHoward Hinnant} 31603e519524SHoward Hinnant 31613e519524SHoward Hinnant// partition 31623e519524SHoward Hinnant 31633e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 31643e519524SHoward Hinnant_ForwardIterator 31653e519524SHoward Hinnant__partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) 31663e519524SHoward Hinnant{ 31673e519524SHoward Hinnant while (true) 31683e519524SHoward Hinnant { 31693e519524SHoward Hinnant if (__first == __last) 31703e519524SHoward Hinnant return __first; 31713e519524SHoward Hinnant if (!__pred(*__first)) 31723e519524SHoward Hinnant break; 31733e519524SHoward Hinnant ++__first; 31743e519524SHoward Hinnant } 31753e519524SHoward Hinnant for (_ForwardIterator __p = __first; ++__p != __last;) 31763e519524SHoward Hinnant { 31773e519524SHoward Hinnant if (__pred(*__p)) 31783e519524SHoward Hinnant { 31793e519524SHoward Hinnant swap(*__first, *__p); 31803e519524SHoward Hinnant ++__first; 31813e519524SHoward Hinnant } 31823e519524SHoward Hinnant } 31833e519524SHoward Hinnant return __first; 31843e519524SHoward Hinnant} 31853e519524SHoward Hinnant 31863e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 31873e519524SHoward Hinnant_BidirectionalIterator 31883e519524SHoward Hinnant__partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 31893e519524SHoward Hinnant bidirectional_iterator_tag) 31903e519524SHoward Hinnant{ 31913e519524SHoward Hinnant while (true) 31923e519524SHoward Hinnant { 31933e519524SHoward Hinnant while (true) 31943e519524SHoward Hinnant { 31953e519524SHoward Hinnant if (__first == __last) 31963e519524SHoward Hinnant return __first; 31973e519524SHoward Hinnant if (!__pred(*__first)) 31983e519524SHoward Hinnant break; 31993e519524SHoward Hinnant ++__first; 32003e519524SHoward Hinnant } 32013e519524SHoward Hinnant do 32023e519524SHoward Hinnant { 32033e519524SHoward Hinnant if (__first == --__last) 32043e519524SHoward Hinnant return __first; 32053e519524SHoward Hinnant } while (!__pred(*__last)); 32063e519524SHoward Hinnant swap(*__first, *__last); 32073e519524SHoward Hinnant ++__first; 32083e519524SHoward Hinnant } 32093e519524SHoward Hinnant} 32103e519524SHoward Hinnant 32113e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 32123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 32133e519524SHoward Hinnant_ForwardIterator 32143e519524SHoward Hinnantpartition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32153e519524SHoward Hinnant{ 3216ce48a113SHoward Hinnant return _VSTD::__partition<typename add_lvalue_reference<_Predicate>::type> 32173e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 32183e519524SHoward Hinnant} 32193e519524SHoward Hinnant 32203e519524SHoward Hinnant// partition_copy 32213e519524SHoward Hinnant 32223e519524SHoward Hinnanttemplate <class _InputIterator, class _OutputIterator1, 32233e519524SHoward Hinnant class _OutputIterator2, class _Predicate> 32243e519524SHoward Hinnantpair<_OutputIterator1, _OutputIterator2> 32253e519524SHoward Hinnantpartition_copy(_InputIterator __first, _InputIterator __last, 32263e519524SHoward Hinnant _OutputIterator1 __out_true, _OutputIterator2 __out_false, 32273e519524SHoward Hinnant _Predicate __pred) 32283e519524SHoward Hinnant{ 32293e519524SHoward Hinnant for (; __first != __last; ++__first) 32303e519524SHoward Hinnant { 32313e519524SHoward Hinnant if (__pred(*__first)) 32323e519524SHoward Hinnant { 32333e519524SHoward Hinnant *__out_true = *__first; 32343e519524SHoward Hinnant ++__out_true; 32353e519524SHoward Hinnant } 32363e519524SHoward Hinnant else 32373e519524SHoward Hinnant { 32383e519524SHoward Hinnant *__out_false = *__first; 32393e519524SHoward Hinnant ++__out_false; 32403e519524SHoward Hinnant } 32413e519524SHoward Hinnant } 32423e519524SHoward Hinnant return pair<_OutputIterator1, _OutputIterator2>(__out_true, __out_false); 32433e519524SHoward Hinnant} 32443e519524SHoward Hinnant 32453e519524SHoward Hinnant// partition_point 32463e519524SHoward Hinnant 32473e519524SHoward Hinnanttemplate<class _ForwardIterator, class _Predicate> 32483e519524SHoward Hinnant_ForwardIterator 32493e519524SHoward Hinnantpartition_point(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 32503e519524SHoward Hinnant{ 32513e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 3252ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 32533e519524SHoward Hinnant while (__len != 0) 32543e519524SHoward Hinnant { 32553e519524SHoward Hinnant difference_type __l2 = __len / 2; 32563e519524SHoward Hinnant _ForwardIterator __m = __first; 3257ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 32583e519524SHoward Hinnant if (__pred(*__m)) 32593e519524SHoward Hinnant { 32603e519524SHoward Hinnant __first = ++__m; 32613e519524SHoward Hinnant __len -= __l2 + 1; 32623e519524SHoward Hinnant } 32633e519524SHoward Hinnant else 32643e519524SHoward Hinnant __len = __l2; 32653e519524SHoward Hinnant } 32663e519524SHoward Hinnant return __first; 32673e519524SHoward Hinnant} 32683e519524SHoward Hinnant 32693e519524SHoward Hinnant// stable_partition 32703e519524SHoward Hinnant 32713e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator, class _Distance, class _Pair> 32723e519524SHoward Hinnant_ForwardIterator 32733e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 32743e519524SHoward Hinnant _Distance __len, _Pair __p, forward_iterator_tag __fit) 32753e519524SHoward Hinnant{ 32763e519524SHoward Hinnant // *__first is known to be false 32773e519524SHoward Hinnant // __len >= 1 32783e519524SHoward Hinnant if (__len == 1) 32793e519524SHoward Hinnant return __first; 32803e519524SHoward Hinnant if (__len == 2) 32813e519524SHoward Hinnant { 32823e519524SHoward Hinnant _ForwardIterator __m = __first; 32833e519524SHoward Hinnant if (__pred(*++__m)) 32843e519524SHoward Hinnant { 32853e519524SHoward Hinnant swap(*__first, *__m); 32863e519524SHoward Hinnant return __m; 32873e519524SHoward Hinnant } 32883e519524SHoward Hinnant return __first; 32893e519524SHoward Hinnant } 32903e519524SHoward Hinnant if (__len <= __p.second) 32913e519524SHoward Hinnant { // The buffer is big enough to use 32923e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 32933e519524SHoward Hinnant __destruct_n __d(0); 32943e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 32953e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 32963e519524SHoward Hinnant // Update __first to always point to the end of the trues 32973e519524SHoward Hinnant value_type* __t = __p.first; 3298ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 32993e519524SHoward Hinnant __d.__incr((value_type*)0); 33003e519524SHoward Hinnant ++__t; 33013e519524SHoward Hinnant _ForwardIterator __i = __first; 33023e519524SHoward Hinnant while (++__i != __last) 33033e519524SHoward Hinnant { 33043e519524SHoward Hinnant if (__pred(*__i)) 33053e519524SHoward Hinnant { 3306ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 33073e519524SHoward Hinnant ++__first; 33083e519524SHoward Hinnant } 33093e519524SHoward Hinnant else 33103e519524SHoward Hinnant { 3311ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 33123e519524SHoward Hinnant __d.__incr((value_type*)0); 33133e519524SHoward Hinnant ++__t; 33143e519524SHoward Hinnant } 33153e519524SHoward Hinnant } 33163e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 33173e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 33183e519524SHoward Hinnant __i = __first; 33193e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3320ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 33213e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 33223e519524SHoward Hinnant return __first; 33233e519524SHoward Hinnant } 33243e519524SHoward Hinnant // Else not enough buffer, do in place 33253e519524SHoward Hinnant // __len >= 3 33263e519524SHoward Hinnant _ForwardIterator __m = __first; 33273e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3328ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 33293e519524SHoward Hinnant // recurse on [__first, __m), *__first know to be false 33303e519524SHoward Hinnant // F????????????????? 33313e519524SHoward Hinnant // f m l 33323e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 33333e519524SHoward Hinnant _ForwardIterator __first_false = __stable_partition<_PredRef>(__first, __m, __pred, __len2, __p, __fit); 33343e519524SHoward Hinnant // TTTFFFFF?????????? 33353e519524SHoward Hinnant // f ff m l 33363e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 33373e519524SHoward Hinnant _ForwardIterator __m1 = __m; 33383e519524SHoward Hinnant _ForwardIterator __second_false = __last; 33393e519524SHoward Hinnant _Distance __len_half = __len - __len2; 33403e519524SHoward Hinnant while (__pred(*__m1)) 33413e519524SHoward Hinnant { 33423e519524SHoward Hinnant if (++__m1 == __last) 33433e519524SHoward Hinnant goto __second_half_done; 33443e519524SHoward Hinnant --__len_half; 33453e519524SHoward Hinnant } 33463e519524SHoward Hinnant // TTTFFFFFTTTF?????? 33473e519524SHoward Hinnant // f ff m m1 l 33483e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); 33493e519524SHoward Hinnant__second_half_done: 33503e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 33513e519524SHoward Hinnant // f ff m sf l 3352ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 33533e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 33543e519524SHoward Hinnant // | 33553e519524SHoward Hinnant} 33563e519524SHoward Hinnant 33573e519524SHoward Hinnantstruct __return_temporary_buffer 33583e519524SHoward Hinnant{ 33593e519524SHoward Hinnant template <class _Tp> 3360ce48a113SHoward Hinnant _LIBCPP_INLINE_VISIBILITY void operator()(_Tp* __p) const {_VSTD::return_temporary_buffer(__p);} 33613e519524SHoward Hinnant}; 33623e519524SHoward Hinnant 33633e519524SHoward Hinnanttemplate <class _Predicate, class _ForwardIterator> 33643e519524SHoward Hinnant_ForwardIterator 33653e519524SHoward Hinnant__stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, 33663e519524SHoward Hinnant forward_iterator_tag) 33673e519524SHoward Hinnant{ 33683e519524SHoward Hinnant const unsigned __alloc_limit = 3; // might want to make this a function of trivial assignment 33693e519524SHoward Hinnant // Either prove all true and return __first or point to first false 33703e519524SHoward Hinnant while (true) 33713e519524SHoward Hinnant { 33723e519524SHoward Hinnant if (__first == __last) 33733e519524SHoward Hinnant return __first; 33743e519524SHoward Hinnant if (!__pred(*__first)) 33753e519524SHoward Hinnant break; 33763e519524SHoward Hinnant ++__first; 33773e519524SHoward Hinnant } 33783e519524SHoward Hinnant // We now have a reduced range [__first, __last) 33793e519524SHoward Hinnant // *__first is known to be false 33803e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 33813e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::value_type value_type; 3382ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 33833e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 33843e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 33853e519524SHoward Hinnant if (__len >= __alloc_limit) 33863e519524SHoward Hinnant { 3387ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 33883e519524SHoward Hinnant __h.reset(__p.first); 33893e519524SHoward Hinnant } 33903e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 33913e519524SHoward Hinnant (__first, __last, __pred, __len, __p, forward_iterator_tag()); 33923e519524SHoward Hinnant} 33933e519524SHoward Hinnant 33943e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator, class _Distance, class _Pair> 33953e519524SHoward Hinnant_BidirectionalIterator 33963e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 33973e519524SHoward Hinnant _Distance __len, _Pair __p, bidirectional_iterator_tag __bit) 33983e519524SHoward Hinnant{ 33993e519524SHoward Hinnant // *__first is known to be false 34003e519524SHoward Hinnant // *__last is known to be true 34013e519524SHoward Hinnant // __len >= 2 34023e519524SHoward Hinnant if (__len == 2) 34033e519524SHoward Hinnant { 34043e519524SHoward Hinnant swap(*__first, *__last); 34053e519524SHoward Hinnant return __last; 34063e519524SHoward Hinnant } 34073e519524SHoward Hinnant if (__len == 3) 34083e519524SHoward Hinnant { 34093e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34103e519524SHoward Hinnant if (__pred(*++__m)) 34113e519524SHoward Hinnant { 34123e519524SHoward Hinnant swap(*__first, *__m); 34133e519524SHoward Hinnant swap(*__m, *__last); 34143e519524SHoward Hinnant return __last; 34153e519524SHoward Hinnant } 34163e519524SHoward Hinnant swap(*__m, *__last); 34173e519524SHoward Hinnant swap(*__first, *__m); 34183e519524SHoward Hinnant return __m; 34193e519524SHoward Hinnant } 34203e519524SHoward Hinnant if (__len <= __p.second) 34213e519524SHoward Hinnant { // The buffer is big enough to use 34223e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 34233e519524SHoward Hinnant __destruct_n __d(0); 34243e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); 34253e519524SHoward Hinnant // Move the falses into the temporary buffer, and the trues to the front of the line 34263e519524SHoward Hinnant // Update __first to always point to the end of the trues 34273e519524SHoward Hinnant value_type* __t = __p.first; 3428ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__first)); 34293e519524SHoward Hinnant __d.__incr((value_type*)0); 34303e519524SHoward Hinnant ++__t; 34313e519524SHoward Hinnant _BidirectionalIterator __i = __first; 34323e519524SHoward Hinnant while (++__i != __last) 34333e519524SHoward Hinnant { 34343e519524SHoward Hinnant if (__pred(*__i)) 34353e519524SHoward Hinnant { 3436ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34373e519524SHoward Hinnant ++__first; 34383e519524SHoward Hinnant } 34393e519524SHoward Hinnant else 34403e519524SHoward Hinnant { 3441ce48a113SHoward Hinnant ::new(__t) value_type(_VSTD::move(*__i)); 34423e519524SHoward Hinnant __d.__incr((value_type*)0); 34433e519524SHoward Hinnant ++__t; 34443e519524SHoward Hinnant } 34453e519524SHoward Hinnant } 34463e519524SHoward Hinnant // move *__last, known to be true 3447ce48a113SHoward Hinnant *__first = _VSTD::move(*__i); 34483e519524SHoward Hinnant __i = ++__first; 34493e519524SHoward Hinnant // All trues now at start of range, all falses in buffer 34503e519524SHoward Hinnant // Move falses back into range, but don't mess up __first which points to first false 34513e519524SHoward Hinnant for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i) 3452ce48a113SHoward Hinnant *__i = _VSTD::move(*__t2); 34533e519524SHoward Hinnant // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer 34543e519524SHoward Hinnant return __first; 34553e519524SHoward Hinnant } 34563e519524SHoward Hinnant // Else not enough buffer, do in place 34573e519524SHoward Hinnant // __len >= 4 34583e519524SHoward Hinnant _BidirectionalIterator __m = __first; 34593e519524SHoward Hinnant _Distance __len2 = __len / 2; // __len2 >= 2 3460ce48a113SHoward Hinnant _VSTD::advance(__m, __len2); 34613e519524SHoward Hinnant // recurse on [__first, __m-1], except reduce __m-1 until *(__m-1) is true, *__first know to be false 34623e519524SHoward Hinnant // F????????????????T 34633e519524SHoward Hinnant // f m l 34643e519524SHoward Hinnant _BidirectionalIterator __m1 = __m; 34653e519524SHoward Hinnant _BidirectionalIterator __first_false = __first; 34663e519524SHoward Hinnant _Distance __len_half = __len2; 34673e519524SHoward Hinnant while (!__pred(*--__m1)) 34683e519524SHoward Hinnant { 34693e519524SHoward Hinnant if (__m1 == __first) 34703e519524SHoward Hinnant goto __first_half_done; 34713e519524SHoward Hinnant --__len_half; 34723e519524SHoward Hinnant } 34733e519524SHoward Hinnant // F???TFFF?????????T 34743e519524SHoward Hinnant // f m1 m l 34753e519524SHoward Hinnant typedef typename add_lvalue_reference<_Predicate>::type _PredRef; 34763e519524SHoward Hinnant __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit); 34773e519524SHoward Hinnant__first_half_done: 34783e519524SHoward Hinnant // TTTFFFFF?????????T 34793e519524SHoward Hinnant // f ff m l 34803e519524SHoward Hinnant // recurse on [__m, __last], except increase __m until *(__m) is false, *__last know to be true 34813e519524SHoward Hinnant __m1 = __m; 34823e519524SHoward Hinnant _BidirectionalIterator __second_false = __last; 34833e519524SHoward Hinnant ++__second_false; 34843e519524SHoward Hinnant __len_half = __len - __len2; 34853e519524SHoward Hinnant while (__pred(*__m1)) 34863e519524SHoward Hinnant { 34873e519524SHoward Hinnant if (++__m1 == __last) 34883e519524SHoward Hinnant goto __second_half_done; 34893e519524SHoward Hinnant --__len_half; 34903e519524SHoward Hinnant } 34913e519524SHoward Hinnant // TTTFFFFFTTTF?????T 34923e519524SHoward Hinnant // f ff m m1 l 34933e519524SHoward Hinnant __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit); 34943e519524SHoward Hinnant__second_half_done: 34953e519524SHoward Hinnant // TTTFFFFFTTTTTFFFFF 34963e519524SHoward Hinnant // f ff m sf l 3497ce48a113SHoward Hinnant return _VSTD::rotate(__first_false, __m, __second_false); 34983e519524SHoward Hinnant // TTTTTTTTFFFFFFFFFF 34993e519524SHoward Hinnant // | 35003e519524SHoward Hinnant} 35013e519524SHoward Hinnant 35023e519524SHoward Hinnanttemplate <class _Predicate, class _BidirectionalIterator> 35033e519524SHoward Hinnant_BidirectionalIterator 35043e519524SHoward Hinnant__stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, 35053e519524SHoward Hinnant bidirectional_iterator_tag) 35063e519524SHoward Hinnant{ 35073e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 35083e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 35093e519524SHoward Hinnant const difference_type __alloc_limit = 4; // might want to make this a function of trivial assignment 35103e519524SHoward Hinnant // Either prove all true and return __first or point to first false 35113e519524SHoward Hinnant while (true) 35123e519524SHoward Hinnant { 35133e519524SHoward Hinnant if (__first == __last) 35143e519524SHoward Hinnant return __first; 35153e519524SHoward Hinnant if (!__pred(*__first)) 35163e519524SHoward Hinnant break; 35173e519524SHoward Hinnant ++__first; 35183e519524SHoward Hinnant } 35193e519524SHoward Hinnant // __first points to first false, everything prior to __first is already set. 35203e519524SHoward Hinnant // Either prove [__first, __last) is all false and return __first, or point __last to last true 35213e519524SHoward Hinnant do 35223e519524SHoward Hinnant { 35233e519524SHoward Hinnant if (__first == --__last) 35243e519524SHoward Hinnant return __first; 35253e519524SHoward Hinnant } while (!__pred(*__last)); 35263e519524SHoward Hinnant // We now have a reduced range [__first, __last] 35273e519524SHoward Hinnant // *__first is known to be false 35283e519524SHoward Hinnant // *__last is known to be true 35293e519524SHoward Hinnant // __len >= 2 3530ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last) + 1; 35313e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __p(0, 0); 35323e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 35333e519524SHoward Hinnant if (__len >= __alloc_limit) 35343e519524SHoward Hinnant { 3535ce48a113SHoward Hinnant __p = _VSTD::get_temporary_buffer<value_type>(__len); 35363e519524SHoward Hinnant __h.reset(__p.first); 35373e519524SHoward Hinnant } 35383e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35393e519524SHoward Hinnant (__first, __last, __pred, __len, __p, bidirectional_iterator_tag()); 35403e519524SHoward Hinnant} 35413e519524SHoward Hinnant 35423e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Predicate> 35433e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35443e519524SHoward Hinnant_ForwardIterator 35453e519524SHoward Hinnantstable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) 35463e519524SHoward Hinnant{ 35473e519524SHoward Hinnant return __stable_partition<typename add_lvalue_reference<_Predicate>::type> 35483e519524SHoward Hinnant (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); 35493e519524SHoward Hinnant} 35503e519524SHoward Hinnant 35513e519524SHoward Hinnant// is_sorted_until 35523e519524SHoward Hinnant 35533e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35543e519524SHoward Hinnant_ForwardIterator 35553e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35563e519524SHoward Hinnant{ 35573e519524SHoward Hinnant if (__first != __last) 35583e519524SHoward Hinnant { 35593e519524SHoward Hinnant _ForwardIterator __i = __first; 35603e519524SHoward Hinnant while (++__i != __last) 35613e519524SHoward Hinnant { 35623e519524SHoward Hinnant if (__comp(*__i, *__first)) 35633e519524SHoward Hinnant return __i; 35643e519524SHoward Hinnant __first = __i; 35653e519524SHoward Hinnant } 35663e519524SHoward Hinnant } 35673e519524SHoward Hinnant return __last; 35683e519524SHoward Hinnant} 35693e519524SHoward Hinnant 35703e519524SHoward Hinnanttemplate<class _ForwardIterator> 35713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35723e519524SHoward Hinnant_ForwardIterator 35733e519524SHoward Hinnantis_sorted_until(_ForwardIterator __first, _ForwardIterator __last) 35743e519524SHoward Hinnant{ 3575ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35763e519524SHoward Hinnant} 35773e519524SHoward Hinnant 35783e519524SHoward Hinnant// is_sorted 35793e519524SHoward Hinnant 35803e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Compare> 35813e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35823e519524SHoward Hinnantbool 35833e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) 35843e519524SHoward Hinnant{ 3585ce48a113SHoward Hinnant return _VSTD::is_sorted_until(__first, __last, __comp) == __last; 35863e519524SHoward Hinnant} 35873e519524SHoward Hinnant 35883e519524SHoward Hinnanttemplate<class _ForwardIterator> 35893e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 35903e519524SHoward Hinnantbool 35913e519524SHoward Hinnantis_sorted(_ForwardIterator __first, _ForwardIterator __last) 35923e519524SHoward Hinnant{ 3593ce48a113SHoward Hinnant return _VSTD::is_sorted(__first, __last, __less<typename iterator_traits<_ForwardIterator>::value_type>()); 35943e519524SHoward Hinnant} 35953e519524SHoward Hinnant 35963e519524SHoward Hinnant// sort 35973e519524SHoward Hinnant 35983e519524SHoward Hinnant// stable, 2-3 compares, 0-2 swaps 35993e519524SHoward Hinnant 36003e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36013e519524SHoward Hinnantunsigned 36023e519524SHoward Hinnant__sort3(_ForwardIterator __x, _ForwardIterator __y, _ForwardIterator __z, _Compare __c) 36033e519524SHoward Hinnant{ 36043e519524SHoward Hinnant unsigned __r = 0; 36053e519524SHoward Hinnant if (!__c(*__y, *__x)) // if x <= y 36063e519524SHoward Hinnant { 36073e519524SHoward Hinnant if (!__c(*__z, *__y)) // if y <= z 36083e519524SHoward Hinnant return __r; // x <= y && y <= z 36093e519524SHoward Hinnant // x <= y && y > z 36103e519524SHoward Hinnant swap(*__y, *__z); // x <= z && y < z 36113e519524SHoward Hinnant __r = 1; 36123e519524SHoward Hinnant if (__c(*__y, *__x)) // if x > y 36133e519524SHoward Hinnant { 36143e519524SHoward Hinnant swap(*__x, *__y); // x < y && y <= z 36153e519524SHoward Hinnant __r = 2; 36163e519524SHoward Hinnant } 36173e519524SHoward Hinnant return __r; // x <= y && y < z 36183e519524SHoward Hinnant } 36193e519524SHoward Hinnant if (__c(*__z, *__y)) // x > y, if y > z 36203e519524SHoward Hinnant { 36213e519524SHoward Hinnant swap(*__x, *__z); // x < y && y < z 36223e519524SHoward Hinnant __r = 1; 36233e519524SHoward Hinnant return __r; 36243e519524SHoward Hinnant } 36253e519524SHoward Hinnant swap(*__x, *__y); // x > y && y <= z 36263e519524SHoward Hinnant __r = 1; // x < y && x <= z 36273e519524SHoward Hinnant if (__c(*__z, *__y)) // if y > z 36283e519524SHoward Hinnant { 36293e519524SHoward Hinnant swap(*__y, *__z); // x <= y && y < z 36303e519524SHoward Hinnant __r = 2; 36313e519524SHoward Hinnant } 36323e519524SHoward Hinnant return __r; 36333e519524SHoward Hinnant} // x <= y && y <= z 36343e519524SHoward Hinnant 36353e519524SHoward Hinnant// stable, 3-6 compares, 0-5 swaps 36363e519524SHoward Hinnant 36373e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36383e519524SHoward Hinnantunsigned 36393e519524SHoward Hinnant__sort4(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36403e519524SHoward Hinnant _ForwardIterator __x4, _Compare __c) 36413e519524SHoward Hinnant{ 36423e519524SHoward Hinnant unsigned __r = __sort3<_Compare>(__x1, __x2, __x3, __c); 36433e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36443e519524SHoward Hinnant { 36453e519524SHoward Hinnant swap(*__x3, *__x4); 36463e519524SHoward Hinnant ++__r; 36473e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36483e519524SHoward Hinnant { 36493e519524SHoward Hinnant swap(*__x2, *__x3); 36503e519524SHoward Hinnant ++__r; 36513e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36523e519524SHoward Hinnant { 36533e519524SHoward Hinnant swap(*__x1, *__x2); 36543e519524SHoward Hinnant ++__r; 36553e519524SHoward Hinnant } 36563e519524SHoward Hinnant } 36573e519524SHoward Hinnant } 36583e519524SHoward Hinnant return __r; 36593e519524SHoward Hinnant} 36603e519524SHoward Hinnant 36613e519524SHoward Hinnant// stable, 4-10 compares, 0-9 swaps 36623e519524SHoward Hinnant 36633e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator> 36643e519524SHoward Hinnantunsigned 36653e519524SHoward Hinnant__sort5(_ForwardIterator __x1, _ForwardIterator __x2, _ForwardIterator __x3, 36663e519524SHoward Hinnant _ForwardIterator __x4, _ForwardIterator __x5, _Compare __c) 36673e519524SHoward Hinnant{ 36683e519524SHoward Hinnant unsigned __r = __sort4<_Compare>(__x1, __x2, __x3, __x4, __c); 36693e519524SHoward Hinnant if (__c(*__x5, *__x4)) 36703e519524SHoward Hinnant { 36713e519524SHoward Hinnant swap(*__x4, *__x5); 36723e519524SHoward Hinnant ++__r; 36733e519524SHoward Hinnant if (__c(*__x4, *__x3)) 36743e519524SHoward Hinnant { 36753e519524SHoward Hinnant swap(*__x3, *__x4); 36763e519524SHoward Hinnant ++__r; 36773e519524SHoward Hinnant if (__c(*__x3, *__x2)) 36783e519524SHoward Hinnant { 36793e519524SHoward Hinnant swap(*__x2, *__x3); 36803e519524SHoward Hinnant ++__r; 36813e519524SHoward Hinnant if (__c(*__x2, *__x1)) 36823e519524SHoward Hinnant { 36833e519524SHoward Hinnant swap(*__x1, *__x2); 36843e519524SHoward Hinnant ++__r; 36853e519524SHoward Hinnant } 36863e519524SHoward Hinnant } 36873e519524SHoward Hinnant } 36883e519524SHoward Hinnant } 36893e519524SHoward Hinnant return __r; 36903e519524SHoward Hinnant} 36913e519524SHoward Hinnant 36923e519524SHoward Hinnant// Assumes size > 0 36933e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 36943e519524SHoward Hinnantvoid 36953e519524SHoward Hinnant__selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 36963e519524SHoward Hinnant{ 36973e519524SHoward Hinnant _BirdirectionalIterator __lm1 = __last; 36983e519524SHoward Hinnant for (--__lm1; __first != __lm1; ++__first) 36993e519524SHoward Hinnant { 3700ce48a113SHoward Hinnant _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator, 37013e519524SHoward Hinnant typename add_lvalue_reference<_Compare>::type> 37023e519524SHoward Hinnant (__first, __last, __comp); 37033e519524SHoward Hinnant if (__i != __first) 37043e519524SHoward Hinnant swap(*__first, *__i); 37053e519524SHoward Hinnant } 37063e519524SHoward Hinnant} 37073e519524SHoward Hinnant 37083e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 37093e519524SHoward Hinnantvoid 37103e519524SHoward Hinnant__insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp) 37113e519524SHoward Hinnant{ 37123e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 37133e519524SHoward Hinnant if (__first != __last) 37143e519524SHoward Hinnant { 37153e519524SHoward Hinnant _BirdirectionalIterator __i = __first; 37163e519524SHoward Hinnant for (++__i; __i != __last; ++__i) 37173e519524SHoward Hinnant { 37183e519524SHoward Hinnant _BirdirectionalIterator __j = __i; 3719ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__j)); 37203e519524SHoward Hinnant for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) 3721ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 3722ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37233e519524SHoward Hinnant } 37243e519524SHoward Hinnant } 37253e519524SHoward Hinnant} 37263e519524SHoward Hinnant 37273e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37283e519524SHoward Hinnantvoid 37293e519524SHoward Hinnant__insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37303e519524SHoward Hinnant{ 37313e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37323e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37333e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37343e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37353e519524SHoward Hinnant { 37363e519524SHoward Hinnant if (__comp(*__i, *__j)) 37373e519524SHoward Hinnant { 3738ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37393e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37403e519524SHoward Hinnant __j = __i; 37413e519524SHoward Hinnant do 37423e519524SHoward Hinnant { 3743ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37443e519524SHoward Hinnant __j = __k; 37453e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3746ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37473e519524SHoward Hinnant } 37483e519524SHoward Hinnant __j = __i; 37493e519524SHoward Hinnant } 37503e519524SHoward Hinnant} 37513e519524SHoward Hinnant 37523e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 37533e519524SHoward Hinnantbool 37543e519524SHoward Hinnant__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 37553e519524SHoward Hinnant{ 37563e519524SHoward Hinnant switch (__last - __first) 37573e519524SHoward Hinnant { 37583e519524SHoward Hinnant case 0: 37593e519524SHoward Hinnant case 1: 37603e519524SHoward Hinnant return true; 37613e519524SHoward Hinnant case 2: 37623e519524SHoward Hinnant if (__comp(*--__last, *__first)) 37633e519524SHoward Hinnant swap(*__first, *__last); 37643e519524SHoward Hinnant return true; 37653e519524SHoward Hinnant case 3: 3766ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 37673e519524SHoward Hinnant return true; 37683e519524SHoward Hinnant case 4: 3769ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 37703e519524SHoward Hinnant return true; 37713e519524SHoward Hinnant case 5: 3772ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 37733e519524SHoward Hinnant return true; 37743e519524SHoward Hinnant } 37753e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 37763e519524SHoward Hinnant _RandomAccessIterator __j = __first+2; 37773e519524SHoward Hinnant __sort3<_Compare>(__first, __first+1, __j, __comp); 37783e519524SHoward Hinnant const unsigned __limit = 8; 37793e519524SHoward Hinnant unsigned __count = 0; 37803e519524SHoward Hinnant for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i) 37813e519524SHoward Hinnant { 37823e519524SHoward Hinnant if (__comp(*__i, *__j)) 37833e519524SHoward Hinnant { 3784ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__i)); 37853e519524SHoward Hinnant _RandomAccessIterator __k = __j; 37863e519524SHoward Hinnant __j = __i; 37873e519524SHoward Hinnant do 37883e519524SHoward Hinnant { 3789ce48a113SHoward Hinnant *__j = _VSTD::move(*__k); 37903e519524SHoward Hinnant __j = __k; 37913e519524SHoward Hinnant } while (__j != __first && __comp(__t, *--__k)); 3792ce48a113SHoward Hinnant *__j = _VSTD::move(__t); 37933e519524SHoward Hinnant if (++__count == __limit) 37943e519524SHoward Hinnant return ++__i == __last; 37953e519524SHoward Hinnant } 37963e519524SHoward Hinnant __j = __i; 37973e519524SHoward Hinnant } 37983e519524SHoward Hinnant return true; 37993e519524SHoward Hinnant} 38003e519524SHoward Hinnant 38013e519524SHoward Hinnanttemplate <class _Compare, class _BirdirectionalIterator> 38023e519524SHoward Hinnantvoid 38033e519524SHoward Hinnant__insertion_sort_move(_BirdirectionalIterator __first1, _BirdirectionalIterator __last1, 38043e519524SHoward Hinnant typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp) 38053e519524SHoward Hinnant{ 38063e519524SHoward Hinnant typedef typename iterator_traits<_BirdirectionalIterator>::value_type value_type; 38073e519524SHoward Hinnant if (__first1 != __last1) 38083e519524SHoward Hinnant { 38093e519524SHoward Hinnant __destruct_n __d(0); 38103e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__first2, __d); 38113e519524SHoward Hinnant value_type* __last2 = __first2; 3812ce48a113SHoward Hinnant ::new(__last2) value_type(_VSTD::move(*__first1)); 38133e519524SHoward Hinnant __d.__incr((value_type*)0); 38143e519524SHoward Hinnant for (++__last2; ++__first1 != __last1; ++__last2) 38153e519524SHoward Hinnant { 38163e519524SHoward Hinnant value_type* __j2 = __last2; 38173e519524SHoward Hinnant value_type* __i2 = __j2; 38183e519524SHoward Hinnant if (__comp(*__first1, *--__i2)) 38193e519524SHoward Hinnant { 3820ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__i2)); 38213e519524SHoward Hinnant __d.__incr((value_type*)0); 38223e519524SHoward Hinnant for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 3823ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__i2); 3824ce48a113SHoward Hinnant *__j2 = _VSTD::move(*__first1); 38253e519524SHoward Hinnant } 38263e519524SHoward Hinnant else 38273e519524SHoward Hinnant { 3828ce48a113SHoward Hinnant ::new(__j2) value_type(_VSTD::move(*__first1)); 38293e519524SHoward Hinnant __d.__incr((value_type*)0); 38303e519524SHoward Hinnant } 38313e519524SHoward Hinnant } 38323e519524SHoward Hinnant __h.release(); 38333e519524SHoward Hinnant } 38343e519524SHoward Hinnant} 38353e519524SHoward Hinnant 38363e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 38373e519524SHoward Hinnantvoid 38383e519524SHoward Hinnant__sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 38393e519524SHoward Hinnant{ 38403e519524SHoward Hinnant // _Compare is known to be a reference type 38413e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 38423e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 3843ca740483SHoward Hinnant const difference_type __limit = is_trivially_copy_constructible<value_type>::value && 3844ca740483SHoward Hinnant is_trivially_copy_assignable<value_type>::value ? 30 : 6; 38453e519524SHoward Hinnant while (true) 38463e519524SHoward Hinnant { 38473e519524SHoward Hinnant __restart: 38483e519524SHoward Hinnant difference_type __len = __last - __first; 38493e519524SHoward Hinnant switch (__len) 38503e519524SHoward Hinnant { 38513e519524SHoward Hinnant case 0: 38523e519524SHoward Hinnant case 1: 38533e519524SHoward Hinnant return; 38543e519524SHoward Hinnant case 2: 38553e519524SHoward Hinnant if (__comp(*--__last, *__first)) 38563e519524SHoward Hinnant swap(*__first, *__last); 38573e519524SHoward Hinnant return; 38583e519524SHoward Hinnant case 3: 3859ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp); 38603e519524SHoward Hinnant return; 38613e519524SHoward Hinnant case 4: 3862ce48a113SHoward Hinnant _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp); 38633e519524SHoward Hinnant return; 38643e519524SHoward Hinnant case 5: 3865ce48a113SHoward Hinnant _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp); 38663e519524SHoward Hinnant return; 38673e519524SHoward Hinnant } 38683e519524SHoward Hinnant if (__len <= __limit) 38693e519524SHoward Hinnant { 3870ce48a113SHoward Hinnant _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp); 38713e519524SHoward Hinnant return; 38723e519524SHoward Hinnant } 38733e519524SHoward Hinnant // __len > 5 38743e519524SHoward Hinnant _RandomAccessIterator __m = __first; 38753e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 38763e519524SHoward Hinnant --__lm1; 38773e519524SHoward Hinnant unsigned __n_swaps; 38783e519524SHoward Hinnant { 38793e519524SHoward Hinnant difference_type __delta; 38803e519524SHoward Hinnant if (__len >= 1000) 38813e519524SHoward Hinnant { 38823e519524SHoward Hinnant __delta = __len/2; 38833e519524SHoward Hinnant __m += __delta; 38843e519524SHoward Hinnant __delta /= 2; 3885ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp); 38863e519524SHoward Hinnant } 38873e519524SHoward Hinnant else 38883e519524SHoward Hinnant { 38893e519524SHoward Hinnant __delta = __len/2; 38903e519524SHoward Hinnant __m += __delta; 3891ce48a113SHoward Hinnant __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp); 38923e519524SHoward Hinnant } 38933e519524SHoward Hinnant } 38943e519524SHoward Hinnant // *__m is median 38953e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 38963e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 38973e519524SHoward Hinnant _RandomAccessIterator __i = __first; 38983e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 38993e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39003e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 39013e519524SHoward Hinnant // Prime the downward search with a guard. 39023e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 39033e519524SHoward Hinnant { 39043e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 39053e519524SHoward Hinnant // manually guard downward moving __j against __i 39063e519524SHoward Hinnant while (true) 39073e519524SHoward Hinnant { 39083e519524SHoward Hinnant if (__i == --__j) 39093e519524SHoward Hinnant { 39103e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 39113e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 39123e519524SHoward Hinnant ++__i; // __first + 1 39133e519524SHoward Hinnant __j = __last; 39143e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 39153e519524SHoward Hinnant { 39163e519524SHoward Hinnant while (true) 39173e519524SHoward Hinnant { 39183e519524SHoward Hinnant if (__i == __j) 39193e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 39203e519524SHoward Hinnant if (__comp(*__first, *__i)) 39213e519524SHoward Hinnant { 39223e519524SHoward Hinnant swap(*__i, *__j); 39233e519524SHoward Hinnant ++__n_swaps; 39243e519524SHoward Hinnant ++__i; 39253e519524SHoward Hinnant break; 39263e519524SHoward Hinnant } 39273e519524SHoward Hinnant ++__i; 39283e519524SHoward Hinnant } 39293e519524SHoward Hinnant } 39303e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 39313e519524SHoward Hinnant if (__i == __j) 39323e519524SHoward Hinnant return; 39333e519524SHoward Hinnant while (true) 39343e519524SHoward Hinnant { 39353e519524SHoward Hinnant while (!__comp(*__first, *__i)) 39363e519524SHoward Hinnant ++__i; 39373e519524SHoward Hinnant while (__comp(*__first, *--__j)) 39383e519524SHoward Hinnant ; 39393e519524SHoward Hinnant if (__i >= __j) 39403e519524SHoward Hinnant break; 39413e519524SHoward Hinnant swap(*__i, *__j); 39423e519524SHoward Hinnant ++__n_swaps; 39433e519524SHoward Hinnant ++__i; 39443e519524SHoward Hinnant } 39453e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 39463e519524SHoward Hinnant // The first part is sorted, sort the secod part 3947ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i, __last, __comp); 39483e519524SHoward Hinnant __first = __i; 39493e519524SHoward Hinnant goto __restart; 39503e519524SHoward Hinnant } 39513e519524SHoward Hinnant if (__comp(*__j, *__m)) 39523e519524SHoward Hinnant { 39533e519524SHoward Hinnant swap(*__i, *__j); 39543e519524SHoward Hinnant ++__n_swaps; 39553e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 39563e519524SHoward Hinnant } 39573e519524SHoward Hinnant } 39583e519524SHoward Hinnant } 39593e519524SHoward Hinnant // It is known that *__i < *__m 39603e519524SHoward Hinnant ++__i; 39613e519524SHoward Hinnant // j points beyond range to be tested, *__m is known to be <= *__lm1 39623e519524SHoward Hinnant // if not yet partitioned... 39633e519524SHoward Hinnant if (__i < __j) 39643e519524SHoward Hinnant { 39653e519524SHoward Hinnant // known that *(__i - 1) < *__m 39663e519524SHoward Hinnant // known that __i <= __m 39673e519524SHoward Hinnant while (true) 39683e519524SHoward Hinnant { 39693e519524SHoward Hinnant // __m still guards upward moving __i 39703e519524SHoward Hinnant while (__comp(*__i, *__m)) 39713e519524SHoward Hinnant ++__i; 39723e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 39733e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 39743e519524SHoward Hinnant ; 39753e519524SHoward Hinnant if (__i > __j) 39763e519524SHoward Hinnant break; 39773e519524SHoward Hinnant swap(*__i, *__j); 39783e519524SHoward Hinnant ++__n_swaps; 39793e519524SHoward Hinnant // It is known that __m != __j 39803e519524SHoward Hinnant // If __m just moved, follow it 39813e519524SHoward Hinnant if (__m == __i) 39823e519524SHoward Hinnant __m = __j; 39833e519524SHoward Hinnant ++__i; 39843e519524SHoward Hinnant } 39853e519524SHoward Hinnant } 39863e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 39873e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 39883e519524SHoward Hinnant { 39893e519524SHoward Hinnant swap(*__i, *__m); 39903e519524SHoward Hinnant ++__n_swaps; 39913e519524SHoward Hinnant } 39923e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 39933e519524SHoward Hinnant // If we were given a perfect partition, see if insertion sort is quick... 39943e519524SHoward Hinnant if (__n_swaps == 0) 39953e519524SHoward Hinnant { 3996ce48a113SHoward Hinnant bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp); 3997ce48a113SHoward Hinnant if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp)) 39983e519524SHoward Hinnant { 39993e519524SHoward Hinnant if (__fs) 40003e519524SHoward Hinnant return; 40013e519524SHoward Hinnant __last = __i; 40023e519524SHoward Hinnant continue; 40033e519524SHoward Hinnant } 40043e519524SHoward Hinnant else 40053e519524SHoward Hinnant { 40063e519524SHoward Hinnant if (__fs) 40073e519524SHoward Hinnant { 40083e519524SHoward Hinnant __first = ++__i; 40093e519524SHoward Hinnant continue; 40103e519524SHoward Hinnant } 40113e519524SHoward Hinnant } 40123e519524SHoward Hinnant } 40133e519524SHoward Hinnant // sort smaller range with recursive call and larger with tail recursion elimination 40143e519524SHoward Hinnant if (__i - __first < __last - __i) 40153e519524SHoward Hinnant { 4016ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__first, __i, __comp); 4017ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__i+1, __last, __comp); 40183e519524SHoward Hinnant __first = ++__i; 40193e519524SHoward Hinnant } 40203e519524SHoward Hinnant else 40213e519524SHoward Hinnant { 4022ce48a113SHoward Hinnant _VSTD::__sort<_Compare>(__i+1, __last, __comp); 4023ce48a113SHoward Hinnant // _VSTD::__sort<_Compare>(__first, __i, __comp); 40243e519524SHoward Hinnant __last = __i; 40253e519524SHoward Hinnant } 40263e519524SHoward Hinnant } 40273e519524SHoward Hinnant} 40283e519524SHoward Hinnant 40293e519524SHoward Hinnant// This forwarder keeps the top call and the recursive calls using the same instantiation, forcing a reference _Compare 40303e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 40313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40323e519524SHoward Hinnantvoid 40333e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 40343e519524SHoward Hinnant{ 4035145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 40363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 40373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 40383e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __c); 4039145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 40403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 40413e519524SHoward Hinnant __sort<_Comp_ref>(__first, __last, __comp); 4042145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 40433e519524SHoward Hinnant} 40443e519524SHoward Hinnant 40453e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 40463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40473e519524SHoward Hinnantvoid 40483e519524SHoward Hinnantsort(_RandomAccessIterator __first, _RandomAccessIterator __last) 40493e519524SHoward Hinnant{ 4050ce48a113SHoward Hinnant _VSTD::sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 40513e519524SHoward Hinnant} 40523e519524SHoward Hinnant 40533e519524SHoward Hinnanttemplate <class _Tp> 40543e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40553e519524SHoward Hinnantvoid 40563e519524SHoward Hinnantsort(_Tp** __first, _Tp** __last) 40573e519524SHoward Hinnant{ 4058ce48a113SHoward Hinnant _VSTD::sort((size_t*)__first, (size_t*)__last, __less<size_t>()); 40593e519524SHoward Hinnant} 40603e519524SHoward Hinnant 40613e519524SHoward Hinnanttemplate <class _Tp> 40623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 40633e519524SHoward Hinnantvoid 40643e519524SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last) 40653e519524SHoward Hinnant{ 4066ce48a113SHoward Hinnant _VSTD::sort(__first.base(), __last.base()); 40673e519524SHoward Hinnant} 40683e519524SHoward Hinnant 4069f554add5SHoward Hinnanttemplate <class _Tp, class _Compare> 4070f554add5SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 4071f554add5SHoward Hinnantvoid 4072f554add5SHoward Hinnantsort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp) 4073f554add5SHoward Hinnant{ 4074f554add5SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4075f554add5SHoward Hinnant _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp); 4076f554add5SHoward Hinnant} 4077f554add5SHoward Hinnant 40780be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4079e4383379SHoward Hinnant#pragma warning( push ) 4080e4383379SHoward Hinnant#pragma warning( disable: 4231) 40810be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 4082f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<char>&, char*>(char*, char*, __less<char>&)) 4083f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4084f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4085f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4086f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<short>&, short*>(short*, short*, __less<short>&)) 4087f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4088f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<int>&, int*>(int*, int*, __less<int>&)) 4089f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4090f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long>&, long*>(long*, long*, __less<long>&)) 4091f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4092f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4093f0544c20SHoward 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>&)) 4094f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<float>&, float*>(float*, float*, __less<float>&)) 4095f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<double>&, double*>(double*, double*, __less<double>&)) 4096f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS void __sort<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 40973e519524SHoward Hinnant 4098f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<char>&, char*>(char*, char*, __less<char>&)) 4099f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<wchar_t>&, wchar_t*>(wchar_t*, wchar_t*, __less<wchar_t>&)) 4100f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<signed char>&, signed char*>(signed char*, signed char*, __less<signed char>&)) 4101f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned char>&, unsigned char*>(unsigned char*, unsigned char*, __less<unsigned char>&)) 4102f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<short>&, short*>(short*, short*, __less<short>&)) 4103f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned short>&, unsigned short*>(unsigned short*, unsigned short*, __less<unsigned short>&)) 4104f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<int>&, int*>(int*, int*, __less<int>&)) 4105f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned>&, unsigned*>(unsigned*, unsigned*, __less<unsigned>&)) 4106f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long>&, long*>(long*, long*, __less<long>&)) 4107f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<unsigned long>&, unsigned long*>(unsigned long*, unsigned long*, __less<unsigned long>&)) 4108f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long long>&, long long*>(long long*, long long*, __less<long long>&)) 4109f0544c20SHoward 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>&)) 4110f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<float>&, float*>(float*, float*, __less<float>&)) 4111f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<double>&, double*>(double*, double*, __less<double>&)) 4112f0544c20SHoward Hinnant_LIBCPP_EXTERN_TEMPLATE(_LIBCPP_FUNC_VIS bool __insertion_sort_incomplete<__less<long double>&, long double*>(long double*, long double*, __less<long double>&)) 41133e519524SHoward Hinnant 4114f0544c20SHoward 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>&)) 41150be8f64cSHoward Hinnant#ifdef _LIBCPP_MSVC 4116e4383379SHoward Hinnant#pragma warning( pop ) 41170be8f64cSHoward Hinnant#endif // _LIBCPP_MSVC 41183e519524SHoward Hinnant 41193e519524SHoward Hinnant// lower_bound 41203e519524SHoward Hinnant 41213e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41223e519524SHoward Hinnant_ForwardIterator 4123e4383379SHoward Hinnant__lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41243e519524SHoward Hinnant{ 41253e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4126ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41273e519524SHoward Hinnant while (__len != 0) 41283e519524SHoward Hinnant { 41293e519524SHoward Hinnant difference_type __l2 = __len / 2; 41303e519524SHoward Hinnant _ForwardIterator __m = __first; 4131ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4132e4383379SHoward Hinnant if (__comp(*__m, __value_)) 41333e519524SHoward Hinnant { 41343e519524SHoward Hinnant __first = ++__m; 41353e519524SHoward Hinnant __len -= __l2 + 1; 41363e519524SHoward Hinnant } 41373e519524SHoward Hinnant else 41383e519524SHoward Hinnant __len = __l2; 41393e519524SHoward Hinnant } 41403e519524SHoward Hinnant return __first; 41413e519524SHoward Hinnant} 41423e519524SHoward Hinnant 41433e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41443e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41453e519524SHoward Hinnant_ForwardIterator 4146e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41473e519524SHoward Hinnant{ 4148145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41493e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41503e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4151e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __c); 4152145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 41533e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4154e4383379SHoward Hinnant return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp); 4155145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 41563e519524SHoward Hinnant} 41573e519524SHoward Hinnant 41583e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 41593e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41603e519524SHoward Hinnant_ForwardIterator 4161e4383379SHoward Hinnantlower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 41623e519524SHoward Hinnant{ 4163e4383379SHoward Hinnant return _VSTD::lower_bound(__first, __last, __value_, 41643e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 41653e519524SHoward Hinnant} 41663e519524SHoward Hinnant 41673e519524SHoward Hinnant// upper_bound 41683e519524SHoward Hinnant 41693e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 41703e519524SHoward Hinnant_ForwardIterator 4171e4383379SHoward Hinnant__upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41723e519524SHoward Hinnant{ 41733e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4174ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 41753e519524SHoward Hinnant while (__len != 0) 41763e519524SHoward Hinnant { 41773e519524SHoward Hinnant difference_type __l2 = __len / 2; 41783e519524SHoward Hinnant _ForwardIterator __m = __first; 4179ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4180e4383379SHoward Hinnant if (__comp(__value_, *__m)) 41813e519524SHoward Hinnant __len = __l2; 41823e519524SHoward Hinnant else 41833e519524SHoward Hinnant { 41843e519524SHoward Hinnant __first = ++__m; 41853e519524SHoward Hinnant __len -= __l2 + 1; 41863e519524SHoward Hinnant } 41873e519524SHoward Hinnant } 41883e519524SHoward Hinnant return __first; 41893e519524SHoward Hinnant} 41903e519524SHoward Hinnant 41913e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 41923e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 41933e519524SHoward Hinnant_ForwardIterator 4194e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 41953e519524SHoward Hinnant{ 4196145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 41973e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 41983e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4199e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __c); 4200145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42013e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4202e4383379SHoward Hinnant return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp); 4203145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42043e519524SHoward Hinnant} 42053e519524SHoward Hinnant 42063e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42073e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42083e519524SHoward Hinnant_ForwardIterator 4209e4383379SHoward Hinnantupper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42103e519524SHoward Hinnant{ 4211e4383379SHoward Hinnant return _VSTD::upper_bound(__first, __last, __value_, 42123e519524SHoward Hinnant __less<_Tp, typename iterator_traits<_ForwardIterator>::value_type>()); 42133e519524SHoward Hinnant} 42143e519524SHoward Hinnant 42153e519524SHoward Hinnant// equal_range 42163e519524SHoward Hinnant 42173e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42183e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4219e4383379SHoward Hinnant__equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42203e519524SHoward Hinnant{ 42213e519524SHoward Hinnant typedef typename iterator_traits<_ForwardIterator>::difference_type difference_type; 4222ce48a113SHoward Hinnant difference_type __len = _VSTD::distance(__first, __last); 42233e519524SHoward Hinnant while (__len != 0) 42243e519524SHoward Hinnant { 42253e519524SHoward Hinnant difference_type __l2 = __len / 2; 42263e519524SHoward Hinnant _ForwardIterator __m = __first; 4227ce48a113SHoward Hinnant _VSTD::advance(__m, __l2); 4228e4383379SHoward Hinnant if (__comp(*__m, __value_)) 42293e519524SHoward Hinnant { 42303e519524SHoward Hinnant __first = ++__m; 42313e519524SHoward Hinnant __len -= __l2 + 1; 42323e519524SHoward Hinnant } 4233e4383379SHoward Hinnant else if (__comp(__value_, *__m)) 42343e519524SHoward Hinnant { 42353e519524SHoward Hinnant __last = __m; 42363e519524SHoward Hinnant __len = __l2; 42373e519524SHoward Hinnant } 42383e519524SHoward Hinnant else 42393e519524SHoward Hinnant { 42403e519524SHoward Hinnant _ForwardIterator __mp1 = __m; 42413e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator> 42423e519524SHoward Hinnant ( 4243e4383379SHoward Hinnant __lower_bound<_Compare>(__first, __m, __value_, __comp), 4244e4383379SHoward Hinnant __upper_bound<_Compare>(++__mp1, __last, __value_, __comp) 42453e519524SHoward Hinnant ); 42463e519524SHoward Hinnant } 42473e519524SHoward Hinnant } 42483e519524SHoward Hinnant return pair<_ForwardIterator, _ForwardIterator>(__first, __first); 42493e519524SHoward Hinnant} 42503e519524SHoward Hinnant 42513e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42533e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4254e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42553e519524SHoward Hinnant{ 4256145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42573e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42583e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4259e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __c); 4260145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42613e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4262e4383379SHoward Hinnant return __equal_range<_Comp_ref>(__first, __last, __value_, __comp); 4263145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42643e519524SHoward Hinnant} 42653e519524SHoward Hinnant 42663e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 42673e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42683e519524SHoward Hinnantpair<_ForwardIterator, _ForwardIterator> 4269e4383379SHoward Hinnantequal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 42703e519524SHoward Hinnant{ 4271e4383379SHoward Hinnant return _VSTD::equal_range(__first, __last, __value_, 42723e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 42733e519524SHoward Hinnant} 42743e519524SHoward Hinnant 42753e519524SHoward Hinnant// binary_search 42763e519524SHoward Hinnant 42773e519524SHoward Hinnanttemplate <class _Compare, class _ForwardIterator, class _Tp> 42783e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42793e519524SHoward Hinnantbool 4280e4383379SHoward Hinnant__binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42813e519524SHoward Hinnant{ 4282e4383379SHoward Hinnant __first = __lower_bound<_Compare>(__first, __last, __value_, __comp); 4283e4383379SHoward Hinnant return __first != __last && !__comp(__value_, *__first); 42843e519524SHoward Hinnant} 42853e519524SHoward Hinnant 42863e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp, class _Compare> 42873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 42883e519524SHoward Hinnantbool 4289e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) 42903e519524SHoward Hinnant{ 4291145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 42923e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 42933e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4294e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __c); 4295145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 42963e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4297e4383379SHoward Hinnant return __binary_search<_Comp_ref>(__first, __last, __value_, __comp); 4298145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 42993e519524SHoward Hinnant} 43003e519524SHoward Hinnant 43013e519524SHoward Hinnanttemplate <class _ForwardIterator, class _Tp> 43023e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43033e519524SHoward Hinnantbool 4304e4383379SHoward Hinnantbinary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) 43053e519524SHoward Hinnant{ 4306e4383379SHoward Hinnant return _VSTD::binary_search(__first, __last, __value_, 43073e519524SHoward Hinnant __less<typename iterator_traits<_ForwardIterator>::value_type, _Tp>()); 43083e519524SHoward Hinnant} 43093e519524SHoward Hinnant 43103e519524SHoward Hinnant// merge 43113e519524SHoward Hinnant 43123e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 43133e519524SHoward Hinnant_OutputIterator 43143e519524SHoward Hinnant__merge(_InputIterator1 __first1, _InputIterator1 __last1, 43153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43163e519524SHoward Hinnant{ 43173e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 43183e519524SHoward Hinnant { 43193e519524SHoward Hinnant if (__first2 == __last2) 4320ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 43213e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 43223e519524SHoward Hinnant { 43233e519524SHoward Hinnant *__result = *__first2; 43243e519524SHoward Hinnant ++__first2; 43253e519524SHoward Hinnant } 43263e519524SHoward Hinnant else 43273e519524SHoward Hinnant { 43283e519524SHoward Hinnant *__result = *__first1; 43293e519524SHoward Hinnant ++__first1; 43303e519524SHoward Hinnant } 43313e519524SHoward Hinnant } 4332ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 43333e519524SHoward Hinnant} 43343e519524SHoward Hinnant 43353e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 43363e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43373e519524SHoward Hinnant_OutputIterator 43383e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43393e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 43403e519524SHoward Hinnant{ 4341145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 43423e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 43433e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4344ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 4345145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 43463e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4347ce48a113SHoward Hinnant return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 4348145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 43493e519524SHoward Hinnant} 43503e519524SHoward Hinnant 43513e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 43523e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 43533e519524SHoward Hinnant_OutputIterator 43543e519524SHoward Hinnantmerge(_InputIterator1 __first1, _InputIterator1 __last1, 43553e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 43563e519524SHoward Hinnant{ 43573e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type __v1; 43583e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator2>::value_type __v2; 43593e519524SHoward Hinnant return merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); 43603e519524SHoward Hinnant} 43613e519524SHoward Hinnant 43623e519524SHoward Hinnant// inplace_merge 43633e519524SHoward Hinnant 4364*adfdae18SMarshall Clowtemplate <class _Compare, class _InputIterator1, class _InputIterator2, 4365*adfdae18SMarshall Clow class _OutputIterator> 4366*adfdae18SMarshall Clowvoid __half_inplace_merge(_InputIterator1 __first1, _InputIterator1 __last1, 4367*adfdae18SMarshall Clow _InputIterator2 __first2, _InputIterator2 __last2, 4368*adfdae18SMarshall Clow _OutputIterator __result, _Compare __comp) 4369*adfdae18SMarshall Clow{ 4370*adfdae18SMarshall Clow for (; __first1 != __last1; ++__result) 4371*adfdae18SMarshall Clow { 4372*adfdae18SMarshall Clow if (__first2 == __last2) 4373*adfdae18SMarshall Clow { 4374*adfdae18SMarshall Clow _VSTD::move(__first1, __last1, __result); 4375*adfdae18SMarshall Clow return; 4376*adfdae18SMarshall Clow } 4377*adfdae18SMarshall Clow 4378*adfdae18SMarshall Clow if (__comp(*__first2, *__first1)) 4379*adfdae18SMarshall Clow { 4380*adfdae18SMarshall Clow *__result = _VSTD::move(*__first2); 4381*adfdae18SMarshall Clow ++__first2; 4382*adfdae18SMarshall Clow } 4383*adfdae18SMarshall Clow else 4384*adfdae18SMarshall Clow { 4385*adfdae18SMarshall Clow *__result = _VSTD::move(*__first1); 4386*adfdae18SMarshall Clow ++__first1; 4387*adfdae18SMarshall Clow } 4388*adfdae18SMarshall Clow } 4389*adfdae18SMarshall Clow // __first2 through __last2 are already in the right spot. 4390*adfdae18SMarshall Clow} 4391*adfdae18SMarshall Clow 43923e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 43933e519524SHoward Hinnantvoid 43943e519524SHoward Hinnant__buffered_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 43953e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 43963e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 43973e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff) 43983e519524SHoward Hinnant{ 43993e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 44003e519524SHoward Hinnant __destruct_n __d(0); 44013e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 44023e519524SHoward Hinnant if (__len1 <= __len2) 44033e519524SHoward Hinnant { 44043e519524SHoward Hinnant value_type* __p = __buff; 4405910285b2SEric Fiselier for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4406ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 4407*adfdae18SMarshall Clow __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp); 44083e519524SHoward Hinnant } 44093e519524SHoward Hinnant else 44103e519524SHoward Hinnant { 44113e519524SHoward Hinnant value_type* __p = __buff; 4412910285b2SEric Fiselier for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__i, ++__p) 4413ce48a113SHoward Hinnant ::new(__p) value_type(_VSTD::move(*__i)); 44143e519524SHoward Hinnant typedef reverse_iterator<_BidirectionalIterator> _RBi; 44153e519524SHoward Hinnant typedef reverse_iterator<value_type*> _Rv; 4416*adfdae18SMarshall Clow __half_inplace_merge(_Rv(__p), _Rv(__buff), 4417*adfdae18SMarshall Clow _RBi(__middle), _RBi(__first), 44183e519524SHoward Hinnant _RBi(__last), __negate<_Compare>(__comp)); 44193e519524SHoward Hinnant } 44203e519524SHoward Hinnant} 44213e519524SHoward Hinnant 44223e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 44233e519524SHoward Hinnantvoid 44243e519524SHoward Hinnant__inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 44253e519524SHoward Hinnant _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, 44263e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::difference_type __len2, 44273e519524SHoward Hinnant typename iterator_traits<_BidirectionalIterator>::value_type* __buff, ptrdiff_t __buff_size) 44283e519524SHoward Hinnant{ 44293e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 44303e519524SHoward Hinnant while (true) 44313e519524SHoward Hinnant { 44323e519524SHoward Hinnant // if __middle == __last, we're done 44333e519524SHoward Hinnant if (__len2 == 0) 44343e519524SHoward Hinnant return; 4435526e0929SMarshall Clow if (__len1 <= __buff_size || __len2 <= __buff_size) 4436526e0929SMarshall Clow return __buffered_inplace_merge<_Compare> 4437526e0929SMarshall Clow (__first, __middle, __last, __comp, __len1, __len2, __buff); 44383e519524SHoward Hinnant // shrink [__first, __middle) as much as possible (with no moves), returning if it shrinks to 0 4439910285b2SEric Fiselier for (; true; ++__first, (void) --__len1) 44403e519524SHoward Hinnant { 44413e519524SHoward Hinnant if (__len1 == 0) 44423e519524SHoward Hinnant return; 44433e519524SHoward Hinnant if (__comp(*__middle, *__first)) 44443e519524SHoward Hinnant break; 44453e519524SHoward Hinnant } 44463e519524SHoward Hinnant // __first < __middle < __last 44473e519524SHoward Hinnant // *__first > *__middle 44483e519524SHoward Hinnant // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that 44493e519524SHoward Hinnant // all elements in: 44503e519524SHoward Hinnant // [__first, __m1) <= [__middle, __m2) 44513e519524SHoward Hinnant // [__middle, __m2) < [__m1, __middle) 44523e519524SHoward Hinnant // [__m1, __middle) <= [__m2, __last) 44533e519524SHoward Hinnant // and __m1 or __m2 is in the middle of its range 44543e519524SHoward Hinnant _BidirectionalIterator __m1; // "median" of [__first, __middle) 44553e519524SHoward Hinnant _BidirectionalIterator __m2; // "median" of [__middle, __last) 44563e519524SHoward Hinnant difference_type __len11; // distance(__first, __m1) 44573e519524SHoward Hinnant difference_type __len21; // distance(__middle, __m2) 44583e519524SHoward Hinnant // binary search smaller range 44593e519524SHoward Hinnant if (__len1 < __len2) 44603e519524SHoward Hinnant { // __len >= 1, __len2 >= 2 44613e519524SHoward Hinnant __len21 = __len2 / 2; 44623e519524SHoward Hinnant __m2 = __middle; 4463ce48a113SHoward Hinnant _VSTD::advance(__m2, __len21); 44643e519524SHoward Hinnant __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp); 4465ce48a113SHoward Hinnant __len11 = _VSTD::distance(__first, __m1); 44663e519524SHoward Hinnant } 44673e519524SHoward Hinnant else 44683e519524SHoward Hinnant { 44693e519524SHoward Hinnant if (__len1 == 1) 44703e519524SHoward Hinnant { // __len1 >= __len2 && __len2 > 0, therefore __len2 == 1 44713e519524SHoward Hinnant // It is known *__first > *__middle 44723e519524SHoward Hinnant swap(*__first, *__middle); 44733e519524SHoward Hinnant return; 44743e519524SHoward Hinnant } 44753e519524SHoward Hinnant // __len1 >= 2, __len2 >= 1 44763e519524SHoward Hinnant __len11 = __len1 / 2; 44773e519524SHoward Hinnant __m1 = __first; 4478ce48a113SHoward Hinnant _VSTD::advance(__m1, __len11); 44793e519524SHoward Hinnant __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp); 4480ce48a113SHoward Hinnant __len21 = _VSTD::distance(__middle, __m2); 44813e519524SHoward Hinnant } 44823e519524SHoward Hinnant difference_type __len12 = __len1 - __len11; // distance(__m1, __middle) 44833e519524SHoward Hinnant difference_type __len22 = __len2 - __len21; // distance(__m2, __last) 44843e519524SHoward Hinnant // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) 44853e519524SHoward Hinnant // swap middle two partitions 4486ce48a113SHoward Hinnant __middle = _VSTD::rotate(__m1, __middle, __m2); 44873e519524SHoward Hinnant // __len12 and __len21 now have swapped meanings 44883e519524SHoward Hinnant // merge smaller range with recurisve call and larger with tail recursion elimination 44893e519524SHoward Hinnant if (__len11 + __len21 < __len12 + __len22) 44903e519524SHoward Hinnant { 44913e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 44923e519524SHoward Hinnant// __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 44933e519524SHoward Hinnant __first = __middle; 44943e519524SHoward Hinnant __middle = __m2; 44953e519524SHoward Hinnant __len1 = __len12; 44963e519524SHoward Hinnant __len2 = __len22; 44973e519524SHoward Hinnant } 44983e519524SHoward Hinnant else 44993e519524SHoward Hinnant { 45003e519524SHoward Hinnant __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size); 45013e519524SHoward Hinnant// __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size); 45023e519524SHoward Hinnant __last = __middle; 45033e519524SHoward Hinnant __middle = __m1; 45043e519524SHoward Hinnant __len1 = __len11; 45053e519524SHoward Hinnant __len2 = __len21; 45063e519524SHoward Hinnant } 45073e519524SHoward Hinnant } 45083e519524SHoward Hinnant} 45093e519524SHoward Hinnant 45103e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 45113e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45123e519524SHoward Hinnantvoid 45133e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, 45143e519524SHoward Hinnant _Compare __comp) 45153e519524SHoward Hinnant{ 45163e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; 45173e519524SHoward Hinnant typedef typename iterator_traits<_BidirectionalIterator>::difference_type difference_type; 4518ce48a113SHoward Hinnant difference_type __len1 = _VSTD::distance(__first, __middle); 4519ce48a113SHoward Hinnant difference_type __len2 = _VSTD::distance(__middle, __last); 4520ce48a113SHoward Hinnant difference_type __buf_size = _VSTD::min(__len1, __len2); 45210b48cf9aSMarshall Clow pair<value_type*, ptrdiff_t> __buf = _VSTD::get_temporary_buffer<value_type>(__buf_size); 45220b48cf9aSMarshall Clow unique_ptr<value_type, __return_temporary_buffer> __h(__buf.first); 45230b48cf9aSMarshall Clow 4524145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 45253e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 45263e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 4527ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __c, __len1, __len2, 45283e519524SHoward Hinnant __buf.first, __buf.second); 4529145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 45303e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 4531ce48a113SHoward Hinnant return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2, 45323e519524SHoward Hinnant __buf.first, __buf.second); 4533145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 45343e519524SHoward Hinnant} 45353e519524SHoward Hinnant 45363e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 45373e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 45383e519524SHoward Hinnantvoid 45393e519524SHoward Hinnantinplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) 45403e519524SHoward Hinnant{ 4541ce48a113SHoward Hinnant _VSTD::inplace_merge(__first, __middle, __last, 45423e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 45433e519524SHoward Hinnant} 45443e519524SHoward Hinnant 45453e519524SHoward Hinnant// stable_sort 45463e519524SHoward Hinnant 45473e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 45483e519524SHoward Hinnantvoid 45493e519524SHoward Hinnant__merge_move_construct(_InputIterator1 __first1, _InputIterator1 __last1, 45503e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45513e519524SHoward Hinnant typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) 45523e519524SHoward Hinnant{ 45533e519524SHoward Hinnant typedef typename iterator_traits<_InputIterator1>::value_type value_type; 45543e519524SHoward Hinnant __destruct_n __d(0); 45553e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h(__result, __d); 45563e519524SHoward Hinnant for (; true; ++__result) 45573e519524SHoward Hinnant { 45583e519524SHoward Hinnant if (__first1 == __last1) 45593e519524SHoward Hinnant { 45603e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result, __d.__incr((value_type*)0)) 4561ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45623e519524SHoward Hinnant __h.release(); 45633e519524SHoward Hinnant return; 45643e519524SHoward Hinnant } 45653e519524SHoward Hinnant if (__first2 == __last2) 45663e519524SHoward Hinnant { 45673e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result, __d.__incr((value_type*)0)) 4568ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45693e519524SHoward Hinnant __h.release(); 45703e519524SHoward Hinnant return; 45713e519524SHoward Hinnant } 45723e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 45733e519524SHoward Hinnant { 4574ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first2)); 45753e519524SHoward Hinnant __d.__incr((value_type*)0); 45763e519524SHoward Hinnant ++__first2; 45773e519524SHoward Hinnant } 45783e519524SHoward Hinnant else 45793e519524SHoward Hinnant { 4580ce48a113SHoward Hinnant ::new (__result) value_type(_VSTD::move(*__first1)); 45813e519524SHoward Hinnant __d.__incr((value_type*)0); 45823e519524SHoward Hinnant ++__first1; 45833e519524SHoward Hinnant } 45843e519524SHoward Hinnant } 45853e519524SHoward Hinnant} 45863e519524SHoward Hinnant 45873e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 45883e519524SHoward Hinnantvoid 45893e519524SHoward Hinnant__merge_move_assign(_InputIterator1 __first1, _InputIterator1 __last1, 45903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, 45913e519524SHoward Hinnant _OutputIterator __result, _Compare __comp) 45923e519524SHoward Hinnant{ 45933e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 45943e519524SHoward Hinnant { 45953e519524SHoward Hinnant if (__first2 == __last2) 45963e519524SHoward Hinnant { 45973e519524SHoward Hinnant for (; __first1 != __last1; ++__first1, ++__result) 4598ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 45993e519524SHoward Hinnant return; 46003e519524SHoward Hinnant } 46013e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 46023e519524SHoward Hinnant { 4603ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46043e519524SHoward Hinnant ++__first2; 46053e519524SHoward Hinnant } 46063e519524SHoward Hinnant else 46073e519524SHoward Hinnant { 4608ce48a113SHoward Hinnant *__result = _VSTD::move(*__first1); 46093e519524SHoward Hinnant ++__first1; 46103e519524SHoward Hinnant } 46113e519524SHoward Hinnant } 46123e519524SHoward Hinnant for (; __first2 != __last2; ++__first2, ++__result) 4613ce48a113SHoward Hinnant *__result = _VSTD::move(*__first2); 46143e519524SHoward Hinnant} 46153e519524SHoward Hinnant 46163e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46173e519524SHoward Hinnantvoid 46183e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46193e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size); 46213e519524SHoward Hinnant 46223e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46233e519524SHoward Hinnantvoid 46243e519524SHoward Hinnant__stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, 46253e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46263e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __first2) 46273e519524SHoward Hinnant{ 46283e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46293e519524SHoward Hinnant switch (__len) 46303e519524SHoward Hinnant { 46313e519524SHoward Hinnant case 0: 46323e519524SHoward Hinnant return; 46333e519524SHoward Hinnant case 1: 4634ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46353e519524SHoward Hinnant return; 46363e519524SHoward Hinnant case 2: 46373e519524SHoward Hinnant __destruct_n __d(0); 46383e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__first2, __d); 46393e519524SHoward Hinnant if (__comp(*--__last1, *__first1)) 46403e519524SHoward Hinnant { 4641ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46423e519524SHoward Hinnant __d.__incr((value_type*)0); 46433e519524SHoward Hinnant ++__first2; 4644ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46453e519524SHoward Hinnant } 46463e519524SHoward Hinnant else 46473e519524SHoward Hinnant { 4648ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__first1)); 46493e519524SHoward Hinnant __d.__incr((value_type*)0); 46503e519524SHoward Hinnant ++__first2; 4651ce48a113SHoward Hinnant ::new(__first2) value_type(_VSTD::move(*__last1)); 46523e519524SHoward Hinnant } 46533e519524SHoward Hinnant __h2.release(); 46543e519524SHoward Hinnant return; 46553e519524SHoward Hinnant } 46563e519524SHoward Hinnant if (__len <= 8) 46573e519524SHoward Hinnant { 46583e519524SHoward Hinnant __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); 46593e519524SHoward Hinnant return; 46603e519524SHoward Hinnant } 46613e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46623e519524SHoward Hinnant _RandomAccessIterator __m = __first1 + __l2; 46633e519524SHoward Hinnant __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); 46643e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); 46653e519524SHoward Hinnant __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp); 46663e519524SHoward Hinnant} 46673e519524SHoward Hinnant 46683e519524SHoward Hinnanttemplate <class _Tp> 46693e519524SHoward Hinnantstruct __stable_sort_switch 46703e519524SHoward Hinnant{ 4671ca740483SHoward Hinnant static const unsigned value = 128*is_trivially_copy_assignable<_Tp>::value; 46723e519524SHoward Hinnant}; 46733e519524SHoward Hinnant 46743e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 46753e519524SHoward Hinnantvoid 46763e519524SHoward Hinnant__stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 46773e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len, 46783e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::value_type* __buff, ptrdiff_t __buff_size) 46793e519524SHoward Hinnant{ 46803e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 46813e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 46823e519524SHoward Hinnant switch (__len) 46833e519524SHoward Hinnant { 46843e519524SHoward Hinnant case 0: 46853e519524SHoward Hinnant case 1: 46863e519524SHoward Hinnant return; 46873e519524SHoward Hinnant case 2: 46883e519524SHoward Hinnant if (__comp(*--__last, *__first)) 46893e519524SHoward Hinnant swap(*__first, *__last); 46903e519524SHoward Hinnant return; 46913e519524SHoward Hinnant } 46923e519524SHoward Hinnant if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 46933e519524SHoward Hinnant { 46943e519524SHoward Hinnant __insertion_sort<_Compare>(__first, __last, __comp); 46953e519524SHoward Hinnant return; 46963e519524SHoward Hinnant } 46973e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2; 46983e519524SHoward Hinnant _RandomAccessIterator __m = __first + __l2; 46993e519524SHoward Hinnant if (__len <= __buff_size) 47003e519524SHoward Hinnant { 47013e519524SHoward Hinnant __destruct_n __d(0); 47023e519524SHoward Hinnant unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); 47033e519524SHoward Hinnant __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff); 47043e519524SHoward Hinnant __d.__set(__l2, (value_type*)0); 47053e519524SHoward Hinnant __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2); 47063e519524SHoward Hinnant __d.__set(__len, (value_type*)0); 47073e519524SHoward Hinnant __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp); 47083e519524SHoward Hinnant// __merge<_Compare>(move_iterator<value_type*>(__buff), 47093e519524SHoward Hinnant// move_iterator<value_type*>(__buff + __l2), 47103e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __l2), 47113e519524SHoward Hinnant// move_iterator<_RandomAccessIterator>(__buff + __len), 47123e519524SHoward Hinnant// __first, __comp); 47133e519524SHoward Hinnant return; 47143e519524SHoward Hinnant } 47153e519524SHoward Hinnant __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size); 47163e519524SHoward Hinnant __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size); 47173e519524SHoward Hinnant __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size); 47183e519524SHoward Hinnant} 47193e519524SHoward Hinnant 47203e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47213e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47223e519524SHoward Hinnantvoid 47233e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47243e519524SHoward Hinnant{ 47253e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 47263e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47273e519524SHoward Hinnant difference_type __len = __last - __first; 47283e519524SHoward Hinnant pair<value_type*, ptrdiff_t> __buf(0, 0); 47293e519524SHoward Hinnant unique_ptr<value_type, __return_temporary_buffer> __h; 47303e519524SHoward Hinnant if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value)) 47313e519524SHoward Hinnant { 4732ce48a113SHoward Hinnant __buf = _VSTD::get_temporary_buffer<value_type>(__len); 47333e519524SHoward Hinnant __h.reset(__buf.first); 47343e519524SHoward Hinnant } 4735145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 47363e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 47373e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 47383e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second); 4739145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 47403e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 47413e519524SHoward Hinnant __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second); 4742145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 47433e519524SHoward Hinnant} 47443e519524SHoward Hinnant 47453e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 47463e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47473e519524SHoward Hinnantvoid 47483e519524SHoward Hinnantstable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) 47493e519524SHoward Hinnant{ 4750ce48a113SHoward Hinnant _VSTD::stable_sort(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47513e519524SHoward Hinnant} 47523e519524SHoward Hinnant 47533e519524SHoward Hinnant// is_heap_until 47543e519524SHoward Hinnant 47553e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47563e519524SHoward Hinnant_RandomAccessIterator 47573e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47583e519524SHoward Hinnant{ 4759ce48a113SHoward Hinnant typedef typename _VSTD::iterator_traits<_RandomAccessIterator>::difference_type difference_type; 47603e519524SHoward Hinnant difference_type __len = __last - __first; 47613e519524SHoward Hinnant difference_type __p = 0; 47623e519524SHoward Hinnant difference_type __c = 1; 47633e519524SHoward Hinnant _RandomAccessIterator __pp = __first; 47643e519524SHoward Hinnant while (__c < __len) 47653e519524SHoward Hinnant { 47663e519524SHoward Hinnant _RandomAccessIterator __cp = __first + __c; 47673e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47683e519524SHoward Hinnant return __cp; 47693e519524SHoward Hinnant ++__c; 47703e519524SHoward Hinnant ++__cp; 47713e519524SHoward Hinnant if (__c == __len) 47723e519524SHoward Hinnant return __last; 47733e519524SHoward Hinnant if (__comp(*__pp, *__cp)) 47743e519524SHoward Hinnant return __cp; 47753e519524SHoward Hinnant ++__p; 47763e519524SHoward Hinnant ++__pp; 47773e519524SHoward Hinnant __c = 2 * __p + 1; 47783e519524SHoward Hinnant } 47793e519524SHoward Hinnant return __last; 47803e519524SHoward Hinnant} 47813e519524SHoward Hinnant 47823e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 47833e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47843e519524SHoward Hinnant_RandomAccessIterator 47853e519524SHoward Hinnantis_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) 47863e519524SHoward Hinnant{ 4787ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 47883e519524SHoward Hinnant} 47893e519524SHoward Hinnant 47903e519524SHoward Hinnant// is_heap 47913e519524SHoward Hinnant 47923e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 47933e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 47943e519524SHoward Hinnantbool 47953e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 47963e519524SHoward Hinnant{ 4797ce48a113SHoward Hinnant return _VSTD::is_heap_until(__first, __last, __comp) == __last; 47983e519524SHoward Hinnant} 47993e519524SHoward Hinnant 48003e519524SHoward Hinnanttemplate<class _RandomAccessIterator> 48013e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48023e519524SHoward Hinnantbool 48033e519524SHoward Hinnantis_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48043e519524SHoward Hinnant{ 4805ce48a113SHoward Hinnant return _VSTD::is_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48063e519524SHoward Hinnant} 48073e519524SHoward Hinnant 48083e519524SHoward Hinnant// push_heap 48093e519524SHoward Hinnant 48103e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48113e519524SHoward Hinnantvoid 48128b512602SDavid Majnemer__sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48133e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 48143e519524SHoward Hinnant{ 48153e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48163e519524SHoward Hinnant if (__len > 1) 48173e519524SHoward Hinnant { 48183e519524SHoward Hinnant __len = (__len - 2) / 2; 48193e519524SHoward Hinnant _RandomAccessIterator __ptr = __first + __len; 48203e519524SHoward Hinnant if (__comp(*__ptr, *--__last)) 48213e519524SHoward Hinnant { 4822ce48a113SHoward Hinnant value_type __t(_VSTD::move(*__last)); 48233e519524SHoward Hinnant do 48243e519524SHoward Hinnant { 4825ce48a113SHoward Hinnant *__last = _VSTD::move(*__ptr); 48263e519524SHoward Hinnant __last = __ptr; 48273e519524SHoward Hinnant if (__len == 0) 48283e519524SHoward Hinnant break; 48293e519524SHoward Hinnant __len = (__len - 1) / 2; 48303e519524SHoward Hinnant __ptr = __first + __len; 48313e519524SHoward Hinnant } while (__comp(*__ptr, __t)); 4832ce48a113SHoward Hinnant *__last = _VSTD::move(__t); 48333e519524SHoward Hinnant } 48343e519524SHoward Hinnant } 48353e519524SHoward Hinnant} 48363e519524SHoward Hinnant 48373e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 48383e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48393e519524SHoward Hinnantvoid 48403e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 48413e519524SHoward Hinnant{ 4842145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 48433e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 48443e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 48458b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __c, __last - __first); 4846145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 48473e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 48488b512602SDavid Majnemer __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); 4849145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 48503e519524SHoward Hinnant} 48513e519524SHoward Hinnant 48523e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 48533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 48543e519524SHoward Hinnantvoid 48553e519524SHoward Hinnantpush_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 48563e519524SHoward Hinnant{ 4857ce48a113SHoward Hinnant _VSTD::push_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 48583e519524SHoward Hinnant} 48593e519524SHoward Hinnant 48603e519524SHoward Hinnant// pop_heap 48613e519524SHoward Hinnant 48623e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 48638b512602SDavid Majnemervoid 48648b512602SDavid Majnemer__sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 48658b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len, 48668b512602SDavid Majnemer _RandomAccessIterator __start) 48678b512602SDavid Majnemer{ 48688b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 48698b512602SDavid Majnemer typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; 48708b512602SDavid Majnemer // left-child of __start is at 2 * __start + 1 48718b512602SDavid Majnemer // right-child of __start is at 2 * __start + 2 48728b512602SDavid Majnemer difference_type __child = __start - __first; 48738b512602SDavid Majnemer 48748b512602SDavid Majnemer if (__len < 2 || (__len - 2) / 2 < __child) 48758b512602SDavid Majnemer return; 48768b512602SDavid Majnemer 48778b512602SDavid Majnemer __child = 2 * __child + 1; 48788b512602SDavid Majnemer _RandomAccessIterator __child_i = __first + __child; 48798b512602SDavid Majnemer 48808b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 48818b512602SDavid Majnemer // right-child exists and is greater than left-child 48828b512602SDavid Majnemer ++__child_i; 48838b512602SDavid Majnemer ++__child; 48848b512602SDavid Majnemer } 48858b512602SDavid Majnemer 48868b512602SDavid Majnemer // check if we are in heap-order 48878b512602SDavid Majnemer if (__comp(*__child_i, *__start)) 48888b512602SDavid Majnemer // we are, __start is larger than it's largest child 48898b512602SDavid Majnemer return; 48908b512602SDavid Majnemer 48918b512602SDavid Majnemer value_type __top(_VSTD::move(*__start)); 48928b512602SDavid Majnemer do 48938b512602SDavid Majnemer { 48948b512602SDavid Majnemer // we are not in heap-order, swap the parent with it's largest child 48958b512602SDavid Majnemer *__start = _VSTD::move(*__child_i); 48968b512602SDavid Majnemer __start = __child_i; 48978b512602SDavid Majnemer 48988b512602SDavid Majnemer if ((__len - 2) / 2 < __child) 48998b512602SDavid Majnemer break; 49008b512602SDavid Majnemer 49018b512602SDavid Majnemer // recompute the child based off of the updated parent 49028b512602SDavid Majnemer __child = 2 * __child + 1; 49038b512602SDavid Majnemer __child_i = __first + __child; 49048b512602SDavid Majnemer 49058b512602SDavid Majnemer if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 49068b512602SDavid Majnemer // right-child exists and is greater than left-child 49078b512602SDavid Majnemer ++__child_i; 49088b512602SDavid Majnemer ++__child; 49098b512602SDavid Majnemer } 49108b512602SDavid Majnemer 49118b512602SDavid Majnemer // check if we are in heap-order 49128b512602SDavid Majnemer } while (!__comp(*__child_i, __top)); 49138b512602SDavid Majnemer *__start = _VSTD::move(__top); 49148b512602SDavid Majnemer} 49158b512602SDavid Majnemer 49168b512602SDavid Majnemertemplate <class _Compare, class _RandomAccessIterator> 49173e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49183e519524SHoward Hinnantvoid 49193e519524SHoward Hinnant__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, 49203e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len) 49213e519524SHoward Hinnant{ 49223e519524SHoward Hinnant if (__len > 1) 49233e519524SHoward Hinnant { 49243e519524SHoward Hinnant swap(*__first, *--__last); 49258b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); 49263e519524SHoward Hinnant } 49273e519524SHoward Hinnant} 49283e519524SHoward Hinnant 49293e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49303e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49313e519524SHoward Hinnantvoid 49323e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49333e519524SHoward Hinnant{ 4934145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49353e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49363e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49373e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __c, __last - __first); 4938145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49393e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49403e519524SHoward Hinnant __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); 4941145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49423e519524SHoward Hinnant} 49433e519524SHoward Hinnant 49443e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49453e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49463e519524SHoward Hinnantvoid 49473e519524SHoward Hinnantpop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49483e519524SHoward Hinnant{ 4949ce48a113SHoward Hinnant _VSTD::pop_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49503e519524SHoward Hinnant} 49513e519524SHoward Hinnant 49523e519524SHoward Hinnant// make_heap 49533e519524SHoward Hinnant 49543e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49553e519524SHoward Hinnantvoid 49563e519524SHoward Hinnant__make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49573e519524SHoward Hinnant{ 49583e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 49593e519524SHoward Hinnant difference_type __n = __last - __first; 49603e519524SHoward Hinnant if (__n > 1) 49613e519524SHoward Hinnant { 49628b512602SDavid Majnemer // start from the first parent, there is no need to consider children 49638b512602SDavid Majnemer for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start) 49648b512602SDavid Majnemer { 49658b512602SDavid Majnemer __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start); 49668b512602SDavid Majnemer } 49673e519524SHoward Hinnant } 49683e519524SHoward Hinnant} 49693e519524SHoward Hinnant 49703e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 49713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49723e519524SHoward Hinnantvoid 49733e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49743e519524SHoward Hinnant{ 4975145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 49763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 49773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 49783e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __c); 4979145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 49803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 49813e519524SHoward Hinnant __make_heap<_Comp_ref>(__first, __last, __comp); 4982145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 49833e519524SHoward Hinnant} 49843e519524SHoward Hinnant 49853e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 49863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 49873e519524SHoward Hinnantvoid 49883e519524SHoward Hinnantmake_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 49893e519524SHoward Hinnant{ 4990ce48a113SHoward Hinnant _VSTD::make_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 49913e519524SHoward Hinnant} 49923e519524SHoward Hinnant 49933e519524SHoward Hinnant// sort_heap 49943e519524SHoward Hinnant 49953e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 49963e519524SHoward Hinnantvoid 49973e519524SHoward Hinnant__sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 49983e519524SHoward Hinnant{ 49993e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 50003e519524SHoward Hinnant for (difference_type __n = __last - __first; __n > 1; --__last, --__n) 50013e519524SHoward Hinnant __pop_heap<_Compare>(__first, __last, __comp, __n); 50023e519524SHoward Hinnant} 50033e519524SHoward Hinnant 50043e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50053e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50063e519524SHoward Hinnantvoid 50073e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) 50083e519524SHoward Hinnant{ 5009145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50103e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50113e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50123e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __c); 5013145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50143e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50153e519524SHoward Hinnant __sort_heap<_Comp_ref>(__first, __last, __comp); 5016145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50173e519524SHoward Hinnant} 50183e519524SHoward Hinnant 50193e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50203e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50213e519524SHoward Hinnantvoid 50223e519524SHoward Hinnantsort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) 50233e519524SHoward Hinnant{ 5024ce48a113SHoward Hinnant _VSTD::sort_heap(__first, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50253e519524SHoward Hinnant} 50263e519524SHoward Hinnant 50273e519524SHoward Hinnant// partial_sort 50283e519524SHoward Hinnant 50293e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 50303e519524SHoward Hinnantvoid 50313e519524SHoward Hinnant__partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50323e519524SHoward Hinnant _Compare __comp) 50333e519524SHoward Hinnant{ 50343e519524SHoward Hinnant __make_heap<_Compare>(__first, __middle, __comp); 50353e519524SHoward Hinnant typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; 50363e519524SHoward Hinnant for (_RandomAccessIterator __i = __middle; __i != __last; ++__i) 50373e519524SHoward Hinnant { 50383e519524SHoward Hinnant if (__comp(*__i, *__first)) 50393e519524SHoward Hinnant { 50403e519524SHoward Hinnant swap(*__i, *__first); 50418b512602SDavid Majnemer __sift_down<_Compare>(__first, __middle, __comp, __len, __first); 50423e519524SHoward Hinnant } 50433e519524SHoward Hinnant } 50443e519524SHoward Hinnant __sort_heap<_Compare>(__first, __middle, __comp); 50453e519524SHoward Hinnant} 50463e519524SHoward Hinnant 50473e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 50483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50493e519524SHoward Hinnantvoid 50503e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, 50513e519524SHoward Hinnant _Compare __comp) 50523e519524SHoward Hinnant{ 5053145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 50543e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 50553e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 50563e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __c); 5057145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 50583e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 50593e519524SHoward Hinnant __partial_sort<_Comp_ref>(__first, __middle, __last, __comp); 5060145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 50613e519524SHoward Hinnant} 50623e519524SHoward Hinnant 50633e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 50643e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50653e519524SHoward Hinnantvoid 50663e519524SHoward Hinnantpartial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) 50673e519524SHoward Hinnant{ 5068ce48a113SHoward Hinnant _VSTD::partial_sort(__first, __middle, __last, 50693e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 50703e519524SHoward Hinnant} 50713e519524SHoward Hinnant 50723e519524SHoward Hinnant// partial_sort_copy 50733e519524SHoward Hinnant 50743e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator, class _RandomAccessIterator> 50753e519524SHoward Hinnant_RandomAccessIterator 50763e519524SHoward Hinnant__partial_sort_copy(_InputIterator __first, _InputIterator __last, 50773e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 50783e519524SHoward Hinnant{ 50793e519524SHoward Hinnant _RandomAccessIterator __r = __result_first; 50803e519524SHoward Hinnant if (__r != __result_last) 50813e519524SHoward Hinnant { 5082910285b2SEric Fiselier for (; __first != __last && __r != __result_last; (void) ++__first, ++__r) 50833e519524SHoward Hinnant *__r = *__first; 50843e519524SHoward Hinnant __make_heap<_Compare>(__result_first, __r, __comp); 50858b512602SDavid Majnemer typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first; 50863e519524SHoward Hinnant for (; __first != __last; ++__first) 50873e519524SHoward Hinnant if (__comp(*__first, *__result_first)) 50883e519524SHoward Hinnant { 50893e519524SHoward Hinnant *__result_first = *__first; 50908b512602SDavid Majnemer __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); 50913e519524SHoward Hinnant } 50923e519524SHoward Hinnant __sort_heap<_Compare>(__result_first, __r, __comp); 50933e519524SHoward Hinnant } 50943e519524SHoward Hinnant return __r; 50953e519524SHoward Hinnant} 50963e519524SHoward Hinnant 50973e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator, class _Compare> 50983e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 50993e519524SHoward Hinnant_RandomAccessIterator 51003e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51013e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) 51023e519524SHoward Hinnant{ 5103145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 51043e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 51053e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 51063e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __c); 5107145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 51083e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 51093e519524SHoward Hinnant return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); 5110145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 51113e519524SHoward Hinnant} 51123e519524SHoward Hinnant 51133e519524SHoward Hinnanttemplate <class _InputIterator, class _RandomAccessIterator> 51143e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 51153e519524SHoward Hinnant_RandomAccessIterator 51163e519524SHoward Hinnantpartial_sort_copy(_InputIterator __first, _InputIterator __last, 51173e519524SHoward Hinnant _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) 51183e519524SHoward Hinnant{ 5119ce48a113SHoward Hinnant return _VSTD::partial_sort_copy(__first, __last, __result_first, __result_last, 51203e519524SHoward Hinnant __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 51213e519524SHoward Hinnant} 51223e519524SHoward Hinnant 51233e519524SHoward Hinnant// nth_element 51243e519524SHoward Hinnant 51253e519524SHoward Hinnanttemplate <class _Compare, class _RandomAccessIterator> 51263e519524SHoward Hinnantvoid 51273e519524SHoward Hinnant__nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 51283e519524SHoward Hinnant{ 51293e519524SHoward Hinnant // _Compare is known to be a reference type 51303e519524SHoward Hinnant typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type; 51313e519524SHoward Hinnant const difference_type __limit = 7; 51323e519524SHoward Hinnant while (true) 51333e519524SHoward Hinnant { 51343e519524SHoward Hinnant __restart: 5135b34b4819SHoward Hinnant if (__nth == __last) 5136b34b4819SHoward Hinnant return; 51373e519524SHoward Hinnant difference_type __len = __last - __first; 51383e519524SHoward Hinnant switch (__len) 51393e519524SHoward Hinnant { 51403e519524SHoward Hinnant case 0: 51413e519524SHoward Hinnant case 1: 51423e519524SHoward Hinnant return; 51433e519524SHoward Hinnant case 2: 51443e519524SHoward Hinnant if (__comp(*--__last, *__first)) 51453e519524SHoward Hinnant swap(*__first, *__last); 51463e519524SHoward Hinnant return; 51473e519524SHoward Hinnant case 3: 51483e519524SHoward Hinnant { 51493e519524SHoward Hinnant _RandomAccessIterator __m = __first; 5150ce48a113SHoward Hinnant _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); 51513e519524SHoward Hinnant return; 51523e519524SHoward Hinnant } 51533e519524SHoward Hinnant } 51543e519524SHoward Hinnant if (__len <= __limit) 51553e519524SHoward Hinnant { 51563e519524SHoward Hinnant __selection_sort<_Compare>(__first, __last, __comp); 51573e519524SHoward Hinnant return; 51583e519524SHoward Hinnant } 51593e519524SHoward Hinnant // __len > __limit >= 3 51603e519524SHoward Hinnant _RandomAccessIterator __m = __first + __len/2; 51613e519524SHoward Hinnant _RandomAccessIterator __lm1 = __last; 5162ce48a113SHoward Hinnant unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); 51633e519524SHoward Hinnant // *__m is median 51643e519524SHoward Hinnant // partition [__first, __m) < *__m and *__m <= [__m, __last) 51653e519524SHoward Hinnant // (this inhibits tossing elements equivalent to __m around unnecessarily) 51663e519524SHoward Hinnant _RandomAccessIterator __i = __first; 51673e519524SHoward Hinnant _RandomAccessIterator __j = __lm1; 51683e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 51693e519524SHoward Hinnant // The search going up is known to be guarded but the search coming down isn't. 51703e519524SHoward Hinnant // Prime the downward search with a guard. 51713e519524SHoward Hinnant if (!__comp(*__i, *__m)) // if *__first == *__m 51723e519524SHoward Hinnant { 51733e519524SHoward Hinnant // *__first == *__m, *__first doesn't go in first part 51743e519524SHoward Hinnant // manually guard downward moving __j against __i 51753e519524SHoward Hinnant while (true) 51763e519524SHoward Hinnant { 51773e519524SHoward Hinnant if (__i == --__j) 51783e519524SHoward Hinnant { 51793e519524SHoward Hinnant // *__first == *__m, *__m <= all other elements 51803e519524SHoward Hinnant // Parition instead into [__first, __i) == *__first and *__first < [__i, __last) 51813e519524SHoward Hinnant ++__i; // __first + 1 51823e519524SHoward Hinnant __j = __last; 51833e519524SHoward Hinnant if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1) 51843e519524SHoward Hinnant { 51853e519524SHoward Hinnant while (true) 51863e519524SHoward Hinnant { 51873e519524SHoward Hinnant if (__i == __j) 51883e519524SHoward Hinnant return; // [__first, __last) all equivalent elements 51893e519524SHoward Hinnant if (__comp(*__first, *__i)) 51903e519524SHoward Hinnant { 51913e519524SHoward Hinnant swap(*__i, *__j); 51923e519524SHoward Hinnant ++__n_swaps; 51933e519524SHoward Hinnant ++__i; 51943e519524SHoward Hinnant break; 51953e519524SHoward Hinnant } 51963e519524SHoward Hinnant ++__i; 51973e519524SHoward Hinnant } 51983e519524SHoward Hinnant } 51993e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1 52003e519524SHoward Hinnant if (__i == __j) 52013e519524SHoward Hinnant return; 52023e519524SHoward Hinnant while (true) 52033e519524SHoward Hinnant { 52043e519524SHoward Hinnant while (!__comp(*__first, *__i)) 52053e519524SHoward Hinnant ++__i; 52063e519524SHoward Hinnant while (__comp(*__first, *--__j)) 52073e519524SHoward Hinnant ; 52083e519524SHoward Hinnant if (__i >= __j) 52093e519524SHoward Hinnant break; 52103e519524SHoward Hinnant swap(*__i, *__j); 52113e519524SHoward Hinnant ++__n_swaps; 52123e519524SHoward Hinnant ++__i; 52133e519524SHoward Hinnant } 52143e519524SHoward Hinnant // [__first, __i) == *__first and *__first < [__i, __last) 52153e519524SHoward Hinnant // The first part is sorted, 52163e519524SHoward Hinnant if (__nth < __i) 52173e519524SHoward Hinnant return; 52183e519524SHoward Hinnant // __nth_element the secod part 52193e519524SHoward Hinnant // __nth_element<_Compare>(__i, __nth, __last, __comp); 52203e519524SHoward Hinnant __first = __i; 52213e519524SHoward Hinnant goto __restart; 52223e519524SHoward Hinnant } 52233e519524SHoward Hinnant if (__comp(*__j, *__m)) 52243e519524SHoward Hinnant { 52253e519524SHoward Hinnant swap(*__i, *__j); 52263e519524SHoward Hinnant ++__n_swaps; 52273e519524SHoward Hinnant break; // found guard for downward moving __j, now use unguarded partition 52283e519524SHoward Hinnant } 52293e519524SHoward Hinnant } 52303e519524SHoward Hinnant } 52313e519524SHoward Hinnant ++__i; 52323e519524SHoward Hinnant // j points beyond range to be tested, *__lm1 is known to be <= *__m 52333e519524SHoward Hinnant // if not yet partitioned... 52343e519524SHoward Hinnant if (__i < __j) 52353e519524SHoward Hinnant { 52363e519524SHoward Hinnant // known that *(__i - 1) < *__m 52373e519524SHoward Hinnant while (true) 52383e519524SHoward Hinnant { 52393e519524SHoward Hinnant // __m still guards upward moving __i 52403e519524SHoward Hinnant while (__comp(*__i, *__m)) 52413e519524SHoward Hinnant ++__i; 52423e519524SHoward Hinnant // It is now known that a guard exists for downward moving __j 52433e519524SHoward Hinnant while (!__comp(*--__j, *__m)) 52443e519524SHoward Hinnant ; 52453e519524SHoward Hinnant if (__i >= __j) 52463e519524SHoward Hinnant break; 52473e519524SHoward Hinnant swap(*__i, *__j); 52483e519524SHoward Hinnant ++__n_swaps; 52493e519524SHoward Hinnant // It is known that __m != __j 52503e519524SHoward Hinnant // If __m just moved, follow it 52513e519524SHoward Hinnant if (__m == __i) 52523e519524SHoward Hinnant __m = __j; 52533e519524SHoward Hinnant ++__i; 52543e519524SHoward Hinnant } 52553e519524SHoward Hinnant } 52563e519524SHoward Hinnant // [__first, __i) < *__m and *__m <= [__i, __last) 52573e519524SHoward Hinnant if (__i != __m && __comp(*__m, *__i)) 52583e519524SHoward Hinnant { 52593e519524SHoward Hinnant swap(*__i, *__m); 52603e519524SHoward Hinnant ++__n_swaps; 52613e519524SHoward Hinnant } 52623e519524SHoward Hinnant // [__first, __i) < *__i and *__i <= [__i+1, __last) 52633e519524SHoward Hinnant if (__nth == __i) 52643e519524SHoward Hinnant return; 52653e519524SHoward Hinnant if (__n_swaps == 0) 52663e519524SHoward Hinnant { 52673e519524SHoward Hinnant // We were given a perfectly partitioned sequence. Coincidence? 52683e519524SHoward Hinnant if (__nth < __i) 52693e519524SHoward Hinnant { 52703e519524SHoward Hinnant // Check for [__first, __i) already sorted 52713e519524SHoward Hinnant __j = __m = __first; 52723e519524SHoward Hinnant while (++__j != __i) 52733e519524SHoward Hinnant { 52743e519524SHoward Hinnant if (__comp(*__j, *__m)) 52753e519524SHoward Hinnant // not yet sorted, so sort 52763e519524SHoward Hinnant goto not_sorted; 52773e519524SHoward Hinnant __m = __j; 52783e519524SHoward Hinnant } 52793e519524SHoward Hinnant // [__first, __i) sorted 52803e519524SHoward Hinnant return; 52813e519524SHoward Hinnant } 52823e519524SHoward Hinnant else 52833e519524SHoward Hinnant { 52843e519524SHoward Hinnant // Check for [__i, __last) already sorted 52853e519524SHoward Hinnant __j = __m = __i; 52863e519524SHoward Hinnant while (++__j != __last) 52873e519524SHoward Hinnant { 52883e519524SHoward Hinnant if (__comp(*__j, *__m)) 52893e519524SHoward Hinnant // not yet sorted, so sort 52903e519524SHoward Hinnant goto not_sorted; 52913e519524SHoward Hinnant __m = __j; 52923e519524SHoward Hinnant } 52933e519524SHoward Hinnant // [__i, __last) sorted 52943e519524SHoward Hinnant return; 52953e519524SHoward Hinnant } 52963e519524SHoward Hinnant } 52973e519524SHoward Hinnantnot_sorted: 52983e519524SHoward Hinnant // __nth_element on range containing __nth 52993e519524SHoward Hinnant if (__nth < __i) 53003e519524SHoward Hinnant { 53013e519524SHoward Hinnant // __nth_element<_Compare>(__first, __nth, __i, __comp); 53023e519524SHoward Hinnant __last = __i; 53033e519524SHoward Hinnant } 53043e519524SHoward Hinnant else 53053e519524SHoward Hinnant { 53063e519524SHoward Hinnant // __nth_element<_Compare>(__i+1, __nth, __last, __comp); 53073e519524SHoward Hinnant __first = ++__i; 53083e519524SHoward Hinnant } 53093e519524SHoward Hinnant } 53103e519524SHoward Hinnant} 53113e519524SHoward Hinnant 53123e519524SHoward Hinnanttemplate <class _RandomAccessIterator, class _Compare> 53133e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53143e519524SHoward Hinnantvoid 53153e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) 53163e519524SHoward Hinnant{ 5317145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53203e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __c); 5321145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53233e519524SHoward Hinnant __nth_element<_Comp_ref>(__first, __nth, __last, __comp); 5324145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53253e519524SHoward Hinnant} 53263e519524SHoward Hinnant 53273e519524SHoward Hinnanttemplate <class _RandomAccessIterator> 53283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53293e519524SHoward Hinnantvoid 53303e519524SHoward Hinnantnth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) 53313e519524SHoward Hinnant{ 5332ce48a113SHoward Hinnant _VSTD::nth_element(__first, __nth, __last, __less<typename iterator_traits<_RandomAccessIterator>::value_type>()); 53333e519524SHoward Hinnant} 53343e519524SHoward Hinnant 53353e519524SHoward Hinnant// includes 53363e519524SHoward Hinnant 53373e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 53383e519524SHoward Hinnantbool 53393e519524SHoward Hinnant__includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53403e519524SHoward Hinnant _Compare __comp) 53413e519524SHoward Hinnant{ 53423e519524SHoward Hinnant for (; __first2 != __last2; ++__first1) 53433e519524SHoward Hinnant { 53443e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first2, *__first1)) 53453e519524SHoward Hinnant return false; 53463e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53473e519524SHoward Hinnant ++__first2; 53483e519524SHoward Hinnant } 53493e519524SHoward Hinnant return true; 53503e519524SHoward Hinnant} 53513e519524SHoward Hinnant 53523e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 53533e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53543e519524SHoward Hinnantbool 53553e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, 53563e519524SHoward Hinnant _Compare __comp) 53573e519524SHoward Hinnant{ 5358145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 53593e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 53603e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 53613e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5362145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 53633e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 53643e519524SHoward Hinnant return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5365145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 53663e519524SHoward Hinnant} 53673e519524SHoward Hinnant 53683e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 53693e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 53703e519524SHoward Hinnantbool 53713e519524SHoward Hinnantincludes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) 53723e519524SHoward Hinnant{ 5373ce48a113SHoward Hinnant return _VSTD::includes(__first1, __last1, __first2, __last2, 53743e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 53753e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 53763e519524SHoward Hinnant} 53773e519524SHoward Hinnant 53783e519524SHoward Hinnant// set_union 53793e519524SHoward Hinnant 53803e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 53813e519524SHoward Hinnant_OutputIterator 53823e519524SHoward Hinnant__set_union(_InputIterator1 __first1, _InputIterator1 __last1, 53833e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 53843e519524SHoward Hinnant{ 53853e519524SHoward Hinnant for (; __first1 != __last1; ++__result) 53863e519524SHoward Hinnant { 53873e519524SHoward Hinnant if (__first2 == __last2) 5388ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 53893e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 53903e519524SHoward Hinnant { 53913e519524SHoward Hinnant *__result = *__first2; 53923e519524SHoward Hinnant ++__first2; 53933e519524SHoward Hinnant } 53943e519524SHoward Hinnant else 53953e519524SHoward Hinnant { 53963e519524SHoward Hinnant *__result = *__first1; 53973e519524SHoward Hinnant if (!__comp(*__first1, *__first2)) 53983e519524SHoward Hinnant ++__first2; 53993e519524SHoward Hinnant ++__first1; 54003e519524SHoward Hinnant } 54013e519524SHoward Hinnant } 5402ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 54033e519524SHoward Hinnant} 54043e519524SHoward Hinnant 54053e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54063e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54073e519524SHoward Hinnant_OutputIterator 54083e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54093e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54103e519524SHoward Hinnant{ 5411145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54123e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54133e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54143e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5415145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54163e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54173e519524SHoward Hinnant return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5418145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54193e519524SHoward Hinnant} 54203e519524SHoward Hinnant 54213e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54223e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54233e519524SHoward Hinnant_OutputIterator 54243e519524SHoward Hinnantset_union(_InputIterator1 __first1, _InputIterator1 __last1, 54253e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54263e519524SHoward Hinnant{ 5427ce48a113SHoward Hinnant return _VSTD::set_union(__first1, __last1, __first2, __last2, __result, 54283e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54293e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54303e519524SHoward Hinnant} 54313e519524SHoward Hinnant 54323e519524SHoward Hinnant// set_intersection 54333e519524SHoward Hinnant 54343e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54353e519524SHoward Hinnant_OutputIterator 54363e519524SHoward Hinnant__set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54373e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54383e519524SHoward Hinnant{ 54393e519524SHoward Hinnant while (__first1 != __last1 && __first2 != __last2) 54403e519524SHoward Hinnant { 54413e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54423e519524SHoward Hinnant ++__first1; 54433e519524SHoward Hinnant else 54443e519524SHoward Hinnant { 54453e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 54463e519524SHoward Hinnant { 54473e519524SHoward Hinnant *__result = *__first1; 54483e519524SHoward Hinnant ++__result; 54493e519524SHoward Hinnant ++__first1; 54503e519524SHoward Hinnant } 54513e519524SHoward Hinnant ++__first2; 54523e519524SHoward Hinnant } 54533e519524SHoward Hinnant } 54543e519524SHoward Hinnant return __result; 54553e519524SHoward Hinnant} 54563e519524SHoward Hinnant 54573e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 54583e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54593e519524SHoward Hinnant_OutputIterator 54603e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54613e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54623e519524SHoward Hinnant{ 5463145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 54643e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 54653e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 54663e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5467145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 54683e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 54693e519524SHoward Hinnant return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5470145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 54713e519524SHoward Hinnant} 54723e519524SHoward Hinnant 54733e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 54743e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 54753e519524SHoward Hinnant_OutputIterator 54763e519524SHoward Hinnantset_intersection(_InputIterator1 __first1, _InputIterator1 __last1, 54773e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 54783e519524SHoward Hinnant{ 5479ce48a113SHoward Hinnant return _VSTD::set_intersection(__first1, __last1, __first2, __last2, __result, 54803e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 54813e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 54823e519524SHoward Hinnant} 54833e519524SHoward Hinnant 54843e519524SHoward Hinnant// set_difference 54853e519524SHoward Hinnant 54863e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 54873e519524SHoward Hinnant_OutputIterator 54883e519524SHoward Hinnant__set_difference(_InputIterator1 __first1, _InputIterator1 __last1, 54893e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 54903e519524SHoward Hinnant{ 54913e519524SHoward Hinnant while (__first1 != __last1) 54923e519524SHoward Hinnant { 54933e519524SHoward Hinnant if (__first2 == __last2) 5494ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 54953e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 54963e519524SHoward Hinnant { 54973e519524SHoward Hinnant *__result = *__first1; 54983e519524SHoward Hinnant ++__result; 54993e519524SHoward Hinnant ++__first1; 55003e519524SHoward Hinnant } 55013e519524SHoward Hinnant else 55023e519524SHoward Hinnant { 55033e519524SHoward Hinnant if (!__comp(*__first2, *__first1)) 55043e519524SHoward Hinnant ++__first1; 55053e519524SHoward Hinnant ++__first2; 55063e519524SHoward Hinnant } 55073e519524SHoward Hinnant } 55083e519524SHoward Hinnant return __result; 55093e519524SHoward Hinnant} 55103e519524SHoward Hinnant 55113e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55123e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55133e519524SHoward Hinnant_OutputIterator 55143e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55153e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55163e519524SHoward Hinnant{ 5517145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55183e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55193e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55203e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5521145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55223e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55233e519524SHoward Hinnant return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5524145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55253e519524SHoward Hinnant} 55263e519524SHoward Hinnant 55273e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55283e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55293e519524SHoward Hinnant_OutputIterator 55303e519524SHoward Hinnantset_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55313e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55323e519524SHoward Hinnant{ 5533ce48a113SHoward Hinnant return _VSTD::set_difference(__first1, __last1, __first2, __last2, __result, 55343e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55353e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55363e519524SHoward Hinnant} 55373e519524SHoward Hinnant 55383e519524SHoward Hinnant// set_symmetric_difference 55393e519524SHoward Hinnant 55403e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2, class _OutputIterator> 55413e519524SHoward Hinnant_OutputIterator 55423e519524SHoward Hinnant__set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55433e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55443e519524SHoward Hinnant{ 55453e519524SHoward Hinnant while (__first1 != __last1) 55463e519524SHoward Hinnant { 55473e519524SHoward Hinnant if (__first2 == __last2) 5548ce48a113SHoward Hinnant return _VSTD::copy(__first1, __last1, __result); 55493e519524SHoward Hinnant if (__comp(*__first1, *__first2)) 55503e519524SHoward Hinnant { 55513e519524SHoward Hinnant *__result = *__first1; 55523e519524SHoward Hinnant ++__result; 55533e519524SHoward Hinnant ++__first1; 55543e519524SHoward Hinnant } 55553e519524SHoward Hinnant else 55563e519524SHoward Hinnant { 55573e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 55583e519524SHoward Hinnant { 55593e519524SHoward Hinnant *__result = *__first2; 55603e519524SHoward Hinnant ++__result; 55613e519524SHoward Hinnant } 55623e519524SHoward Hinnant else 55633e519524SHoward Hinnant ++__first1; 55643e519524SHoward Hinnant ++__first2; 55653e519524SHoward Hinnant } 55663e519524SHoward Hinnant } 5567ce48a113SHoward Hinnant return _VSTD::copy(__first2, __last2, __result); 55683e519524SHoward Hinnant} 55693e519524SHoward Hinnant 55703e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare> 55713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55723e519524SHoward Hinnant_OutputIterator 55733e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55743e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) 55753e519524SHoward Hinnant{ 5576145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 55773e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 55783e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 55793e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __c); 5580145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 55813e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 55823e519524SHoward Hinnant return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); 5583145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 55843e519524SHoward Hinnant} 55853e519524SHoward Hinnant 55863e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _OutputIterator> 55873e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 55883e519524SHoward Hinnant_OutputIterator 55893e519524SHoward Hinnantset_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, 55903e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) 55913e519524SHoward Hinnant{ 5592ce48a113SHoward Hinnant return _VSTD::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, 55933e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 55943e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 55953e519524SHoward Hinnant} 55963e519524SHoward Hinnant 55973e519524SHoward Hinnant// lexicographical_compare 55983e519524SHoward Hinnant 55993e519524SHoward Hinnanttemplate <class _Compare, class _InputIterator1, class _InputIterator2> 56003e519524SHoward Hinnantbool 56013e519524SHoward Hinnant__lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56023e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56033e519524SHoward Hinnant{ 5604910285b2SEric Fiselier for (; __first2 != __last2; ++__first1, (void) ++__first2) 56053e519524SHoward Hinnant { 56063e519524SHoward Hinnant if (__first1 == __last1 || __comp(*__first1, *__first2)) 56073e519524SHoward Hinnant return true; 56083e519524SHoward Hinnant if (__comp(*__first2, *__first1)) 56093e519524SHoward Hinnant return false; 56103e519524SHoward Hinnant } 56113e519524SHoward Hinnant return false; 56123e519524SHoward Hinnant} 56133e519524SHoward Hinnant 56143e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2, class _Compare> 56153e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56163e519524SHoward Hinnantbool 56173e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56183e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) 56193e519524SHoward Hinnant{ 5620145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56213e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56223e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56233e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __c); 5624145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56253e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56263e519524SHoward Hinnant return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); 5627145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56283e519524SHoward Hinnant} 56293e519524SHoward Hinnant 56303e519524SHoward Hinnanttemplate <class _InputIterator1, class _InputIterator2> 56313e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56323e519524SHoward Hinnantbool 56333e519524SHoward Hinnantlexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 56343e519524SHoward Hinnant _InputIterator2 __first2, _InputIterator2 __last2) 56353e519524SHoward Hinnant{ 5636ce48a113SHoward Hinnant return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, 56373e519524SHoward Hinnant __less<typename iterator_traits<_InputIterator1>::value_type, 56383e519524SHoward Hinnant typename iterator_traits<_InputIterator2>::value_type>()); 56393e519524SHoward Hinnant} 56403e519524SHoward Hinnant 56413e519524SHoward Hinnant// next_permutation 56423e519524SHoward Hinnant 56433e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56443e519524SHoward Hinnantbool 56453e519524SHoward Hinnant__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56463e519524SHoward Hinnant{ 56473e519524SHoward Hinnant _BidirectionalIterator __i = __last; 56483e519524SHoward Hinnant if (__first == __last || __first == --__i) 56493e519524SHoward Hinnant return false; 56503e519524SHoward Hinnant while (true) 56513e519524SHoward Hinnant { 56523e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 56533e519524SHoward Hinnant if (__comp(*--__i, *__ip1)) 56543e519524SHoward Hinnant { 56553e519524SHoward Hinnant _BidirectionalIterator __j = __last; 56563e519524SHoward Hinnant while (!__comp(*__i, *--__j)) 56573e519524SHoward Hinnant ; 56583e519524SHoward Hinnant swap(*__i, *__j); 5659ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 56603e519524SHoward Hinnant return true; 56613e519524SHoward Hinnant } 56623e519524SHoward Hinnant if (__i == __first) 56633e519524SHoward Hinnant { 5664ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 56653e519524SHoward Hinnant return false; 56663e519524SHoward Hinnant } 56673e519524SHoward Hinnant } 56683e519524SHoward Hinnant} 56693e519524SHoward Hinnant 56703e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 56713e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56723e519524SHoward Hinnantbool 56733e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56743e519524SHoward Hinnant{ 5675145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 56763e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 56773e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 56783e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __c); 5679145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 56803e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 56813e519524SHoward Hinnant return __next_permutation<_Comp_ref>(__first, __last, __comp); 5682145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 56833e519524SHoward Hinnant} 56843e519524SHoward Hinnant 56853e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 56863e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 56873e519524SHoward Hinnantbool 56883e519524SHoward Hinnantnext_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 56893e519524SHoward Hinnant{ 5690ce48a113SHoward Hinnant return _VSTD::next_permutation(__first, __last, 56913e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 56923e519524SHoward Hinnant} 56933e519524SHoward Hinnant 56943e519524SHoward Hinnant// prev_permutation 56953e519524SHoward Hinnant 56963e519524SHoward Hinnanttemplate <class _Compare, class _BidirectionalIterator> 56973e519524SHoward Hinnantbool 56983e519524SHoward Hinnant__prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 56993e519524SHoward Hinnant{ 57003e519524SHoward Hinnant _BidirectionalIterator __i = __last; 57013e519524SHoward Hinnant if (__first == __last || __first == --__i) 57023e519524SHoward Hinnant return false; 57033e519524SHoward Hinnant while (true) 57043e519524SHoward Hinnant { 57053e519524SHoward Hinnant _BidirectionalIterator __ip1 = __i; 57063e519524SHoward Hinnant if (__comp(*__ip1, *--__i)) 57073e519524SHoward Hinnant { 57083e519524SHoward Hinnant _BidirectionalIterator __j = __last; 57093e519524SHoward Hinnant while (!__comp(*--__j, *__i)) 57103e519524SHoward Hinnant ; 57113e519524SHoward Hinnant swap(*__i, *__j); 5712ce48a113SHoward Hinnant _VSTD::reverse(__ip1, __last); 57133e519524SHoward Hinnant return true; 57143e519524SHoward Hinnant } 57153e519524SHoward Hinnant if (__i == __first) 57163e519524SHoward Hinnant { 5717ce48a113SHoward Hinnant _VSTD::reverse(__first, __last); 57183e519524SHoward Hinnant return false; 57193e519524SHoward Hinnant } 57203e519524SHoward Hinnant } 57213e519524SHoward Hinnant} 57223e519524SHoward Hinnant 57233e519524SHoward Hinnanttemplate <class _BidirectionalIterator, class _Compare> 57243e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57253e519524SHoward Hinnantbool 57263e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) 57273e519524SHoward Hinnant{ 5728145afa17SHoward Hinnant#ifdef _LIBCPP_DEBUG 57293e519524SHoward Hinnant typedef typename add_lvalue_reference<__debug_less<_Compare> >::type _Comp_ref; 57303e519524SHoward Hinnant __debug_less<_Compare> __c(__comp); 57313e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __c); 5732145afa17SHoward Hinnant#else // _LIBCPP_DEBUG 57333e519524SHoward Hinnant typedef typename add_lvalue_reference<_Compare>::type _Comp_ref; 57343e519524SHoward Hinnant return __prev_permutation<_Comp_ref>(__first, __last, __comp); 5735145afa17SHoward Hinnant#endif // _LIBCPP_DEBUG 57363e519524SHoward Hinnant} 57373e519524SHoward Hinnant 57383e519524SHoward Hinnanttemplate <class _BidirectionalIterator> 57393e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57403e519524SHoward Hinnantbool 57413e519524SHoward Hinnantprev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) 57423e519524SHoward Hinnant{ 5743ce48a113SHoward Hinnant return _VSTD::prev_permutation(__first, __last, 57443e519524SHoward Hinnant __less<typename iterator_traits<_BidirectionalIterator>::value_type>()); 57453e519524SHoward Hinnant} 57463e519524SHoward Hinnant 57473e519524SHoward Hinnanttemplate <class _Tp> 57483e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57493e519524SHoward Hinnanttypename enable_if 57503e519524SHoward Hinnant< 57513e519524SHoward Hinnant is_integral<_Tp>::value, 57523e519524SHoward Hinnant _Tp 57533e519524SHoward Hinnant>::type 57543e519524SHoward Hinnant__rotate_left(_Tp __t, _Tp __n = 1) 57553e519524SHoward Hinnant{ 57563e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57573e519524SHoward Hinnant __n &= __bits; 57583e519524SHoward Hinnant return static_cast<_Tp>((__t << __n) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> (__bits - __n))); 57593e519524SHoward Hinnant} 57603e519524SHoward Hinnant 57613e519524SHoward Hinnanttemplate <class _Tp> 57623e519524SHoward Hinnantinline _LIBCPP_INLINE_VISIBILITY 57633e519524SHoward Hinnanttypename enable_if 57643e519524SHoward Hinnant< 57653e519524SHoward Hinnant is_integral<_Tp>::value, 57663e519524SHoward Hinnant _Tp 57673e519524SHoward Hinnant>::type 57683e519524SHoward Hinnant__rotate_right(_Tp __t, _Tp __n = 1) 57693e519524SHoward Hinnant{ 57703e519524SHoward Hinnant const unsigned __bits = static_cast<unsigned>(sizeof(_Tp) * __CHAR_BIT__ - 1); 57713e519524SHoward Hinnant __n &= __bits; 57723e519524SHoward Hinnant return static_cast<_Tp>((__t << (__bits - __n)) | (static_cast<typename make_unsigned<_Tp>::type>(__t) >> __n)); 57733e519524SHoward Hinnant} 57743e519524SHoward Hinnant 57753e519524SHoward Hinnant_LIBCPP_END_NAMESPACE_STD 57763e519524SHoward Hinnant 57773e519524SHoward Hinnant#endif // _LIBCPP_ALGORITHM 5778